Sciweavers

1014 search results - page 123 / 203
» Distributed Algorithms for Attack Localization in All-Optica...
Sort
View
ISPDC
2008
IEEE
14 years 3 months ago
Token Loss Detection for Random Walk based Algorithm
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
Thibault Bernard, Alain Bui, Devan Sohier
IPPS
2007
IEEE
14 years 3 months ago
Task-pushing: a Scalable Parallel GC Marking Algorithm without Synchronization Operations
This paper describes a scalable parallel marking technique for garbage collection that does not employ any synchronization operation. To achieve good scalability, two major design...
Ming Wu, Xiao-Feng Li
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
14 years 9 months ago
A secure hierarchical model for sensor network
In a distributed sensor network, large number of sensors deployed which communicate among themselves to selforganize a wireless ad hoc network. We propose an energyefficient level...
Malik Ayed Tubaishat, Jian Yin, Biswajit Panja, Sa...
INFOCOM
2006
IEEE
14 years 3 months ago
Proportional Replication in Peer-to-Peer Networks
— We recently showed for peer-to-peer networks, that having the number of replicas of each object proportional to the request rate for these objects has many per-node advantages....
Saurabh Tewari, Leonard Kleinrock
OPODIS
2010
13 years 7 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas