Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Empirically derived analytic models of wide-area TCP connections
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
The changing nature of network traffic: scaling phenomena
ACM SIGCOMM Computer Communication Review
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
A faster and simpler fully dynamic transitive closure
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Virtual-topology adaptation for WDM mesh networks under dynamic traffic
IEEE/ACM Transactions on Networking (TON)
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Data-intensive e-science frontier research
Communications of the ACM - Blueprint for the future of high-performance networking
Customer-managed end-to-end lightpath provisioning
International Journal of Network Management
Eucalyptus: intelligent infrastructure enabled participatory design studio
Proceedings of the 38th conference on Winter simulation
Improved Dynamic Reachability Algorithms for Directed Graphs
SIAM Journal on Computing
Dynamic paths in multi-domain optical networks for grids
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
Constraint-based routing in the internet: Basic principles and recent research
IEEE Communications Surveys & Tutorials
The optical network control plane: state of the standards and deployment
IEEE Communications Magazine
Lightpaths on demand: a Web-services-based management system
IEEE Communications Magazine
IEEE Network: The Magazine of Global Internetworking
Decentralized management of bi-modal network resources in a distributed stream processing platform
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
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.