Referenced Items are not available for this document.
In this paper, we focus on the design of the fault-tolerant routing algorithm for the (n,k)-star graph. We apply the idea of collecting the limited global information used for routing on the n-star graph to the (n,k)-star graph. First, we build the probabilistic safety vector (PSV) with modified cycle patterns. Then, our routing algorithm decides the fault-free routing path with the help of PSV. The performance is judged by the average length of routing paths. Compared with distance first search and safety level, we get the best performance in the simulations.
Published in:
Pervasive Systems, Algorithms, and Networks (ISPAN), 2009 10th International Symposium on
Date of Conference: 14-16 Dec. 2009
- Page(s):
- 34 - 39
- Print ISBN:
- 978-1-4244-5403-7
- INSPEC Accession Number:
- 11085267
- Conference Location :
- Kaohsiung
- Digital Object Identifier :
- 10.1109/I-SPAN.2009.141
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
