Advanced Computer Networks (Summer 2012): Difference between revisions
Jump to navigation
Jump to search
(32 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
== Details == | == Details == | ||
{{Announcement|''' | {{Announcement|'''Due to the low number of participants, the written exam is replaced by oral examination.'''}} | ||
{{Announcement|'''Please register with FlexNow one week before the presentations.'''}} | |||
{{CourseDetails | {{CourseDetails | ||
|credits=120h, 6 ECTS (old PO), 6 ECTS (new PO) | |credits=120h, 6 ECTS (old PO), 6 ECTS (new PO) | ||
|module=M.Inf.1222.Mp, M.Inf.1223.Mp, M.Inf.221.3C1 | |module=M.Inf.1222.Mp, M.Inf.1223.Mp, M.Inf.221.3C1 | ||
|lecturer=[http://www.net.informatik.uni-goettingen.de/people/xiaoming_fu Prof. Xiaoming Fu], [http://www.net.informatik.uni-goettingen.de/people/wenzhong_li Dr. Wenzhong Li], [http://www.net.informatik.uni-goettingen.de/people/florian_tegeler Florian Tegeler] | |lecturer=[http://www.net.informatik.uni-goettingen.de/people/xiaoming_fu Prof. Xiaoming Fu], [http://www.net.informatik.uni-goettingen.de/people/wenzhong_li Dr. Wenzhong Li], [http://www.net.informatik.uni-goettingen.de/people/florian_tegeler Dr. Florian Tegeler] | ||
|ta=[http://www.net.informatik.uni-goettingen.de/people/florian_tegeler Florian Tegeler] | |ta=[http://www.net.informatik.uni-goettingen.de/people/florian_tegeler Dr. Florian Tegeler] | ||
|time=start: 19.04.2012, Thursdays 10-12 | |time=start: 19.04.2012, Thursdays 10-12 | ||
|place=3.101 | |place=3.101 | ||
Line 28: | Line 29: | ||
| Introduction | | Introduction | ||
| [[Media:ACN_01_introduction.pdf | pdf]] | | [[Media:ACN_01_introduction.pdf | pdf]] | ||
|- | |||
| align="right" | 26.04.2012 | |||
| Girls Day | |||
| No lecture | |||
|- | |- | ||
| align="right" | 03.05.2012 | | align="right" | 03.05.2012 | ||
Line 35: | Line 40: | ||
|- | |- | ||
| align="right" | 10.05.2012 | | align="right" | 10.05.2012 | ||
| | | Distributed Hash Tables | ||
| | | [[Media:ACN_03_DHTs.pdf | pdf]] | ||
|- | |- | ||
| align="right" | 17.05.2012 | | align="right" | 17.05.2012 | ||
| | | Christi Himmelfahrt | ||
| | | No lecture | ||
|- | |- | ||
|- | |- | ||
| align="right" | 24.05.2012 | | align="right" | 24.05.2012 | ||
| | | CCN/Cloud Computing | ||
| | | [[Media:ACN_04_CCN.pdf | pdf]] | ||
|- | |- | ||
| align="right" | 31.05.2012 | | align="right" | 31.05.2012 | ||
| | | Security in P2P Networks | ||
| | | [[Media:ACN_05_p2psec.pdf | pdf]] | ||
|- | |- | ||
|- | |- | ||
| align="right" | 07.06.2012 | | align="right" | 07.06.2012 | ||
| | | Social Networks 1 | ||
| | | [[Media:ACN_06_osn1.pdf | pdf]] | ||
|- | |- | ||
| align="right" | 14.06.2012 | | align="right" | 14.06.2012 | ||
| | | Social Networks 2 | ||
| | | [[Media:ACN_06_osn2.pdf | pdf]] | ||
|- | |- | ||
| align="right" | 21.06.2012 | | align="right" | 21.06.2012 | ||
Line 65: | Line 70: | ||
|- | |- | ||
| align="right" | 28.06.2012 | | align="right" | 28.06.2012 | ||
| | | Social Networks 3 | ||
| | | [[Media:ACN_07_osn3.pdf | pdf]] | ||
|- | |- | ||
| align="right" | 05.07.2012 | | align="right" | 05.07.2012 | ||
| | | Social Networks 4 | ||
| | | [[Media:ACN_08_osn4.pdf | pdf]] | ||
|- | |- | ||
| align="right" | 12.07.2012 | | align="right" | 12.07.2012 | ||
| | | Decentralized OSNs | ||
| | | [[Media:ACN_09_decosn.pdf | pdf]] | ||
|- | |- | ||
| align="right" | 19.07.2012 | | align="right" | 19.07.2012 | ||
| | | Oral Examination | ||
| | | | ||
|- | |- | ||
|} | |} | ||
==Presentation Topics== | |||
Register informally via email. | |||
* Security in DHT Networks (may be based on Urdaneta et al., ACM Comput. Surv., Jan. 2011, [[Media:security_survey_dhts.pdf | pdf]]) | |||
* <strike>G-COPSS: A Content Centric Communication Infrastructure for Gaming, ICDCS 2012 (A workshop paper is also available in LANMAN 2011)</strike> Alex | |||
* InDepth BitTorrent - Fairness, Superseeding, Trackerless, Extensions | |||
* <strike>The little engine(s) that could: scaling online social networks. SIGCOMM 2010. http://ccr.sigcomm.org/online/?q=node/642</strike> Sonja | |||
* <strike>An analysis of social network-based Sybil defenses. SIGCOMM 2010. http://ccr.sigcomm.org/online/?q=node/643</strike> Sabyasachi | |||
* <strike>Link Analysis and Web Search, Chapter 14 of the book. David Easley and Jon Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press, 2010.</strike> Sebastian | |||
* PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing http://gridsec.usc.edu/files/publications/TPDS-0463-1105.R2-Final-June21.pdf | |||
* <strike>On Blind Mice and the Elephant -- Understanding the Network Impact of a Large Distributed System http://conferences.sigcomm.org/sigcomm/2011/papers/sigcomm/p110.pdf</strike> Sromona | |||
==Presentation Style== | |||
* 20-25 min presentation and short discussion | |||
* Focus on your topic (only like 3 slides general intro) | |||
* For your audience: Assume the knowledge of a typical M.Sc. Computer Science student that attended the lecture. | |||
==Textbook== | ==Textbook== |
Latest revision as of 15:43, 16 July 2012
Details
Due to the low number of participants, the written exam is replaced by oral examination. |
Please register with FlexNow one week before the presentations. |
Workload/ECTS Credits: | 120h, 6 ECTS (old PO), 6 ECTS (new PO) |
Module: | M.Inf.1222.Mp, M.Inf.1223.Mp, M.Inf.221.3C1 |
Lecturer: | Prof. Xiaoming Fu, Dr. Wenzhong Li, Dr. Florian Tegeler |
Teaching assistant: | Dr. Florian Tegeler |
Time: | start: 19.04.2012, Thursdays 10-12 |
Place: | 3.101 |
UniVZ | [1] |
Course description
This lecture presents advanced concepts of computer networking. Preliminary topics are, for example, P2P, DHT, Cloud Computing, Social Networking, Mathematical Network Models, Content Centric Networking, Content Delivery Networks
In irregular intervals, optional exercises will be provided.
Schedule
To be determined
Date | Topic | Slides |
19.04.2012 | Introduction | |
26.04.2012 | Girls Day | No lecture |
03.05.2012 | P2P-Networks | |
10.05.2012 | Distributed Hash Tables | |
17.05.2012 | Christi Himmelfahrt | No lecture |
24.05.2012 | CCN/Cloud Computing | |
31.05.2012 | Security in P2P Networks | |
07.06.2012 | Social Networks 1 | |
14.06.2012 | Social Networks 2 | |
21.06.2012 | Presentations | |
28.06.2012 | Social Networks 3 | |
05.07.2012 | Social Networks 4 | |
12.07.2012 | Decentralized OSNs | |
19.07.2012 | Oral Examination |
Presentation Topics
Register informally via email.
- Security in DHT Networks (may be based on Urdaneta et al., ACM Comput. Surv., Jan. 2011, pdf)
G-COPSS: A Content Centric Communication Infrastructure for Gaming, ICDCS 2012 (A workshop paper is also available in LANMAN 2011)Alex- InDepth BitTorrent - Fairness, Superseeding, Trackerless, Extensions
The little engine(s) that could: scaling online social networks. SIGCOMM 2010. http://ccr.sigcomm.org/online/?q=node/642SonjaAn analysis of social network-based Sybil defenses. SIGCOMM 2010. http://ccr.sigcomm.org/online/?q=node/643SabyasachiLink Analysis and Web Search, Chapter 14 of the book. David Easley and Jon Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press, 2010.Sebastian- PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing http://gridsec.usc.edu/files/publications/TPDS-0463-1105.R2-Final-June21.pdf
On Blind Mice and the Elephant -- Understanding the Network Impact of a Large Distributed System http://conferences.sigcomm.org/sigcomm/2011/papers/sigcomm/p110.pdfSromona
Presentation Style
- 20-25 min presentation and short discussion
- Focus on your topic (only like 3 slides general intro)
- For your audience: Assume the knowledge of a typical M.Sc. Computer Science student that attended the lecture.
Textbook
- Christian Schindelhauer and Peter Mahlmann, Peer-to-Peer Netzwerke (german)
- David Easley and Jon Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press, 2010.
- Mark M. Meerschaert, Mathematical Modeling (3th Edition), Elsevier Academic Press, 2007.
- Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, Cambridge University Press, 1995
Other Resources
Prerequisites
- Computer Science I, II; Computer Networks