课程名称 (Course Name) ： Advanced Computer Networks

课程代码 (Course Code）： X033517

学分/学时 (Credits/Credit Hours)： 3

开课时间 (Course Term )： Fall

开课学院（School Providing the Course）:  Computer Science

任课教师（Teacher）:  Chen Guihai

课程讨论时数（Course Discussion Hours）:  

课程实验数（Lab Hours）:   

课程内容简介(Course Introduction):

Description

How does the global network infrastructure work and what are the design principles on which it is based? In what ways are these design principles compromised in practice? How do we make it work better in today's world? How do we ensure that it will work well in the future in the face of rapidly growing scale and heterogeneity? And how should Internet applications be written, so they can obtain the best possible performance both for themselves and for others using the infrastructure? These are some issues that are grappled with in this course. The course will focus on the design, implementation, analysis, and evaluation of large-scale networked systems.

Topics include internetworking philosophies, unicast and multicast routing, congestion control, network quality of service, mobile networking, router architectures, network-aware applications, content dissemination systems, network security, and performance issues. Material for the course will be drawn from research papers, industry white papers, and Internet RFCs.

Goals

1）In depth understanding of modern networks for computer and computing

2）Know about fundamental issues and engineering tradeoffs

3）How to design a good network

Prerequisite

Undergraduate systems or networks course covering basic networking concepts. Some discrete mathematics, especially graph theory, and computer networks might be helpful.

If your networking background is rusty, you should page material in from one of these excellent books such as [Computer Networking: A Top-Down Approach Featuring the Internet].

Features

Research-oriented

Methodology-oriented

Paper-oriented

Enjoy-oriented

Topics

Interconnection Networks

P2P Overlay Networks

Data Center Networks

Wireless Sensor Networks (optional)

Network on Chips (optional)

Grading

20% - Attendance

50% - Homework

30% - Final Exam

Website

http://www.cs.sjtu.edu.cn/~gchen/course/acn/index.htm

教学大纲(Course Teaching Outline):

Lecture 1  Interconnection Networks

Introduce two classes of interconnection networks, the static (e.g. Ring, Mesh, Hypercube) and the dynamic (e.g. Bus, Crossbar, MIN). And then discuss the issues, criteria and topics of network design, which includes topology and analysis, routing and communication, mapping and simulation, algorithm and computation, VLSI Design and Construction.

Lecture 2 Typical networks and issues

We further discuss the motivations of interconnection networks research. Then we have a survey of typical networks, and introduce the crossbar network, multistage network, mesh and torus network, fat tree and hypercube network.

Lecture 3 Hypercube and dynamic networks

In this lecture, we learning more properties of hypercube and disucss some variation of hypercube, such as Möbius cubes, folded hypercubes. We also have a overview of dynamic networks.

Lecture 4 Peer-to-peer networks

We have a brief introduction of P2P networks, and have an overview of Napster, Gnutella and Freenet.

Lecture 5 Chord，CAN and Pastry

Some new solutions to the location problem such as Chordal Ring, Tapstry are introduced in this lecture. Furthermore, we have an in-depth discussion of CAN and Pastry.

Lecture 6 Koorde 

How to design theoretically optimal P2P topologies? Koorde can achieve O(logN) steps between any two nodes by using only O(logN) entries in lookup table.

Lecture 7 Parallel algorithms

Except PRAM model，we discuss network model for parallel algorithms. Typical parallel algorithms such as bitonic sorting and Prefix sum are analyzed.

Lecture 8 Data center Networking

In this lecture, we first talk about the importance of data center. Moreover, we discuss three scientific issues(i.e. energy, scalability and coordination) and the motivations of novel date center networks.

Lecture 9  Dcell and Bcube

Two latest network structures for data centers, Dcell and Bcube are introduced in this lecture.

Lecture 10 Overview

        Provide deep investigations into research problems involved in assignments. We encourage students find more problems and new solutions.

课程进度计划(Course Schedule):

Lecture 1  Interconnection Networks

Introduce two classes of interconnection networks, the static (e.g. Ring, Mesh, Hypercube) and the dynamic (e.g. Bus, Crossbar, MIN). And then discuss the issues, criteria and topics of network design, which includes topology and analysis, routing and communication, mapping and simulation, algorithm and computation, VLSI Design and Construction.

Lecture 2 Typical networks and issues

We further discuss the motivations of interconnection networks research. Then we have a survey of typical networks, and introduce the crossbar network, multistage network, mesh and torus network, fat tree and hypercube network.

Lecture 3 Hypercube and dynamic networks

In this lecture, we learning more properties of hypercube and disucss some variation of hypercube, such as Möbius cubes, folded hypercubes. We also have a overview of dynamic networks.

Lecture 4 Peer-to-peer networks

We have a brief introduction of P2P networks, and have an overview of Napster, Gnutella and Freenet.

Lecture 5 Chord，CAN and Pastry

Some new solutions to the location problem such as Chordal Ring, Tapstry are introduced in this lecture. Furthermore, we have an in-depth discussion of CAN and Pastry.

Lecture 6 Koorde 

How to design theoretically optimal P2P topologies? Koorde can achieve O(logN) steps between any two nodes by using only O(logN) entries in lookup table.

Lecture 7 Parallel algorithms

Except PRAM model，we discuss network model for parallel algorithms. Typical parallel algorithms such as bitonic sorting and Prefix sum are analyzed.

Lecture 8 Data center Networking

In this lecture, we first talk about the importance of data center. Moreover, we discuss three scientific issues(i.e. energy, scalability and coordination) and the motivations of novel date center networks.

Lecture 9  Dcell and Bcube

Two latest network structures for data centers, Dcell and Bcube are introduced in this lecture.

Lecture 10 Overview

        Provide deep investigations into research problems involved in assignments. We encourage students find more problems and new solutions.

课程考核要求(Course Assessment Requirements)：

Five assignments account for 50% of final score. Final exam accounts for 30% of final score.

Remaining 20% contributes to the attendance, active involvement in class and innovation

in solutions

参考文献(Course References)：

Reference books

James F. Kurose and Keith W. Ross.Computer Networking: A Top-Down Approach Featuring the Internet.5th ed. Addison-Wesley, 2009. ISBN: 0136079679.

Andrew S. Tanenbaum, David J. Wetherall.Computer Networks.5th ed. Prentice Hall, 2010. ISBN: 0132126958.

Reading materials

Y. Saad and M. H. Schultz,Topological Properties of Hypercube, IEEE Transactions on Computers 1988,Vol. 24, No. 5

L.N. Bhuyan and D.P. Agrawal,Generalized Hypercube and Hyperbus Structures for a Computer Network, IEEE Transactions on Computers, Vol. 33, No. 5, 1984

Leiserson, C. E.Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Transactions on Computers 1985, 100(10): 892-901.

G. Chen and F.C.M. Lau, The Wall Mesh, Computer Architecture'97: Selected Papers of the 2nd Australasian Conference, R. Pose(ed.), Springer, 1997, 217-230.

F.C.M. Lau and G. Chen, Optimal Layouts of Midimew Networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 9, 954-961, September 1996

Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, Hari Balakrishnan,Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications, IEEE Transactions on Networking, 2003,Vol. 11, No. 1

Ripeanu, Matei,Peer-to-peer architecture case study: Gnutella network, First International Conference on Peer-to-Peer Computing, pp. 99-100. IEEE, 2001.

Clarke, Ian, Oskar Sandberg, Brandon Wiley, Theodore Hong,Freenet: A distributed anonymous information storage and retrieval system,Designing Privacy Enhancing Technologies, pp. 46-66. Springer Berlin/Heidelberg, 2001

Antony Rowstron, Peter Druschel,Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems,Middleware, pp. 329-350, Springer Berlin/Heidelberg, 2001.

Ratnasamy, Sylvia, Paul Francis, Mark Handley, Richard Karp, Scott Shenker,A scalable content-addressable network, ACM SIGCOMM 2001.

Chuanxiong Guo, Haitao Wu, Kun Tan, Lei Shi, Yongguang Zhang, Songwu Lu,Dcell: a scalable and fault-tolerant network structure for data centers, ACM SIGCOMM 2008.

Chuanxiong Guo, Guohan Lu, Dan Li, Haitao Wu, Xuan Zhang, Yunfeng Shi, Chen Tian, Yongguang Zhang, Songwu Lu,BCube: a high performance, server-centric network architecture for modular data centers, ACM SIGCOMM 2009.

Deke Guo, Tao Chen,Dan Li, Mo Li, Yunhao Liu, Guihai Chen, Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers, IEEE Transactions on Computers, Vol. 62, No. 7, 1303-1317, July 2013.

预修课程（Prerequisite Course）