Skip to main content
SpringerLink
Log in

Container Problem in Bi-rotator Graphs

  • Conference paper
Parallel and Distributed Computing: Applications and Technologies (PDCAT 2004)

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

  • 740 Accesses

Abstract

In this paper, we give an algorithm for the container problem in bi-rotator graphs. The solution achieves some fault tolerance such as file distribution based information dispersal technique. The algorithm is of polynomial order of n for an n-bi-rotator graph. It is based on recursion and divided into two cases according to the position of the destination node. Performance of the algorithm is also evaluated by computer experiments.

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. Corbett, P.F.: Rotator graphs: an efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel and Distributed Systems 3(5), 622–626 (1992)

    Article  Google Scholar 

  2. Dietzfelbinger, M., et al.: Three disjoint path paradigms in star networks. In: Proc. IEEE SPDP, pp. 400–406 (1991)

    Google Scholar 

  3. Gu, Q.-P., Peng, S.: Node-to-set disjoint paths problem in star graphs. IPL 62(4), 201–207 (1997)

    Article  MathSciNet  Google Scholar 

  4. Hamada, Y., Bao, F., Mei, A., Igarashi, Y.: Nonadaptive fault-tolerant file transmission in rotator graphs. IEICE Trans. Fundamentals E79-A(4), 477–482 (1996)

    Google Scholar 

  5. Kaneko, K., Suzuki, Y.: An algorithm for node-to-set disjoint paths problem in rotator graphs. IEICE Trans. Inf. & Syst. E84-D(9), 1155–1163 (2001)

    Google Scholar 

  6. Kaneko, K., Suzuki, Y.: Node-to-set disjoint paths problem in pancake graphs. IEICE Trans. Inf. & Syst. E86-D(9), 1628–1633 (2003)

    Google Scholar 

  7. Lin, H.-R., Hsu, C.-C.: Topological properties of bi-rotator graphs. IEICE Trans. Inf. & Syst. E86-D(10), 2172–2178 (2003)

    Google Scholar 

  8. Suzuki, Y., Kaneko, K.: An algorithm for node-disjoint paths in pancake graphs. IEICE Trans. Inf. & Syst. E86-D(3), 610–615 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo, 184-8588, Japan

    Keiichi Kaneko, Yasuto Suzuki & Yukihiro Hasegawa

Authors
  1. Keiichi Kaneko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yasuto Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yukihiro Hasegawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanyang Centre for Supercomputing and Visualisation School of Mechanical and Production Engineering, Nanyang Technological University, 50 Nanyang Avenue, 639 798, Singapore

    Kim-Meow Liew

  2. School of Computer Science, The University of Adelaide,  

    Hong Shen

  3. Asia Pacific Science and Technology Center, Sun Microsystems Inc., 50 Nanyang Avenue, N3-1c-10, 639798, Singapore

    Simon See

  4. School of Computer Engineering, Nanyang Technological University, 639798, Singapore

    Wentong Cai

  5. Southwest Jiaotong University,  

    Pingzhi Fan

  6. Tohoku University ,  

    Susumu Horiguchi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaneko, K., Suzuki, Y., Hasegawa, Y. (2004). Container Problem in Bi-rotator Graphs. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30501-9_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24013-6

  • Online ISBN: 978-3-540-30501-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation