Paper Info
Title
Path selection in user-controlled circuit-switched optical networks
Abstract
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we consider the resource allocation challenges that arise in such networks, in particular problems related to construction of end-to-end lightpaths for carrying large multimedia streams. Specifically, we discuss variations of the least cost and widest path problems that address two unique aspects of the user-controlled environment. First, since network resources are exposed for user-control using a service-oriented software control plane, each lightpath is subject to an expiry time. Second, because Wavelength Division Multiplexing (WDM) and resource partitioning introduces multiple redundant paths, classic least cost path computations tend to yield multiple optimal solutions, and so it is useful to break ties among these in a judicious manner. We present polynomial-time path selection techniques that address these issues using efficient data structures. We also show the benefit of breaking ties in shortest path computations in a manner that reduces harmful fragmentation of capacity.
Year
DOI
Venue
2008
10.1016/j.osn.2008.02.001
Optical Switching and Networking
Keywords
Field
DocType
Path selection,Widest path problem,User-controlled networks,Optical networks
Wavelength-division multiplexing,Data structure,Online community,Circuit switching,Shortest path problem,Computer science,Computer network,Resource allocation,Widest path problem,Distributed computing,Computation
Journal
Volume
Issue
ISSN
5
2-3
1573-4277
Citations 
PageRank 
References 
4
0.42
0
Authors
2
Name
Order
Citations
PageRank
Wojciech Golab121017.22
Raouf Boutaba26453404.30