On the efficiency of dynamic routing of connections with known duration
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Dynamic lightpath establishment in wavelength routed WDM networks
IEEE Communications Magazine
Computing approximate blocking probabilities for a class of all-optical networks
IEEE Journal on Selected Areas in Communications
Network Dimensioning under Scheduled and Random Lightpath Demands in All-Optical WDM Networks
IEEE Journal on Selected Areas in Communications - Part Supplement
Opportunity cost analysis for dynamic wavelength routed mesh networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Recently, new solutions for automatized management in optical networks promise to allow customers to specify on-demand the terms of the Service Level Agreement (SLA) to be guaranteed by the service provider. In this paper we show that is possible to design a highly efficient load balancing algorithm, called RABBIT, for the dynamic provisioning of connections exploiting the knowledge, among the other Service Level Specifications (SLS), of the connections duration. The core idea of RABBIT consists in routing connections based on the transient probability of future-link congestion, that can be estimated with higher precision when the knowledge of connections durations is given. So, we introduce a time-dependent link-weight assignment that evaluates future link congestions probability based on the transient analysis of the Markovian model of the link, making it computationally feasible by means of an effective approximation technique. By means of an extensive set of simulative experiments, we compare our approach to other traditional holding-time agnostic, yet efficient, dynamic routing algorithms. We consider different performance metrics, among which the Blocking Probability (BP), in a wavelength-convertible WDM mesh network scenario. For a typical US nationwide network, RABBIT obtains savings on BP of up to 20% for practical scenarios.