Skip to main content
SpringerLink
Log in

Efficient Routing and Broadcasting Algorithms in de Bruijn Networks

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3358))

Abstract

Recently, routing on dBG has been investigated as shortest path and fault tolerant routing but investigation into shortest path in failure mode on dBG has been non-existent. Furthermore, dBG based broadcasting has been studied as local broadcasting and arc-disjoint spanning trees based broadcasting. However, their broadcasting algorithms can only work in dBG(2,k). In this paper, we investigate shortest path routing algorithms in the condition of existing failure, based on the Bidirectional de Bruijn graph (BdBG). And we also investigate broadcasting in BdBG for a degree greater than or equal to two.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liu, Z., Sung, T.-Y.: Routing and Transmitting Problem in de Bruijn Networks. IEEE Trans. on Comp. 45(9), 1056–1062 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Yang, O.W.W., Feng, Z.: DBG MANs and their routing performance. Comm., IEEE Proc. 147(1), 32–40 (2000)

    Article  Google Scholar 

  3. Esfahanian, A.H., Hakimi, S.L.: Fault-tolerant routing in de Bruijn communication networks. IEEE Trans. Comp. C-34, 777–788 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Mao, J.-W., Yang, C.-B.: Shortest path routing and fault tolerant routing on de Bruijn networks. Networks 35(3), 207–215 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Aho, A.V., Corasick, M.J.: Efficient String Matching: An Aid to Bibliographic Search. Comm. of the ACM 18(6) (June 1975)

    Google Scholar 

  6. Esfahanian, A.H., Zimmerman, G.: A Distributed Broadcast Algorithm for Binary De Bruijn networks. IEEE Conf. on Comp. and Comm. (March 1988)

    Google Scholar 

  7. Ganesan, E., Pradhan, D.K.: Optimal Broadcasting in Binary de Bruijn Networks and Hyper-deBruijn Networks. In: IEEE Symposium on Parallel Processing (April 1993)

    Google Scholar 

  8. Ohring, S.R., Hondel, D.H.: Optimal Fault-Tolerant Communication Algorithms on Product Networks using Spanning Trees. In: IEEE Symp. on Parallel Processing (1994)

    Google Scholar 

  9. Sengupta, A., Sen, A., Bandyopadhyay, S.: Fault tolerant distributed system design. IEEE Trans. Circuit Syst. CAS-35, 168–172 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Kyung Hee Univerity, 1, Seocheon, Giheung, Yongin, Gyeonggi, 449-701, Korea

    Ngoc Chi Nguyen, Nhat Minh Dinh Vo & Sungyoung Lee

Authors
  1. Ngoc Chi Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nhat Minh Dinh Vo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sungyoung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China

    Jiannong Cao

  2. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  4. Department of Computer Science, The University of Hong Kong, Pokfulam

    Francis Lau

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, N.C., Vo, N.M.D., Lee, S. (2004). Efficient Routing and Broadcasting Algorithms in de Bruijn Networks. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30566-8_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24128-7

  • Online ISBN: 978-3-540-30566-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation