Great Deals on Used Textbooks & New Textbooks!               
My Account | Help Desk | Market Place Shopping Cart
Free shipping. Click here for details.
No items in cart.
Total: $0.00
Textbooks Sell Textbooks Books Supplies Medical Books College Apparel Movies Clearance
Search  Advanced >>
Related Topics: Technology
Cover Art for Broadband Packet Switching Technologies: A Practical Guide to Atm Switches and Ip Routers
Other versions by this Author
Details>>

Broadband Packet Switching Technologies: A Practical Guide to Atm Switches and Ip Routers


Author(s): H. Jonathan Chao (Polytechnic University, Brooklyn, New York, USA); Cheuk H. Lam (Lucent Technologies, Inc., Landover, Maryland, USA); Eiji Oki (NTT Network Service Systems Laboratories, Tokyo, Japan)
ISBN10:  0471004545
ISBN13:  9780471004547
Format:  Hardcover
Pub. Date:  10/1/2001
Publisher(s): Wiley-Interscience

Buy in Bulk
Send to a friend
New Price  $122.80
List Price $125.95
eVIP Price  $116.66
New Copy:  Usually Ships in 2-3 Business Days
add remove
Marketplace Price $42.88
List Price $125.95 Available in the eCampus Marketplace
Take 90 Days to Pay on $250 or more
with Quick, Easy, Secure
Subject to credit approval.
SummaryTable of ContentsExcerptsAuthor Biography
Complete and comprehensive coverage of packet switching concepts and technologies

The rapid growth of Internet traffic has spurred a new concentration on IP routers and ATM, MPLS, and optical switches. This book addresses the basics, theory, architectures, and technologies for implementing ATM switches and IP routers. It focuses on the architecture for the next generation of broadband switches and routers and provides detailed treatment of both theoretical and practical topics for professionals and students alike.

Broadband Packet Switching Technologies is written with engineers and industry researchers in mind. It describes the basic concepts and fundamentals of ATM switches and IP routers, then divides the switches into different categories. In each category, the authors discuss the operations, problems, strengths, and weaknesses of the switches in performance and implementation. Detailed solutions and algorithms are also provided. The authors also extend fundamental packet-switching concepts to wireless and fiber-optic networks.

Broadband Packet Switching Technologies fills the need for a textbook and reference dedicated to high-speed networking technologies that serves the specific needs of professionals in the telecommunications industry and provides expert material for students in related fields.


The effective design of high-speed, reliable switching systems is essential for moving the huge volumes of traffic and multimedia over modern communications networks. This book explains all the main packet-switching architectures, including all theoretical and practical topics relevant to the design and management of high-speed networks. Delivering the most systematic coverage available of the subject, the authors interweave fundamental concepts with real-world applications and include engineering case studies from wireless and fiber-optic communications.
Market: Hardware and Software Engineers in the telecommunication industry, System Engineers, and Technicians.
Preface xiii
Introduction
1(14)
ATM Switch Systems
3(5)
Basics of ATM networks
3(2)
ATM switch structure
5(3)
IP Router Systems
8(5)
Functions of IP routers
8(1)
Architectures of IP routers
9(4)
Design Criteria and Performance Requirements
13(2)
References
14(1)
Basics of Packet Switching
15(34)
Switching Concepts
17(4)
Internal link blocking
17(1)
Output port contention
18(1)
Head-of-line blocking
19(1)
Multicasting
19(1)
Call splitting
20(1)
Switch Architecture Classification
21(16)
Time division switching
22(2)
Space division switching
24(10)
Buffering strategies
34(3)
Performance of Basic Switches
37(12)
Input-buffered switches
37(3)
Output-buffered switches
40(4)
Completely shared-buffer switches
44(2)
References
46(3)
Input-Buffered Switches
49(34)
A Simple Switch Model
50(3)
Head-of-line blocking phenomenon
51(1)
Traffic models and related throughput results
52(1)
Methods for Improving Performance
53(4)
Increasing internal capacity
53(1)
Increasing scheduling efficiency
54(3)
Scheduling Algorithms
57(15)
Parallel iterative matching (PIM)
58(2)
Iterative round-robin matching (iRRM)
60(1)
Iterative round-robin with SLIP (iSLIP)
60(2)
Dual round-robin matching (DRRM)
62(3)
Round-robin greedy scheduling
65(2)
Design of round-robin arbiters/selectors
67(5)
Output-Queuing Emulation
72(6)
Most-Urgent-Cell-First-Algorithm (MUCFA)
72(1)
Chuang et al.'s results
73(5)
Lowest-Output-Occupancy-Cell-First Algorithm (LOOFA)
78(5)
References
80(3)
Shared-Memory Switches
83(20)
Linked-List Approach
84(7)
Content-Addressable Memory Approach
91(2)
Space-Time-Space Approach
93(1)
Multistage Shared-Memory Switches
94(3)
Washington University gigabit switch
95(1)
Concentrator-based growable switch architecture
96(1)
Multicast Shared-Memory Switches
97(6)
Shared-memory switch with a multicast logical queue
97(1)
Shared-memory switch with cell copy
98(1)
Shared-memory switch with address copy
99(2)
References
101(2)
Banyan-Based Switches
103(38)
Banyan Networks
103(3)
Batcher-Sorting Network
106(4)
Output Contention Resolution Algorithms
110(2)
Three-phase implementation
110(1)
Ring reservation
110(2)
The Sunshine Switch
112(2)
Deflection Routing
114(11)
Tandem banyan switch
114(3)
Shuffle-exchange network with deflection routing
117(1)
Dual shuffle-exchange network with error-correcting routing
118(7)
Multicast Copy Networks
125(16)
Broadcast banyan network
127(2)
Encoding process
129(3)
Concentration
132(1)
Decoding process
133(1)
Overflow and call splitting
133(1)
Overflow and input fairness
134(4)
References
138(3)
Knockout-Based Switches
141(48)
Single-Stage Knockout Switch
142(8)
Basic architecture
142(2)
Knockout concentration principle
144(2)
Construction of the concentrator
146(4)
Channel Grouping Principle
150(4)
Maximum throughput
150(2)
Generalized knockout principle
152(2)
A Two-Stage Multicast Output-Buffered ATM Switch
154(15)
Two-stage configuration
154(3)
Multicast grouping network
157(3)
Translation tables
160(3)
Multicast knockout principle
163(6)
A Fault-Tolerant Multicast Output-Buffered ATM Switch
169(16)
Fault model of switch element
169(3)
Fault detection
172(2)
Fault location and reconfiguration
174(7)
Performance analysis of reconfigured switch module
181(4)
Appendix
185(4)
References
187(2)
The Abacus Switch
189(38)
Basic Architecture
190(3)
Multicast Contention Resolution Algorithm
193(4)
Implementation of Input Port Controller
197(1)
Performance
198(10)
Maximum throughput
199(4)
Average delay
203(3)
Cell loss probability
206(2)
ATM Routing and Concentration Chip
208(3)
Enhanced Abacus Switch
211(9)
Memoryless multistage concentration network
212(2)
Buffered multistage concentration network
214(3)
Resequencing cells
217(2)
Complexity comparison
219(1)
Abacus Switch for Packet Switching
220(7)
Packet interleaving
220(2)
Cell interleaving
222(2)
References
224(3)
Crosspoint-Buffered Switches
227(12)
Overview of Crosspoint-Buffered Switches
228(1)
Scalable Distributed Arbitration Switch
229(5)
SDA structure
229(2)
Performance of SDA switch
231(3)
Multiple-Qos SDA Switch
234(5)
MSDA structure
234(2)
Performance of MSDA switch
236(2)
References
238(1)
The Tandem-Crosspoint Switch
239(14)
Overview of Input-Output-Buffered Switches
239(2)
TDXP Structure
241(5)
Basic architecture
241(1)
Unicasting operation
242(4)
Multicasting operation
246(1)
Performance of TDXP Switch
246(7)
References
252(1)
Clos-Network Switches
253(26)
Routing Properties and Scheduling Methods
255(3)
A Suboptimal Straight Matching Method for Dynamic Routing
258(1)
The ATLANTA Switch
259(4)
Basic architecture
261(1)
Distributed and random arbitration
261(1)
Multicasting
262(1)
The Continuous Round-Robin Dispatching Switch
263(5)
Basic architecture
264(1)
Concurrent round-robin dispatching (CRRD) scheme
265(2)
Desynchronization effect of CRRD
267(1)
The Path Switch
268(11)
Homogeneous capacity and route assignment
272(2)
Heterogeneous capacity assignment
274(3)
References
277(2)
Optical Packet Switches
279(58)
All-Optical Packet Switches
281(3)
The staggering switch
281(1)
ATMOS
282(1)
Duan's switch
283(1)
Optoelectronic Packet Switches
284(7)
HYPASS
284(2)
STAR-TRACK
286(1)
Cisneros and Brackett's Architecture
287(2)
BNR switch
289(1)
Wave-mux switch
290(1)
The 3M Switch
291(10)
Basic architecture
291(3)
Cell delineation unit
294(2)
VCI-overwrite unit
296(1)
Cell synchronization unit
297(4)
Optical Interconnection Network for Terabit IP Routers
301(36)
Introduction
301(2)
A terabit IP router architecture
303(3)
Router module and route controller
306(3)
Optical interconnection network
309(6)
Ping-pong arbitration unit
315(9)
OIN complexity
324(2)
Power budget analysis
326(2)
Crosstalk analysis
328(3)
References
331(6)
Wireless ATM Switches
337(28)
Wireless ATM Structure Overviews
338(3)
System considerations
338(11)
Wireless ATM protocol
349
Wireless ATM Systems
341(3)
NEC's WATMnet prototype system
341(1)
Olivetti's radio ATM LAN
342(1)
Virtual connection tree
342(1)
BAHAMA wireless ATM LAN
343(1)
NTT's wireless ATM Access
343
Other European projects
243(101)
Radio Access Layers
344(3)
Radio physical layer
344(2)
Medium access control layer
346(1)
Data link control layer
346(1)
Handoff in Wireless ATM
347(5)
Connection rerouting
348
Buffering
340(11)
Cell routing in a COS
351(1)
Mobility-Support ATM Switch
352(13)
Design of a mobility-support switch
353(5)
Performance
358(4)
References
362(3)
IP Route Lookups
365(74)
IP Router Design
366(3)
Architectures of generic routers
366(2)
IP route lookup design
368(1)
IP Route Lookup Based on Caching Technique
369(1)
IP Route Lookup Based on Standard Trie Structure
369(3)
Patricia Tree
372(1)
Small Forwarding Tables for Fast Route Lookups
373(4)
Level 1 of data structure
374(2)
Levels 2 and 3 of data structure
376(1)
Performance
377(1)
Route Lookups in Hardware at Memory Access Speeds
377(4)
The DIR-24-8-BASIC scheme
378(3)
Performance
381(1)
IP Lookups Using Multiway Search
381(7)
Adapting binary search for best matching prefix
381(3)
Precomputed 16-bit prefix table
384(1)
Multiway binary search: exploiting the cache line
385(3)
Performance
388(1)
IP Route Lookups for Gigabit Switch Routers
388(8)
Lookup algorithms and data structure construction
388(7)
Performance
395(1)
IP Route Lookups Using Two-Trie Structure
396(13)
IP route lookup algorithm
397(1)
Prefix update algorithms
398(5)
Performance
403(1)
References
404(5)
APPENDIX SONET AND ATM PROTOCOLS
A.1 ATM Protocol Reference Model
409(1)
A.2 Synchronous Optical Network (SONET)
410(13)
A.2.1 SONET sublayers
410(2)
A.2.2 STS-N signals
412(2)
A.2.3 SONET overhead bytes
414(3)
A.2.4 Scrambling and descrambling
417(1)
A.2.5 Frequency justification
418(1)
A.2.6 Automatic protection switching (APS)
419(2)
A.2.7 STS-3 versus STS-3c
421(1)
A.2.8 OC-N multiplexer
422(1)
A.3 Sub-Layer Functions in Reference Model
423(2)
A.4 Asynchronous Transfer Mode (ATM)
425(4)
A.4.1 Virtual path/virtual channel identifier (VPI/VCI)
426(1)
A.4.2 Payload type identifier (PTI)
427(1)
A.4.3 Cell loss priority (CLP)
428(1)
A.4.4 Pre-defined header field values
428(1)
A.5 ATM Adaptation Layer (AAL)
429(10)
A.5.1 AAL type 1 (AAL1)
431(2)
A.5.2 AAL type 2 (AAL2)
433(1)
A.5.3 AAL types 3/4 (AAL3/4)
434(2)
A.5.4 AAL type 5 (AAL5)
436(2)
References
438(1)
Index 439

Broadband Packet Switching Technologies

A Practical Guide to ATM Switches and IP Routers
By H. Jonathan Chao Cheuk H. Lam Eiji Oki

John Wiley & Sons

Copyright © 2001 H. Jonathan Chao
All right reserved.

ISBN: 978-0-471-00454-7


Chapter One

INTRODUCTION

The scalable and distributed nature of the Internet continuously contributes to a wild and rapid growth of its population, including the number of users, hosts, links, and emerging applications. The great success of the Internet thus leads to exponential increases in traffic volumes, stimulating an unprecedented demand for the capacity of the core network.

Network providers therefore face the need of providing a new network infrastructure that can support the growth of traffic in the core network. Advances in fiber throughput and optical transmission technologies have enabled operators to deploy capacity in a dramatic fashion. However, the advancement in packet switch/router technologies is rather slow, so that it is still not able to keep pace with the increase in link transmission speed.

Dense-wavelength-division-multiplexing (DWDM) equipment is installed on each end of the optical fiber to multiplex wavelengths i.e., channels over a single fiber. For example, a 128-channel OC-192 (10 Gbit/s) DWDM system can multiplex the signals to achieve a total capacity of 1.2 Tbit/s. Several vendors are expected to enter trials for wide area DWDM networks that support OC-768 (40 Gbit/s) for each channel in the near future.

Another advanced optical technology that is being deployed in the optical network is the optical cross connect (OXC) system. Since the optical-to-electrical-to-optical conversions do not occur within the system, transmission interfaces are transparent. The OXC System is based on the microelectro-mechanical systems (MEMS) technology, where an array of hundreds or thousands of electrically configurable microscopic mirrors is fabricated on a single substrate to direct light. The switching scheme is based on freely moving mirrors being rotated around micromachined hinges with submillisecond switching speed. It is rate- and format-independent.

As carriers deploy fiber and DWDM equipment to expand capacity, terabit packet switching technologies are required to aggregate high-bit-rate links while achieving higher utilization on the links. Although OXC systems have high-speed interfaces (e.g., 10 or 40 Gbit/s) and large switching capacity (e.g., 10-40 Tbit/s), the granularity of the switching is coarse, e.g., 10 or 40 Gbit/s. As a result, it is required to have high-speed and large-capacity packet switches/routers to aggregate lower-bit-rate traffic to 10 or 40 Gbit/s links. The aggregated traffic can be delivered to destinations through DWDM transmission equipment or OXC systems. The terabit packet switches that are critical elements of the Internet network infrastructure must have switch fabric capable of supporting terabit speeds to eliminate the network bottlenecks. Core terabit switches/routers must also deliver low latency and guaranteed delay variance to support real-time traffic. As a result, quality-of-service (QoS) control techniques, such as traffic shaping, packet scheduling, and buffer management, need to be incorporated into the switches/routers.

Asynchronous transfer mode (ATM) is revolutionizing the telecommunications infrastructure by transmitting integrated voice, data, and video at very high speed. The current backbone network mainly consists of ATM switches and IP routers, where ATM cells and IP packets are carried on an optical physical layer such as the Synchronous Optical Network (SONET). ATM also provides different QoS requirements for various multimedia services. Readers who are interested in knowing the SONET frame structure, the ATM cell format, and the functions associated with SONET/ATM layers are referred to the Appendix.

Along with the growth of the Internet, IP has become the dominant protocol for data traffic and is making inroads into voice transmission as well. Network providers recognize the cost savings and performance advantages of converging voice, data, and video services onto a common network infrastructure, instead of an overlayered structure. Multi-protocol label switching (MPLS) is a new technology combining the advantageous features of the ATM network, short labels and explicit routing, and the connectionless datagram of the IP network. The MPLS network also provides traffic engineering capability to achieve bandwidth provisioning, fast restoration, load balancing, and virtual private network (VPN) services. The so-called label switching routers (LSRs) that route packets can be either IP routers, ATM switches, or frame relay switches. In this book, we will address the issues and technologies of building a scalable switch/router with large capacity, e.g., several terabits per second.

In the rest of this chapter, we briefly describe the ATM network, ATM switch systems, IP router systems, and switch design criteria and performance requirements.

1.1 ATM SWITCH SYSTEMS

1.1.1 Basics of ATM Networks

ATM protocol corresponds to layer 2 as defined in the open systems interconnection (OSI) reference model. ATM is connection-oriented. That is, an end-to-end connection (or virtual channel) needs to be set up before routing ATM cells. Cells are routed based on two important values contained in the 5-byte cell header: the virtual path identifier (VPI) and virtual channel identifier (VCI), where a virtual path consists of a number of virtual channels. The number of bits allocated for a VPI depends on the type of interface. If it is the user network interface (UNI), between the user and the first ATM switch, 8 bits are provided for the VPI. This means that up to [2.sup.8] = 256 virtual paths are available at the user access point. On the other hand, if the it is the network node interface (NNI), between the intermediate ATM switches, 12 bits are provided for the VPI. This indicates that there are [2.sup.12] = 4096 possible virtual paths between ATM switches. In both UNI and NNI, there are 16 bits for the VCI. Thus, there are [2.sup.16] = 65,536 virtual channels for each virtual path.

The combination of the VPI and the VCI determines a specific virtual connection between two ends. Instead of having the same VPI/VCI for the whole routing path, the VPI/VCI is determined on a per-link basis and changes at each ATM switch. Specifically, at each incoming link to a switch node, a VPI/VCI may be replaced with another VPI/VCI at the output link with reference to a table called a routing information table (RIT) in the ATM switch. This substantially increases the possible number of routing paths in the ATM network.

The operation of routing cells is as follows. Each ATM switch has its own RIT containing at least the following fields: old VPI/VCI, new VPI/VCI, output port address, and priority field (optional). When an ATM cell arrives at an input line of the switch, it is split into the 5-byte header and the 48-byte payload. By using the VPI/VCI contained in the header as the old VPI/VCI value, the switch looks in the RIT for the arriving cell's new VPI/VCI. Once the match is found, the old VPI/VCI value is replaced with the new VPI/VCI value. Moreover, the corresponding output port address and priority field are attached to the 48-byte payload of the cell, before it is sent to the switch fabric. The output port address indicates to which output port the cell should be routed. There are three modes of routing operations within the switch fabric: the unicast mode refers to the mode in which a cell is routed to a specific output port, the multicast mode refers to the mode in which a cell is routed to a number of output ports, and the broadcast mode refers to the mode in which a cell is routed to all output ports. In the unicast mode, [log.sub.2]N bits, where N is the number of input/output ports, are sufficient to indicate any possible output port. However, in the multicast/broadcast modes, N bits, each associated with a particular output port, are needed in a single-stage switch. The priority field enables the switch to selectively transmit cells to the output ports or discard them when the buffer is full, according to service requirements.

