Sciweavers

675 search results - page 57 / 135
» Anonymous communication in overlay networks
Sort
View
CONEXT
2009
ACM
14 years 12 months ago
Scaling all-pairs overlay routing
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
David Sontag, Yang Zhang, Amar Phanishayee, David ...
COMPSAC
2003
IEEE
15 years 4 months ago
Facilitating Secure Ad hoc Service Discovery in Public Environments
Securely accessing unfamiliar services in public environments using ad hoc wireless networks is challenging. We present a proxy-based approach that uses other existing network cha...
Feng Zhu, Matt W. Mutka, Lionel M. Ni
P2P
2010
IEEE
135views Communications» more  P2P 2010»
14 years 9 months ago
QoE in Pull Based P2P-TV Systems: Overlay Topology Design Tradeoffs
Abstract—This paper presents a systematic performance analysis of pull P2P video streaming systems for live applications, providing guidelines for the design of the overlay topol...
R. Fortuna, Emilio Leonardi, Marco Mellia, Michela...
INFOCOM
2002
IEEE
15 years 3 months ago
Topologically-Aware Overlay Construction and Server Selection
— A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host no...
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, S...
PODC
2006
ACM
15 years 4 months ago
Stably computable predicates are semilinear
We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via twoway inter...
Dana Angluin, James Aspnes, David Eisenstat