WDM Optical Network Design- Using Limited Traffic Grooming Resources - Softcover

Awwad, Osama

 
9783836434362: WDM Optical Network Design- Using Limited Traffic Grooming Resources
Softcover
ISBN 10: 3836434369 ISBN 13: 9783836434362
Verlag: VDM Verlag Dr. Mueller e.K., 2007

Inhaltsangabe

While a single fiber strand in wavelength division multiplexing (WDM) hasover a terabit-per-second bandwidth and a wavelength channel has over agigabit-per-second transmission speed, the network may still be required tosupport traffic requests at rates that are lower than the full wavelength capacity.To avoid assigning an entire lightpath to a small request, many researchershave looked at adding traffic grooming to the routing and wavelengthassignment (RWA) problem. In this work, we consider the RWA problem withtraffic grooming (GRWA) for mesh networks under static and dynamic lightpathconnection requests. The GRWA problem is NP-Complete since it is ageneralization of the RWA problem which is known to be NP-Complete. Wepropose an integer linear programming (ILP) model that accurately depictsthe GRWA problem. Because it is very hard to find a solution for large networksusing ILP, we solve the GRWA problem by proposing two novel heuristics.The strength of the proposed heuristics stems from their simplicity, efficiencyand applicability to large-scale networks.The book is addressed to professionals in optical communcation networks likeprofessors, students and engineers.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

While a single fiber strand in wavelength division multiplexing (WDM) has over a terabit-per-second bandwidth and a wavelength channel has over a gigabit-per-second transmission speed, the network may still be required to support traffic requests at rates that are lower than the full wavelength capacity. To avoid assigning an entire lightpath to a small request, many researchers have looked at adding traffic grooming to the routing and wavelength assignment (RWA) problem. In this work, we consider the RWA problem with traffic grooming (GRWA) for mesh networks under static and dynamic lightpath connection requests. The GRWA problem is NP-Complete since it is a generalization of the RWA problem which is known to be NP-Complete. We propose an integer linear programming (ILP) model that accurately depicts the GRWA problem. Because it is very hard to find a solution for large networks using ILP, we solve the GRWA problem by proposing two novel heuristics. The strength of the proposed heuristics stems from their simplicity, efficiency and applicability to large-scale networks. The book is addressed to professionals in optical communcation networks like professors, students and engineers.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
VDM Verlag Dr. Mueller e.K.
Erscheinungsdatum
2007
Sprache
Englisch
ISBN 10 
3836434369
ISBN 13 
9783836434362
Einband
Tapa blanda
Anzahl der Seiten
88
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar

Weitere beliebte Ausgaben desselben Titels

9783639425215: WDM Optical Network Design: Using limited traffic grooming resources

Vorgestellte Ausgabe

ISBN 10:  3639425219 ISBN 13:  9783639425215
Verlag: AV Akademikerverlag, 2012
Softcover