Network Architectures: Internet Routing (Seminar)

•  Overview / Überblick —

•  Content / Inhalt —

•  Organisation —

•  Schedule / Zeitplan —

•  Topics / Themen —

•  Agenda / Ablauf —

•  Literature / Literatur

News / Aktuelles

• The talks will take place on Monday, 27 July 12:00 p.m. to 4:00 p.m. and on Wednesday, 29 July, 1:00 p.m. to 5:00 p.m. See below for the agenda.

  Die Vorträge werden am Montag, den 27. Juli, 12:00 Uhr bis 16:00 Uhr, und am Mittwoch, den 29. Juli, jeweils 13:00 Uhr bis 17:00 Uhr, stattfinden. Für die Agenda siehe unten.

 top

Overview / Überblick

lecturer / Dozentin:	Prof. Anja Feldmann, Ph.D., Dr. Sonja Buchegger
Contact Person / Ansprechpartner:	Doris Schiöberg, Oliver Hohlfeld
Supervisors / Betreuer:	Ioannis Avramopoulos Oliver Hohlfeld Thomas Hühn Wolfgang Mühlbauer Doris Schiöberg Harald Schiöberg Cigdem Sengul Steve Uhlig All supervisors / Alle Betreuer: seminarlists.net.t-labs.tu-berlin.de
Mailing list	Please subscribe the mailing list here. Bitte hier die Mailingliste abbonieren. Beiträge an die Liste können an die folgende E-Mail Adresse geschrieben werden / Posts to the list can be addressed to the following e-mail address: seminar_ss09lists.net.t-labs.tu-berlin.de
event type / Veranstaltungstyp:	advanced seminar / Hauptseminar
area / Gebiet:	Operating and Communication Systems / Betriebs- und Kommunikationssysteme (BKS)
SWS:	2
ECTS / LP:	3
Time / Zeit:	tba (vorauss. zwei bis drei Tage in den ersten zwei bis drei Wochen nach der Vorlesungszeit)
Room / Raum:	tba
Preparatory Meeting / Vorbesprechung:	17 April 2009, 10 a.m. Room: MA 144 Slides / Folien
Course ID / Veranstaltungsnr.:	0432 L 822
Audience / Hörerkreis	main course students / Hauptstudium
Prerequisites / Voraussetzungen:	intermediate diplom, profound knowledge in computer networks and cryptology, good english for reading scientific papers / Vordiplom, tiefgehendes Wissen in Rechnernetzen und Kryptologie, gutes Englisch, um wissenschaftliche Artikel zu lesen
Exam / Prüfung:	talk and paper / Vortrag und Ausarbeitung

 top

Content / Inhalt

 top

Organisation

 top

Schedule / Zeitplan

When/Wann?	What?	Was?	Time Need / Aufwand?
17. April 2009, 10:00–12:00	Preparatory Meeting: Presentation of the supervisors, topic groups and topics	Vorbesprechung: Vorstellung der Betreuer, Themengruppen und Einzelthemen	2h
until/bis 21 April 2009 (12:00)	Registration for the seminar via web form. At least three topic wishes and the Matrikelnummer are required. The topics are allocated by lot!	Anmeldung zum Seminar per Webformular. Es müssen mindestens drei Themenwünsche und die Matrikelnummer angegeben werden. Die Themenvergabe wird ausgelost!
until/bis 24 April 2009	Announcement of participant ↔ topic correlation in the web or per email	Bekanntgabe der Zuordnung der Themen auf die Teilnehmer/innen im Web oder per E-Mail
until / bis 8 May 2009	elaborate the topic (search literature, sort it, read it – and if possible – understand it)	Thema ausarbeiten (Literatur suchen, sortieren, lesen und – soweit es geht – verstehen)	20h
subsequently / anschließend	Meeting of every participant with his supervisor	Treffen jedes/r Teilnehmers/in mit seinem/ihrem Betreuer	1h
until / bis 8 June 2009	summarize literature in a seminar paper (about 10 pages)	Literatur in Form einer Seminarausarbeitung (ca. 10 Seiten) zusammenfassen.	20h
until / bis 8 June 2009 (23:59)	send seminar paper to supervisor	Seminarausarbeitung an Betreuer mailen
until / bis 22 June 2009	read and correct seminar paper of the other participants of the group	Korrekturlesen der Seminarausarbeitungen der anderen Gruppenteilnehmer	5h
susequently / anschließend	Group meeting: exchange comments and helpful hints with each other. Attendance is mandatory!	Gruppentreffen: Dabei werden die gegenseitigen Kommentare besprochen. Anwesenheit ist verpflichtend!	2h
until / bis 3 July 2009 (23:59)	incorporate results of the group meeting in seminar paper and send the revised version to supervisor	Ergebnisse des Gruppentreffens in Seminarausarbeitung einarbeiten und überarbeitete Fassung an Betreuer mailen	5h
until / bis 14 July 2009	Prepare slides and send them to supervisor	Vortragsfolien vorbereiten und an per E-Mail an den Betreuer senden	10h
subsequently / anschließend	Meeting with supervisor: discuss slides	Treffen mit Betreuer zur Besprechung der Folien	1h
until / bis 17 July 2009	incoporate comments of supervisor in slides and send final version to supervisor	Treffen mit Betreuer zur Besprechung der Folien	5h
18 July 2009	End of term	Ende der Vorlesungszeit
until the day before seminar / bis zum Tag vor dem Seminar	Prepare the talk	Vorbereitung des Vortrags	5h
Mo, 27 July and We/Mi, 29 July 2009 13:00 – 17:00	Talks Attendance to all talks is mandatory!	Vorträge Anwesenheit zu allen Vorträgen ist verpflichtend!	45min incl. Discussion per talk

 top

Topics / Themen

(Hide all abstracts & references / alle Zusammenfassungen und Referenzen ausblenden)

1 — Building an AS-topology model that captures route diversity.

Student/Bearbeiter: Martin Müller ; Supervisor/Betreuer: Wolfgang Mühlbauer;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

Describes a first try to build a model of the AS-level Internet that captures the route diversity observed in BGP route from several vantage points. The model is built incrementally by refining the granularity of the topology and setting policies so as to match the diversity present in observed BGP data.

• Wolfgang Mühlbauer, Anja Feldmann, Olaf Maennel, Matthew Roughan, and Seteve Uhlig. Building an AS-topology model that captures route diversity, Proc. of the ACM SIGCOMM conference, Pisa, Italy, September 2006.

2 — BGP routing policies in ISP networks.

Student/Bearbeiter: Yan Ma; Supervisor/Betreuer: Harald Schiöberg;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

The Internet has quickly evolved into a vast global network owned and operated by thousands of different administrative entities. During this time, it became apparent that vanilla shortest-path routing would be insufficient to handle the myriad operational, economic, and political factors involved in routing. ISPs began to modify routing configurations to support routing policies, i.e., goals held by the router's owner that controlled which routes were chosen and which routes were propagated to neighbors. BGP, originally a simple path-vector protocol, was incrementally modified over time with a number of mechanisms to support policies, adding substantially to the complexity. Much of the mystery in BGP comes not only from the protocol complexity but also from a lack of understanding of the underlying policies and the problems ISPs face which they address. In this paper we shed light on goals operators have and their resulting routing policies, why BGP evolved the way it did, and how common policies are implemented using BGP. We also discuss recent and current work in the field that aims to address problems that arise in applying and supporting routing policies.

• Matt Caesar and Jennifer Rexford. BGP routing policies in ISP networks, IEEE Network Magazine, special issue on interdomain routing, November/December 2005. Earlier version appears as UC Berkeley Technical Report UCB/CSD-05-1377, March 2005.

3 — Interdomain traffic engineering with BGP.

