Sciweavers

581 search results - page 31 / 117
» Approximation algorithms for constructing wavelength routing...
Sort
View
WDAG
2005
Springer
102views Algorithms» more  WDAG 2005»
15 years 6 months ago
Papillon: Greedy Routing in Rings
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku
ADHOCNOW
2005
Springer
15 years 7 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
15 years 8 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
PDPTA
2007
15 years 2 months ago
Scalable Overlay Multicast Tree Construction for Media Streaming
Overlay networks have become popular in recent times for content distribution and end-system multicasting of media streams. In the latter case, the motivation is based on the lack...
Gabriel Parmer, Richard West, Gerald Fry
MOBIHOC
2004
ACM
15 years 6 months ago
Antenna orientation optimization for minimum-energy multicast tree construction in wireless ad hoc networks with directional ant
Energy conservation is a critical issue in wireless ad hoc networks since batteries are the only energy source to power the nodes. One major metric for energy conservation is to r...
Song Guo, Oliver W. W. Yang