Sciweavers

625 search results - page 87 / 125
» Routing in Trees
Sort
View
NGC
2001
Springer
196views Communications» more  NGC 2001»
14 years 2 months ago
Application-Level Multicast Using Content-Addressable Networks
Abstract. Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, o...
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, S...
ISPD
1999
ACM
127views Hardware» more  ISPD 1999»
14 years 2 months ago
Buffer insertion for clock delay and skew minimization
 Buffer insertion is an effective approach to achieve both minimal clock signal delay and skew in high speed VLSI circuit design. In this paper, we develop an optimal buffer ins...
X. Zeng, D. Zhou, Wei Li
INFOCOM
2010
IEEE
13 years 7 months ago
Predicting Prefix Availability in the Internet
The Border Gateway Protocol (BGP) maintains inter-domain routing information by announcing and withdrawing IP prefixes, possibly resulting in temporary prefix unreachability. Prefi...
Ravish Khosla, Sonia Fahmy, Y. Charlie Hu, Jennife...
IPPS
2007
IEEE
14 years 4 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
WCNC
2008
IEEE
14 years 4 months ago
Arbutus: Network-Layer Load Balancing for Wireless Sensor Networks
—The hot spot problem is a typical byproduct of the many-to-one traffic pattern that characterizes most wireless sensor networks: the nodes with the best channel to the sink are ...
Daniele Puccinelli, Martin Haenggi