Sciweavers

72 search results - page 12 / 15
» A Diophantine model of routes in structured P2P overlays
Sort
View
ANTSW
2004
Springer
14 years 26 days ago
An Ant Approach to Membership Overlay Design
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...
Vittorio Maniezzo, Marco A. Boschetti, Márk...
CIC
2004
13 years 9 months ago
Dynamic Characteristics of k-ary n-cube Networks for Real-time Communication
Overlay topologies are now popular with many emerging peer-to-peer (P2P) systems, to efficiently locate and retrieve information. In contrast, the focus of this work is to use ove...
Gerald Fry, Richard West
IPPS
2006
IEEE
14 years 1 months ago
Ant-inspired query routing performance in dynamic peer-to-peer networks
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
Mojca Ciglaric, Tone Vidmar
IPTPS
2003
Springer
14 years 20 days ago
Structured Peer-to-Peer Overlays Need Application-Driven Benchmarks
Considerable research effort has recently been devoted to the design of structured peer-to-peer overlays, a term we use to encompass Content-Addressable Networks (CANs), Distribut...
Sean C. Rhea, Timothy Roscoe, John Kubiatowicz
GC
2004
Springer
14 years 26 days ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...