New dynamic network design and provisioning algorithms for broadband connection services considering fairness

We propose novel dynamic network control algorithms that reduce the blocking probability for dynamic bandwidth service provisioning. The expected network services include on-demand broad bandwidth provisioning services and layer one VPN. The important service attribute of fairness in terms of path length is effectively achieved by introducing a simple weighting function that considers path length and link utilizations of intermediate links of candidate paths. The algorithm achieves enhanced network utilization by rerouting existing paths to alternative routes without disruption. Numerical examples demonstrate that the developed algorithms attain not only a high degree of fairness but also low service blocking probability.

[1]  Byrav Ramamurthy,et al.  Rerouting schemes for dynamic traffic grooming in optical WDM networks , 2008, Comput. Networks.

[2]  R. Jain Throughput fairness index : An explanation , 1999 .

[3]  Eric Wing Ming Wong,et al.  Analysis of rerouting in circuit-switched networks , 2000, TNET.

[4]  R. Kline,et al.  Metro WDM networks develop an edge , 2006, 2006 Optical Fiber Communication Conference and the National Fiber Optic Engineers Conference.

[5]  Byrav Ramamurthy,et al.  Rerouting schemes for dynamic traffic grooming in optical WDM mesh networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[6]  M. Ackroyd Call Repacking in Connecting Networks , 1979, IEEE Trans. Commun..

[7]  Biswanath Mukherjee,et al.  Dynamic lightpath establishment in wavelength-routed WDM networks , 2001, IEEE Commun. Mag..

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  K. Lee,et al.  A wavelength rerouting algorithm in wide-area all-optical networks , 1996 .

[10]  Yoshihiko Uematsu,et al.  Route diversity with hitless path switching , 1994 .

[11]  Hiroshi Hasegawa,et al.  Quasi-Dynamic Network Design Considering Different Service Holding Times , 2008, IEEE Journal on Selected Areas in Communications.

[12]  Gurusamy Mohan,et al.  A time optimal wavelength rerouting algorithm for dynamic traffic in WDM networks , 1999 .

[13]  Lily Chen,et al.  Deployment of Carrier-Grade Bandwidth-on-Demand Services over Optical Transport Networks: A Verizon Experience , 2007, OFC/NFOEC 2007 - 2007 Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference.

[14]  D. Brown,et al.  Next Generation Optical Network - Enabling Dynamic Bandwidth Services , 2007, OFC/NFOEC 2007 - 2007 Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference.

[15]  Eric Wing Ming Wong,et al.  A taxonomy of rerouting in circuit-switched networks , 1999, IEEE Commun. Mag..

[16]  Hiroshi Hasegawa,et al.  An RWA algorithm for OBS networks based on iterative local optimization of total blocking probability , 2007, SPIE/OSA/IEEE Asia Communications and Photonics.

[17]  Takashi Kurimoto,et al.  Demonstration of PCE-controlled dynamic traffic engineering for GMPLS-based multilayer service network , 2005 .

[18]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[19]  Xiang-Yang Li,et al.  A Study of Lightpath Rerouting Schemes in Wavelength-Routed WDM Networks , 2007, 2007 IEEE International Conference on Communications.

[20]  S. Hurtubise,et al.  Dynamic Routing and Call Repacking in Circuit-Switched Networks , 1983, IEEE Trans. Commun..