Skip to main content
SpringerLink
Log in

On Disjoint Shortest Paths Routing on the Hypercube

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5573))

Abstract

We present a routing algorithm that finds n disjoint shortest paths from the source node to n target nodes in the n-dimensional hypercube in O(n 3) = O(log3 N) time, where N = 2n, provided that such disjoint shortest paths exist which can be verified in O(n 5/2) time, improving the previous O(n 3 logn) routing algorithm. In addition, the development of this algorithm also shows strong relationship between the problems of the disjoint shortest paths routing and matching.

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

Access this chapter

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 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.00
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chen, C.C., Chen, J.: Nearly Optimal One-to-Many Parallel Routing in Star Networks. IEEE trans. on Parallel and Distributed Systems 8(12), 1196–1202 (1997)

    Article  Google Scholar 

  2. Dietzfelbinger, M., Madhavapeddy, S., Sudborough, I.H.: Three Disjoint Path Paradigms in Star Networks. In: Proc. of the 3rd IEEE Symposium on Parallel and Distributed Processing, pp. 400–406. IEEE Computer Society Press, Dallas (1991)

    Chapter  Google Scholar 

  3. Duh, D.R., Chen, G.H.: On the Rabin Number Problem. Networks 30(3), 219–230 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gao, S., Novick, B., Qiu, K.: From Hall’s Matching Theorem to Optimal Routing on Hypercubes. Journal of Combinatorial Theory (B) 74(2), 291–301 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gonzalez, T.F., Serena, D.: n-Cube Network: Node Disjoint Shortest Paths for Maximal Distance Pairs of Vertices. Parallel Computing 30, 973–998 (2004)

    Article  MathSciNet  Google Scholar 

  6. Gu, Q.P., Peng, S.T.: Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. Parallel Computing 24, 1245–1261 (1998)

    Article  MathSciNet  Google Scholar 

  7. Gu, Q.P., Peng, S.T.: An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. Journal of Parallel and Distributed Computing 60, 764–774 (2000)

    Article  MATH  Google Scholar 

  8. Hall, P.: On Representatives of Subsets. J. London Math. Soc. 10, 26–30 (1935)

    Article  MATH  Google Scholar 

  9. Hopcroft, J.E., Karp, R.M.: An n 5/2 Algorithm for Maximum Matching in Bipartite Graphs. J. SIAM Comp. 2, 225–231 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lai, C.N.: One-to-Many Disjoint Paths in the Hypercube and Folded Hypercube. Ph.D. Thesis, National Taiwan University (2001)

    Google Scholar 

  11. Latifi, S., Ko, H., Srimani, P.K.: Node-to-Set Vertex Disjoint Paths in Hypercube Networks. Technical Report CS-98-107, Colorado State University (1998)

    Google Scholar 

  12. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, Mineola (1998)

    MATH  Google Scholar 

  13. Qiu, K., Novick, B.: Disjoint Paths in Hypercubes. Congressus Numerantium 119, 105–112 (1996)

    MathSciNet  MATH  Google Scholar 

  14. Qiu, K.: An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube. In: Proc. 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS 2008), pp. 43–47. IEEE Computer Society Press, Melbourne (2008)

    Chapter  Google Scholar 

  15. Rabin, M.O.: Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance. Journal of ACM 36(2), 335–348 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  16. Stewart, I.A., Xiang, Y.H.: One-to-Many Node-Disjoint Paths in (n, k)-Star Graphs. Technical Report, Department of Computer Science, Durham University, UK (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Statistics, Oakland University, USA

    Eddie Cheng

  2. Dept. of Mathematical Science, Clemson University, USA

    Shuhong Gao

  3. Dept. of Computer Science, Brock University, Canada

    Ke Qiu

  4. Dept. of Computer Science and Technology, Plymouth State University, USA

    Zhizhang Shen

Authors
  1. Eddie Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuhong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ke Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhizhang Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 800 West Campbell Road, TX 75080-3021, Richardson, USA

    Ding-Zhu Du

  2. Chinese Academy of Sciences, Institute of Applied Mathematics, Zhong Guan Cun Dong Lu 55, 100190, Beijing, P. R. China

    Xiaodong Hu

  3. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, P.O. Box 116595, FL 32611-6595, Gainesville, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheng, E., Gao, S., Qiu, K., Shen, Z. (2009). On Disjoint Shortest Paths Routing on the Hypercube. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02026-1_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02025-4

  • Online ISBN: 978-3-642-02026-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation