Opportunity cost analysis for dynamic wavelength routed mesh networks

Authors:
Xiaolan Joy Zhang;Sun-Il Kim;Steven S. Lumetta
Affiliations:
Coordinated Science Laboratory, Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Electrical and Computer Systems Engineering, University of Alaska Anchorage, Anchorage, AK;Coordinated Science Laboratory, Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 8
Cited 0

Load-sensitive routing of long-lived IP flows

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Dynamic routing and resource allocation in WDM transport network

Computer Networks: The International Journal of Computer and Telecommunications Networking
Static and dynamic approaches to modeling end-to-end routing in circuit-switched networks

IEEE/ACM Transactions on Networking (TON)
Routing and Admission Control in General Topology Networks

Routing and Admission Control in General Topology Networks
Fixed point approximation for multirate multihop loss networks with state-dependent routing

IEEE/ACM Transactions on Networking (TON)
Blocking analysis of dynamic traffic grooming in mesh WDM optical networks

IEEE/ACM Transactions on Networking (TON)
Dynamic routing of connections with known duration in WDM networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optical backbone networks are becoming increasingly intelligent and flexible. These networks are able to establish high-bandwidth wavelength connections on-demand to support future network-centric applications. Choosing an efficient path in a timely manner, while considering important criteria such as operation costs and network performance, is a key problem confronting the network operators. Subtle path preferences of different dynamic routing algorithms (which are usually ignored by traditional analysis techniques) can make a significant difference in performance on mesh networks. It opens new research to advance routing algorithms in both analysis and implementation paradigms. In this paper, we propose an opportunity cost model that provides fast and accurate analysis for threshold-based online congestion-aware routing algorithms. The model is simple to compute, robust to different network topologies, and scalable. We show that our model further aids in the design of a number of new routing algorithms that can be easily applied to practical networks. In contrast to previous work, the optimal threshold values for our algorithms can be identified analytically, and the values sustain good performance on different network topologies and sizes.