Worst-case analysis of dynamic wavelength allocation in optical networks
IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms
Architectural study of high-speed networks with optical bypassing
Architectural study of high-speed networks with optical bypassing
Dynamic wavelength assignment for WDM all-optical tree networks
IEEE/ACM Transactions on Networking (TON)
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks
IEEE/ACM Transactions on Networking (TON)
Scheduling algorithms for throughput maximization in data networks
Scheduling algorithms for throughput maximization in data networks
On the stability of isolated and interconnected input-queueing switches under multiclass traffic
IEEE Transactions on Information Theory
IEEE Communications Magazine
Labeled optical burst switching for IP-over-WDM integration
IEEE Communications Magazine
A simple dynamic integrated provisioning/protection scheme in IP over WDM networks
IEEE Communications Magazine
IEEE Communications Magazine
Dynamic routing and wavelength assignment with optical bypass using ring embeddings
Optical Switching and Networking
QoS performance of optical burst switching in IP-over-WDM networks
IEEE Journal on Selected Areas in Communications
Fault management in IP-over-WDM networks: WDM protection versus IP restoration
IEEE Journal on Selected Areas in Communications
Efficient routing and wavelength assignment for reconfigurable WDM networks
IEEE Journal on Selected Areas in Communications
Advances in the management and control of optical Internet
IEEE Journal on Selected Areas in Communications
Scheduling algorithms for optical packet fabrics
IEEE Journal on Selected Areas in Communications
Scheduling bursts in time-domain wavelength interleaved networks
IEEE Journal on Selected Areas in Communications
IP restoration vs. WDM protection: is there an optimal choice?
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
We study the maximum throughput properties of dynamically reconfigurable optical network architectures having wavelength and port constraints. Using stability as the throughput performance metric, we outline the single-hop and multi-hop stability regions of the network. Our analysis of the stability regions is a generalization of the BvN decomposition technique that has been so effective at expressing any stabilizable rate matrix for input-queued switches as a convex combination of service configurations. We consider generalized decompositions for physical topologies with wavelength and port constraints. For the case of a single wavelength per optical fiber, we link the decomposition problem to a corresponding Routing and Wavelength Assignment (RWA) problem. We characterize the stability region of the reconfigurable network, employing both single-hop and multi-hop routing, in terms of the RWA problem applied to the same physical topology. We derive expressions for two geometric properties of the stability region: maximum stabilizable uniform arrival rate and maximum scaled doubly substochastic region. These geometric properties provide a measure of the performance gap between a network having a single wavelength per optical fiber and its wavelength-unconstrained version. They also provide a measure of the performance gap between algorithms employing single-hop versus multi-hop electronic routing in coordination with WDM reconfiguration.