Reading List

Reading List (with pointers to handouts and papers)

This page will be updated as we go along. Older materials from past offerings of the course appear in lighter shade.

Commentary on Internet Architecture

D. Clark, "The Design Philosophy of the DARPA Internet Protocols", SIGCOMM'88, 106-114, Palo Alto, CA, Sept 1988. (pdf)
J.H. Salzer, D.P. Reed and D.D. Clark, "End-to-end arguments in system design", ACM Transactions on Computer Systems, Nov 1984, p. 277-288. (ps)
Chapter 1 of Kurose-Ross, particularly the history part.
Slides are on blackboard.

Network Performance Evaluation and Simulation

General introduction to queuing systems. Little's law. Simple analysis of a single queue with exponential inter-arrival and service times.
Read Chapter 1 (general ideas only), Chapter 3 (skip 3.4), Chapter 4 (general ideas only) from this book on the web.
ns-2 simulation.
All slides and notes are on blackboard for this section. (To be posted)
This section to be updated further.

Link layer and LAN

Chapter 5 of Kurose-Ross - only sections 5.3, 5.4 (will not be covered in lectures), 5.5.
Chapter 6 of Kurose-Ross - only sections 6.1, 6.2 (exclude CDMA), 6.3 (exclude Advanced Features, Bluetooth and WiMax).
Slides for multiple access protocols.
Alternative Slotted Aloha analysis.
Crow, B.P.; Widjaja, I.; Kim, L.G.; Sakai, P.T., "IEEE 802.11 Wireless Local Area Networks," IEEE Communications Magazine, Volume: 35 , Issue: 9 , Sept. 1997, Pages:116 - 126. (pdf). This paper contains a good overview of 802.11.
V. Bharghavan, A. Demeres, S. Shenker, L. Zhang, "MACAW: A Media Access Protocol for Wireless LANs," ACM Sigcomm 1994. (pdf). MACAW is precursor of 802.11. This is a good paper to read to understand the rationale behind the protocol design.
F. A. Tobagi and L. Kleinrock, "Packet Switching in Radio Channels: Part II -- The Hidden Terminal Problem in Carrier Sense Multiple-Access and Busy-Tone Solution," IEEE Trans. on Comm., Dec 1975. (pdf). This paper is a classic and quite analytical. Ignore analysis. Study CSMA, hidden terminal problem and BTMA protocols from here.

Transport and Congestion Control

Sections 3.4 (skim through), 3.5, 3.6, 3.7 of textbook.
Lecture slides
TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms, RFC 2001, by W. Stevens
Succinct description of TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. A MUST read. All its citations are also very useful if you are interested in further details of TCP/IP networking.
D. Chiu and R. Jain, "Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks," Journal of Computer Networks and ISDN, Vol. 17, No. 1, June 1989, pp. 1-14. (Note parts of sections 2.1-2.3 are covered in class).
Floyd, S., and Jacobson, V., Random Early Detection gateways for Congestion Avoidance V.1 N.4, August 1993, p. 397-413. (This describes RED queue management).
Floyd, S., TCP and Explicit Congestion Notification (compressed postscript, pdf). ACM Computer Communication Review, V. 24 N. 5, October 1994, p. 10-23. (This describes ECN).
TCP over wireless links lecture slides.
References for TCP over wireless links are below:

A. Bakre and B. Badrinath, "I-TCP: Indirect TCP for Mobile Hosts," in Proceedings of 15^th International Conference on Distributed Computing Systems (ICDCS), May 1995.
Hari Balakrishnan, Srinivasan Seshan, Randy H. Katz, Improving Reliable Transport and Handoff Performance in Cellular Wireless Networks, ACM Wireless Networks, 1(4), December 1995.

Hari Balakrishnan and Randy H. Katz, Explicit Loss Notification and Wireless Web Performance, in Proc. IEEE Globecom Internet Mini-Conference, Sydney, Australia, November 1998.

R. Caceres and L. Iftode, Improving the Performance of Reliable Transport Protocols in Mobile Computing Environments, IEEE Journal on Selected Areas in Communications, Vol. 13, No. 5, June 1995.

