|
Contents:
|
This course discusses the operational and management
aspects of distributed systems (including networked
systems) and the security aspects of distributed systems
(authentication, privacy, key creation and distribution
protocols, firewalls, access control models, trust in
distributed systems). In addition, this course will cover
recent approaches to build self-controlling and
self-organizing distributed systems.
This course assumes that students are familiar with
fundamental distributed systems concepts usually covered
in undergraduate courses on distributed systems. The
course will be accompanied by a hands-on programming lab,
where selected topics of the course will be implemented.
|
|
Books:
|
This course does not follow a text book. Most of the
material discussed in the course is taken from recent
research papers. Students are expected to obtain and read
original research papers:
-
E. Cohen and S. Shenker: Replication Strategies in
Unstructured Peer-to-Peer Networks. Proc. SIGCOMM 2002,
ACM, Pittsburgh, August 2002.
-
S. Saroiu and P. Gummadi and S. Gribble: A Measurement
Study of Peer-to-Peer File Sharing Systems. Proc. of
Multimedia Computing and Networking (MMCN 2002), January
2002.
-
K.P. Gummadi and R.J. Dunn and S. Saroiu and
S.D. Gribble and H.M. Levy and J. Zahorjan: Measurement,
Modeling, and Analysis of a Peer-to-Peer File-sharing
Workload. Proc. of the 19th ACM Symposium on Operating
Systems Principles (SOSP 2003), ACM, January 2003.
-
I. Stoica and R. Morris and D. Karger and M. F.
Kaashoek and H. Balakrishna: Chord: A Scalable
Peer-to-peer Lookup Service for Internet Applications.
Proc. SIGCOMM 2001, ACM, San Diego, August 2001.
-
S. Ratnasamy and P. Francis and M. Handley and R. Karp
and S. Shenker: A Scalable Content-Addressable
Network. Proc. SIGCOMM 2001, ACM, San Diego, August
2001.
-
A. Rowstron and P. Druschel: Pastry: Scalable,
decentralized object location and routing for
large-scale peer-to-peer systems. Proc. 18th IFIP/ACM
International Conference on Distributed Systems
Platforms (Middleware 2001), Heidelberg, November 2001.
-
S. Androutsellis-Theotokis and D. Spinellis: A Survey of
Peer-to-Peer Content Distribution Technologies. ACM
Computing Surveys 7(2), 2005.
-
S. Rhea and B. Godfrey and B. Karp and J. Kubiatowicz
and S. Ratnasamy and S. Shenker and I. Stoica and H.
Yu: OpenDHT: A Public DHT Service and Its Uses.
Proc. SIGCOMM 2005, ACM, Philadelphia, August 2005.
-
Y. Chawathe and S. Ramabhadran and S. Ratnasamy and A.
LaMarca and S. Shenker and J. Hellerstein: A Case Study
in Building Layered DHT Applications. Proc. SIGCOMM
2005, ACM, Philadelphia, August 2005.
-
J. Risson and T. Moors: Survey of Research towards
Robust Peer-to-Peer Networks: Search Methods. Computer
Networks 50(17), Elsevier, December 2006.
-
L. Gong: JXTA: A Network Programming Environment.
IEEE Internet Computing, 5(3), May 2001.
-
D. Qiu and R. Srikant: Modeling and Performance Analysis
of BitTorrent-Like Peer-to-Peer Networks. Proc. SIGCOMM
2004, ACM, Portland, September 2004.
-
L. Guo and S. Chen and Z. Xiao and E. Tan and X. Ding
and X. Zhang: A Performance Study of BitTorrent-like
Peer-to-Peer Systems. IEEE Journal on Selected Areas in
Communications, 25(1), January 2007.
-
T. Locher and P. Moor and S. Schmid and R. Wattenhofer:
Free Riding in BitTorrent is Cheap. Proc. of the 5th
Workshop on Hot Topics in Networks, ACM, Irvine,
November 2006.
-
R. Dingledine and N. Mathewson and P. Syverson: Tor: The
Second-Generation Onion Router. Proc. of the 13th
USENIX Security Symposium, San Diego, August 2004.
-
S.J. Murdoch: Hot or Not: Revealing Hidden Services by
their Clock Skew. Proc. of the 13th ACM Conference on
Computer and Communications Security (CCS'06), ACM,
Alexandria, November 2006.
-
D. Gay and P. Levis and R. von Behren and M. Welsh and
E. Brewer and D. Culler: The nesC Language: A Holistic
Approach to Networked Embedded Systems. Proc. of the ACM
Conference on Programming Language Design and
Implementation (PLDI03), ACM, June 2003.
-
J.E. Elson: Time Synchronization in Wireless Sensor
Networks. PhD Thesis, University of California Los
Angeles, 2003.
-
K. Roemer: Time Synchronization and Localization in
Sensor Networks. PhD Thesis, ETH Zurich, 2005.
-
G. Werner-Allen and G. Tewari and A. Patel and M. Welsh
and R. Nagpal: Firefly-Inspired Sensor Network
Synchronicity with Realistic Radio Effects. Proc. of
the ACM Conference on Embedded Networked Sensor Systems
(SenSys'05), ACM, November 2005.
-
S.R. Madden and M.J. Franklin and J.M. Hellerstein and
W. Hong: TinyDB: An Acquisitional Query Processing
System for Sensor Networks. ACM Transactions on Database
Systems, 30(1), ACM, March 2005.
|
|
Grading:
|
The final grade is made up of the mid-term exam, the final
exam, and paper homeworks, and some mini projects. The
final grade G will be computed from the course grade C and
the project grade P:
G = 5/9 * C + 4/9 * P
The course grade C will be computed from the grade of the
midterm exam (M), the final exam (F), and homeworks (H):
G = 1/3 * M + 1/3 F + 1/3 H
It is required to submit the solution for programming
problems electronically and on paper to the
instructor. Late submissions will not be accepted.
Homeworks and project work must be defended in an oral
interview.
All partial grades will be expressed in percentages. The
overall percentage G will be converted into Jacobs
University grades as follows:
| Percentage | Grade | Description |
|---|
| [96-100] | 1.00 | Excellent |
| [91-95] | 1.33 | Very Good |
| [86-90] | 1.67 | Very Good |
| [81-85] | 2.00 | Good |
| [76-80] | 2.33 | Good |
| [71-75] | 2.67 | Satisfactory |
| [66-70] | 3.00 | Satisfactory |
| [61-65] | 3.33 | Satisfactory |
| [56-60] | 3.67 | Sufficient |
| [51-55] | 4.00 | Sufficient |
| [46-50] | 4.33 | Sufficient |
| [41-45] | 4.67 | Failing |
| [ 0-40] | 5.00 | Failing |
Any programs which have to be written will be
evaluated based on the following criteria:
- correctness including proper handling of error conditions
- proper use of programming language constructs
- clarity of the program organization and design
- readability of the source code and any output produced
|