Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios

P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.

Download
Restricted underlayMod2.pdf 717.33 KB
Report
Author
;
Department
Abstract
Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to setup a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known by the RWA algorithm. Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parameters only known at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason a RWA algorithm is needed which involves its users in the preemption decisions. We present a family of preemptive RWA algorithms for WDM networks. These algorithms have two distinguishing features: a) they can handle dynamic traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration decisions and thus influence the preemption decision of the RWA algorithm, leading to networks which adapt directly to application needs. This is different from traffic engineering where the network is (slowly) adapted to observed traffic patterns. Our algorithms handle various WDM network configurations including networks consisting of heterogeneous WDM hardware. To this end, we are using the layered graph approach together with a newly developed graph model that is used to determine conflicting lightpaths.
Publishing Year
LibreCat-ID

Cite this

Wette P, Karl H. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn; 2012.
Wette, P., & Karl, H. (2012). Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios. Universität Paderborn.
@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }
Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn, 2012.
P. Wette and H. Karl, Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios. Universität Paderborn, 2012.
Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn, 2012.
Main File(s)
File Name
underlayMod2.pdf 717.33 KB
Access Level
Restricted Closed Access
Last Uploaded
2018-03-09T09:57:26Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar