Skip to main content
SpringerLink
Log in

Some Bounded Degree Communication Networks and Optimal Leader Election

  • Chapter
Combinatorial Optimization in Communication Networks

Part of the book series: Combinatorial Optimization ((COOP,volume 18))

  • 866 Accesses

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. S. Lakshmivarahan, J. S. Jwo, and S. K. Dhall. Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey. Parallel Computing, 19:361–407, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. B. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers, 38(4):555–566, April 1989.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. B. Akers and B. Krishnamurthy. The star graph: an attractive alternative to n-cube. In Proceedings of International Conference on Parallel Processing (ICPP-87), pages 393–400, St. Charles, Illinois, August 1987.

    Google Scholar 

  4. K. Qiu, H. Meijer, and S. G. Akl. Decomposing a star graph into disjoint cycles. Information Processing Letters, 39(3):125–129, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. L. Bhuyan and D. P. Agrawal. Generalized hypercube and hyperbus structure for a computer netwrk. IEEE Transactions on Computers, 33(3):323–333, March 1984.

    MATH  Google Scholar 

  6. K. Qiu, H. Meijer, and S. G. Akl. On the cycle structure of star graphs. Technical Report 92-341, Department of Computer Science, Queen’s University, Ontario, Canada, November 1992.

    Google Scholar 

  7. B. W. Arden and K. W. Tang. Representation and routing of Cayley graphs. IEEE Transactions on Communications, 39:1533–1537, December 1991.

    Article  MATH  Google Scholar 

  8. I. D. Scherson. Orthogonal graphs for the construction of interconnection networks. IEEE Transactions on Parallel and Distributed Systems, 2(1):3–19, 1991.

    Article  Google Scholar 

  9. K. Day and A. Tripathi. Arrangement graphs: a class of generalized star graphs. Information Processing Letters, 42:235–241, July 1992.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. R. Samatham and D. K. Pradhan. The De Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI. IEEE Transactions on Computers, 38(4):567–581, April 1989.

    Article  MATH  MathSciNet  Google Scholar 

  11. C. Chen, D. P. Agrawal, and J. R. Burke. dBCube: a new class of hierarchical multiprocessor interconnection networks with area efficient layout. IEEE Transactions on Parallel and Distributed Systems, 4(12):1332–1344, December 1993.

    Article  Google Scholar 

  12. F. Preparata and J. Vuillemin. The cube-connected cycles: a versatile network for parallel computation. Communications of ACM, 24(5):30–39, May 1981.

    Article  MathSciNet  Google Scholar 

  13. G. E. Carlsson, J. E. Cruthirds, H. B. Sexton, and C. G. Wright. Interconnection networks based on a generalization of cube-connected cycles. IEEE Transactions on Computers, C-34(8):769–772, 1985.

    Google Scholar 

  14. D. J. Pritchard and D. A. Nicole. Cube connected Möbius ladders: an inherently deadlock free fixed degree network. IEEE Transactions on Parallel and Distributed Systems, 4(1):111–117, January 1993.

    Article  Google Scholar 

  15. D. K. Pradhan. On a class of fault-tolerant multiprocessor network architectures. In 3rd International Conference on Distributed Computing Systems, pages 302–311, Miami, FL, October 1982. IEEE.

    Google Scholar 

  16. W. E. Leland and M. H. Solomon. Dense trivalent graphs for processor interconnection. IEEE Transactions on Computers, 31(3):219–222, March 1982.

    MATH  MathSciNet  Google Scholar 

  17. D. K. Pradhan. Fault tolerant VLSI architectures based on de Bruijn graphs (Galileo in the mid nineties). DIMACS Series in Discrete Mathematics, 5, 1991.

    Google Scholar 

  18. R. G. Gallagar, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum weight spanning trees. ACM Transactions on Programming Languages and Systems, 5:67–77, 1983.

    Google Scholar 

  19. N. Santoro. Sense of direction, topological awareness and communication. ACM SIGACT News, 16:50–56, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  20. H. L. Bodlaender. New lower bound techniques for distributed leader finding and other problems on rings of processors. Theoretical Computer Science, 81:237–256, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  21. M. C. Loui, T. A. Matsuhita, and D. B. West. Election in a complete network with a sense of direction. Information Processing Letters, 22:185–187, 1986.

    Article  MathSciNet  Google Scholar 

  22. E. Korach, S. Moran, and S. Zaks. Tight upper and lower bounds for some distributed algorithms for a complete network of processors. In Proceedings of Symposium on Principles of Distributed Computing, pages 199–207, 1984.

    Google Scholar 

  23. G. Tel. Linear election in oriented hypercubes. Technical Report RUU-CS-93-39, Computer Science, Utrecht University, 1993.

    Google Scholar 

  24. G. Tel. Linear election in hypercubes. Parallel Processing Letters, 5:357–366, 1995.

    Article  MathSciNet  Google Scholar 

  25. S. B. Akers and B. Krishnamurthy. A group theoretic model for symmetric interconnection networks. In Proceedings of the 1986 International Conference on Parallel Processing, pages 216–223. IEEE, August 1986. U Ma. and Tektronix.

    Google Scholar 

  26. S. Lakshmivarahan, J.-S. Jwo, and S. K. Dhall. Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey. Parallel Computing, 19:361–407, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  27. D. J. Pritchard and D. A. Nicole. Cube connected mobius ladders: An inherently deadlock-free fixed degree network. IEEE Transactions on Parallel and Distributed Systems, 4(1):111–117, January 1993.

    Article  Google Scholar 

  28. S. Latifi, M. M. Azevedo, and N. Bagherzadeh. The star connected cycles: a fixed degree network for parallel processing. In Proceedings of the International Conference on Parallel Processing, volume 1, pages 91–95, 1993.

    Google Scholar 

  29. F. T. Leighton. Introductions to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan Kaufman, 1992.

    Google Scholar 

  30. P. Vadapalli and P. K. Srimarni. A new family of Cayley graph interconnection networks of constant degree four. IEEE Transactions on Parallel and Distributed Systems, 7(1), January 1996.

    Google Scholar 

  31. S. Guha and A Sen. On fault tolerant distributor communication architecture. IEEE Transactions on Computers, C-35(3):281–283, March 1986.

    Google Scholar 

  32. Elango Ganesan and Dhiraj K. Pradhan. The hyper-deBruijn networks: Scalable versatile architecture. IEEE Transactions on Parallel and Distributed Systems, 4(9):962–978, September 1993.

    Article  Google Scholar 

  33. S. Ohring and S. K. Das. Dynamic embeddings of trees and quasi-grids into hyper DeBruijn networks. In Proceedings of the 7th International Parallel Processing Symposium, pages 519–523, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Clemson University, Clemson, South Carolina, 29634

    Pradip K. Srimani

  2. Department of Electrical Engineering, University of Nevada, Las Vegas, NV, 89154

    Shahram Latifi

Authors
  1. Pradip K. Srimani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shahram Latifi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Missouri, Rolla, Missouri

    Maggie Xiaoyan Cheng

  2. Georgia State University, Atlanta, Georgia

    Yingshu Li

  3. University of Texas at Dallas, Richardson, Texas

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Srimani, P.K., Latifi, S. (2006). Some Bounded Degree Communication Networks and Optimal Leader Election. In: Cheng, M.X., Li, Y., Du, DZ. (eds) Combinatorial Optimization in Communication Networks. Combinatorial Optimization, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-387-29026-5_17

Download citation

  • DOI: https://doi.org/10.1007/0-387-29026-5_17

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-29025-6

  • Online ISBN: 978-0-387-29026-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation