Book•
The Internet and Its Protocols: A Comparative Approach
01 Jan 2004-
TL;DR: The Internet and its Protocols as discussed by the authors is a comprehensive, in-depth, and comparative coverage of the Internet Protocol (both IPv4 and IPv6) and its many related technologies.
Abstract: The view presented in The Internet and Its Protocols is at once broad and deep. It covers all the common protocols and how they combine to create the Internet in its totality. More importantly, it describes each one completely, examining the requirements it addresses and the exact means by which it does its job. These descriptions include message flows, full message formats, and message exchanges for normal and error operation. They are supported by numerous diagrams and tables.
This book's comparative approach gives you something more valuable: insight into the decisions you face as you build and maintain your network, network device, or network application. Author Adrian Farrel?s experience and advice will dramatically smooth your path as you work to offer improved performance and a wider range of services.
* Provides comprehensive, in-depth, and comparative coverage of the Internet Protocol (both IPv4 and IPv6) and its many related technologies.
* Written for developers, operators, and managers, and designed to be used as both an overview and a reference.
* Discusses major concepts in traffic engineering, providing detailed looks at MPLS and GMPLS and how they control both IP and non-IP traffic.
* Covers protocols for governing routing and transport, and for managing switches, components, and the network as a whole, along with higher-level application protocols.
* Offers thoughtful guidance on choosing between protocols, selecting features within a protocol, and other service- and performance-related decisions.
Table of Contents
Ch 1 Overview of Essentials ? Ch 2 The Internet Protocol ? Ch 3 Multicast ? Ch 4 Routing ? Ch 5 Concepts in IP Security ? Ch 6 IP Service Management ? Ch 7 Transport Over IP ? Ch 8 Traffic Engineering ? Ch 9 MPLS (Multiprotocol Label Switching) ? Ch 10 Generalized MPLS ? Ch 11 Managing Switches and Components ? Ch 12 Network Management ? Ch 13 Application Protocols ? Ch 14 Advanced Applications ? Ch 15 Future Developments
Citations
More filters
[...]
TL;DR: This review presents the emergent field of temporal networks, and discusses methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems.
Abstract: A great variety of systems in nature, society and technology -- from the web of sexual contacts to the Internet, from the nervous system to power grids -- can be modeled as graphs of vertices coupled by edges The network structure, describing how the graph is wired, helps us understand, predict and optimize the behavior of dynamical systems In many cases, however, the edges are not continuously active As an example, in networks of communication via email, text messages, or phone calls, edges represent sequences of instantaneous or practically instantaneous contacts In some cases, edges are active for non-negligible periods of time: eg, the proximity patterns of inpatients at hospitals can be represented by a graph where an edge between two individuals is on throughout the time they are at the same ward Like network topology, the temporal structure of edge activations can affect dynamics of systems interacting through the network, from disease contagion on the network of patients to information diffusion over an e-mail network In this review, we present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems In the light of traditional network theory, one can see this framework as moving the information of when things happen from the dynamical system on the network, to the network itself Since fundamental properties, such as the transitivity of edges, do not necessarily hold in temporal networks, many of these methods need to be quite different from those for static networks
2,452 citations
61 citations
Book•
31 Oct 2006
TL;DR: This book describes, analyzes, and recommends traffic engineering and quality of service optimization methods for integrated voice/data dynamic routing networks and illustrates the tradeoffs between the various methods discussed.
Abstract: This book describes, analyzes, and recommends traffic engineering (TE) and quality of service (QoS) optimization methods for integrated voice/data dynamic routing networks. These functions control a network's response to traffic demands and other stimuli, such as link failures or node failures. TE and QoS optimization is concerned with measurement, modeling, characterization, and control of network traffic, and the application of techniques to achieve specific performance objectives. The scope of the analysis and recommendations include dimensioning, call/flow and connection routing, QoS resource management, routing table management, dynamic transport routing, and operational requirements. Case studies are included which provide the reader with a concrete way into the technical details and highlight why and how to use the techniques described in the book.
* Includes Case Studies of MPLS & GMPLS Network Optimization
* Presents state-of-the-art traffic engineering and quality of service optimization methods and illustrates the tradeoffs between the various methods discussed
* Contains practical Case Studies based on large-scale service provider implementations and architecture plans
* Written by a highly respected and well known active expert in traffic engineering and quality of service
42 citations
TL;DR: The motivation that underlines the significance of various techniques addressing routing topology discovery among a group of hosts and their state-of-the-art position, merits and challenges are discussed.
Abstract: Although there are surveys summarizing the efforts toward discovering the Internet routing topology, no work has addressed how to infer the routing topology among a particular group of hosts scattered across the Internet. These two issues differ in scale, objective and solutions currently available. How to infer the routing topology among a group of hosts is non-trivial due to the complexity, size and decentralized nature of the Internet. Nevertheless, a cost-effective means of inferring topology would be of considerable benefit to many mechanisms, such as network monitoring, overlay topology construction and failure diagnosis. Since external information, such as routing table entries, is not publicly available to hosts, most of the methodologies employ an active probing mechanism to address this issue. For this reason our focus is on active probing based solutions, too. A comparison between generic Internet topology discovery and that between a specific group of hosts is elaborated in order to distinguish these two problems. Furthermore, we discuss the motivation that underlines the significance of various techniques addressing routing topology discovery among a group of hosts. We then classify the strategies into two types: Router-Assisted (RA) and Non-Router-Assisted (NRA), and analyze in detail their state-of-the-art position, merits and challenges, respectively. Conclusions and future directions are also presented.
30 citations
References
More filters
01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.
7,384 citations
01 Jan 1985
TL;DR: This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Abstract: From the reviews: "This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry...The book is well organized and lucidly written; a timely contribution by two founders of the field. It clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics. It also points the way to the solution of the more challenging problems in dimensions higher than two."
6,525 citations
25 Oct 1998
TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Abstract: An ad hoc networkis a collwtion of wirelessmobilenodes dynamically forminga temporarynetworkwithouttheuseof anyexistingnetworkirrfrastructureor centralizedadministration.Dueto the limitedtransmissionrange of ~vlrelessnenvorkinterfaces,multiplenetwork“hops”maybe neededfor onenodeto exchangedata ivithanotheracrox thenetwork.Inrecentyears, a ttiery of nelvroutingprotocols~geted specificallyat this environment havebeen developed.but little pcrfomrartwinformationon mch protocol and no ralistic performancecomparisonbehvwrrthem ISavailable. ~Is paper presentsthe results of a derailedpacket-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocolsthatcovera range of designchoices: DSDV,TORA, DSR and AODV. \Vehave extended the /~r-2networksimulatorto accuratelymodelthe MACandphysical-layer behaviorof the IEEE 802.1I wirelessLANstandard,includinga realistic wtrelesstransmissionchannelmodel, and present the resultsof simulations of net(vorksof 50 mobilenodes.
5,147 citations
18 Nov 2002
TL;DR: A key-management scheme designed to satisfy both operational and security requirements of DSNs is presented, which relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes.
Abstract: Distributed Sensor Networks (DSNs) are ad-hoc mobile networks that include sensor nodes with limited computation and communication capabilities. DSNs are dynamic in the sense that they allow addition and deletion of sensor nodes after deployment to grow the network or replace failing and unreliable nodes. DSNs may be deployed in hostile areas where communication is monitored and nodes are subject to capture and surreptitious use by an adversary. Hence DSNs require cryptographic protection of communications, sensor-capture detection, key revocation and sensor disabling. In this paper, we present a key-management scheme designed to satisfy both operational and security requirements of DSNs. The scheme includes selective distribution and revocation of keys to sensor nodes as well as node re-keying without substantial computation and communication capabilities. It relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes. The security and network connectivity characteristics supported by the key-management scheme are discussed and simulation experiments presented.
3,900 citations
TL;DR: The bulk-synchronous parallel (BSP) model is introduced as a candidate for this role, and results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware.
Abstract: The success of the von Neumann model of sequential computation is attributable to the fact that it is an efficient bridge between software and hardware: high-level languages can be efficiently compiled on to this model; yet it can be effeciently implemented in hardware. The author argues that an analogous bridge between software and hardware in required for parallel computation if that is to become as widely used. This article introduces the bulk-synchronous parallel (BSP) model as a candidate for this role, and gives results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware.
3,885 citations