Dynamic preemptive multi-class routing scheme under dynamic traffic in survivable WDM mesh networks

Authors:
Xuetao Wei;Lemin Li;Hongfang Yu;Du Xu
Affiliations:
Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu, China;Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu, China;Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu, China;Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu, China
Venue:
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Year:
2007

Citing 5
Cited 3

Dynamic routing and resource allocation in WDM transport network

Computer Networks: The International Journal of Computer and Telecommunications Networking
Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints

IEEE/ACM Transactions on Networking (TON)
Surviving Multiple Network Failures Using Shared Backup Path Protection

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Optical layer survivability: a services perspective

IEEE Communications Magazine
Optical layer survivability-an implementation perspective

IEEE Journal on Selected Areas in Communications

Multi-path routing in Spatial Wireless Ad Hoc networks

Computers and Electrical Engineering
Joint scheduling and routing algorithm with load balancing in wireless mesh network

Computers and Electrical Engineering
Dynamic hybrid grooming based on power efficiency in green IP over WDM networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A large-scale optical network will carry various traffic classes with different fault-tolerance requirements. Several previous papers suggest a preemptive multi-class routing scheme. They have proposed Integer Linear Programming (ILP) formulations to implement this routing scheme and simulate it under the assumption that the traffic holding on the network will not depart. However, in the real world, most of the traffic is the dynamic traffic: the traffic holding on the network will leave at the end of connection holding time. In this paper, we propose a detailed algorithm for Dynamic Preemptive Multi-class Routing (DPMR) scheme under dynamic traffic pattern. Furthermore, we compare DPMR scheme with DPP (Dedicated Path Protection) and SPP (Shared Path Protection), and evaluate their performances from resource utilization ratio and blocking probability. In addition, we propose a modified link cost function for Dynamic Preemptive Multi-class Routing scheme to find the routes.