Skip to main content
SpringerLink
Log in
Book cover

International Conference on Advances in Computing and Communications

ACC 2011: Advances in Computing and Communications pp 21–33Cite as

3-Disjoint Paths Fault-tolerant Multi-stage Interconnection Networks

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 190))

Abstract

In this paper, we have compared the existing 3-Disjoint Paths Fault-tolerant Omega Multi-stage Interconnection Network (3-DON) with newly proposed 3-Disjoint Fault-tolerant Gamma Interconnection Network (3-DGMIN) using the concept of reachable sets and coloring scheme. A 3-Disjoint network can concurrently send packets from the source node to increase the arrival ratio or tolerate a maximum of 2 faults in the network by re-routing the packet through another path. We have used red blue, green and yellow color for the coloring the nodes. The 3-DON is better than existing Omega Multi-stage Interconnection Network (OMIN) for every performance parameter except the cost. Moreover, the new 3-DGMIN is also better than existing Gamma Multi-stage Interconnection Network (GIN) for every performance parameter. Further, the experimental results show that the 3-DGMIN outperforms 3-DON when compared for the throughput.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Feng, T.Y.: A survey of interconnection networks. IEEE Computer 14, 12–27 (1981)

    Article  Google Scholar 

  2. Adams III, G.B., Agrawal, D.P., Siegel, H.J.: A survey and comparison of fault-tolerant multi-stage interconnection networks. IEEE Computer 20, 14–27 (1987)

    Article  Google Scholar 

  3. Dally, W.J.: Scalable Switching Fabrics for Internet Routers, White paper, Avici Systems Incorporation (2001)

    Google Scholar 

  4. Bhuyan, L.N.: Special issue of interconnection networks. IEEE Computer 20(6) (June 1987)

    Google Scholar 

  5. Siegel, H.J.: Interconnection Network for Large Scale Parallel Processing: Theory and Case Studies. McGraw-Hill, New York (1990) ISBN 0-07-057561-4

    Google Scholar 

  6. Hwang, K.: Advanced Computer Architecture: Parallelism, Scalability, Programmability. Tata McGraw-Hill, India (2000) ISBN 0-07-053070-X

    Google Scholar 

  7. Duato, J., Yalamanchili, S., Ni, L.M.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann, San Francisco (2003) ISBN 1-55860-852-4

    Google Scholar 

  8. Dally, W., Towles, B.: Principles and Practices of Interconnection Networks. Morgan Kaufmann, San Francisco (2004) ISBN 978-0-12-200751-4

    Google Scholar 

  9. Arabnia, H.R., Oliver, M.A.: Arbitrary Rotation of Raster Images with SIMD Machine Architectures. International Journal of Eurographics Association (Computer Graphics Forum) 6(1), 3–12 (1987)

    Article  Google Scholar 

  10. Bhandarkar, S.M., Arabnia, H.R., Smith, J.W.: A Reconfigurable Architecture For Image Processing And Computer Vision. International Journal of Pattern Recognition And Artificial Intelligence 9(2), 201–229 (1995)

    Article  Google Scholar 

  11. Bhandarkar, S.M., Arabnia, H.R.: The Hough Transform on a Reconfigurable Multi-Ring Network. Journal of Parallel and Distributed Computing 24(1), 107–114 (1995)

    Article  Google Scholar 

  12. Wani, M.A., Arabnia, H.R.: Parallel Edge-Region-Based Segmentation Algorithm Targeted at Reconfigurable Multi-Ring Network. The Journal of Supercomputing 25(1), 43–63 (2003)

    Article  MATH  Google Scholar 

  13. Duato, J.: A New Theory of Deadlock-free Adaptive Routing in Wormhole Networks. IEEE Transactions on Parallel and Distributed Systems 4(12), 1320–1331 (1993)

    Article  Google Scholar 

  14. Duato, J.: A Necessary and Sufficient Condition for Dead lock-free Adaptive Routing in Wormhole Networks. IEEE Transactions on Parallel and Distributed Systems 6(10), 1055–1067 (1995)

    Article  Google Scholar 

  15. Dally, W.J., Seitz, C.L.: Deadlock-Free Message Routing in Multiprocessor Interconnection Networks. IEEE Transactions on Computers C-36(5), 547–553 (1987)

    Article  MATH  Google Scholar 

  16. Dally, W.J., Aoki, H.: Deadlock-Free Adaptive Routing in Multi computer Networks Using Virtual Channels. IEEE Transactions on Parallel Distributed Systems 4(4) (1993)

    Google Scholar 

  17. Duato, J.: Deadlock-Free Adaptive Routing Algorithms for the 3DTorus: Limitations and Solutions. In: Proceedings of Parallel Architectures and Languages Europe 1993 (1993)

    Google Scholar 

  18. Nitin, C., Subramanian, A.: Efficient Algorithms to Solve Dynamic MINs Stability Problems using Stable Matching with Complete TIES. Journal of Discrete Algorithms 6(3), 353–380 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  19. Singh, A., Dally, W.J., Gupta, A.K., Towels, B.: Adaptive Channel Queue Routing on k-ary n-cubes. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (2004)

    Google Scholar 

  20. Nitin, C., Garhwal, S., Srivastava, N.: Designing a Fault-tolerant Fully-chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths. The Journal of Supercomputing 55(3), 400–431 (2009), doi:10.1007/s11227-009-0336-z

    Article  Google Scholar 

  21. Nitin, C., Chauhan, D.S.: Comparative Analysis of Traffic Patterns on k-ary n-tree using Adaptive Algorithms based on Burton Normal Form. Journal of Supercomputing, 1–20 (2010), doi:10.1007/s11227-010-0454-7

    Google Scholar 

  22. Nitin, C., Sehgal, V.K., Bansal, P.K.: On MTTF analysis of a Fault-tolerant Hybrid MINs. WSEAS Transactions on Computer Research 2(2), 130–138 (2007) ISSN 1991-8755

    Google Scholar 

  23. Nitin, C.: Component Level Reliability analysis of Fault-tolerant Hybrid MINs. WSEAS Transactions on Computers 5(9), 1851–1859 (2006) ISSN 1109-2750

    Google Scholar 

  24. Chen, C.W., Chung, C.P.: Designing a Disjoint path interconnection network with collision solving and fault tolerance. The Journal of Supercomputing 34(1), 63–80 (2005)

    Article  Google Scholar 

  25. Chen, C.W.: Design schemes of dynamic rerouting networks with destination tag routing for tolerating faults and preventing collisions. The Journal of Supercomputing 38(3), 307–326 (2006)

    Article  Google Scholar 

  26. Siegal, H.J., Jose, D.R., Fortes, A.B.: Destination tag routing techniques based on a state model for the IADM network. IEEE Transaction on Computers 41(3), 274–285 (1992)

    Article  Google Scholar 

  27. Smith, B.: Design of dynamic rerouting networks with destination tag routing for tolerating faults and preventing collisions. Springer Science, Heidelberg (2006)

    Google Scholar 

  28. Parker, D.S., Raghavendra, C.S.: The gamma network. IEEE Transactions on Computers 33, 367–373 (1984)

    Article  MATH  Google Scholar 

  29. Chuang, P.J.: CGIN: A fault tolerant modified gamma interconnection network. IEEE Transactions on Parallel and Distributed Systems 7(12), 1301–1306 (1996)

    Article  Google Scholar 

  30. Chen, C.W., Lu, N.P., Chen, T.F., Chung, C.P.: Fault-tolerant gamma interconnection networks by chaining. IEE Proceedings on Computers and Digital Techniques 147(2), 75–80 (2000)

    Article  Google Scholar 

  31. Chen, C.W., Lu, N.P., Chung, C.P.: 3-Disjoint gamma interconnection networks. The Journal of Systems and Software 66, 129–134 (2003)

    Article  Google Scholar 

  32. Rastogi, R., Nitin, C., Chauhan, D.S.: 3-Disjoint Paths Fault-tolerant Omega Multi-stage Interconnection Network with Reachable Sets and Coloring Scheme. In: Proceedings of the 13th IEEE International conference on Computer Modeling and Simulation (IEEE UKSim), Emmanuel College, Cambridge (2011)

    Google Scholar 

  33. Rastogi, R., Nitin, C.: Fast Interconnections: A Case Tool for Developing Fault-tolerant Multi-stage Interconnection Networks. International Journal of Advancements in Computing Technology 2(5), 13–24 (2010) ISSN: 2005-8039

    Article  Google Scholar 

  34. Rastogi, R., Nitin, C.: On a Fast Interconnections. International Journal of Computer Science and Network Security 10(8), 74–79 (2010) ISSN: 1738-7906

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering and Information Technology, Jaypee University of Information Technology, Waknaghat Solan, 173234, Himachal Pradesh, India

    Ravi Rastogi & Rohit Verma

  2. College of Information Science and Technology, The Peter Kiewit Institute, University of Nebraska at Omaha, Omaha, 68182-0116, Nebraksa, United States of America

    Nitin

  3. Uttarakhand Technical Univesity, Post Office Chandanwadi Prem Nagar, Sudohwala, Dehradun, 248007, Uttarakhand, India

    Durg Singh Chauhan

Authors
  1. Ravi Rastogi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rohit Verma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nitin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Durg Singh Chauhan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Machine Intelligence Research Labs (MIR Labs), Auburn, 98071-2259, Washington, USA

    Ajith Abraham

  2. Department of Communications, Polytechnic University of Valencia, Camino de Vera, 46022, Valencia, Spain

    Jaime Lloret Mauri

  3. Avaya Labs Research, Basking Ridge, NJ, USA

    John F. Buford

  4. University of Massachusetts, 100 Morrissey Blvd., 02125-3393, Boston, MA, USA

    Junichi Suzuki

  5. Rajagiri School of Engineering and Technology, Rajagiri Valley, Kakkanad, 682 039, Kochi, India

    Sabu M. Thampi

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rastogi, R., Verma, R., Nitin, Chauhan, D.S. (2011). 3-Disjoint Paths Fault-tolerant Multi-stage Interconnection Networks. In: Abraham, A., Lloret Mauri, J., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22709-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22709-7_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22708-0

  • Online ISBN: 978-3-642-22709-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation