!!Projects per year
Abstract
The node-disjoint paths problem deals with finding node-disjoint paths from a source node s to target node t, where t ≠ s. Two paths from s to t are said to be node-disjoint iff they do not have any common vertices except for their endpoints. Distributed solutions to the node-disjoint paths problem have numerous applications such as secure message transmission, reliable routing, and network survivability. In this paper, we present a simple distributed algorithm that is both stabilizing and inherently stabilizing under a realistic model that describes system interfaces and implementation issues in detail to route messages over all shortest node-disjoint paths from one process to another in an n-dimensional hypercube network.
| Original language | English |
|---|---|
| Article number | 5445078 |
| Pages (from-to) | 995-999 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Computers |
| Volume | 59 |
| Issue number | 7 |
| DOIs | |
| State | Published - 2010 |
Keywords
- Fault-tolerance
- Hypercube networks
- Inherent stabilization
- Node-disjoint paths
- Stabilization
Fingerprint
Dive into the research topics of 'An inherently stabilizing algorithm for node-to-node routing over all shortest node-disjoint paths in hypercube networks'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Design and verification of an optimal stabilizing algorithm for routing over all node-disjoint paths in cayley graphs.
Karaata, M. H. (PI), Bdaiwi, B. F. A. B. M. A. (CoI) & Sinanoglu, O. (CoI)
20/07/09 → 19/07/10
Project: RESEARCH PROJECT
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver