Sciweavers

211 search results - page 24 / 43
» Inter-Domain Routing in Optical Networks
Sort
View
SPAA
2003
ACM
14 years 20 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
ICC
2007
IEEE
123views Communications» more  ICC 2007»
14 years 1 months ago
An Analytical Model for Wavelength-Convertible Optical Networks
Abstract— In this paper, we have proposed an analytical model for optical networks with full wavelength conversion at the nodes. We have derived an analytical expression to compu...
Pachamuthu Rajalakshmi, Ashok Jhunjhunwala
BROADNETS
2007
IEEE
14 years 1 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
ICNS
2006
IEEE
14 years 1 months ago
Anycast Algorithms Supporting Optical Burst Switched Grid Networks
— In this paper we consider implementing optical burst switching as a technology for building Grids with computationally intensive requirements. This architecture has been referr...
Marc De Leenheer, Farid Farahmand, Kejie Lu, Tao Z...
GLOBECOM
2009
IEEE
13 years 11 months ago
Power Efficient Traffic Grooming in Optical WDM Networks
Abstract--Power-awareness in networking attracts more attention as the trends in the energy consumption of the Internet raise growing concerns about the environmental impacts and s...
Emre Yetginer, George N. Rouskas