Advertisement

An Improved Algorithm for CIOQ Switches

  • Yossi Azar
  • Yossi Richter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3221)

Abstract

The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most general model that has been investigated is the standard CIOQ (Combined Input and Output Queued) switch architecture with internal fabric speedup S ≥ 1. CIOQ switches, that comprise the backbone of packet routing networks, are N × N switches controlled by a switching policy that incorporates two components: admission control and scheduling. An admission control strategy is essential to determine the packets stored in the FIFO queues in input and output ports, while the scheduling policy conducts the transfer of packets through the internal fabric, from input ports to output ports. The online problem of maximizing the total weighted throughput of CIOQ switches was recently investigated by Kesselman and Rosén in [12]. They presented two different online algorithms for the general problem that achieve non-constant competitive ratios (linear in either the speedup or the number of distinct values or logarithmic in the value range). We introduce the first constant-competitive algorithm for the general case of the problem, with arbitrary speedup and packet values. Specifically, our algorithm is 9.47-competitive, and is also simple and easy to implement.

Keywords

Admission Control Output Port Competitive Ratio Online Algorithm Input Port 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aiello, W.A., Mansour, Y., Rajagopolan, S., Rosén, A.: Competitive queue policies for differentiated services. In: Proceedings of the IEEE INFOCOM 2000, pp. 431–440 (2000)Google Scholar
  2. 2.
    Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proc. 36th ACM Symp. on Theory of Computing (2004) (to appear)Google Scholar
  3. 3.
    Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 761–770 (2003)Google Scholar
  4. 4.
    Andrews, M., Awerbuch, B., Fernández, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention-resolution protocols. In: Proc. 37th IEEE Symp. on Found. of Comp. Science, pp. 380–389 (1996)Google Scholar
  5. 5.
    Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. In: Proc. 35th ACM Symp. on Theory of Computing, pp. 82–89 (2003)Google Scholar
  6. 6.
    Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proc. 36th ACM Symp. on Theory of Computing (2004) (to appear)Google Scholar
  7. 7.
    Birman, A., Gail, H.R., Hantler, S.L., Rosberg, Z., Sidi, M.: An optimal service policy for buffer systems. Journal of the Association Computing Machinery (JACM) 42(3), 641–657 (1995)zbMATHMathSciNetGoogle Scholar
  8. 8.
    Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial queuing theory. In: Proc. 28th ACM Symp. on Theory of Computing, pp. 376–385 (1996)Google Scholar
  9. 9.
    Hahne, E.L., Kesselman, A., Mansour, Y.: Competitive buffer management for shared-memory switches. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 53–58 (2001)Google Scholar
  10. 10.
    Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proc. 33rd ACM Symp. on Theory of Computing, pp. 520–529 (2001)Google Scholar
  11. 11.
    Kesselman, A., Mansour, Y.: Loss-bounded analysis for differentiated services. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pp. 591–600 (2001)Google Scholar
  12. 12.
    Kesselman, A., Rosén, A.: Scheduling policies for CIOQ switches. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 353–362 (2003)Google Scholar
  13. 13.
    Lotker, Z., Patt-Shamir, B.: Nearly optimal fifo buffer management for diffserv. In: Proc. 21st ACM Symp. on Principles of Distrib. Computing, pp. 134–143 (2002)Google Scholar
  14. 14.
    May, M., Bolot, J.C., Jean-Marie, A., Diot, C.: Simple performance models of differentiated services for the internet. In: Proceedings of the IEEE INFOCOM 1999, pp. 1385–1394 (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Yossi Azar
    • 1
  • Yossi Richter
    • 1
  1. 1.School of Computer ScienceTel Aviv UniversityTel AvivIsrael

Personalised recommendations