ATM connections either are preestablished through provisioning or are set up dynamically on demand using signaling, such as UNI signaling and private network-network interface (PNNI) routing signaling. The former is referred to permanent virtual connections (PVCs), while the latter is referred to switched virtual connections (SVCs). For SVCs, the RIT is updated by a call processor during the call setup, which finds an appropriate routing path between the source and the destination. The VPI/VCI of every link along the path, the output port addresses of the switches, and the priority field are determined and filled into the table by the call processor. The call processor has to ensure that at each switch, the VPI/VCI of the cells coming from different connections but going to the same output port are different. In practice, there is a call processor for every ATM switch. For simplicity, Figure 1.1 just shows a call processor to update the RIT of each switch in a conceptual way.

With respect to Figure 1.1, once a call setup is completed, the source starts to send a cell whose VPI/VCI is represented by W. As soon as this cell arrives at the first ATM switch, the entries of the table are searched. The matched entry is found with a new VPI/VCI X, which replaces the old VPI/VCI W. The corresponding output port address whose value is 100 and the priority field are attached to the cell so that the cell can be routed to output port 100 of the first switch. At the second ATM switch, the VPI/VCI of the cell whose value is X is updated with a new value Y. Based on the output port address obtained from the table, the incoming cell is routed to output port 10. This operation repeats in other switches along the path to the destination. Once the connection is terminated, the call processor deletes the associated entries of the routing tables along the path.

In the multicast case, a cell is replicated into multiple copies and each copy is routed to an output port. Since the VPI/VCI of each copy at the output port can be different, VPI/VCI replacement usually takes place at the output instead of the input. As a result, the routing table is usually split into two parts, one at the input and the other at the output. The former has two fields in the RIT: the old VPI/VCI and the N-bit routing information. The latter has three fields in the RIT: the input port number, the old VPI/VCI, and the new VPI/VCI. The combination of the input port number and the old VPI/VCI can uniquely identify the multicast connection and is used as an index to locate the new VPI/VCI at the output. Since multiple VPI/VCIs from different input ports can merge to the same output port and have the identical old VPI/VCI value, it thus has to use extra information as part of the index for the RIT. Using the input port number is a natural and easy way.

1.1.2 ATM Switch Structure

Figure 1.2 a depicts a typical ATM switch system model, consisting of input port controllers (IPCs), a switch fabric, and output port controllers (OPCs). In practice, the IPC and the OPC are usually built on the same printed circuit board, called the line interface card (LIC). Multiple IPCs and OPCs can be built on the same LIC. The center switch fabric provides interconnections between the IPCs and the OPCs. Figure 1.2(b) shows a chasis containing a power supply card, a CPU card to perform operation, administration, and maintenance (OAM) functions for the switch system, a switch fabric card, and multiple LICs. Each LIC has a transmitter (XMT) and a receiver (RCV).

As shown in Figure 1.3(a), each IPC terminates an incoming line and extracts cell headers for processing. In this example, optical signals are first converted to electrical signals by an optical-to-electrical (O/E) converter and then terminated by an SONET framer. Cell payloads are stored in a first-in, first-out (FIFO) buffer, while headers are extracted for routing processing. Incoming cells are aligned before being routed in the switch fabric, which greatly simplifies the design of the switch fabric. The cell stream is slotted, and the time required to transmit a cell across to the network is a time slot.

In Figure 1.3(b), cells coming from the switch fabric are stored in a FIFO buffer. Routing information (and other information such as a priority level, if any) will be stripped off before cells are written to the FIFO. Cells are then carried in the payload of SONET frames, which are then converted to optical signals through an electrical-to-optical (E/O) converter.

The OPC can transmit at most one cell to the transmission link in each time slot. Because cells arrive randomly in the ATM network, it is likely that more than one cell is destined for the same output port. This event is called output port contention (or conflict). One cell will be accepted for transmission, and the others must be either discarded or buffered. The location of the buffers not only affects the switch performance significantly, but also affects the switch implementation complexity. The choice of the contention resolution techniques is also influenced by the location of the buffers.

