Valiant load-balanced robust routing algorithm for multi-granularity connection requests in traffic-grooming WDM mesh networks

Authors:
Xiaoning Zhang;Lemin Li;Sheng Wang;Fei Yang
Affiliations:
Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu 610054, China;Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu 610054, China;Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu 610054, China;Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu 610054, China
Venue:
Computer Communications
Year:
2007

Citing 10
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A flexible model for resource management in virtual private networks

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Algorithms for provisioning virtual private networks in the hose model

IEEE/ACM Transactions on Networking (TON)
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Designing a predictable internet backbone with valiant load-balancing

IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering

Computer Communications
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering

Computer Communications
Traffic grooming in WDM networks

IEEE Communications Magazine
Traffic grooming in an optical WDM mesh network

IEEE Journal on Selected Areas in Communications
Traffic grooming in WDM networks: past and future

IEEE Network: The Magazine of Global Internetworking

Multi-granularity and robust grooming in power- and port-cost-efficient IP over WDM networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.24

Visualization

Abstract

The paper considers the problem of establishing robust routes for multi-granularity connection requests in traffic-grooming WDM mesh networks and proposes a novel Valiant load-balanced robust routing scheme for the hose uncertain model. Our objective is to minimize the total network cost when construct the stable virtual topology that assure robust routing for all possible multi-granularity connection requests under the hose model. Since the optimization problem is shown to be NP-complete, two heuristic algorithms are proposed and evaluated. Finally we compare the traffic throughput of the virtual topology by Valiant load-balanced robust routing scheme with that of the traditional traffic-grooming algorithm under the same total network cost by computer simulation.