On M-concurrency path computation and its application in dynamic service Multi-Layer Networks

Author

Yang, Xi ; Lehman, Tom ; Ogaki, Kenichi ; Tsurusawa, Munefumi

Author_Institution

USC/ISI East, Arlington, VA, USA

fYear

2010

fDate

1-3 Feb. 2010

Firstpage

1

Lastpage

6

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.

Keywords

concurrency theory; optical fibre networks; optimisation; M-concurrency path computation; dynamic service multi-layer networks; dynamic service provisioning optimization; packet optical transport networks; Computer applications; Computer architecture; Computer networks; Concurrent computing; Dynamic scheduling; Optical computing; Optical fiber networks; Processor scheduling; Telecommunication traffic; Traffic control; Concurrent Path Computation; Dynamic Optimization; Dynamic Service; IP-over-WDM Network; Multi-Layer Network (MLN); Packet Optical Transport Network (P-OTN); Path Computation Element (PCE);

fLanguage

English

Publisher

ieee

Conference_Titel

Optical Network Design and Modeling (ONDM), 2010 14th Conference on

Conference_Location

Kyoto

Print_ISBN

978-1-4244-5973-5

Electronic_ISBN

978-3-901882-40-1

Type

conf

DOI

10.1109/ONDM.2010.5431573

Filename

5431573