Sciweavers

1798 search results - page 80 / 360
» A Tree for All Seasons
Sort
View
IPTPS
2005
Springer
14 years 2 months ago
Chainsaw: Eliminating Trees from Overlay Multicast
In this paper, we present Chainsaw, a p2p overlay multicast system that completely eliminates trees. Peers are notified of new packets by their neighbors and must explicitly requ...
Vinay S. Pai, Kapil Kumar, Karthik Tamilmani, Vina...
INFOCOM
2003
IEEE
14 years 2 months ago
Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations
— Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all...
Arindam Kumar Das
COCOON
1999
Springer
14 years 1 months ago
Multi-coloring Trees
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
Magnús M. Halldórsson, Guy Kortsarz,...
BROADCOM
2008
IEEE
13 years 11 months ago
Tree Based Flooding Protocol for Multi-hop Wireless Networks
In this paper we propose and analyze an efficient flooding technique for static multi-hop wireless networks. The protocol builds up a routing tree that connects all network nodes....
Raphael Frank, Thomas Scherer, Thomas Engel
CCCG
2008
13 years 10 months ago
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
Christian Wulff-Nilsen