Sciweavers

2076 search results - page 245 / 416
» Universal Routing in Distributed Networks
Sort
View
172
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley
CLUSTER
2002
IEEE
15 years 3 months ago
Location Selection for Active Services
Active services are application-specified programs that are executed inside the network. The location where the active service is executed plays an important role. The dynamic beha...
Roger Karrer, Thomas R. Gross
148
Voted
OPODIS
2010
15 years 1 months ago
Biased Selection for Building Small-World Networks
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
Andrés Sevilla, Alberto Mozo, M. Araceli Lo...
135
Voted
DCOSS
2005
Springer
15 years 9 months ago
Macro-programming Wireless Sensor Networks Using Kairos
The literature on programming sensor networks has focused so far on g higher-level abstractions for expressing local node behavior. Kairos is a natural next step in sensor network ...
Ramakrishna Gummadi, Omprakash Gnawali, Ramesh Gov...
134
Voted
PODC
2010
ACM
15 years 3 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...