Sciweavers

346 search results - page 26 / 70
» Routing networks for distributed hash tables
Sort
View
SIGIR
2005
ACM
14 years 1 months ago
Publish/subscribe functionality in IR environments using structured overlay networks
We study the problem of offering publish/subscribe functionality on top of structured overlay networks using data models and languages from IR. We show how to achieve this by ext...
Christos Tryfonopoulos, Stratos Idreos, Manolis Ko...
INFOCOM
2005
IEEE
14 years 1 months ago
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Fr...
ICCS
2009
Springer
14 years 2 months ago
A Scalable Non-blocking Multicast Scheme for Distributed DAG Scheduling
Abstract. This paper presents an application-level non-blocking multicast scheme for dynamic DAG scheduling on large-scale distributedmemory systems. The multicast scheme takes int...
Fengguang Song, Jack Dongarra, Shirley Moore
NCA
2003
IEEE
14 years 24 days 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
TELETRAFFIC
2007
Springer
14 years 1 months ago
Estimating Churn in Structured P2P Networks
In structured peer-to-peer (P2P) networks participating peers can join or leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that ...
Andreas Binzenhöfer, Kenji Leibnitz