Student/Bearbeiter: Christian Ludwig; Supervisor/Betreuer: Dr. Steve Uhlig;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

A survey on interdomain traffic engineering, explains why controling outbound traffic relatively straightforward (in principle) while inbound very difficult.

• B. Quoitin, S. Uhlig, C. Pelsser, L. Swinnen and O. Bonaventure. Interdomain traffic engineering with BGP. IEEE Network Magazine, special issue on interdomain routing, November/December 2005. Earlier version appears as UC Berkeley Technical Report UCB/CSD-05-1377, March 2005.

5 — BubbleStorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search.

Student/Bearbeiter: Kevin REDON; Supervisor/Betreuer: Oliver Hohlfeld
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

Peer-to-peer systems promise inexpensive scalability, adaptability, and robustness. Thus, they are an attractive platform for file sharing, distributed wikis, and search engines. These applications often store weakly structured data, requiring sophisticated search algorithms. To simplify the search problem, most scalable algorithms introduce structure to the network. However, churn or violent disruption may break this structure, compromising search guarantees. This paper proposes a simple probabilistic search system, BubbleStorm, built on random multigraphs. Our primary contribution is a flexible and reliable strategy for performing exhaustive search. BubbleStorm also exploits the heterogeneous bandwidth of peers. However, we sacrifice some of this bandwidth for high parallelism and low latency. The provided search guarantees are tunable, with success probability adjustable well into the realm of reliable systems. For validation, we simulate a network with one million low-end peers and show BubbleStorm handles up to 90% simultaneous peer departure and 50% simultaneous crash.

• Wesley W. Terpstra, Jussi Kangasharju, Christof Leng, Alejandro P. Buchmann. BubbleStorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search. Proceedings of the 2007 ACM SIGCOMM Conference, ISBN 978-1-59593-713-1, ACM Press, New York, NY, USA, August 2007

6 — HLP: A Next-generation Interdomain Routing Protocol.

Student/Bearbeiter: Roman Golovatenko; Supervisor/Betreuer: Wolfgang Mühlbauer;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

It is well-known that BGP, the current inter-domain routing protocol, has many deficiencies. This paper describes a hybrid link-state and path-vector protocol called HLP as an alternative to BGP that has vastly better scalability, isolation and convergence properties. Using current BGP routing information, we show that HLP, in comparison to BGP, can reduce the churn-rate of route updates by a factor 400 as well as isolate the effect of routing events to a region 100 times smaller than that of BGP. For a majority of Internet routes, HLP guarantees worst-case linear-time convergence. We also describe a prototype implementation of HLP on top of the XORP router platform. HLP is not intended to be a finished and final proposal for a replacement for BGP, but is instead offered as a starting point for debates about the nature of the next-generation inter-domain routing protocol.

• Lakshminarayanan Subramanian, Matthew Caesar, Cheng Tien Ee, Mark Handley, Morley Mao, Scott Shenker, Ion Stoica. HLP: A Next-generation Interdomain Routing Protocol. Sigcomm 2005

7 — Ant colonies for Adaptive Routing in Packet-switched Communications Networks.

Student/Bearbeiter: Harald Kühl; Supervisor/Betreuer: Thomas Hühn;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

It is well-known that BGP, the current inter-domain routing protocol, has many deficiencies. This paper describes a hybrid link-state and path-vector protocol called HLP as an alternative to BGP that has vastly better scalability, isolation and convergence properties. Using current BGP routing information, we show that HLP, in comparison to BGP, can reduce the churn-rate of route updates by a factor 400 as well as isolate the effect of routing events to a region 100 times smaller than that of BGP. For a majority of Internet routes, HLP guarantees worst-case linear-time convergence. We also describe a prototype implementation of HLP on top of the XORP router platform. HLP is not intended to be a finished and final proposal for a replacement for BGP, but is instead offered as a starting point for debates about the nature of the next-generation inter-domain routing protocol.

• Gianni Di Caro, Marco Dorigo. Ant colonies for Adaptive Routing in Packet-switched Communications Networks. Lecture Notes in Computer Science 1998

11 — APT: A Practical Tunneling Architecture for Routing Scalability.

Student/Bearbeiter: Haoran Bai; Supervisor/Betreuer: Wolfgang Mühlbauer;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

The routing table has seen a rapid increase in size and dynamics in recent years, mostly driven by the growth of edge networks. This growth reflects two major limitations in the current architecture: (a) the conflict between provider-based addressing and edge networks' need for multihoming, and (b) flat routing's inability to provide isolation from edge dynamics. To address these limitations, we propose A Practical Tunneling Architecture (APT), a new routing architecture that enables the Internet routing system to scale independently from edge growth. APT partitions the Internet address space in two, one for the transit core and one for edge networks, allowing edge addresses to be removed from the routing table in the transit core. In order to tunnel packets between edge networks, APT provides an efficient mapping service between edge addresses and the addresses of their transit-core attachment points. We conducted an extensive performance evaluation of APT using trace data collected from routers at two major service providers. Our results show that APT can tunnel packets through the transit core by imposing a minimal delay on no more than 0.8% of all packets at the cost of introducing only one or a few new or repurposed devices per AS.

• Dan Jen, Michael Meisel, Dan Massey, Lan Wang, Beichuan Zhang, and Lixia Zhang. APT: A Practical Tunneling Architecture for Routing Scalability. UCLA Computer Science Dept. Technical Report #080004

12 — Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks. 

Student/Bearbeiter: Bernd May; Supervisor/Betreuer: Dr. Cigdem Sengul;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents a large number of types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.

• Yih-Chun Hu, Adrian Perrig, and David B. Johnson. Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks. in Wireless Networks (WINET), ACM and Springer, 11(1-2):21-38, January 2005. Invited paper.

13 — Incentive-Compatible Opportunistic Routing for Wireless Networks.

Student/Bearbeiter: Kaikai Yang; Supervisor/Betreuer: Harald Schiöberg;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

User-contributed wireless mesh networks are a disruptive technology that may fundamentally change the economics of edge network access and bring the benefits of a computer network infrastructure to local communities at low cost, anywhere in the world. To achieve high throughput despite highly unpredictable and lossy wireless channels, it is essential that such networks take advantage of transmission opportunities wherever they emerge. However, as opportunistic routing departs from the traditional but less effective deterministic, shortest-path based routing, user nodes in such networks may have less incentive to follow protocols and contribute. In this paper, we present the first routing protocols in which it is incentive-compatible for each user node to honestly participate in the routing despite opportunistic transmissions. We not only rigorously prove the properties of our protocols but also thoroughly evaluate a complete implementation of our protocols. Experiments show that there is a 5.8%–58.0% gain in throughput when compared with an opportunistic routing protocol that does not provide incentives and users can act selfishly.

• Fan Wu, Tingting Chen, and Sheng Zhong (SUNY at Buffalo, USA); Li (Erran) Li (Bell Labs, Lucent Technologies, USA); and Y. Richard Yang (Yale University, US). Incentive-Compatible Opportunistic Routing for Wireless Networks.

18 — An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. 

Student/Bearbeiter: Hendika Sugiharto; Supervisor/Betreuer: Doris Schiöberg;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

Skype is a peer-to-peer VoIP client developed by KaZaa in 2003. Skype claims that it can work almost seamlessly across NATs and firewalls and has better voice quality than the MSN and Yahoo IM applications. It encrypts calls end-to-end, and stores user information in a decentralized fashion. Skype also supports instant messaging and conferencing.

This report analyzes key Skype functions such as login, NAT and firewall traversal, call establishment, media transfer, codecs, and conferencing under three different network setups. Analysis is performed by careful study of Skype network traffic.

• Salman A. Baset and Henning Schulzrinne.An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. 2004

19 — A Measurement-based Study of the Skype Peer-to-Peer VoIP Performance.

Student/Bearbeiter: Jinliang Xue; Supervisor/Betreuer: Doris Schiöberg;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

It has been increasingly popular to build voiceoverIP (VoIP) applications based on peertopeer (P2P) networks in the Internet. However, many such VoIP applications freeride the network bandwidth of Internet Service Providers (ISPs). Thus their success may come at a cost to ISPs, especially those on the edge of the Internet. In this paper, we study the VoIP quality of Skype, a popular P2Pbased VoIP application. Specifically, using largescale endtoend measurements, we first conduct a systematic analysis of Skype supernode network. We then investigate the impacts of the access capacity constraint and the AS policy constraint on the VoIP quality of Skype. We show that even when freeriding is no longer possible for only 20% of supernodes that are located in stub ISPs, the overall VoIP quality of Skype degrades significantly, and a large percentage of VoIP sessions will have unacceptable quality. This result clearly demonstrates the potential danger of building VoIP applications based on P2P networks without taking into account operational models of the Internet. We also study using time diversity in traffic patterns to reduce the impacts of the preceding constraints.

• Haiyong Xie, Yang Richard Yang (Yale University). A Measurement-based Study of the Skype Peer-to-Peer VoIP Performance. IPTPS 2007

20 — A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time.

Student/Bearbeiter: Christian Horn; Supervisor/Betreuer: Dr. Steve Uhlig;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

As more and more Internet IP prefix hijacking incidents are being reported, the value of hijacking detection services has become evident. Most of the current hijacking detection approaches monitor IP prefixes on the control plane and detect inconsistencies in route advertisements and route qualities. We propose a different approach that utilizes information collected mostly from the data plane. Our method is motivated by two key observations: when a prefix is not hijacked, 1) the hop count of the path from a source to this prefix is generally stable; and 2) the path from a source to this prefix is almost always a super-path of the path from the same source to a reference point along the previous path, as long as the reference point is topologically close to the prefix. By carefully selecting multiple vantage points and monitoring from these vantage points for any departure from these two observations, our method is able to detect prefix hijacking with high accuracy in a light-weight, distributed, and real-time fashion. Through simulations constructed based on real Internet measurement traces, we demonstrate that our scheme is accurate with both false positive and false negative ratios below 0.5%.

• Changxi Zheng, Lusheng Ji, Dan Pei, Jia Wang, and Paul Francis. A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time. 2007

24 — OpenFlow: Enabling Innovation in Campus Networks. 

Student/Bearbeiter: Julius Werner; Supervisor/Betreuer: Dr. Ioannis Avramopoulos;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use ev- ery day. OpenFlow is based on an Ethernet switch, with an internal flow-table, and a standardized interface to add and remove flow entries. Our goal is to encourage network- ing vendors to add OpenFlow to their switch products for deployment in college campus backbones and wiring closets. We believe that OpenFlow is a pragmatic compromise: on one hand, it allows researchers to run experiments on hetero- geneous switches in a uniform way at line-rate and with high port-density; while on the other hand, vendors do not need to expose the internal workings of their switches. In addition to allowing researchers to evaluate their ideas in real-world traffic settings, OpenFlow could serve as a useful campus component in proposed large-scale testbeds like GENI. Two buildings at Stanford University will soon run OpenFlow networks, using commercial Ethernet switches and routers. We will work to encourage deployment at other schools; and We encourage you to consider deploying OpenFlow in your university network too.

• Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, Jonathan Turner. OpenFlow: Enabling Innovation in Campus Networks. 2008

25 — OpenDHT: A Public DHT Service and Its Uses. 

Student/Bearbeiter: Mohannad Alnablsi; Supervisor/Betreuer: Doris Schiöberg;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

Large-scale distributed systems are hard to deploy, and distributed hash tables (DHTs) are no exception. To lower the barriers facing DHT-based applications, we have created a public DHT service called OpenDHT. Designing a DHT that can be widely shared, both among mutually untrusting clients and among a variety of applications, poses two distinct challenges. First, there must be adequate control over storage allocation so that greedy or malicious clients do not use more than their fair share. Second, the interface to the DHT should make it easy to write simple clients, yet be sufficiently general to meet a broad spectrum of application requirements. In this paper we describe our solutions to these design challenges. We also report our early deployment experience with OpenDHT and describe the variety of applications already using the system.

• Sean Rhea, Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, Scott Shenker, Ion Stoica, and Harlan Yu. OpenDHT: A Public DHT Service and Its Uses.

26 — Donnybrook: Enabling Large-Scale, High-Speed, Peer-to-Peer Games

Student/Bearbeiter: Hannes Gorges; Supervisor/Betreuer: Oliver Hohlfeld;
(Hide abstract & reference / Zusammenfassung und Referenz ausblenden)

Without well-provisioned dedicated servers, modern fast-paced action games limit the number of players who can interact simultaneously to 16-32. This is because interacting players must frequently exchange state updates, and high player counts would exceed the bandwidth available to participating machines. In this paper, we describe Donnybrook, a system that enables epicscale battles without dedicated server resources, even in a fastpaced game with tight latency bounds. It achieves this scalability through two novel components. First, it reduces bandwidth demand by estimating what players are paying attention to, thereby enabling it to reduce the frequency of sending less important state updates. Second, it overcomes resource and interest heterogeneity by disseminating updates via a multicast system designed for the special requirements of games: that they have multiple sources, are latency-sensitive, and have frequent group membership changes. We present user study results using a prototype implementation based on Quake III that show our approach provides a desirable user experience. We also present simulation results that demonstrate Donnybrook's efficacy in enabling battles of up to 900 players.

• Ashwin Bharambe, John R. Douceur, Jacob R. Lorch, Thomas Moscibroda, Jeffrey Pang, Srinivasan Seshan, and Xinyu Zhuang. Donnybrook: Enabling Large-Scale, High-Speed, Peer-to-Peer Games.

 top

Agenda / Ablauf

All talks take place in room Auditorium 1, TEL building, 20th floor.

Time	Title & Handouts	Student
Monday, 27 July 2009
12:00–12:45	Interdomain traffic engineering with BGP	Christian Ludwig
12:45–13:30	Building an AS topology model that captures router diversity	Martin Möller
break
13:45–14:30	A Light-Weight Distributed Scheme for Detecting IP Hijacking	Christian Horn
14:30–15:15	HLP: A Next-generation Interdomain Routing Protocol	Roman Golovatenko
Wednesday, 29 July 2009
13:00–13:45	OpenDHT: A Public DHT Service and Its Uses	Mohannad Alnablsi
13:45–14:30	BubbleStorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search	Kévin Redon
break
14:45–15:30	OpenFlow: Enabling Innovation in Campus Networks	Julius Werner
15:30–16:15	Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks	Bernd May

 top

Literature / Literatur

[Hui95en]

Huitema, Christian. Routing in the Internet. Prentice Hall, Englewood Cliffs, NJ, USA, 1995. (english)

[KR07en]

James F. Kurose and Keith W. Ross. Computer Networking: A Top-Down Approach. Addison-Wesley, fourth edition, 2007. (englisch), online version (preliminary version of 1st edition, password will be given during the course)
Ressources: 2nd edition, 3rd edition

[KR02de]

James F. Kurose und Keith W. Ross. Computernetze: Ein Top-Down-Ansatz mit Schwerpunkt Internet. Pearson Studium (Prentice Hall), München, Deutschland, 2002. (deutsch)

[Tan00de]

Andrew S. Tanenbaum. Computernetzwerke. Pearson Studium (Prentice Hall), München, Deutschland, dritte revidierte Auflage, 2000. (deutsch)

[Tan03en]

Andrew S. Tanenbaum. Computer Networks. Prentice Hall Professional Technical Reference, Upper Saddle River, NJ, USA, fourth edition, 2003. (english)