All-to-All Scatter in Kautz networks

  • Petr Salinger
  • Pavel Tvrdík
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)


We give lower and upper bounds on the average distance of Kautz digraph. Using this result, we give a memory-optimal and asymptotically time-optimal algorithm for All-to-All-Scatter in noncombining all-port store-&-forward Kautz networks.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J.-C. Bermond, Z. Liu, and M. Syska. Mean eccentricities of de Bruijn networks. Networks, 30:187–203, 1997.MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    G. Liu, K. Y. Lee, and H. F. Jordan. TDM and TWDM de Bruijn networks and ShuffleNets for optical communications. IEEE Transactions on Computers, 46:695–701, 1997.CrossRefGoogle Scholar
  3. 3.
    K. Sivarajan and R. Ramaswami. Lightwave networks based on de Bruijn graphs. IEEE/ACM Trans. Networking, 2(1):70–79, 1994.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Petr Salinger
    • 1
  • Pavel Tvrdík
    • 1
  1. 1.Department of Computer Science and EngineeringCzech Technical UniversityPragueCzech Republic

Personalised recommendations