Sciweavers

143 search results - page 13 / 29
» Randomness versus Fault-Tolerance
Sort
View
APIN
2007
118views more  APIN 2007»
14 years 9 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 9 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
JPDC
2006
187views more  JPDC 2006»
14 years 9 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
OPODIS
2010
14 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
EUROPAR
2009
Springer
14 years 7 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou