Advanced Topics in Computer Networking (Winter 2010/2011)
Jump to navigation
Jump to search
Details
Workload/ECTS Credits: | 180h, 6 ECTS |
Module: | M.Inf.223: Seminar Telematik III |
Lecturer: | {{{lecturer}}} |
Teaching assistant: | Yang Chen, Tianyin Xu |
Time: | Fridays, 10.15 - 11.45 |
Place: | IfI 3.101 |
UniVZ | [1] |
Course Overview
The purpose of this seminar is to discuss some advanced concepts in computer networking. This course is a research seminar (6 ECTS, 2 SWS), held on a weekly base and comprising the following components:
- Weekly paper reading and discussion + Weekly Presentation
- Final Presentation
- Final report
The material in the seminar, drawn mainly from the research literature from top tier journal/conference, like ToN, TPDS, SIGCOMM, SIGMETRICS, IMC, WWW, CoNEXT. The seminar topics include the following:
- Peer-to-Peer Networking (Infrastructure, Systems, Applications)
- Online Social Networking (Architecture, User Behavior, Data Collection, Data Analysis)
Schedule
- 05.11.2010 [Session 0]
- File:Introduction ATCN WS1011.pdf
- Course Introduction (how to read, write....)
- Introduction of Peer-to-Peer Networking
- 12.11.2010 [Session 1]: Peer-to-Peer Networking
- Paper reading: GNP (landmark-based network coordinate system)
- 19.11.2010 [Session 2]: Peer-to-Peer Networking
- Paper reading: Vivaldi (decentralized network coordinate system)
- 26.11.2010 [Session 3]: Peer-to-Peer Networking
- Paper reading: IDES (matrix factorization model based network coordinate system)
- 03.12.2010 [Session 4]: Peer-to-Peer Networking
- Paper reading: Chord (scalable Peer-to-peer lookup service)
- 10.12.2010 [Session 5]: No class
- Decisions on assigning papers for the final presentation!
- 17.12.2010 [Session 6]: Peer-to-Peer Networking
- Paper reading: High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two
- Introduction of online social networking
- 07.01.2011 [Session 7]: Online Social Networking
- Paper reading: Understanding Latent Interactions in Online Social Networks
- 14.01.2011 [Session 8]: Online Social Networking
- Paper reading: Understanding online social network usage from a network perspective
- 21.01.2011 [Session 9]: Online Social Networking
- Paper reading
- Introduction of top conferences
- 11.02.2011 [Final presentation]
- Time: 9:00AM-12:00AM
- Each presentation is limited to up to 20 minutes, plus 10 minutes Q/A and discussion
- Please send your slides to Yang and Tianyin by 07.02.2011
Session Reading Assignments
- For Section 1: [2](Presenter: Lei Jiao)
- Feedback: [3]
- For Section 2: [4] (Presenter: Cong Ding)
- For Section 3: [8] (Presenter: Shining Wu)
- For Section 4: [11]
- For Section 6: [12][13]
- For Section 7: [14] (Presenter: Dominic Simm)
- For Section 8: [15] (Presenter: Jiachen Chen)
- For Section 9: [16] (Presenter: Malte Hübner)
- Feedback: [17]
Feedback lists some papers related to the discussion in the class, could act as references for reviewing the sessions
Reading Assignments for Final Presentation
- User Behavior in OSN
- Alan Mislove, Massilmiliano Marcon, Krishna P. Gummadi, Peter Druschel, Bobby Bhattacharjee. Measurement and Analysis of Online Social Networks. In Proc. of ACM IMC, 2007.
- Meeyoung Cha, Alan Mislove, and Krishna P. Gummadi. A Measurement-driven Analysis of Information Propagation in the Flickr Social Network. In Proceedings of the 18th Annual World Wide Web Conference (WWW'09), Madrid, Spain, April 2009.
- Christo Wilson, Bryce Boe, Alessandra Sala, Krishna P. N. Puttaswamy and Ben Y. Zhao. User Interactions in Social Networks and their Implications. In Proc. of ACM EuroSys, 2009.
- Haewoon Kwak, Changhyun Lee, Hosung Park, Sue Moon. What is Twitter, a Social Network or a News Media?. In Proc. of WWW, 2010.
Social Graph Analysis(Cong Ding)- J. Leskovec, Christos Faloutsos. Sampling from Large Graphs. In Proc. of ACM SIGKDD, 2006.
- Alessandra Sala, Lili Cao, Christo Wilson, Robert Zablit, Haitao Zheng and Ben Y. Zhao. Measurement-calibrated Graph Models for Social Network Experiments. In Proc. of WWW, 2010.
- Minas Gjoka, Maciej Kurant, Carter T Butts, Athina Markopoulou. Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In Proc. of IEEE Infocom, 2010.
- Bruno Ribeiro and Don Towsley, Estimating and Sampling Graphs with Multidimensional Random Walks, ACM IMC, 2010.
- Security of Network Coordinate Systems
- M.A. Kaafar, L. Mathy, C. Barakat. K. Salamatian, T. Turletti, and W. Dabbous. Securing Internet Coordinate Embedding Systems. In Proc of ACM SIGCOMM, 2007.
- D. J. Zage, C. Nita-Rotaru. On the Accuracy of Decentralized Virtual Coordinate Systems in Adversarial Networks. In Proc. of ACM CCS, 2007
- Guohui Wang, T. S. Eugene Ng. Distributed Algorithms for Stable and Secure Network Coordinates. In Proc. of ACM IMC, 2008.
- Micah Sherr, Matt Blaze, and Boon Thau Loo. Veracity: Practical Secure Network Coordinates via Vote-based Agreements. In Proc. of USENIX Annual Technical Conference, 2009.
Mobile Social Networking(Lei Jiao)- Pan Hui, Jon Crowcroft, and Eiko Yoneki. BUBBLE Rap: Social-based Forwarding in Delay Tolerant Networks. To appear in IEEE Transactions on Mobile Computing.
- Justin Manweiler, Ryan Scudellari, Landon P. Cox. SMILE: encounter-based trust for mobile social services. In Proc. of ACM CCS, 2009.
- Shravan Gaonkar, Jack Li, Romit Roy Choudhury, Landon Cox, Al Schmidt. Micro-Blog: sharing and querying content through mobile phones and social participation. In Proc. of ACM MobiSys, 2008.
Security and Privacy of OSN(Jiachen Chen)- Randolph Baden, Adam Bender, Daniel Starin, Neil Spring, Bobby Bhattacharjee. Persona: An Online Social Network with User-Defined Privacy. In Proc. of ACM SIGCOMM, 2009.
- Krishna P. N. Puttaswamy, Alessandra Sala, and Ben Y. Zhao. StarClique: Guaranteeing User Privacy in Social Networks Against Intersection Attacks. In Proc. of ACM Conference on emerging Networking EXperiments and Technologies (CoNEXT), 2009.
- Bimal Viswanath, Ansley Post, Krishna P. Gummadi, Alan Mislove. An Analysis of Social Network-Based Sybil Defenses. In Proc. of ACM SIGCOMM, 2010.
- Hongyu Gao, Jun Hu, Christo Wilson, Zhichun Li, Yan Chen and Ben Y. Zhao. Detecting and Characterizing Social Spam Campaigns. In Proc. of ACM IMC, 2010.
P2P VoD System(Shining Wu)- W. P. K. Yiu, X, Jin, and S. H. G. Chan. VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming. In IEEE Journal on Selected Areas in Communications, 25(9):1717-1731, Dec. 2007.
- B. Cheng, H. Jin, X. Liao. Supporting VCR Functions in P2P VoD Services Using Ring-Assisted Overlays. In Proc. of IEEE ICC 2007.
- D. Wang and J. Liu. A Dynamic Skip List-based Overlay for On-Demand Media Streaming with VCR Interactions. In IEEE Transaction on Parallel and Distributed Systems, 19(4):503-514, Apr. 2008.
- Y. Huang, T. Z. J. Fu, D. M. Chiu, J. C. S. Liu, and C. Huang. Challenges, Design and Analysis of a Large-scale P2P-VoD System. In Proc. of ACM SIGCOMM 2008.
- Gossip/Epidemic Dissemination
- A. J. Ganesh, A. -M. Kermarrec, and L. Massoulie. Peer-to-Peer Membership Management for Gossip-Based Protocols. IEEE Transactions on Computer, 52(2):1-11, Feb. 2003.
- P. T. Eugster, R. Guerrauoi, A. -M. Kermarrec, and L. Massoulie. From Epidemics to Distributed Computing. IEEE Computer, 37:60-67, 2004.
- A. J. Demers, D. H. Greene, C. Hauser, W. Irish, and J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic Algorithms for Replicated Database Maintenance. In Proc. of ACM PODC1987.
- D. Kempe, J. Kleinberg, and A. Demers. Spatial Gossip and Resource Location Protocols. In Proc. of 33rd ACM STOC 2001.
Requirements
- Each participant is required to read the selected paper before the seminar and prepare the review of the paper, which should include the following parts:
- Summary of the paper
- pros and cons of the paper (your conclusion)
- NOTE!! Every participant should provide the paper review BEFORE the seminar (23:59 Wednesday). => the review form is available at [18]
- During the seminar, one is chosen for giving the overview of the paper. And the list of pros and cons is discussed by all the participant.
- In the end of the semester, everyone is requested to pick a topic (about 4 papers) and prepare:
- presentation (each for ~20 minutes, plus ~10 minutes discussions)
- essay (12~15 pages)