Broadband Packet Switching Technologies: A Practical Guide to ATM Switches and IP Routers |
Autore | Chao H. Jonathan |
Edizione | [1st edition] |
Pubbl/distr/stampa | [Place of publication not identified], : Wiley Interscience Imprint, 2001 |
Descrizione fisica | 1 online resource (1 v.) : ill |
Disciplina | 621.38216 |
Soggetto topico |
Electrical & Computer Engineering
Engineering & Applied Sciences Telecommunications |
ISBN |
1-280-55644-7
9786610556441 0-470-29714-X 0-471-22440-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Basics of packet switching -- Input-buffered switches -- Shared-memory switches -- Banyan-based switches -- Knockout-based switches -- The abacus switch -- Crosspoint-buffered switches -- The tandem-crosspoint switch -- Clos-network switches -- Optical packet switches -- Wireless ATM switches -- IP route lookups. |
Record Nr. | UNINA-9910145903403321 |
Chao H. Jonathan
![]() |
||
[Place of publication not identified], : Wiley Interscience Imprint, 2001 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Contemporary communication systems using MATLAB / John G.Proakis, Masoud Salehi |
Autore | PROAKIS, John G. |
Pubbl/distr/stampa | Pacific Grove : Brooks/Cole, copyr.2000 |
Descrizione fisica | XIII, 428 p. ; 24 cm |
Disciplina | 621.38216 |
Altri autori (Persone) | SALEHI, Masoud |
Collana | BookWare Companion Series |
Soggetto topico |
Trasmissione dei dati - Simulazione - Programmi per microelaboratori
Elaboratori elettronici - Programmi MATLAB |
ISBN | 0-534-37173-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-990000340820203316 |
PROAKIS, John G.
![]() |
||
Pacific Grove : Brooks/Cole, copyr.2000 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Contemporary communication systems using MATLAB / John G. Proakis, Masoud Salehi |
Autore | Proakis, John G. |
Pubbl/distr/stampa | Pacific Grove, : Brooks/Cole, 2000 |
Descrizione fisica | XIII, 428 p. : ill. ; 24 cm. |
Disciplina | 621.38216 |
Altri autori (Persone) | Salehi, Masoud |
Collana | Bookware companion series |
Soggetto topico |
MATLAB
Sistemi di telecomunicazioni Sistemi di trasmissione dati |
ISBN | 0534371736 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNICAS-UFI0383051 |
Proakis, John G.
![]() |
||
Pacific Grove, : Brooks/Cole, 2000 | ||
![]() | ||
Lo trovi qui: Univ. di Cassino | ||
|
Contemporary communication systems using MATLAB / John G. Proakis, Masoud Salehi |
Autore | Proakis, John G. |
Pubbl/distr/stampa | Pacific Grove, : Brooks/Cole, 2000 |
Descrizione fisica | XIII, 428 p. : ill. ; 24 cm. |
Disciplina |
621.382
621.38216 |
Altri autori (Persone) | Salehi, Masoud |
Collana | Bookware companion series |
Soggetto topico |
Trasmissione dei dati
Microelaboratori - Programmi MATLAB Telecomunicazioni - Simulazione |
ISBN | 0534371736 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISANNIO-UFI0383051 |
Proakis, John G.
![]() |
||
Pacific Grove, : Brooks/Cole, 2000 | ||
![]() | ||
Lo trovi qui: Univ. del Sannio | ||
|
Contemporary communication systems using MATLAB and simulink / John G. Proakis, Masoud Salehi, Gerhard Bauch |
Autore | PROAKIS, John G. |
Edizione | [2. ed.] |
Pubbl/distr/stampa | Belmont : Thomson-Brooks/Cole, copyr. 2004 |
Descrizione fisica | VIII, 487 p. : ill. ; 23 cm |
Disciplina | 621.38216 |
Altri autori (Persone) |
SALEHI, Masoud
BAUCH, Gerhard |
Collana | Bookware Companion Series |
Soggetto topico |
Trasmissione dei dati - Simulazione - Programmi per microelaboratori
Elaboratori elettronici - Programma MATLAB Elaboratori elettronici - Programma SIMULINK |
ISBN | 0-534-40617-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | ita |
Record Nr. | UNISA-990002091120203316 |
PROAKIS, John G.
![]() |
||
Belmont : Thomson-Brooks/Cole, copyr. 2004 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Contemporary communication systems using Matlab and Simulink / John G. Proakis, Masoud Salehi, Gerhard Bauch |
Autore | Proakis, John G. |
Edizione | [2. ed] |
Pubbl/distr/stampa | Belmont, : Thomson books/cole, c2004 |
Descrizione fisica | VIII, 487 p. : ill. ; 24 cm. |
Disciplina |
621.382
621.38216 |
Altri autori (Persone) |
Salehi, Masoud
Bauch, Gerhard |
Collana | Bookware companion series |
Soggetto topico |
Telecomunicazioni
Trasmissione dei dati |
ISBN | 0534406173 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISANNIO-UBO2543433 |
Proakis, John G.
![]() |
||
Belmont, : Thomson books/cole, c2004 | ||
![]() | ||
Lo trovi qui: Univ. del Sannio | ||
|
Distributed source coding : theory, algorithms, and applications / / Pier Luigi Dragotti, Michael Gastpar |
Autore | Dragotti Pier Luigi |
Pubbl/distr/stampa | Amsterdam ; ; Boston : , : Academic Press/Elsevier, , [2009] |
Descrizione fisica | 1 online resource (359 p.) |
Disciplina |
621.382/16 22
621.38216 |
Soggetto topico |
Data compression (Telecommunication)
Multisensor data fusion Coding theory Electronic data processing - Distributed processing |
ISBN |
1-282-28683-8
9786612286834 0-08-092274-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Front Cover; Distributed Source Coding; Copyright Page; Table of Contents; List of Contributors; Introduction; Part I: Theory; Chapter 1. Foundations of Distributed Source Coding; 1.1 Introduction; 1.2 Centralized Source Coding; 1.2.1 Lossless Source Coding; 1.2.2 Lossy Source Coding; 1.2.3 Lossy Source Coding for Sources with Memory; 1.2.4 Some Notes on Practical Considerations; 1.3 Distributed Source Coding; 1.3.1 Lossless Source Coding; 1.3.2 Lossy Source Coding; 1.3.3 Interaction; 1.4 Remote Source Coding; 1.4.1 Centralized; 1.4.2 Distributed: The CEO Problem
1.5 Joint Source-channel CodingAcknowledgments; Appendix A: Formal Definitions and Notations; A.1 Notation; A.1.1 Centralized Source Coding; A.1.2 Distributed Source Coding; A.1.3 Remote Source Coding; References; Chapter 2. Distributed Transform Coding; 2.1 Introduction; 2.2 Foundations of Centralized Transform Coding; 2.2.1 Transform Coding Overview; 2.2.2 Lossless Compression; 2.2.3 Quantizers; 2.2.4 Bit Allocation; 2.2.5 Transforms; 2.2.6 Linear Approximation; 2.3 The Distributed Karhunen--Loève Transform; 2.3.1 Problem Statement and Notation; 2.3.2 The Two-terminal Scenario 2.3.3 The Multiterminal Scenario and the Distributed KLT Algorithm2.4 Alternative Transforms; 2.4.1 Practical Distributed Transform Coding with Side Information; 2.4.2 High-rate Analysis of Source Coding with Side Informationat Decoder; 2.5 New Approaches to Distributed Compression with FRI; 2.5.1 Background on Sampling of 2D FRI Signals; 2.5.2 Detailed Example: Coding Scheme for Translatinga Bi-level Polygon; 2.6 Conclusions; References; Chapter 3. Quantization for Distributed Source Coding; 3.1 Introduction; 3.2 Formulation of the Problem; 3.2.1 Conventions 3.2.2 Network Distributed Source Coding3.2.3 Cost, Distortion, and Rate Measures; 3.2.4 Optimal Quantizers and Reconstruction Functions; 3.2.5 Example: Quantization of Side Information; 3.3 Optimal Quantizer Design; 3.3.1 Optimality Conditions; 3.3.2 Lloyd Algorithm for Distributed Quantization; 3.4 Experimental Results; 3.5 High-rate Distributed Quantization; 3.5.1 High-rate WZ Quantization of Clean Sources; 3.5.2 High-rate WZ Quantization of Noisy Sources; 3.5.3 High-rate Network Distributed Quantization; 3.6 Experimental Results Revisited; 3.7 Conclusions; References Chapter 4. Zero-error Distributed Source Coding4.1 Introduction; 4.2 Graph Theoretic Connections; 4.2.1 VLZE Coding and Graphs; 4.2.2 Basic Definitions and Notation; 4.2.3 Graph Entropies; 4.2.4 Graph Capacity; 4.3 Complementary Graph Entropy and VLZE Coding; 4.4 Network Extensions; 4.4.1 Extension 1: VLZE Coding When Side Information May Be Absent; 4.4.2 Extension 2: VLZE Coding with Compound Side Information; 4.5 VLZE Code Design; 4.5.1 Hardness of Optimal Code Design; 4.5.2 Hardness of Coding with Length Constraints; 4.5.3 An Exponential-time Optimal VLZE Code Design Algorithm 4.6 Conclusions |
Record Nr. | UNINA-9910782886303321 |
Dragotti Pier Luigi
![]() |
||
Amsterdam ; ; Boston : , : Academic Press/Elsevier, , [2009] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Distributed source coding : theory, algorithms, and applications / / Pier Luigi Dragotti, Michael Gastpar |
Autore | Dragotti Pier Luigi |
Pubbl/distr/stampa | Amsterdam ; ; Boston : , : Academic Press/Elsevier, , [2009] |
Descrizione fisica | 1 online resource (359 p.) |
Disciplina |
621.382/16 22
621.38216 |
Soggetto topico |
Data compression (Telecommunication)
Multisensor data fusion Coding theory Electronic data processing - Distributed processing |
ISBN |
1-282-28683-8
9786612286834 0-08-092274-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Front Cover; Distributed Source Coding; Copyright Page; Table of Contents; List of Contributors; Introduction; Part I: Theory; Chapter 1. Foundations of Distributed Source Coding; 1.1 Introduction; 1.2 Centralized Source Coding; 1.2.1 Lossless Source Coding; 1.2.2 Lossy Source Coding; 1.2.3 Lossy Source Coding for Sources with Memory; 1.2.4 Some Notes on Practical Considerations; 1.3 Distributed Source Coding; 1.3.1 Lossless Source Coding; 1.3.2 Lossy Source Coding; 1.3.3 Interaction; 1.4 Remote Source Coding; 1.4.1 Centralized; 1.4.2 Distributed: The CEO Problem
1.5 Joint Source-channel CodingAcknowledgments; Appendix A: Formal Definitions and Notations; A.1 Notation; A.1.1 Centralized Source Coding; A.1.2 Distributed Source Coding; A.1.3 Remote Source Coding; References; Chapter 2. Distributed Transform Coding; 2.1 Introduction; 2.2 Foundations of Centralized Transform Coding; 2.2.1 Transform Coding Overview; 2.2.2 Lossless Compression; 2.2.3 Quantizers; 2.2.4 Bit Allocation; 2.2.5 Transforms; 2.2.6 Linear Approximation; 2.3 The Distributed Karhunen--Loève Transform; 2.3.1 Problem Statement and Notation; 2.3.2 The Two-terminal Scenario 2.3.3 The Multiterminal Scenario and the Distributed KLT Algorithm2.4 Alternative Transforms; 2.4.1 Practical Distributed Transform Coding with Side Information; 2.4.2 High-rate Analysis of Source Coding with Side Informationat Decoder; 2.5 New Approaches to Distributed Compression with FRI; 2.5.1 Background on Sampling of 2D FRI Signals; 2.5.2 Detailed Example: Coding Scheme for Translatinga Bi-level Polygon; 2.6 Conclusions; References; Chapter 3. Quantization for Distributed Source Coding; 3.1 Introduction; 3.2 Formulation of the Problem; 3.2.1 Conventions 3.2.2 Network Distributed Source Coding3.2.3 Cost, Distortion, and Rate Measures; 3.2.4 Optimal Quantizers and Reconstruction Functions; 3.2.5 Example: Quantization of Side Information; 3.3 Optimal Quantizer Design; 3.3.1 Optimality Conditions; 3.3.2 Lloyd Algorithm for Distributed Quantization; 3.4 Experimental Results; 3.5 High-rate Distributed Quantization; 3.5.1 High-rate WZ Quantization of Clean Sources; 3.5.2 High-rate WZ Quantization of Noisy Sources; 3.5.3 High-rate Network Distributed Quantization; 3.6 Experimental Results Revisited; 3.7 Conclusions; References Chapter 4. Zero-error Distributed Source Coding4.1 Introduction; 4.2 Graph Theoretic Connections; 4.2.1 VLZE Coding and Graphs; 4.2.2 Basic Definitions and Notation; 4.2.3 Graph Entropies; 4.2.4 Graph Capacity; 4.3 Complementary Graph Entropy and VLZE Coding; 4.4 Network Extensions; 4.4.1 Extension 1: VLZE Coding When Side Information May Be Absent; 4.4.2 Extension 2: VLZE Coding with Compound Side Information; 4.5 VLZE Code Design; 4.5.1 Hardness of Optimal Code Design; 4.5.2 Hardness of Coding with Length Constraints; 4.5.3 An Exponential-time Optimal VLZE Code Design Algorithm 4.6 Conclusions |
Record Nr. | UNINA-9910818223603321 |
Dragotti Pier Luigi
![]() |
||
Amsterdam ; ; Boston : , : Academic Press/Elsevier, , [2009] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
High performance switches and routers / / H. Jonathan Chao and Bin Liu |
Autore | Chao H. Jonathan <1955-> |
Pubbl/distr/stampa | Hoboken, New Jersey : , : Wiley-Interscience, , c2007 |
Descrizione fisica | 1 online resource (633 p.) |
Disciplina |
004.66
621.38216 |
Altri autori (Persone) | LiuBin |
Soggetto topico |
Asynchronous transfer mode
Routers (Computer networks) Computer network protocols Packet switching (Data transmission) |
ISBN |
0-470-45072-X
1-280-90010-5 9786610900107 0-470-11395-2 0-470-11394-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
PREFACE -- ACKNOWLEDGMENTS -- 1 INTRODUCTION -- 1.1 Architecture of the Internet: Present and Future -- 1.2 Router Architectures -- 1.3 Commercial Core Router Examples -- 1.4 Design of Core Routers -- 1.5 IP Network Management -- -- 1.6 Outline of the Book -- 2 IP ADDRESS LOOKUP -- 2.1 Overview -- 2.2 Trie-Based Algorithms -- 2.3 Hardware-Based Schemes -- 2.4 IPv6 Lookup -- 2.5 Comparison -- 3 PACKET CLASSIFICATION -- 3.1 Introduction -- 3.2 Trie-Based Classifications -- 3.3 Geometric Algorithms -- 3.4 Heuristic Algorithms -- 3.5 TCAM-Based Algorithms -- 4 TRAFFIC MANAGEMENT -- 4.1 Quality of Service -- 4.2 Integrated Services -- 4.3 Differentiated Services -- 4.4 Traffic Policing and Shaping -- 4.5 Packet Scheduling -- 4.6 Buffer Management -- 5 BASICS OF PACKET SWITCHING -- 5.1 Fundamental Switching Concept -- 5.2 Switch Fabric Classification -- 5.3 Buffering Strategy in Switching Fabrics -- 5.4 Multiplane Switching and Multistage Switching -- 5.5 Performance of Basic Switches -- 6 SHARED-MEMORY SWITCHES -- 6.1 Linked List Approach -- 6.2 Content Addressable Memory Approach -- 6.3 Space-Time-Space Approach -- 6.4 Scaling the Shared-Memory Switches -- 6.5 Multicast Shared-Memory Switches -- 7 INPUT-BUFFERED SWITCHES -- 7.1 Scheduling in VOQ-Based Switches -- 7.2 Maximum Matching -- 7.3 Maximal Matching -- 7.4 Randomized Matching Algorithms -- 7.5 Frame-based Matching -- 7.6 Stable Matching with Speedup -- 8 BANYAN-BASED SWITCHES -- 8.1 Banyan Networks -- 8.2 Batcher-Sorting Network -- 8.3 Output Contention Resolution Algorithms -- 8.4 The Sunshine Switch -- 8.5 Deflection Routing -- 8.6 Multicast Copy Networks -- 9 KNOCKOUT-BASED SWITCHES -- 9.1 Single-Stage Knockout Switch -- 9.2 Channel Grouping Principle -- 9.3 Two-Stage Multicast Output-Buffered ATM Switch (MOBAS) -- 9.4 Appendix -- 10 THE ABACUS SWITCH -- 10.1 Basic Architecture -- 10.2 Multicast Contention Resolution Algorithm -- 10.3 Implementation of Input Port Controller.
10.4 Performance -- 10.5 ATM Routing and Concentration (ARC) Chip -- 10.6 Enhanced Abacus Switch -- 10.7 Abacus Switch for Packet Switching -- 11 CROSSPOINT BUFFERED SWITCHES -- 11.1 Combined Input and Crosspoint Buffered Switches -- 11.2 Combined Input and Crosspoint Buffered Switches with VOQ -- 11.3 OCF_OCF: Oldest Cell First Scheduling -- 11.4 LQF_RR: Longest Queue First and Round-Robin Scheduling in CIXB-1 -- 11.5 MCBF: Most Critical Buffer First Scheduling -- 12 CLOS-NETWORK SWITCHES -- 12.1 Routing Property of Clos Network Switches -- 12.2 Looping Algorithm -- 12.3 m-Matching Algorithm -- 12.4 Euler Partition Algorithm -- 12.5 Karol's Algorithm -- 12.6 Frame-Based Matching Algorithm for Clos Network (f-MAC) -- 12.7 Concurrent Matching Algorithm for Clos Network (c-MAC) -- 12.8 Dual-Level Matching Algorithm for Clos Network (d-MAC) -- 12.9 The ATLANTA Switch -- 12.10 Concurrent Round-Robin Dispatching (CRRD) Scheme -- 12.11 The Path Switch -- 13 MULTI-PLANE MULTI-STAGE BUFFERED SWITCH -- 13.1 TrueWay Switch Architecture -- 13.2 Packet Scheduling -- 13.3 Stage-To-Stage Flow Control -- 13.4 Port-To-Port Flow Control -- 13.5 Performance Analysis -- 13.6 Prototype -- 14 LOAD-BALANCED SWITCHES -- 14.1 Birkhoff-Von Neumann Switch -- 14.2 Load-Balanced Birkhoff-von Neumann Switches -- 14.3 Load-Balanced Birkhoff-von Neumann SwitchesWith FIFO Service -- 15 OPTICAL PACKET SWITCHES -- 15.1 Opto-Electronic Packet Switches -- 15.2 Optoelectronic Packet Switch Case Study I -- 15.3 Optoelectronic Packet Switch Case Study II -- 15.4 All Optical Packet Switches -- 15.5 Optical Packet Switch with Shared Fiber Delay Lines Single-stage Case -- 15.6 All Optical Packet Switch with Shared Fiber Delay Lines - Three Stage Case -- 16 HIGH-SPEED ROUTER CHIP SET -- 16.1 Network Processors (NPs) -- 16.2 Co-Processors for Packet Classification -- 16.3 Traffic Management Chips -- 16.4 Switching Fabric Chips -- INDEX. |
Record Nr. | UNINA-9910143692803321 |
Chao H. Jonathan <1955->
![]() |
||
Hoboken, New Jersey : , : Wiley-Interscience, , c2007 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
High performance switches and routers / / H. Jonathan Chao and Bin Liu |
Autore | Chao H. Jonathan <1955-> |
Pubbl/distr/stampa | Hoboken, New Jersey : , : Wiley-Interscience, , c2007 |
Descrizione fisica | 1 online resource (633 p.) |
Disciplina |
004.66
621.38216 |
Altri autori (Persone) | LiuBin |
Soggetto topico |
Asynchronous transfer mode
Routers (Computer networks) Computer network protocols Packet switching (Data transmission) |
ISBN |
0-470-45072-X
1-280-90010-5 9786610900107 0-470-11395-2 0-470-11394-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
PREFACE -- ACKNOWLEDGMENTS -- 1 INTRODUCTION -- 1.1 Architecture of the Internet: Present and Future -- 1.2 Router Architectures -- 1.3 Commercial Core Router Examples -- 1.4 Design of Core Routers -- 1.5 IP Network Management -- -- 1.6 Outline of the Book -- 2 IP ADDRESS LOOKUP -- 2.1 Overview -- 2.2 Trie-Based Algorithms -- 2.3 Hardware-Based Schemes -- 2.4 IPv6 Lookup -- 2.5 Comparison -- 3 PACKET CLASSIFICATION -- 3.1 Introduction -- 3.2 Trie-Based Classifications -- 3.3 Geometric Algorithms -- 3.4 Heuristic Algorithms -- 3.5 TCAM-Based Algorithms -- 4 TRAFFIC MANAGEMENT -- 4.1 Quality of Service -- 4.2 Integrated Services -- 4.3 Differentiated Services -- 4.4 Traffic Policing and Shaping -- 4.5 Packet Scheduling -- 4.6 Buffer Management -- 5 BASICS OF PACKET SWITCHING -- 5.1 Fundamental Switching Concept -- 5.2 Switch Fabric Classification -- 5.3 Buffering Strategy in Switching Fabrics -- 5.4 Multiplane Switching and Multistage Switching -- 5.5 Performance of Basic Switches -- 6 SHARED-MEMORY SWITCHES -- 6.1 Linked List Approach -- 6.2 Content Addressable Memory Approach -- 6.3 Space-Time-Space Approach -- 6.4 Scaling the Shared-Memory Switches -- 6.5 Multicast Shared-Memory Switches -- 7 INPUT-BUFFERED SWITCHES -- 7.1 Scheduling in VOQ-Based Switches -- 7.2 Maximum Matching -- 7.3 Maximal Matching -- 7.4 Randomized Matching Algorithms -- 7.5 Frame-based Matching -- 7.6 Stable Matching with Speedup -- 8 BANYAN-BASED SWITCHES -- 8.1 Banyan Networks -- 8.2 Batcher-Sorting Network -- 8.3 Output Contention Resolution Algorithms -- 8.4 The Sunshine Switch -- 8.5 Deflection Routing -- 8.6 Multicast Copy Networks -- 9 KNOCKOUT-BASED SWITCHES -- 9.1 Single-Stage Knockout Switch -- 9.2 Channel Grouping Principle -- 9.3 Two-Stage Multicast Output-Buffered ATM Switch (MOBAS) -- 9.4 Appendix -- 10 THE ABACUS SWITCH -- 10.1 Basic Architecture -- 10.2 Multicast Contention Resolution Algorithm -- 10.3 Implementation of Input Port Controller.
10.4 Performance -- 10.5 ATM Routing and Concentration (ARC) Chip -- 10.6 Enhanced Abacus Switch -- 10.7 Abacus Switch for Packet Switching -- 11 CROSSPOINT BUFFERED SWITCHES -- 11.1 Combined Input and Crosspoint Buffered Switches -- 11.2 Combined Input and Crosspoint Buffered Switches with VOQ -- 11.3 OCF_OCF: Oldest Cell First Scheduling -- 11.4 LQF_RR: Longest Queue First and Round-Robin Scheduling in CIXB-1 -- 11.5 MCBF: Most Critical Buffer First Scheduling -- 12 CLOS-NETWORK SWITCHES -- 12.1 Routing Property of Clos Network Switches -- 12.2 Looping Algorithm -- 12.3 m-Matching Algorithm -- 12.4 Euler Partition Algorithm -- 12.5 Karol's Algorithm -- 12.6 Frame-Based Matching Algorithm for Clos Network (f-MAC) -- 12.7 Concurrent Matching Algorithm for Clos Network (c-MAC) -- 12.8 Dual-Level Matching Algorithm for Clos Network (d-MAC) -- 12.9 The ATLANTA Switch -- 12.10 Concurrent Round-Robin Dispatching (CRRD) Scheme -- 12.11 The Path Switch -- 13 MULTI-PLANE MULTI-STAGE BUFFERED SWITCH -- 13.1 TrueWay Switch Architecture -- 13.2 Packet Scheduling -- 13.3 Stage-To-Stage Flow Control -- 13.4 Port-To-Port Flow Control -- 13.5 Performance Analysis -- 13.6 Prototype -- 14 LOAD-BALANCED SWITCHES -- 14.1 Birkhoff-Von Neumann Switch -- 14.2 Load-Balanced Birkhoff-von Neumann Switches -- 14.3 Load-Balanced Birkhoff-von Neumann SwitchesWith FIFO Service -- 15 OPTICAL PACKET SWITCHES -- 15.1 Opto-Electronic Packet Switches -- 15.2 Optoelectronic Packet Switch Case Study I -- 15.3 Optoelectronic Packet Switch Case Study II -- 15.4 All Optical Packet Switches -- 15.5 Optical Packet Switch with Shared Fiber Delay Lines Single-stage Case -- 15.6 All Optical Packet Switch with Shared Fiber Delay Lines - Three Stage Case -- 16 HIGH-SPEED ROUTER CHIP SET -- 16.1 Network Processors (NPs) -- 16.2 Co-Processors for Packet Classification -- 16.3 Traffic Management Chips -- 16.4 Switching Fabric Chips -- INDEX. |
Record Nr. | UNINA-9910830119503321 |
Chao H. Jonathan <1955->
![]() |
||
Hoboken, New Jersey : , : Wiley-Interscience, , c2007 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|