Optical networks and components : fundamentals and advances. Volume II, Advances in optical networks and components /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Sahu, Partha Pratim (Writer on optical networks) (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Boca Raton, FL : CRC Press, 2020.
Edición:First edition.
Temas:
Optical fiber communication.
Computer networks.
Télécommunications par fibres optiques.
Réseaux d'ordinateurs.
Computer networks
Optical fiber communication
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Cover
  • Half Title
  • Title Page
  • Copyright Page
  • Dedication
  • Table of Contents
  • Preface
  • Acknowledgments
  • Author
  • Chapter 1 Optical Ring Metropolitan Area Networks
  • 1.1 Different MANs
  • 1.2 Metro WDM Networks
  • 1.2.1 WDM Ring Networks for MAN
  • 1.2.2 Metro-Edge Technology
  • 1.2.3 Traffic Grooming in SONET Ring Networks
  • 1.2.3.1 Node Architecture
  • 1.2.3.2 Single-Hop Grooming in SONET/WDM Ring
  • 1.2.3.3 Multi-Hop Grooming in SONET/WDM Ring
  • 1.2.4 Dynamic Grooming in SONET/WDM Ring
  • 1.2.5 Grooming in Interconnected SONET/WDM Rings
  • 1.3 Traffic Grooming in WDM Ring Networks
  • 1.3.1 Problem Definition
  • 1.3.2 Mathematical Formulation of Single-Hop Connections
  • 1.3.3 Mathematical Formulation of Multi-hop Method
  • 1.3.4 Heuristics-Based Simulated Annealing Algorithm for Single Hop
  • 1.4 Interconnected WDM Ring Networks
  • 1.4.1 Interconnected Rings
  • 1.4.2 Traffic Grooming in Interconnected Rings
  • 1.5 Packet Communication using Tunable Wavelength ADMs
  • 1.5.1 Protocol
  • 1.5.2 Algorithm of Virtual Path Creation and Assigning Wavelengths
  • 1.5.3 Priority Schemes
  • 1.5.4 Packet-Selection Protocols
  • 1.5.5 Implementation of Algorithm
  • 1.6 Online Connection Provisioning using ROADMs
  • 1.6.1 Tuning Constraint
  • 1.6.2 Problem Statement
  • 1.6.3 Heuristics
  • 1.6.4 Comparison of Heuristics Schemes using Numerical Examples
  • Summary
  • Exercises
  • References
  • Chapter 2 Queuing System and Its Interconnection with Other Networks
  • 2.1 Queuing Models
  • 2.1.1 FCFS System
  • 2.1.2 Representation of Queue Models
  • 2.1.3 Random Variables and Parameters
  • 2.2 Queues
  • 2.2.1 M/M/1 Queues
  • 2.2.2 M/M/1/K Queues
  • 2.2.3 M/M/m Queues
  • 2.2.4 M/M/∞ Queue System
  • 2.2.5 M/M/m/m Queue System
  • 2.2.6 M/G/1 Queues
  • 2.2.7 M/G/1 Queues with Vacations
  • 2.3 Networks of Queues
  • 2.4 Time Reversibility
  • Burke's Theorem
  • 2.5 Interconnection with Other Networks
  • 2.5.1 Gateways
  • 2.5.2 Bridges
  • 2.5.2.1 Spanning Bridges
  • 2.5.2.2 Source Routing Bridges
  • 2.5.2.3 Quality of Bridge Services
  • 2.5.3 Routers
  • 2.5.4 Repeaters
  • Summary
  • Exercises
  • References
  • Chapter 3 Routing and Wavelength Assignment
  • 3.1 Light paths
  • 3.2 LP Formulation of RWA and Its Reduction
  • 3.2.1 Reduction of Size of LP Formulation
  • 3.2.2 Randomized Rounding
  • 3.2.3 Graph Coloring
  • 3.2.4 Analysis of ILP
  • 3.3 Routing
  • 3.3.1 Routing Algorithms
  • 3.3.1.1 Dijkstra's Algorithm
  • 3.3.1.2 Bellman-Ford Algorithm
  • 3.3.2 Routing Approaches
  • 3.3.2.1 Fixed Routing
  • 3.3.2.2 Fixed-Alternate Routing
  • 3.3.2.3 Flooding
  • 3.3.2.4 Adaptive Routing
  • 3.3.2.5 Fault-Tolerant Routing
  • 3.3.2.6 Randomized Routing
  • 3.4 WA Subproblem (Heuristics)
  • 3.4.1 Wavelength Search Algorithm
  • 3.4.1.1 Exhaustive Search
  • 3.4.1.2 Tabu Search
  • 3.4.1.3 Simulated Annealing
  • 3.4.1.4 Genetic Algorithms
  • 3.4.2 WA Heuristics
  • 3.4.2.1 Random WA (R)
  • 3.4.2.2 First-Fit (FF) Approach

Ejemplares similares