Sciweavers

366 search results - page 58 / 74
» A routing underlay for overlay networks
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space
Abstract—Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications. CBR differs from classical routing paradigms as messages a...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
P2P
2009
IEEE
114views Communications» more  P2P 2009»
14 years 2 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
NETGAMES
2003
ACM
14 years 23 days ago
Priority-based distribution trees for application-level multicast
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...
INFOCOM
2007
IEEE
14 years 1 months ago
A Framework for Measuring and Predicting the Impact of Routing Changes
— Routing dynamics heavily influence Internet data plane performance. Existing studies only narrowly focused on a few destinations and did not consider the predictability of the...
Ying Zhang, Zhuoqing Morley Mao, Jia Wang
AINA
2004
IEEE
13 years 11 months ago
An Efficient Clustered Architecture for P2P Networks
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some ...
Juan Li, Son T. Vuong