Sciweavers

272 search results - page 45 / 55
» On properties of multicast routing trees
Sort
View
SPAA
1996
ACM
13 years 11 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
INFOCOM
2006
IEEE
14 years 1 months ago
Path Protection Routing with SRLG Constraints to Support IPTV in WDM Mesh Networks
— The distribution of broadcast TV across large provider networks has become a highly topical subject as satellite distribution capacity exhausts and competitive pressures increa...
Meeyoung Cha, Wanpracha Art Chaovalitwongse, Zihui...
PODC
2004
ACM
14 years 29 days ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
INFOCOM
1999
IEEE
13 years 12 months ago
A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks
We present, prove correctness for, and evaluate a protocol for the reliable broadcast of topology and link-state information in a multihop communication network with a dynamic topo...
Bhargav R. Bellur, Richard G. Ogier
AINA
2008
IEEE
13 years 9 months ago
Flexible Address Configurations for Tree-Based ZigBee/IEEE 802.15.4 Wireless Networks
A number of IEEE 802.15.4 devices can be connected by a tree topology as proposed by ZigBee specification. Address configuration in tree-based ZigBee networks needs to assign ever...
Li-Hsing Yen, Wei-Ting Tsai