Sciweavers

376 search results - page 22 / 76
» Self-Stabilizing Graph Protocols
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 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
ICDCS
2005
IEEE
14 years 1 months ago
An Update Protocol for XML Documents in Distributed and Cooperative Systems
Securing data is becoming a crucial need for most internet-based applications. Whereas the problem of data confidentiality has been widely investigated, the problem of how to ens...
Yunhua Koglin, Giovanni Mella, Elisa Bertino, Elen...
ICNP
2000
IEEE
14 years 1 days ago
Convergent Multi-Path Routing
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
Jorge Arturo Cobb
TPDS
2008
96views more  TPDS 2008»
13 years 7 months ago
Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
CN
2008
108views more  CN 2008»
13 years 7 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool