Sciweavers

235 search results - page 3 / 47
» Scalability of Routing Tables in Wireless Networks
Sort
View
IPSN
2007
Springer
13 years 11 months ago
Beacon location service: a location service for point-to-point routing in wireless sensor networks
In this paper we present Beacon Location Service (BLS): a location service for beacon-based routing algorithms like Beacon Vector Routing (BVR) [8] and S4 [19] . The role of a loc...
Jorge Ortiz, Chris R. Baker, Daekyeong Moon, Rodri...
NCA
2003
IEEE
13 years 10 months ago
Scalable Protocol for Content-Based Routing in Overlay Networks
In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alte...
Raphaël Chand, Pascal Felber
INFOCOM
2006
IEEE
13 years 11 months ago
Tunnel Vector: A New Routing Algorithm with Scalability
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
Cheng-Jia Lai, Richard R. Muntz
INFOCOM
2007
IEEE
13 years 11 months ago
Geographic Routing Using Hyperbolic Space
Abstract— We propose a scalable and reliable point-topoint routing algorithm for ad hoc wireless networks and sensornets. Our algorithm assigns to each node of the network a virt...
Robert Kleinberg
CONEXT
2006
ACM
13 years 11 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford