DCN - R202

Additional References

review_log

Open Source Projects

Reading Club Papers (updated)

Contact

Overview

This module provides an introduction to data centric networking, where data is a communication token in networking. Data centric networking in distributed systems relies on content addressing instead of host addressing, thus providing network independence for applications. Integration of complex data processing with networking is a key vision for future computing. This course provides various aspects in data centric networking ranging from content-based routing to data-flow programming, providing a solid basis to work on the next generation of communication paradigm. On completion of this module, you should:

• Understand key concepts of data centric approaches in future networking
• Obtain a clear understanding of building distributed systems using data centric communication

The class photo is here!

Module Structure

The module consists of 8 sessions, of which 6 sessions focus on a specific aspect of the topic in data centric networking research. Each session discusses 2-3 papers, led by the assigned students. Each student will present about 2 paper reviews during the course. The first session advises how to read/review a paper and a brief introduction of different perspectives in data centric networking. The last session is dedicated to the presentation of the open source project studies present by the students. Three guest lectures are planned (subject to change), covering inspiring current research in the data centric networking domain.

Schedule and Reading List

We’ll meet in SW01 every Thursday (from January 20 to March 10) in 2011. The time slot is 14:00-16:00.

 2011/01/20 Session 1: Introduction to Data Centric Networking (DCN)

• Introduction (slides)
• Assignment details
• Guidance of how to read/review/present a paper
• Six Faces of Data Centric Networking (slides)

 2011/01/27 Session 2: Content-Based Networking (CBN) and Content Distribution Networks (CDN)

• Content distribution overlay

Todor Minchev slides
1.1 A. Carzaniga, D.S. Rosenblum, A.L. Wolf: Achieving scalability and expressiveness in an internet-scale event notification service, PODC, 2001.
1.2. A. Carzaniga, M.J. Rutherford, A.L. Wolf: A Routing Scheme for Content-Based Networking, INFOCOM, 2004.
1.3. A. Carzaniga, A.L. Wolf: Forwarding in a content-based network, SIGCOMM, 2003.

Eireann Leverett slides
3.1. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker: A scalable content addressable network, SIGCOMM, 2001.
3.2. S. Ratnasamy, M. Handley, R. Karp, S. Shenker: Application-level multicast using content addressable networks, NGC, 2001.
 
Stojan Trajanovski slides
2. M. Castro, M. B. Jones, A-M. Kermarrec, A. Rowstron, M. Theimer, H. Wang and A. Wolman: An Evaluation of Scalable Application-level Multicast Built Using Peer-to-peer overlays, INFOCOM, 2003.
 

4.1. M.J. Freedman, E. Freudenthal, D. Mazières: Democratizing Content Publication with Coral, NSDI, 2004.
4.2. M.J. Freedman: Experiences with CoralCDN: A Five-Year Operational View, NSDI, 2010.
 

 2011/02/03 Session 3: Content-Centric Networking (CCN) and Named Data Networking (NDN)

• Content represents network identifier
• A good introductory talk by Van Jacobson

Yi Liu slides
1. T. Koponen, M. Chawla, B. Chun. K. Kim, S. Shenker, A. Ermolinskiy, I. Stoica: A Data-Oriented (and Beyond) Network Architecture, SIGCOMM 2007.

Karthik Nilakant (2.1 and 2.2) slides, Chung Leung Lam (2.2) slides
2.1. V Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N.H. Briggs, R.L. Braynard: Networking Named Content, CoNEXT, 2009.
2.2. L. Zhang, D. Estrin, J. Burke, V. Jacobson, J.D. Thornton, D.K. Smetters, B. Zhang, G. Tsudik, K.C. Claffy, D. Krioukov, D. Massey, C. Papadopoulos, T. Abdelzaher, L. Wang, P. Crowley, E. Yeh: Named Data Networking (NDN) Project, PARC Technical Report NDN-0001, 2010.

Mert Coskun slides
3. M.J. Freedman, M. Arye, P. Gopalan, S.Y. Ko, E. Nordström, J. Rexford, D. Shue: Service-Centric Networking with SCAFFOLD, Princeton University, Technical Report TR-885-10, 2010.
 
4. P. Jokela, A. Zahemszky, C. E. Rothenberg, S. Arianfar, and P. Nikander: LIPSIN: Line Speed Publish/Subscribe Inter-networking, SIGCOMM, 2009.
 

 2011/02/10 Session 4: Programming in Data Centric Environment

• Network meets programming
• Guest lecture (Derek Murray - University of Cambridge) CIEL Control-flow in a distributed execution engine slides

Mert Coskun slides
1. Yuan Yu, Michael Isard, D. Fetterly, M. Budiu, U. Erlingsson, P.K. Gunda, J. Currey: DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language, OSDI, 2008.

2.1. Boon Thau Loo, Tyson Condie, Joseph M. Hellerstein, Petros Maniatis, Timothy Roscoe, and Ion Stoica: Implementing Declarative Overlays, SOSP, 2005.
2.2. Boon Thau Loo, Tyson Condie, Minos Garofalakis, David E. Gay, Joseph M. Hellerstein, Petros Maniatis, Raghu Ramakrishnan, Timothy Roscoe, Ion Stoica: Declarative Networking, Communications of the ACM, Vol. 52 No. 11, pp. 87-95, 2009.

Stefan Istrate slides
3. Peter Alvaro, Tyson Condie, Neil Conway, Khaled Elmeleegy, Joseph M. Hellerstein, Russell Sears: Boom analytics: exploring data-centric, declarative programming for the cloud, Eurosys 2010.
 
4. J. Dean, S. Ghemawat: MapReduce: Simplied Data Processing on Large Clusters, OSDI, 2004.
 

 2011/02/17 Session 5: Stream Data Processing and Data/Query Model

• Data and continuous query in steam data processing
• Guest lecture (Peter Pietzuch - Imperial College - postponed)

Rocky Ge slides
1. V. Gulisano, R. Jimenez-Peris, M. Patiño-Martinez, P. Valduriez: StreamCloud: A Large Scale Data Streaming System, ICDCS, 2010.

Ee Lee Ng slides
2. Peter Pietzuch, Jonathan Ledlie, Jeffrey Shneidman, Mema Roussopoulos, Matt Welsh, and Margo Seltzer: Network-Aware Operator Placement for Stream-Processing Systems, ICDE, 2006.

Karthik Nilakant slides
Stojan Trajanovski slides
3.1. Geoffrey Mainland, Greg Morrisett, Matt Welsh: Flask: Staged Functional Programming for Sensor Networks, ICFP, 2008.
3.2. Geoffrey Mainland, Matt Welsh, Greg Morrisett: Flask: A Language for Data-driven Sensor Network Programs, Harvard University Technical Report TR-13-06, 2006.
 
Chung Leung Lam slides
4. S. Babu, J. Widom: Continuous Queries over Data Streams, SIGMOD Record 30(3), 2001.
 

 2011/02/24 Session 6: Network holds Data in Delay Tolerant Networks (DTN)

• Network holds data

Karthik Nilakant slides
1. E. Nordström, P. Gunningberg, C. Rohner: A Search-based Network Architecture for Mobile Devices, Uppsala University Technical Report 2009-003, 2009.

Wenhan Tong slides
2. N. Laoutaris, G. Smaragdakis, P. Rodriguez, R. Sundaram: Delay Tolerant Bulk Data Transfers on the Internet, SIGMETRICS, 2009., in ACM/SIGMETRICS'09.

Stefan Istrate slides
3. M. Grossglauser, D. Tse: Mobility increases the capacity of ad-hoc wireless networks, IEEE/ACM Trans. on Networking, 10:477–486, 2002.
 
4. K. Fall: A delay-tolerant network architecture for challenged internets, SIGCOMM, 2003.
 

 2011/03/03 Session 7: Network Structure/Characteristics and Contexts

• Network graph for data flow
• Guest lecture (Damien Fay - University of Cambridge) The weighted spectral distribution: A graph metric with applications slides

Stojan Trajanovski slides
1. Kunwadee Sripanidkulchai, Bruce Maggs, Hui Zhang: Efficient content location using interest-based locality in peer-to-peer systems, INFOCOM, 2003.

2.1. Dmitri Krioukov, kc claffy, Kevin Fall, Arthur Brady: On compact routing for the internet, ACM 37 (3), 2007.
2.2. Dmitri Krioukov, Kevin Fall, Xiaowei Yang: Compact routing on Internet-like graphs, INFOCOM, 2004.

Eireann Leverett slides
3.1. P. Eugster, R. Guerraoui, A-M. Kermarrec, L. Massoulie: Epidemic information dissemination in distributed system, IEEE Computer, 37(5), 2004.
3.2. P. Eusgter, R. Guerraoui, S.B. Handurukande, P. Kouznetsov: Lightweight probabilistic broadcast, ACM TOCS 21(4), 2003.
 

 2011/03/10 Session 8: Presentation of Open Source Project Study

• Presentation of Open Source Project Study by all (6 minutes of presentation and 3 minutes of QA for each student)

1. 13:30 Mert Coskun (Hadoop) SpreaDoop with HBase slides
2. 13:40 Rocky Ge (XmlBlaster) Android communication with xmlBlaster slides
3. 13:50 Chung Leung Lam (CIEL) Exploring Skywriting with Ciel slides
4. 14:00 Stefan Istrate (Hadoop MapReduce) Distributed computing with Hadoop MapReduce slides
5. 14:10 FG
6. 14:20 Eireann Leverett (Hadoop) Zookeeper to examine configuration management of devices slides
7. 14:30 Yi Liu (STREAM) Evaluation of STREAM open source project slides
   
   14:40-14:45 Break
   
   
8. 14:45 Todor Minchev (PSIRP) Setup, simulation and functionality evaluation of the PSIRP architecture slides
9. 14:55 Ee Lee Ng (Cayuga) Monitoring SocialAds on Social-Networking sites slides
10. 15:05 Karthik Nilakant (Haggle) Opportunistic Distributed Download over Haggle slides
11. 15:15 Wenhan Tong (DTN) Mobility Models and Simulations slides
12. 15:25 Stojan Trajanovski (DryadLINQ) On the complex network clustering using DryadLINQ slides
    
    15:45-16:00 Wrap-up Discussion slides

 Coursework 1 (Reading Club)

