Sciweavers

50 search results - page 8 / 10
» An Algorithm for Node-Capacitated Ring Routing
Sort
View
JSAC
2006
157views more  JSAC 2006»
13 years 7 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
SI3D
1992
ACM
13 years 11 months ago
Interactive Volume Rendering on a Multicomputer
Direct volume rendering is a computationally intensive operation that has become a valued and often preferred visualization tool. For maximal data comprehension, interactive manip...
Ulrich Neumann
NETWORKING
2010
13 years 9 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
14 years 1 months ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
INFOCOM
2003
IEEE
14 years 27 days ago
Non-Uniform Waveband Hierarchy in Hybrid Optical Networks
Abstract— Aggregation of individual wavelengths into wavebands for their subsequent switching and routing as a single group is an attractive way for scalable and cost-efficient ...
Rauf Izmailov, Samrat Ganguly, Viktor Kleptsyn, Ai...