Atjaunināt sīkdatņu piekrišanu

E-grāmata: Dissemination of Information in Optical Networks:: From Technology to Algorithms

  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

Optical networks and the related technologies, network management software and services have undergone remarkable developments, and such networks are now the ultra-high-speed backbone networks for communication. Wavelength-Division Multiplexing (WDM), the ability to support multiple communication pathways over the same fiber, enables efficient use of the enormous capability for data communication of optical networks. This book gives a broad overview of techniques used in the design of WDM networks for efficient dissemination of information in computer networks. It starts with an overview of the hardware components, then provides a thorough review of WDM, wavelength-routed networks, algorithms for route and wavelength assignment, design of broadcast and select networks, logical topology design, and techniques to handle faults and algorithms for efficient use of optical networks. Each topic has been covered rigorously with emphasis on detailed explanations of the approaches used, starting from the fundamentals up to the state of the art. The optimization techniques covered in the book include graph-theoretic algorithms, mixed-integer linear programming and heuristics. The book is intended for beginners as well as for specialists, and the reader should be able to design WDM networks and follow developments in the field. Each chapter contains a detailed, annotated bibliography. There are numerous exercises for the reader to test understanding of the subject, while readers unfamiliar with mathematical programming techniques and network flow optimization are offered short, easy-to-understand appendices at the end of the book.

This book offers a broad overview of techniques used in the design of Wavelength Division Multiplexing (WDM) networks for efficient dissemination of information in computer networks. It starts with an overview of the hardware components then provides a thorough review of WDM. Each topic is covered rigorously with emphasis on detailed explanations of the approaches used. Numerous exercises are included.
Introduction to Optical Networks
1(15)
What Is an Optical Network
1(6)
Important Advantages of WDM Optical Networks
2(1)
Key Terminology in WDM Optical Networks
2(3)
Data Communication in a WDM Optical Network
5(2)
Categorizations of WDM Networks
7(2)
Broadcasting Networks and Wavelength-Routed Networks
7(1)
Static and Dynamic Lightpath Allocation
8(1)
Single-hop and Multi-hop WDM Networks
9(1)
Important Problems in WDM Networks and Solution Approaches
9(1)
A Typical Problem in Multi-hop Wavelength-Routed Network Design
10(3)
Structure of the Book
13(2)
Introduction to Optical Technology
15(20)
Optical Fiber
15(2)
Optical Communication Fundamentals
17(3)
Optical Devices
20(13)
Optical Transmitters, Modulators, and Receivers
20(1)
Optical Couplers
21(2)
Optical Filters and Switches
23(1)
Multiplexers, Demultiplexers, and Cross-connect Switches
24(3)
Add-Drop Multiplexers and Optical Line Terminals
27(2)
Wavelength Converters
29(4)
Bibliographic Notes
33(2)
WDM Network Design
35(28)
Broadcast-and-Select Networks
35(3)
Wavelength-Routed Networks
38(8)
Advantages of Second-Generation WDM Networks
42(3)
Single-hop and Multi-hop Networks
45(1)
Route and Wavelength Assignment Problem in WDM Networks
46(2)
Static and Dynamic Lightpath Allocation
46(2)
Wavelength-Convertible Networks
48(8)
Bibliographic Notes
56(7)
Wavelength-Convertible Networks
57(1)
Light-Trail Networks
58(1)
Burst Switching Networks
58(1)
Multicasting Networks
59(4)
Route and Wavelength Assignment (RWA) I
63(24)
RWA as a Graph Coloring Problem
63(4)
Congestion and Its Relationship to Chromatic Number
67(1)
Greedy Heuristics for the RWA Problem
68(3)
A Greedy Heuristic for the RWA Problem
68(2)
An Improved Greedy Heuristic for the RWA Problem
70(1)
Specific Networks
71(7)
The Bidirectional Path
71(2)
The Bidirectional Ring
73(3)
Trees
76(2)
Specific Instances
78(2)
One-to-All Communication
78(2)
All-to-All Communication
80(1)
Bibliographic Notes
80(7)
One-to-Many and All-to-All Communication
81(1)
Permutations
82(1)
Miscellaneous
83(4)
Route and Wavelength Assignment (RWA) II
87(36)
Off-line Route and Wavelength Assignment
88(7)
Exact Solution of the RWA Problem in Networks with Full Wavelength Converters
88(4)
Exact Solution of the RWA Problem in Networks Without Wavelength Converters
92(3)
Route and Wavelength Assignment in a Bidirectional Ring
95(3)
A Heuristic for Route and Wavelength Assignment
98(3)
Dynamic Route and Wavelength Assignment
101(14)
Dynamic Routing Using a Central Agent
104(3)
Dynamic Routing Using a Distributed Algorithm
107(8)
Bibliographic Notes
115(8)
Sparse Wavelength Conversion and RWA
117(1)
Limited Wavelength Conversion and RWA
118(1)
Placement of Wavelength Converters
119(1)
Multi-fiber Networks
120(3)
Logical Topology Design I
123(14)
A Scalable Topology Based on the de Bruijn Graph
125(4)
The Topology of the Network
127(2)
Addition of an End node to an Existing Network
129(2)
A Routing Scheme for This Topology
131(3)
Bibliographic Notes
134(3)
Logical Topology Design II
137(28)
MILP-Based Solution of the Logical Topology Design and the Routing Problem
139(4)
A Heuristic for Determining the Logical Topology
143(3)
Routing in Wavelength-Routed Networks Viewed as an MCNF Problem
146(1)
Routing in Small- and Medium-Sized Networks
147(2)
Routing in Large Networks
149(13)
The Arc-Chain Representation
150(1)
An LP for the Routing Problem Using the Arc-Chain Representation
151(3)
Solving the LP Specified Using the Arc-Chain Representation
154(8)
Bibliographic Notes
162(3)
Faults in Optical Networks
165(48)
Categorization of Faults
169(4)
Important Problems in Protection and Restoration
173(3)
Schemes for Handling Faults
176(26)
1:1 Path Protection in Wavelength-Convertible Networks Using Static Allocation
177(2)
Dynamic Wavelength Allocation with Wavelength Continuity Constraint
179(6)
Utilizing the Channels Used by Backup Paths When There Is No Fault in the Network
185(3)
1:N Protection Using Static Allocation with Wavelength Continuity Constraint
188(11)
Restoration in Networks That Support Dynamic Lightpath Allocation
199(3)
Bibliographic Notes
202(11)
Review Papers on Fault
202(1)
Link and Path Protection Schemes
203(2)
Schemes for Restoration
205(1)
Attacks on All-Optical Networks
206(1)
Reducing the Overhead for Fault Tolerance
206(2)
Handling Multiple Faults
208(2)
Survivable Routing
210(1)
Miscellaneous Topics
210(3)
Traffic Grooming
213(32)
Static Traffic Grooming
219(10)
Problem 1
219(4)
Problem 2
223(4)
A Heuristic for Static Traffic Grooming
227(2)
Dynamic Traffic Grooming
229(8)
A Graph Model for a Network Supporting Dynamic Traffic Grooming
230(5)
Algorithms for Supporting Dynamic Traffic Grooming
235(2)
Bibliographic Notes
237(8)
Books and Surveys on Traffic Grooming
237(1)
Traffic Grooming on Rings
238(1)
Traffic Grooming Strategies
238(3)
Fault-Tolerant Traffic Grooming
241(4)
Appendix 1: Linear Programming in a Nutshell 245(4)
Appendix 2: The de Bruijn Graph 249(4)
Appendix 3: Network Flow Programming 253(8)
References 261(28)
List of Symbols Used 289(12)
Index 301