Sciweavers

581 search results - page 13 / 117
» Approximation algorithms for constructing wavelength routing...
Sort
View
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 7 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
ISAAC
2003
Springer
92views Algorithms» more  ISAAC 2003»
15 years 6 months ago
Wavelength Conversion in Shortest-Path All-Optical Networks
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
Thomas Erlebach, Stamatis Stefanakos
INFOCOM
2011
IEEE
14 years 5 months ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...
NETWORKING
2010
15 years 2 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...
ICC
2009
IEEE
140views Communications» more  ICC 2009»
14 years 11 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...