Sciweavers

1503 search results - page 39 / 301
» Self-optimizing distributed trees
Sort
View
CORR
2006
Springer
166views Education» more  CORR 2006»
13 years 9 months ago
Bounding the Bias of Tree-Like Sampling in IP Topologies
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
Reuven Cohen, Mira Gonen, Avishai Wool
ICCCN
2007
IEEE
14 years 4 months ago
Maintaining Routing Tree in IEEE 802.16 Centralized Scheduling Mesh Networks
Abstract— The IEEE 802.16 mesh mode supports two scheduling mechanisms, namely centralized scheduling and distributed scheduling. Centralized scheduling is based on a routing tre...
Yanbin Lu, Guoqing Zhang
JCM
2006
76views more  JCM 2006»
13 years 9 months ago
Hierarchical Aggregation of Multicast Trees in Large Domains
Multicast tree aggregation is a technique that reduces the control overhead and the number of states induced by multicast. The main idea of this protocol is to route several groups...
Joanna Moulierac, Alexandre Guitton, Miklós...
IPL
2002
119views more  IPL 2002»
13 years 9 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski