Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize
IEEE Transactions on Computers
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Perfectly secure message transmission
Journal of the ACM (JACM)
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Two Steiner tree packing problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Error-detecting codes and fault-containing self-stabilization
Information Processing Letters
Fault-containing self-stabilization using priority scheduling
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Self-Stabilizing Strong Fairness under Weak Fairness
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Self-stabilizing depth-first token circulation in arbitrary rooted networks
Distributed Computing
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing depth-first token circulation on networks
Distributed Computing - Special issue: Self-stabilization
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Pairwise Disjoint Paths in Pancake Graphs
PDCAT '07 Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies
S/Kademlia: A practicable approach towards secure key-based routing
ICPADS '07 Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02
On-line admission control and circuit routing for high performance computing and communication
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Dynamic Multipath Allocation in Ad Hoc Networks
SENSORCOMM '08 Proceedings of the 2008 Second International Conference on Sensor Technologies and Applications
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Brief announcement: a stabilizing algorithm for finding two edge-disjoint paths in arbitrary graphs
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing algorithm for maximal graph partitioning into triangles
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.24 |
In this paper, we present an adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks. Given two distinct nodes s and t of a network, the all disjoint paths problem is to identify all disjoint paths from s to t. Since our algorithm is stabilizing, it does not require initialization and withstands transient faults. In addition, the proposed algorithm adapts to topology changes in the form of process/link crashes and additions, i.e., upon a topology change, it finds all available paths from s to t. The space complexity of our algorithm is 4xd states for the source process s, one state for the target process, 120xd states for other processes, where d is the diameter of the communication network. The time complexity of the proposed algorithm is O(d) rounds. The proposed algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks.