Sciweavers

115 search results - page 18 / 23
» Using Random Subsets to Build Scalable Network Services
Sort
View
AFRICACRYPT
2010
Springer
14 years 4 months ago
Flexible Group Key Exchange with On-demand Computation of Subgroup Keys
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...
Michel Abdalla, Céline Chevalier, Mark Manu...
SIGMETRICS
2002
ACM
133views Hardware» more  SIGMETRICS 2002»
13 years 9 months ago
On the stability of network distance estimation
Estimating end-to-end Internet distance can benefit many applications and services, such as efficient overlay construction, overlay routing and location, and peer-topeer systems. ...
Yan Chen, Khian Hao Lim, Randy H. Katz, Chris Over...
SP
2008
IEEE
103views Security Privacy» more  SP 2008»
14 years 4 months ago
Preserving Caller Anonymity in Voice-over-IP Networks
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
Mudhakar Srivatsa, Ling Liu, Arun Iyengar
ICDCS
2007
IEEE
14 years 4 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
DAIS
2011
13 years 1 months ago
Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...
Amir H. Payberah, Jim Dowling, Seif Haridi