Loading...
Send to Friend
 Bookmark
 Review List
  1. Simple search
  2. Search result
  3. Fault-tolerant routing in the star graph
Fault-tolerant routing in the star graph
650 viewed

Fault-tolerant routing in the star graph

Rezazad, S. M

Fault-tolerant routing in the star graph

Rezazad, S. M ; Sharif University of Technology | 2004

747 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/AINA.2004.1283853
  3. Publisher: 2004
  4. Abstract:
  5. This paper presents a fault tolerant routing algorithm for the star graph. The algorithm is based on the concept of unsafely vectors originally proposed for binary n-cubes. Each node starts by computing a first level unsafety set,composed of the set of unreachable neighbours.It then performs some exchanges with its neighbours to determine the unsafety nodes.After that all of the nodes have the addresses of all faulty nodes. Based on the information gathered in each nodefault-tolearnt routing between a source node and a destination node is raelised
  6. Keywords:
  7. Fault tolerance ; Greedy algorithms ; Hypercubes ; Computer science ; Routing
  8. Source: Proceedings - 18th International Conference on Advanced Information Networking and Applications, AINA 2004, Fukuoka, 29 March 2004 through 31 March 2004 ; Volume 2 , 2004 , Pages 503-506 ; 0769520510 (ISBN); 9780769520513 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/1283853