The reading club will require you to read between 1 and 3 papers every week. You need to fill out a review_log (MS word format, text format) except sections 6&7 prior to each session and email me by 12:00 noon on Thursday. After the session, you finish filling out sections 6&7 and email me by the end of following Friday. The minimum requirement of review_log is one, but you can read as many as you want and fill the review_log for each paper you read.

At each session, around 3 papers are selected under the session topic, and if you are assigned to present your review work, please prepare 15-20 minutes slides for presenting your review work. Your presented material should also be emailed by the following day Friday. You would present your review work approximately twice during the course. The paper includes following two types and you can focus on the specified aspects upon reviewing the paper.

1. Full length papers 
   • What is the significant contribution?
   • What is the difference from the existing works?
2. Short length papers 
   • What is the novel idea?
   • What is required to complete the work?

 Coursework 2 (Reports)

The following three reports are required, which could be extended from the reading assignment of the reading club or a different one within the scope of data centric networking.

1. Review report on a full length of paper (2500 words)
   • Describe the contribution of paper in depth with criticism
   • Crystallise the significant novelty in contrast to the other related work
   • Suggestion for future work
2. Survey report on sub-topic in data centric networking (aim at 2500-3000 words - max 3500 words)
   • Pick up to 5 papers as core papers in your survey scope
   • Read the above and expand your reading through related work
   • Comprehend your view and finish as your survey paper
   • See how to write a survey paper
3. Project study and exploration of a prototype (3500 words)
   • See Open Source Projects
   • What is the significance of the project in the research domain?
   • Compare with the similar and succeeding projects
   • Demonstrate the project by exploring its prototype
   • Please email your project selection (MS word format, text format <150 words) by February 5, 2011
   • Project presentation on March 10, 2011

The reports 1 and 2 should be handed in by the end of 5^th week (Feb 22, 2011 - 12:00 noon ) and 7^th week (March 15, 2011 - 12:00 noon) of the course (not in any particular order). The report 3 should be by the end of the Lent term (March 25, 2011 - 12:00 noon).

 Assessment

The final grade for the course will be provided as a letter grade or percentage and the assessment will consist of two parts:

1. 25%: for a reading club (Presentation, participation and review_log)
2. 75%: for the three reports
   • 20%: Intensive review report
   • 20%: Survey report
   • 35%: Project study

Open Source Projects

See the candidates of Open Source Projects in data centric networking. The list is not exhausted. If you take anything other than the one in the list, please discuss with me. The purpose of this assignment is to understand the prototype of the proposed architecture, algorithms, and systems through running an actual prototype and present/explain to the other people how the prototype runs, any additional work you have done including your own applications and setup process of the prototype. This experience will give you better understanding of the project. These Open Source Projects come with a set of published papers and you should be able to examine your interests in the paper through running the prototype. Some projects are rather large and may require extensive environment and time; make sure you are able to complete this assignment.

How to Read/Review a Paper

The following papers aid how to read/review a paper.

• S. Keshav: How to Read a Paper, ACM SIGCOMM Computer Communication Review 83 Volume 37, Number 3, July 2007.
• T. Roscoe: Writing Reviews for Systems Conferences, 2007.
• Simon Peyton-Jones: How to write a great paper and give a great talk about it, Microsoft Research Cambridge.
• David A. Patterson: How to Have a Bad Career in Research/Academia, 2001.

Further supplement: see ‘how to read/review a paper’ section in Advanced Topics in Computer Systems by Steven Hand.

Presentations

Presentations should be about 15-20 minutes long, where you need to cover the following aspects.

1. What are the background and the problem domain of the paper? What is the motivation of the presented work? What is the difference from the existing works?  What is the novel idea? How did the paper change/unchange the research in the research community?

2. What is the significant contribution? How did the authors tackle the problem? Did the authors obtain expected result from their trial?

3. How do you like the paper and why? What is the takeaway message to you (and to research community)? What is required to complete the work?

The following document aids in presenting a review.

• Perdita Stevens in University of Edinburgh How to [read, present, review] a research paper.

How to write a survey paper

A survey paper provides the readers with an exposition of existing work that is comprehensive and organized. It must expose relevant details associated in the surveying area, but it is important to keep a consistent level of details and to avoid simply listing the different works. Thus a good survey paper should demonstrate a summary of recent research results in a novel way that integrates and adds understanding to work in the field. For example, you can take an approach by classifying the existing literature in your own way; develop a perspective on the area, and evaluate trends. Thus, after defining the scope of your survey, 1) classify and organize the trend, 2) critical evaluation of approaches (pros/cons), and 3) add your analysis or explanation (e.g. table, figure). Also adding reference and pointer to further in-depth information is important (summary from Rich Wolski’s note).

Contact Email

Please email to eiko.yoneki@cl.cam.ac.uk for your submission of course work or any question.