Sciweavers

417 search results - page 59 / 84
» A randomized algorithm for the joining protocol in dynamic d...
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...
MOBIHOC
2003
ACM
14 years 2 months ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 9 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
IWCMC
2010
ACM
14 years 1 months ago
Only the short die old: route optimization in MANETs by dynamic subconnection shrinking
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha
PE
2002
Springer
158views Optimization» more  PE 2002»
13 years 8 months ago
Comparison of inter-area rekeying algorithms for secure wireless group communications
Many emerging mobile wireless applications depend upon secure group communications, in which data is encrypted and the group's data encryption key is changed whenever a membe...
Chun Zhang, Brian DeCleene, James F. Kurose, Donal...