Advertisement

A fast switch algorithm for ABR traffic to achieve max-min fairness

  • Danny H. K. Tsang
  • Wales Kin Fai Wong
  • Sheng Ming Jiang
  • Eric Y. S. Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1044)

Abstract

In this paper, a new rate-based switch mechanism is proposed for flow control of ABR traffic. By making use of the most upto-date information from both the upstream and the downstream paths, the current bottleneck of the VC can quickly be found. The bandwidth allocation for different VCs can then be adjusted by using this new bottleneck information to achieve max-min fairness allocation [1]. We compare the proposed scheme to CAPC [2] and ERICA [3]. Simulation results showed that the transient response times of the sources are significantly reduced in the proposed scheme. Furthermore, the peak queue lengths of the switches are generally smaller.

Keywords

Queue Length Asynchronous Transfer Mode Asynchronous Transfer Mode Network Peak Cell Rate Congestion Indication 
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.
    Bartsekas, D., Gallager, R.: Data Networks. Prentice Hall, 2nd Edition, 1987Google Scholar
  2. 2.
    Barnhart, A.W.: Explicit Rate Performance Evaluation. ATM Forum 94-0983R1Google Scholar
  3. 3.
    Jain, R.: A Sample Switch Algorithm. ATM Forum 95-0178R1Google Scholar
  4. 4.
    Sathay, S.: ATM Forum Traffic Management Specification Version 4. ATM Forum 95-0013Google Scholar
  5. 5.
    Kung, H.T., Morris, R., Charuhas, T., Lin, D.: Use of Link-by-Link Flow Control in Maximising ATM Networks Performance: Simulation Results. Proc. IEEE Hot Interconnects Symposium, '93Google Scholar
  6. 6.
    Saunders, S.: ATM Forum Ponders Congestion Control Options. Data Communications, March 1994, page 55–60Google Scholar
  7. 7.
    Ramakrishnan, K. K., Jain, R.: A Binary Feedback Scheme for Congestion Avoidance in Computer Networks. ACM Transaction on Computer Systems, Vol. 8, No. 2, May 1990, page 159–181Google Scholar
  8. 8.
    Jain, R.: Congestion Control and Traffic Management in ATM Networks: Recent Advances and A Survey. Invited submission to Computer Networks and ISDN SystemsGoogle Scholar
  9. 9.
    Jain, R., et al.: Rate Based Schemes: Mistakes to Avoid. ATM Forum 94-0882Google Scholar
  10. 10.
    Bonomi, F., Fendick, K.W.: The Rate-Based Flow Control Framework for the Available Bit Rate ATM Service. IEEE Network Magazine, March/April 1995, page 25–39Google Scholar
  11. 11.
    Chang, Y., Golmie, N., Su, D.: Comparative Analysis of the Evolving End System Behavior (Simulation Study). ATM Forum 95-0395R1Google Scholar
  12. 12.
    COMDISCO System Inc.: BONeS DESIGNER Core Library Guide. June 1993Google Scholar
  13. 13.
    Wojnaroski, L.: Baseline Text for Traffic Management Sub-Working Group. ATM Forum 94-0394R5Google Scholar
  14. 14.
    Barnhart, A.W.: Providing improved Explicit Rate Performance for the LAN. ATM Forum 94-1111Google Scholar
  15. 15.
    Charny, A.: An Algorithm for Rate Allocation in a Packet-Switching Network with Feedback. MIT/LCS/TR-601. April 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Danny H. K. Tsang
    • 1
  • Wales Kin Fai Wong
    • 1
  • Sheng Ming Jiang
    • 1
  • Eric Y. S. Liu
    • 2
  1. 1.Department of Electrical and Electronic EngineeringHong Kong University of Science and TechnologyKowloonHong Kong
  2. 2.Broadband and Data StrategiesLondonUK

Personalised recommendations