Cover image for Principles of broadband switching and networking
Title:
Principles of broadband switching and networking
Personal Author:
Series:
Wiley series in telecommunications and signal processing
Publication Information:
Hoboken, N.J. : John Wiley & Sons, c2010
Physical Description:
xviii, 454 p. : ill. ; 25 cm.
ISBN:
9780471139010
Added Author:

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010253858 TK5103.4 L573 2010 Open Access Book Book
Searching...

On Order

Summary

Summary

An authoritative introduction to the roles of switching and transmission in broadband integrated services networks

Principles of Broadband Switching and Networking explains the design and analysis of switch architectures suitable for broadband integrated services networks, emphasizing packet-switched interconnection networks with distributed routing algorithms. The text examines the mathematical properties of these networks, rather than specific implementation technologies. Although the pedagogical explanations in this book are in the context of switches, many of the fundamental principles are relevant to other communication networks with regular topologies.

After explaining the concept of the modern broadband integrated services network and why it is necessary in today's society, the book moves on to basic switch design principles, discussing two types of circuit switch design--space domain and time domain--and packet switch design. Throughput improvements are illustrated by some switch design variations such as Speedup principle, Channel-Grouping principle, Knockout principle, and Dilation principle.

Moving seamlessly into advanced switch design principles, the book covers switch scalability, switch design for multicasting, and path switching. Then the focus moves to broadband communications networks that make use of such switches. Readers receive a detailed introduction on how to allocate network resources and control traffic to satisfy the quality of service requirements of network users and to maximize network usage. As an epilogue, the text shows how transmission noise and packet contention have similar characteristics and can be tamed by comparable means to achieve reliable communication.

Principles of Broadband Switching and Networking is written for senior undergraduate and first-year postgraduate students with a solid background in probability theory.


Author Notes

Tony T. Lee PhD, is Professor of Information Engineering at the Chinese University of Hong Kong and an Adjunct Professor at the Institute of Applied Mathematics of the Chinese Academy of Science. From 1991 to 1993, he was a professor of electrical engineering at the Polytechnic Institute. Previously with ATT Bell and Bellcore, Dr. Lee was the recipient of the Leonard G. Abraham Prize Award from IEEE Communication Society in 1988, and the National Natural Science Award from China in 1999. He is a Fellow of IEEE and now an associate editor of the IEEE Transactions on Communications.
Soung C. Liew, PhD, is Professor and Chairman of the Department of Information Engineering at the Chinese University of Hong Kong. He is also Adjunct Professor at Southeast University in China. TCP version, of TCP that improves its performance over wireless networks, was proposed by Liew and his student, and has now been incorporated into a recent release of Linux OS. He initiated and built the first interuniversity ATM network testbed in Hong Kong in 1993.


Table of Contents

Prefacep. xiii
About the Authorsp. xvii
1 Introduction and Overviewp. 1
1.1 Switching and Transmissionp. 2
1.1.1 Roles of Switching and Transmissionp. 2
1.1.2 Telephone Network Switching and Transmission Hierarchyp. 4
1.2 Multiplexing and Concentrationp. 5
1.3 Timescales of Information Transferp. 8
1.3.1 Sessions and Circuitsp. 9
1.3.2 Messagesp. 9
1.3.3 Packets and Cellsp. 9
1.4 Broadband Integrated Services Networkp. 10
Problemsp. 12
2 Circuit Switch Design Principlesp. 15
2.1 Space-Domain Circuit Switchingp. 16
2.1.1 Nonblocking Propertiesp. 16
2.1.2 Complexity of Nonblocking Switchesp. 18
2.1.3 Clos Switching Networkp. 20
2.1.4 Benes Switching Networkp. 28
2.1.5 Baseline and Reverse Baseline Networksp. 31
2.1.6 Cantor Switching Networkp. 32
2.2 Time-Domain and Time-Space-Time Circuit Switchingp. 35
2.2.1 Time-Domain Switchingp. 35
2.2.2 Time-Space-Time Switchingp. 37
Problemsp. 39
3 Fundamental Principles of Packet Switch Designp. 43
3.1 Packet Contention in Switchesp. 45
3.2 Fundamental Properties of Interconnection Networksp. 48
3.2.1 Definition of Banyan Networksp. 49
3.2.2 Simple Switches Based on Banyan Networksp. 51
3.2.3 Combinatoric Properties of Banyan Networksp. 54
3.2.4 Nonblocking Conditions for the Banyan Networkp. 54
3.3 Sorting Networksp. 59
3.3.1 Basic Concepts of Comparison Networksp. 61
3.3.2 Sorting Networks Based on Bitonic Sortp. 64
3.3.3 The Odd-Even Sorting Networkp. 70
3.3.4 Switching and Contention Resolution in Sort-Banyan Networkp. 71
3.4 Nonblocking and Self-Routing Properties of Clos Networksp. 75
3.4.1 Nonblocking Route Assignmentp. 76
3.4.2 Recursiveness Propertyp. 79
3.4.3 Basic Properties of Half-Clos Networksp. 81
3.4.4 Sort-Clos Principlep. 89
Problemsp. 90
4 Switch Performance Analysis and Design Improvementsp. 95
4.1 Performance of Simple Switch Designsp. 95
4.1.1 Throughput of an Internally Nonblocking Loss Systemp. 96
4.1.2 Throughput of an Input-Buffered Switchp. 96
4.1.3 Delay of an Input-Buffered Switchp. 103
4.1.4 Delay of an Output-Buffered Switchp. 112
4.2 Design Improvements for Input Queueing Switchesp. 113
4.2.1 Look-Ahead Contention Resolutionp. 113
4.2.2 Parallel Iterative Matchingp. 115
4.3 Design Improvements Based on Output Capacity Expansionp. 119
4.3.1 Speedup Principlep. 119x
4.3.2 Channel-Grouping Principlep. 121
4.3.3 Knockout Principlep. 131
4.3.4 Replication Principlep. 137
4.3.5 Dilation Principlep. 138
Problemsp. 144
5 Advanced Switch Design Principlesp. 151
5.1 Switch Design Principles Based on Deflection Routingp. 151
5.1.1 Tandem-Banyan Networkp. 151
5.1.2 Shuffle-Exchange Networkp. 154
5.1.3 Feedback Shuffle-Exchange Networkp. 158
5.1.4 Feedback Bidirectional Shuffle-Exchange Networkp. 166
5.1.5 Dual Shuffle-Exchange Networkp. 175
5.2 Switching by Memory I/Op. 184
5.3 Design Principles for Scalable Switchesp. 187
5.3.1 Generalized Knockout Principlep. 187
5.3.2 Modular Architecturep. 191
Problemsp. 198
6 Switching Principles for Multicast, Multirate, and Multimedia Servicesp. 205
6.1 Multicast Switchingp. 205
6.1.1 Multicasting Based on Nonblocking Copy Networksp. 208
6.1.2 Performance Improvement of Copy Networksp. 213
6.1.3 Multicasting Algorithm for Arbitrary Network Topologiesp. 220
6.1.4 Nonblocking Copy Networks Based on Broadcast Clos Networksp. 228
6.2 Path Switchingp. 235
6.2.1 Basic Concept of Path Switchingp. 237
6.2.2 Capacity and Route Assignments for Multirate Trafficp. 242
6.2.3 Trade-Off Between Performance and Complexityp. 249
6.2.4 Multicasting in Path Switchingp. 254
6.A Appendixp. 268
6.A.1 A Formulation of Effective Bandwidthp. 268
6.A.2 Approximations of Effective Bandwidth Based on On-Off Source Modelp. 269
Problemsp. 270
7 Basic Concepts of Broadband Communication Networksp. 275
7.1 Synchronous Transfer Modep. 275
7.2 Delays in ATM Networkp. 280
7.3 Cell Size Considerationp. 283
7.4 Cell Networking, Virtual Channels, and Virtual Pathsp. 285
7.4.1 No Data Link Layerp. 285
7.4.2 Cell Sequence Preservationp. 286
7.4.3 Virtual-Circuit Hop-by-Hop Routingp. 286
7.4.4 Virtual Channels and Virtual Pathsp. 287
7.4.5 Routing, Using VCI and VPIp. 289
7.4.6 Motivations for VP/VC Two-Tier Hierarchyp. 293
7.5 ATM Layer, Adaptation Layer, and Service Classp. 295
7.6 Transmission Interfacep. 300
7.7 Approaches Toward IP over ATMp. 300
7.7.1 Classical IP over ATMp. 301
7.7.2 Next Hop Resolution Protocolp. 302
7.7.3 IP Switch and Cell Switch Routerp. 303
7.7.4 ARIS and Tag Switchingp. 306
7.7.5 Multiprotocol Label Switchingp. 308
Appendix 7.A ATM Cell Formatp. 311
7.A.1 ATM Layerp. 311
7.A.2 Adaptation Layerp. 314
Problemsp. 319
8 Network Traffic Control and Bandwidth Allocationp. 323
8.1 Fluid-Flow Model: Deterministic Discussionp. 326
8.2 Fluid-Flow On-Off Source Model: Stochastic Treatmentp. 332
8.3 Traffic Shaping and Policingp. 348
8.4 Open-Loop Flow Control and Schedulingp. 354
8.4.1 First-Come-First-Serve Schedulingp. 355
8.4.2 Fixed-Capacity Assignmentp. 357
8.4.3 Round-Robin Schedulingp. 358
8.4.4 Weighted Fair Queueingp. 364
8.4.5 Delay Bound in Weighted Fair Queueing with Leaky-Bucket Access Controlp. 373
8.5 Closed-Loop Flow Controlp. 380
Problemsp. 381
9 Packet Switching and Information Transmissionp. 385
9.1 Duality of Switching and Transmissionp. 386
9.2 Parallel Characteristics of Contention and Noisep. 390
9.2.1 Pseudo Signal-to-Noise Ratio of Packet Switchp. 390
9.2.2 Clos Network with Random Routing as a Noisy Channelp. 393
9.3 Clos Network with Deflection Routingp. 396
9.3.1 Cascaded Clos Networkp. 397
9.3.2 Analysis of Deflection Clos Networkp. 397
9.4 Route Assignments and Error-Correcting Codesp. 402
9.4.1 Complete Matching in Bipartite Graphsp. 402
9.4.2 Graphical Codesp. 405
9.4.3 Route Assignments of Benes Networkp. 407
9.5 Clos Network as Noiseless Channel-Path Switchingp. 410
9.5.1 Capacity Allocationp. 411
9.5.2 Capacity Matrix Decompositionp. 414
9.6 Scheduling and Source Codingp. 416
9.6.1 Smoothness of Schedulingp. 417
9.6.2 Comparison of Scheduling Algorithmsp. 420
9.6.3 Two-Dimensional Schedulingp. 424
9.7 Conclusionp. 430
Bibliographyp. 433