Sciweavers

675 search results - page 48 / 135
» Anonymous communication in overlay networks
Sort
View
IPPS
2006
IEEE
15 years 4 months ago
An adaptive stabilization framework for distributed hash tables
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
Gabriel Ghinita, Yong Meng Teo
P2P
2002
IEEE
124views Communications» more  P2P 2002»
15 years 3 months ago
The Multi-Ring Topology - High-Performance Group Communication in Peer-to-Peer Networks
Emerging peer-to-peer applications require efficient group communication. However, current techniques for group communication are not optimal for peer-to-peer networks, which do n...
Markus Junginger, Yugyung Lee
SPAA
2009
ACM
15 years 11 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa
AAAIDEA
2005
IEEE
15 years 4 months ago
SOSIMPLE: A Serverless, Standards-based, P2P SIP Communication System
Voice over IP (VoIP) and Instant Messaging (IM) systems to date have either followed a client-server model or have required the use of clients that do not follow any VoIP or IM st...
David A. Bryan, Bruce Lowekamp, Cullen Jennings
NCA
2003
IEEE
15 years 4 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