On M-concurrency path computation and its application in dynamic service multi-layer networks

Authors:
Xi Yang;Tom Lehman;Kenichi Ogaki;Munefumi Tsurusawa
Affiliations:
USC/ISI East, Arlington, VA;USC/ISI East, Arlington, VA;KDDI R&D Laboratories, Inc., Fujimino, Saitama, Japan;KDDI R&D Laboratories, Inc., Fujimino, Saitama, Japan
Venue:
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Year:
2010

Citing 8
Cited 0

Tabu Search

Tabu Search
Dynamic Online Routing Algorithm for MPLS Traffic Engineering

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
A study on cross-layer multi-constraint path computation for IP-over-optical networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Dynamic multilayer routing schemes in GMPLS-based IP+optical networks

IEEE Communications Magazine
DRAGON: a framework for service provisioning in heterogeneous grid networks

IEEE Communications Magazine
Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking
Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.01

Visualization

Abstract

Dynamic path computation and optimization is very challenging for emerging Multi-Layer Networks (MLN), typically Packet Optical Transport Networks (P-OTN). In this work, we propose to address a category of dynamic optimization problems in MLNs by using an M-concurrency path computation approach. By leveraging our previous work in single path computation solutions for MLNs, we design an efficient M-concurrency path computation heuristic to optimize dynamic service provisioning. Based on this base solution, we develop optimization schemes to address two realistic application problems: 1) dynamic optimization for service reprovisioning and 2) dynamic optimization for mixed scheduling and immediate requests. Experimental results are presented for performance evaluation and comparison of the investigated optimization solutions and schemes.