A Maxmin Routing Algorithm for Dense Wavelength Division Multiplexing Networks

A Maxmin Routing Algorithm for Dense Wavelength Division Multiplexing Networks

In this paper, we present an algorithm to solve the routing problem for wavelength division multiplexing networks. We use the discrete maxmin fairness as the routing metric. First we use this algorithm to solve routing problem. After we get paths for all flows in the network, we use another algorith...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yunyun Yang, Wei Kang Tsai
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithm design and analysis
Internet
Network topology
Optical fiber networks
Routing protocols
Telecommunication traffic
Testing
Wavelength assignment
Wavelength division multiplexing
Wavelength routing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we present an algorithm to solve the routing problem for wavelength division multiplexing networks. We use the discrete maxmin fairness as the routing metric. First we use this algorithm to solve routing problem. After we get paths for all flows in the network, we use another algorithm d-CPG, to assign discrete maxmin rates for these flows. We test our algorithm by using the National LambdaRail network topology.
DOI:10.1109/ICCT.2006.341804