Kevin Brown and Suresh Singh, M-TCP: TCP for Mobile Cellular Networks, ACM Computer Communication Review, Oct 1999

Network Layer - Intra- and Inter-domain Routing, Multicast

Sections 4.5, 4.6 and 4.7 of the textbook.
Cyril Gavoille and David Peleg, Compact and Localized Distributed Data Structures, Distributed Computing, Vol 16(2), 2003. (Shows a technique to do interval routing on trees that is optimal. See description around Fig. 2. This shows that it is possible to have very compact routing tables while delivering optimal routes. However, the optimality breaks for non-tree graphs. Also, this technique is not efficient if nodes are added dynamically.)
Slides on routing. Primarily on LS and DV routing and IP.
RFC 1058, RIP (Routing Information Protocol), Official description of RIP. Has nice examples and clarifies quite a few concepts on practical implementation of distance vector protocols.
M. Ramalho, "Intra- and Inter-domain Multicast Routing Protocols: A Survey and Taxonomy," IEEE Communications Surveys and Tutorials, Fall 2000.
Chuck Semeria and Tom Maufer, Introduction to IP Multicast Routing, Tutorial notes.
Multicast routing slides (part 1) (part 2)
BGP notes and BGP lecture slides are on blackboard.
Additional references related to BGP:

For reverse engineering BGP policies and AS relationships, look at (i) F. Wang and L. Gao, Inferring and Characterizing Internet Routing Policies, ACM SIGCOMM Internet Measurement Conference 2003, and (ii) L. Gao. "On Inferring Automonous System Relationships in the Internet," IEEE Global Internet, Nov 2000.
For observing that better, alternate routes exist on the Internet: The End-to-end Effects of Internet Path Selection, Stefan Savage, Andy Collins, Eric Hoffman, John Snell and Tom Anderson, Proceedings of the 1999 ACM SIGCOMM Conference, pp. 289-299, Cambridge, MA, September, 1999.

Oregon Routeviews Project provides BGP table dumps.

Mobile Routing

Sections 6.3, 6.5, 6.6 of textbook (802.11, IP layer mobility and Mobile IP protocol).
Lecture slides on Mobile IP
Charles Perkins (ed), IP Mobility Support, RFC 2002, The RFC on Mobile IP.
RFC 3024 - Reverse Tunneling for Mobile IP, revised
Mobile Networking Through Mobile IP, Charles Perkins, IEEE Internet Computing, 1998. Slightly dated, but very easy reading.

Overlay Networks

For making a case for overlay networks look at: D. Anderson, H. Balakrishnan, F. Kaashoek, R. Morris, "The case for reslient overlay networks," Proc. HotOS VIII, May 2001. Also, a more detailed version: D. Anderson, H. Balakrishnan, F. Kaashoek, R. Morris, "Resilient Overlay Networks," Proc. SOSP 2001.
To argue that multihoming with route control can work almost as well as overlay networks look at: A Comparison of Overlay Routing and Multihoming Route Control , Aditya Akella, Jeff Pang, Bruce Maggs, Srinivasan Seshan and Anees Shaikh. ACM SIGCOMM 2004, Portland, OR.
For a good application, look at application layer multicast: S. Banerjee, B. Bhattacharjee, and C. Kommareddy. "Scalable application layer multicast," SIGCOMM Comput. Commun. Rev. 32, 4 (Oct. 2002).

Scheduling

Lecture Slides.
Chapter 9 in "An Engineering Approach to Computer Networking," by S. Keshav, Addison Wesley.
M. Shreedhar and G. Varghese, Efficient Fair Queuing Using Deficit Round Robin, IEEE Trans. on Networking, Vol 4(3), 1996. (shows the fairness properties of DRR).

P2P Networks and Distributed Hash Tables

Section 2.6 in textbook..
Lecture slides on Blackboard.
I. Stoica, R. Morris , D. Karger , M. Kaashoek , H. Balakrishnan , Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications , Proc. ACM SIGCOMM , San Diego, CA, August 2001.
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proc. ACM SIGCOMM 2001, August 2001.