高等計算機網路 (Advanced Computer Networks)

Term: Spring, 2006

Instructor: 陳伶志 Ling-Jyh Chen (cclljj@iis.sinica.edu.tw)

Time: Tuesday 9-12

Room: 1016 Edu. Building

Grading:

• In-Class Participation/Discussion: 10%
• Homework: 40%
• Project: 50% (checkpoint: 10%; project presentation: 15%, project report: 25%)

Schedule:

Week	Topic	Slides
Week 1; 2/21	Course admin	[Admin]
Week 2; 2/28	Holiday
Week 3; 3/7	1. Introduction to course projects 2. Network research tools	[Projects][Tools][DTNSIM]
Week 4; 3/14	Network Measurements 1	[Pathchar][Pathrate][CapProbe][AsymProbe]
Week 5; 3/21	Network Measurements 2	[Pathload][Spruce][PathChirp][Compare]
Week 6; 3/28	Network Measurements 3	[Clock][Strategies][PSN][Survival][Survival_R]
Week 7; 4/4	Holiday
Week 8; 4/11	Delay Tolerant Networks 1	[DTN03][DTN04][DTN05]
Week 9; 4/18	Delay Tolerant Networks 2	[DTN-Prob][DTN-EC][DTN-NC]
Week 10; 4/25	Project checkpoint
Week 11; 5/2	Mesh Networks 1	[ETX][WCETT][Hyacinth]
Week 12; 5/9	Mesh Networks 2	[RoofNet_04][RoofNet_05][ExOR]
Week 13; 5/16	Conference week (Networking'06)
Week 14; 5/23	P2P Networks 1	[CAN][Chord][Pastry]
Week 15; 5/30	P2P Networks 2	[BT1][BT2][Review]
Week 16; 6/6	Project presentation	Project 6, 7
Week 17; 6/13	Project presentation	Project 2, 4, 5
Week 18; 6/20	Project presentation	Project 1, 3

HW:

Reading List/Paper assignment (HW submission records):

• Network Measurements
  • Link Capacity
    • Constantinos Dovrolis, Parameswaran Ramanathan, and David Moore. What do packet dispersion techniques measure? Infocom 2001. [PDF]
    • Rohit Kapoor, Ling-Jyh Chen, Li Lao, Mario Gerla, and M. Y. Sanadidi. CapProbe: A Simple and Accurate Capacity Estimation Technique. SIGCOMM 2004. [PDF]
    • Ling-Jyh Chen, Tony Sun, Guang Yang, M. Y. Sanadidi, and Mario Gerla. End-to-end Asymmetric Link Capacity Estimation. IFIP Networking 2005, Waterloo, Ontario, Canada, 2005. [PDF]
    • Anders Persson, Cesar A. C. Marcondes, Ling-Jyh Chen, M. Y. Sanadidi, and Mario Gerla. TCP Probe: A TCP with built-in Path Capacity Estimation. The 8th IEEE Global Internet Symposium (in conjunction with IEEE Infocom'05), Miami, USA, 2005. [PDF]
  • Available Bandwidth
    • M. Jain and Constantinos Dovrolis. Pathload: an available bandwidth estimation tool. PAM 2002. [PDF]
    • Jacob Strauss, Dina Katabi, and Frans Kaashoek. A measurement study of available bandwidth estimation tools. IMC 2003. [PDF]
    • Vinay J. Ribeiro, Rudolf H. Riedi, Richard G. Baraniuk, Jiri Navratil, and Les Cottrell. pathChirp: Efficient Available Bandwidth Estimation for Network Paths. PAM 2003. [PDF]
    • Alok Shriram, Margaret Murray, Young Hyun, Nevil Brownlee, Andre Broido, Marina Fomenkov, and kc claffy. Comparison of Public End-to-end Bandwidth Estimation Tools on High-Speed Links. PAM 2005. [PDF]
  • System and Measurement Issues
    • Li Zhang, Zhen Liu, and Cathy Honghui Zia. Clock Synchronization Algorithms for Network Measurements. Infocom 2002. [PDF]
    • Vern Paxson. Strategies for Sound Internet Measurement. IMC 2004. [PDF]
  • Trace Analysis
    • Augustin Chaintreau, Pan Hui, Jon Crowcroft, Christophe Diot, Richard Gass, and James Scott. Pocket switched networks: Real-world mobility and its consequences for opportunistic forwarding. University of Cambridge, Computer Laboratory, Tech. Rep. UCAM-CL-TR-617, February 2005. [PDF]
• Delay Tolerant Networks
  • Kevin Fall. A Delay-Tolerant Network Architecture for Challenged Internets. SIGCOMM 2003. [PDF]
  • Sushant Jain, Kevin Fall and Rabin Patra. Routing in a Delay Tolerant Networking. SIGCOMM 2004. [PDF]
  • Sushant Jain, Rabin Patra and Kevin Fall. Wireless: Using redundancy to cope with failures in a delay tolerant network. SIGCOMM 2005. [PDF]
  • Anders Lindgreny, Avri Doria and Olov Schel. Probabilistic Routing in Intermittently Connected Networks. SAPIR 2004. [PDF]
  • Yong Wang and Margaret Martonosi. Erasure-coding based routing for opportunistic networks. WDTN 2005. [PDF]
  • Joerg Widmer and Jean-Yves Le Boudec. Network Coding for Efficient Communication in Extreme Networks. WDTN 2005. [PDF]
• Mesh Networks
  • Douglas S. J. De Couto, Daniel Aguayo, John Bicket, and Robert Morris. A High-Throughput Path Metric for Multi-Hop Wireless Routing. MobiCom 2003. [PDF]
  • Richard Draves, Jitendra Padhye, and Brian Zill. Routing in Multi-radio, Multi-hop Wireless Mesh Networks. MobiCom 2004. [PDF]
  • A Raniwala and Tzi-cker Chiueh. Architecture and Algorithms for an IEEE 802.11-based Multi-channel Wireless Mesh Network. Infocom 2005. [PDF]
  • Dan Aguayo, John Bicket, Sanjit Biswas, and Robert Morris. Link-level Measurements from an 802.11b Mesh Network. SIGCOMM 2004. [PDF]
  • John Bicket, Daniel Aguayo, Sanjit Biswas, and Robert Morris. Architecture and Evaluation of an Unplanned 802.11b Mesh Network. Mobicom 2005. [PDF]
  • Sanjit Biswas and Robert Morris. ExOR: Opportunistic MultiHop Routing for Wireless Networks. SIGCOMM 2005. [PDF]
• Peer to Peer Networks
  • Antony Rowstron and Peter Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Middleware 2001. [PDF]
  • Ion Stoica, Robert Morris, David R. Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. SIGCOMM 2001. [PDF]
  • S. Ratnasamy, R. Karp, and P. Francis, M. Handley, and S. Shenker. A Scalable Content-Addressable Network. SIGCOMM 2001. [PDF]
  • Bram Cohen. Incentives Build Robustness in BitTorrent. P2PECOM 2003. [PDF]
  • Nikitas Liogkas, Robert Nelson, Eddie Kohler, Lixia Zhang. Exploiting BitTorrent For Fun (But Not Profit). IPTPS 2006. [PDF]