There are two methods of routing cells through an ATM switch fabric: self-routing and label routing. In self-routing, an output port address field (A) is prepended to each cell at the input port before the cell enters to the switch fabric. This field, which has [log.sub.2]N bits for unicast cells or N bits for multicast/broadcast cells, is used to navigate the cells to their destination output ports. Each bit of the output port address field is examined by each stage of the switch element. If the bit is 0, the cell is routed to the upper output of the switch element. If the bit is 1, it is routed to its lower output. As shown in Figure 1.4, a cell whose output port address is 5 (101) is routed to input port 2. The first bit of the output port address (1) is examined by the first stage of the switch element. The cell is routed to the lower output and goes to the second stage. The next bit (0) is examined by the second stage, and the cell is routed to the upper output of the switch element. At the last stage of the switch element, the last bit (1) is examined and the cell is routed to its lower output, corresponding to output port 5. Once the cell arrives at the output port, the output port address is removed.

In contrast, in label routing the VPI/VCI field within the header is used by each switch module to make the output link decision. That is, each switch module has a VPI/VCI lookup table and switches cells to an output link according to the mapping between VPI/VCI and input/output links in the table. Label routing does not depend on the regular interconnection of switching elements as self-routing does, and can be used arbitrarily wherever switch modules are interconnected.

1.2 IP ROUTER SYSTEMS

The Internet protocol corresponds to layer 3 as defined in the OSI reference model. The Internet, as originally conceived, offers best-effort data delivery. In contrast to ATM, which is a connection-oriented protocol, IP is a connectionless protocol. A user sends IP packets to IP networks without setting up any connection. As soon as a packet arrives at an IP router, the router decides to which output link the packet is to be routed, based on its IP address in the packet overhead, and transmits it to the output link.

To meet the demand for QoS for IP networks, the Internet Engineering Task Force (IETF) has proposed many service models and mechanisms, including the integrated services/resource reservation protocol (RSVP) model, the differentiated services (DS) model, MPLS, traffic engineering, w x and constraint-based routing. These models will enhance today's IP networks to support a variety of service applications.

1.2.1 Functions of IP Routers

IP routers' functions can be classified into two categories, datapath functions and control functions.

(Continues...)



Excerpted from Broadband Packet Switching Technologies by H. Jonathan Chao Cheuk H. Lam Eiji Oki Copyright © 2001 by H. Jonathan Chao. Excerpted by permission.
All rights reserved. No part of this excerpt may be reproduced or reprinted without permission in writing from the publisher.
Excerpts are provided by Dial-A-Book Inc. solely for the personal use of visitors to this web site.

H. JONATHAN CHAO, PhD, earned his doctorate at The Ohio State University. Since 1992 he has been Professor of Electrical Engineering at Polytechnic University, Brooklyn, New York and conducts research in terabit ATM switches and IP routers, quality of service control, and photonic packet switching. He was co-founder and Chief Technical Officer of Coree Networks Inc., building a terabit IP/MPLS switch router. Between 1985 and 1992 he was a member of technical staff at Telcordia in New Jersey. He is a Fellow of the IEEE and has published widely in the above subjects.

Check Out These Items!
eCampus.com Pink Backpack eCampus.com Pink Backpack
Retail Price $28.95
Our Price $10.00
eCampus.com T-Shirt eCampus.com T-Shirt
Retail Price $14.99
Our Price $2.00
eCampus.com 4GB USB Drive eCampus.com 4GB USB Drive
Retail Price $32.95
Our Price $25.00
  Buy Textbooks
  Sell Textbooks
  College Apparel
  Shop by School
  Virtual Bookstores
  Order Status
  Shipping Rates
  Return Policy
  Marketplace Info
  F.A.S.T.
  Contact Us
  Privacy Policy
  Legal Notices
  Site Security
  Employment
  Help Desk
  eCampus Blog
  Affiliate Program
  Bulk Orders
  College Marketing
HACKER SAFE certified sites prevent over 99.9% of hacker crime.
eCampus.com blog follow eCampus.com on twitter find eCampus.com on facebook RSS Need Help? eService@ecampus.com   Copyright© 1999-2008     
.