Skip to main content
Springer Nature Link
Log in

Competitive source routing on tori and meshes

  • Session 2B
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1997)

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

Included in the following conference series:

Abstract

We study the source routing problem on √N x √N tori and meshes. In this problem, the paths for packets are the shortest ones. And the routing decision is distributed in a way that the path designated to a packet is determined entirely on its source node, with no knowledge of the other packets injected to other nodes and the system load distribution. The cost we concern about is the maximum load among the edges. We use competitive analysis to measure the performance of algorithms. We show that the competitive ratio for any algorithm is ,Ω(log N), and we provide an algorithm whose competitive ratio is O(log N).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. N. Alon, G. Kalai, M. Ricklin, and L. Stockmeyer. Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. In 33rd FOCS, pages 334–343, 992.

    Google Scholar 

  2. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In 34th FOGS, pages 32–40, 1993.

    Google Scholar 

  3. B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. In 25th STOC, pages 164–173, 1993.

    Google Scholar 

  4. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosen. Competitive non-preemptive call control. In 5th SODA, pages 312–320, 1994.

    Google Scholar 

  5. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line admission control and circuit routing for high performance computing and communication. In 35th FOCS, pages 412–423, 1994.

    Google Scholar 

  6. B. Awerbuch, S. Kutten, and D. Peleg. Competitive distributed job scheduling. In 24th STOC, pages 517–580, 1992.

    Google Scholar 

  7. Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In 24th STOC, pages 39–50, 1992.

    Google Scholar 

  8. Y. Banal and A. Rosén. The distributed k-server problem — a competitive distributed translator for k-server algorithms. In 33rd FOGS, pages 344–353, 1992.

    Google Scholar 

  9. A. Borodin, P. Raghavan, B. Schieber, and E. Upfal. How much can hardware help routing. In 25th STOC, pages 573–582, 1993.

    Google Scholar 

  10. S. Irani, N. Reingold, J. Westbrook, and D. Sleator. Randomized competitive algorithms for the list update problem. In 2nd SODA, pages 251–260, 1991.

    Google Scholar 

  11. C. Kaklamanis, D. Krizanc, and T. Tsantilas. Tight bounds for oblivious routing in the hypercube. In 2nd SPAA, pages 31–36, 1990.

    Google Scholar 

  12. E. Koutsoupias and C. Papadimitriou. On the k-server conjecture. In 26th STOC, pages 507–511, 1994.

    Google Scholar 

  13. M. Kunde. Packet routing on grids of processors. Algorithmica, 9(1):32–46, 1993.

    Google Scholar 

  14. T. Leighton. Average case analysis of greedy routing algorithms on arrays. In 2nd SPAA, pages 2–10, 1990.

    Google Scholar 

  15. T. Leighton, F. Makedon, and I. Tollis. A 2n −2 step algorithm for routing in an nx n array with constant size queues. In 1st SPAA, pages 328–335, 1989.

    Google Scholar 

  16. S. Rajasekaran and R. Overholt. Constant queue routing on a mesh. In 8th Annual Symposium on Theoretical Aspects of Computer Science, volume 480 of Lecture Nodes in Computer Science, pages 444–455, Springer-Verlag, 1991.

    Google Scholar 

  17. J. Sibeyn, B. Chlebus, and M. Kaufmann. Deterministic permutation routing on meshes. J. Algorithms, 22:111–141, 1997.

    Google Scholar 

  18. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28:202–208, 1985.

    Google Scholar 

  19. S. Vishwanathan. Randomized on-line graph coloring. J. Algorithms, 13(4):657–669, 1992.

    Google Scholar 

  20. T.-H. Yeh, C.-M. Kuo, C.-L. Lei, and H.-C. Yen. Competitive source routing on tori and meshes. Technical report, Dept. of Electrical Engineering, National Taiwan University, 1996.

    Google Scholar 

  21. N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11(6):525–541, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan, ROC

    Tzuoo-Hawn Yeh, heng-Ming Kuo, Chin-Laung Lei & Hsu-Chun Yen

Authors
  1. Tzuoo-Hawn Yeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. heng-Ming Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chin-Laung Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hsu-Chun Yen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hon Wai Leong Hiroshi Imai Sanjay Jain

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yeh, TH., Kuo, hM., Lei, CL., Yen, HC. (1997). Competitive source routing on tori and meshes. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-63890-3_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63890-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation