Sciweavers

298 search results - page 52 / 60
» Multicriteria Steiner Tree Problem for Communication Network
Sort
View
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 1 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
FOCS
1995
IEEE
14 years 1 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
INFOCOM
1998
IEEE
14 years 2 months ago
Active Reliable Multicast
Abstract--This paper presents a novel loss recovery scheme, Active Reliable Multicast (ARM), for large-scale reliable multicast. ARM is "active" in that routers in the mu...
Li-Wei H. Lehman, Stephen J. Garland, David L. Ten...
NOMS
2008
IEEE
14 years 4 months ago
Host-aware routing in multicast overlay backbone
— To support large-scale Internet-based broadcast of live streaming video efficiently in content delivery networks (CDNs), it is essential to implement a cost-effective overlay ...
Jun Guo, Sanjay Jha