000 09902nam a2200601 i 4500
001 8039658
003 IEEE
005 20220712211700.0
006 m o d
007 cr |n|||||||||
008 171024s2008 maua ob 001 eng d
010 _z 2010001924 (print)
020 _a9780470591055
_qelectronic
020 _a0471139017
020 _z9780471139010
_qprint
024 7 _a10.1002/9780470591055
_2doi
035 _a(CaBNVSL)mat08039658
035 _a(IDAMS)0b00006485f0d745
040 _aCaBNVSL
_beng
_erda
_cCaBNVSL
_dCaBNVSL
050 4 _aTK5103.4
_b.L573 2010eb
082 0 0 _a621.382/16
_222
100 1 _aLee, Tony T.,
_d1960-
_930036
245 1 0 _aPrinciples of broadband switching and networking /
_cTony T. Lee and Soung C. Liew.
264 1 _aHoboken, New Jersey :
_bJohn Wiley & Sons,
_cc2010.
264 2 _a[Piscataqay, New Jersey] :
_bIEEE Xplore,
_c[2010]
300 _a1 PDF (xviii, 454 pages) :
_billustrations.
336 _atext
_2rdacontent
337 _aelectronic
_2isbdmedia
338 _aonline resource
_2rdacarrier
490 1 _aWiley series in telecommunications and signal processing ;
_v32
504 _aIncludes bibliographical references and index.
505 0 _aPreface -- About the Authors -- 1 Introduction and Overview -- 1.1 Switching and Transmission -- 1.1.1 Roles of Switching and Transmission -- 1.1.2 Telephone Network Switching and Transmission Hierarchy -- 1.2 Multiplexing and Concentration -- 1.3 Timescales of Information Transfer -- 1.3.1 Sessions and Circuits -- 1.3.2 Messages -- 1.3.3 Packets and Cells -- 1.4 Broadband Integrated Services Network -- Problems -- 2 Circuit Switch Design Principles -- 2.1 Space-Domain Circuit Switching -- 2.1.1 Nonblocking Properties -- 2.1.2 Complexity of Nonblocking Switches -- 2.1.3 Clos Switching Network -- 2.1.4 Benes Switching Network -- 2.1.5 Baseline and Reverse Baseline Networks -- 2.1.6 Cantor Switching Network -- 2.2 Time-Domain and Time-Space-Time Circuit Switching -- 2.2.1 Time-Domain Switching -- 2.2.2 Time-Space-Time Switching -- Problems -- 3 Fundamental Principles of Packet Switch Design -- 3.1 Packet Contention in Switches -- 3.2 Fundamental Properties of Interconnection Networks -- 3.2.1 Definition of Banyan Networks -- 3.2.2 Simple Switches Based on Banyan Networks -- 3.2.3 Combinatoric Properties of Banyan Networks -- 3.2.4 Nonblocking Conditions for the Banyan Network -- 3.3 Sorting Networks -- 3.3.1 Basic Concepts of Comparison Networks -- 3.3.2 Sorting Networks Based on Bitonic Sort -- 3.3.3 The Odd-Even Sorting Network -- 3.3.4 Switching and Contention Resolution in Sort-Banyan Network -- 3.4 Nonblocking and Self-Routing Properties of Clos Networks -- 3.4.1 Nonblocking Route Assignment -- 3.4.2 Recursiveness Property -- 3.4.3 Basic Properties of Half-Clos Networks -- 3.4.4 Sort-Clos Principle -- Problems -- 4 Switch Performance Analysis and Design Improvements -- 4.1 Performance of Simple Switch Designs -- 4.1.1 Throughput of an Internally Nonblocking Loss System -- 4.1.2 Throughput of an Input-Buffered Switch -- 4.1.3 Delay of an Input-Buffered Switch -- 4.1.4 Delay of an Output-Buffered Switch -- 4.2 Design Improvements for Input Queueing Switches -- 4.2.1 Look-Ahead Contention Resolution.
505 8 _a4.2.2 Parallel Iterative Matching -- 4.3 Design Improvements Based on Output Capacity Expansion -- 4.3.1 Speedup Principle -- 4.3.2 Channel-Grouping Principle -- 4.3.3 Knockout Principle -- 4.3.4 Replication Principle -- 4.3.5 Dilation Principle -- Problems -- 5 Advanced Switch Design Principles -- 5.1 Switch Design Principles Based on Deflection Routing -- 5.1.1 Tandem-Banyan Network -- 5.1.2 Shuffle-Exchange Network -- 5.1.3 Feedback Shuffle-Exchange Network -- 5.1.4 Feedback Bidirectional Shuffle-Exchange Network -- 5.1.5 Dual Shuffle-Exchange Network -- 5.2 Switching by Memory I/O -- 5.3 Design Principles for Scalable Switches -- 5.3.1 Generalized Knockout Principle -- 5.3.2 Modular Architecture -- Problems -- 6 Switching Principles for Multicast, Multirate, and Multimedia Services -- 6.1 Multicast Switching -- 6.1.1 Multicasting Based on Nonblocking Copy Networks -- 6.1.2 Performance Improvement of Copy Networks -- 6.1.3 Multicasting Algorithm for Arbitrary Network Topologies -- 6.1.4 Nonblocking Copy Networks Based on Broadcast Clos Networks -- 6.2 Path Switching -- 6.2.1 Basic Concept of Path Switching -- 6.2.2 Capacity and Route Assignments for Multirate Traffic -- 6.2.3 Trade-Off Between Performance and Complexity -- 6.2.4 Multicasting in Path Switching -- 6.A Appendix -- 6.A.1 A Formulation of Effective Bandwidth -- 6.A.2 Approximations of Effective Bandwidth Based on On / Off Source Model -- Problems -- 7 Basic Concepts of Broadband Communication Networks -- 7.1 Synchronous Transfer Mode -- 7.2 Delays in ATM Network -- 7.3 Cell Size Consideration -- 7.4 Cell Networking, Virtual Channels, and Virtual Paths -- 7.4.1 No Data Link Layer -- 7.4.2 Cell Sequence Preservation -- 7.4.3 Virtual-Circuit Hop-by-Hop Routing -- 7.4.4 Virtual Channels and Virtual Paths -- 7.4.5 Routing Using VCI and VPI -- 7.4.6 Motivations for VP/VC Two-Tier Hierarchy -- 7.5 ATM Layer, Adaptation Layer, and Service Class -- 7.6 Transmission Interface -- 7.7 Approaches Toward IP over ATM.
505 8 _a7.7.1 Classical IP over ATM -- 7.7.2 Next Hop Resolution Protocol -- 7.7.3 IP Switch and Cell Switch Router -- 7.7.4 ARIS and Tag Switching -- 7.7.5 Multiprotocol Label Switching -- Appendix 7.A ATM Cell Format -- 7.A.1 ATM Layer -- 7.A.2 Adaptation Layer -- Problems -- 8 Network Traffic Control and Bandwidth Allocation -- 8.1 Fluid-Flow Model: Deterministic Discussion -- 8.2 Fluid-Flow On-Off Source Model: Stochastic Treatment -- 8.3 Traffic Shaping and Policing -- 8.4 Open-Loop Flow Control and Scheduling -- 8.4.1 First-Come-First-Serve Scheduling -- 8.4.2 Fixed-Capacity Assignment -- 8.4.3 Round-Robin Scheduling -- 8.4.4 Weighted Fair Queueing -- 8.4.5 Delay Bound in Weighted Fair Queueing with Leaky-Bucket Access Control -- 8.5 Closed-Loop Flow Control -- Problems -- 9 Packet Switching and Information Transmission -- 9.1 Duality of Switching and Transmission -- 9.2 Parallel Characteristics of Contention and Noise -- 9.2.1 Pseudo Signal-to-Noise Ratio of Packet Switch -- 9.2.2 Clos Network with Random Routing as a Noisy Channel -- 9.3 Clos Network with Deflection Routing -- 9.3.1 Cascaded Clos Network -- 9.3.2 Analysis of Deflection Clos Network -- 9.4 Route Assignments and Error-Correcting Codes -- 9.4.1 Complete Matching in Bipartite Graphs -- 9.4.2 Graphical Codes -- 9.4.3 Route Assignments of Benes Network -- 9.5 Clos Network as Noiseless Channel-Path Switching -- 9.5.1 Capacity Allocation -- 9.5.2 Capacity Matrix Decomposition -- 9.6 Scheduling and Source Coding -- 9.6.1 Smoothness of Scheduling -- 9.6.2 Comparison of Scheduling Algorithms -- 9.6.3 Two-Dimensional Scheduling -- 9.7 Conclusion -- Bibliography.
506 _aRestricted to subscribers or individual electronic text purchasers.
520 _aAn 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.
530 _aAlso available in print.
538 _aMode of access: World Wide Web
588 _aDescription based on PDF viewed 10/24/2017.
650 0 _aBroadband communication systems
_xMathematical models.
_930037
650 0 _aTelecommunication
_xSwitching systems
_xMathematical models.
_93739
650 0 _aIntegrated services digital networks
_xMathematical models.
_930038
650 0 _aPacket switching (Data transmission)
_xMathematical models.
_930039
650 0 _aComputer algorithms.
_94534
655 0 _aElectronic books.
_93294
700 1 _aLiew, Soung C.,
_d1948-
_930040
710 2 _aIEEE Xplore (Online Service),
_edistributor.
_930041
710 2 _aWiley,
_epublisher.
_930042
776 0 8 _iPrint version:
_z9780471139010
830 0 _aWiley series in telecommunications and signal processing.
_930043
856 4 2 _3Abstract with links to resource
_uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=8039658
942 _cEBK
999 _c74732
_d74732