Sciweavers

625 search results - page 52 / 125
» Routing in Trees
Sort
View
COMCOM
2006
98views more  COMCOM 2006»
13 years 11 months ago
High-speed IP address lookup using balanced multi-way trees
Rapid growth of the Internet traffic requires more bandwidth and high-speed packet processing in the Internet routers. As one of the major packet processing performed in routers, ...
Hyesook Lim, Wonjung Kim, Bomi Lee, Changhoon Yim
SAINT
2005
IEEE
14 years 4 months ago
HAR: Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks
In this paper, we present Hierarchy-Based Anycast Routing (HAR), a routing protocol for collecting data over multi-hop, wireless sensor networks. The design of the protocol aims t...
Niwat Thepvilojanapong, Yoshito Tobe, Kaoru Sezaki
INFOCOM
2000
IEEE
14 years 3 months ago
Alternate Path Routing for Multicast
Abstract— Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, asi...
Daniel Zappala
ISAAC
2005
Springer
129views Algorithms» more  ISAAC 2005»
14 years 4 months ago
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
ICNP
1998
IEEE
14 years 3 months ago
Receiver-based Multicast Scoping: A New Cost-Conscious Join/Leave Paradigm
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
George F. Riley, Mostafa H. Ammar, Lenitra M. Clay