Advertisement

Telecommunication Systems

, Volume 12, Issue 2–3, pp 149–166 | Cite as

Simulation‐based results of weighted fair queuing algorithms for ATM networks

  • Fabrice Guillemin
  • Alain Dupuis
Article

Abstract

The behavior of the ideal General Processor Sharing (GPS) discipline and different per‐VC queuing algorithms approximating this ideal scheme, namely the Self Clocked Fair Queuing, the Packet by Packet Generalized Processor Sharing, and the Virtual Starting Time disciplines, are studied in this paper via simulation. We specifically consider a simple simulation configuration involving two Constant Bit rate (CBR) connections and several ON/OFF connections (bursty traffic). This simple simulation experiment allows us to point out three important features of the GPS and approximating disciplines. First, by adequately choosing the weight coefficients, these scheduling schemes can offer to CBR traffic almost Head of Line (HOL) priority over ON/OFF connections, to each of which, nevertheless, a minimum bandwidth is guaranteed. Second, GPS and per‐VC queuing disciplines, like the simple FIFO scheme, is very sensitive to burst scale congestion phenomena. Finally, simulation results seem to indicate that the scheduling disciplines considered perform traffic shaping on ON/OFF connections, which drastically reduces the burstiness of output traffic.

Keywords

Sojourn Time FIFO Queue Queue Occupancy Silence Duration Peak Cell Rate 
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]
    P. Boyer, F. Guillemin, M. Servel and J.P. Coudreuse, Spacing cells protects and enhances utilization of ATM network links, IEEE Communications Magazine (September 1992) 38–49.Google Scholar
  2. [2]
    D. Clark, S. Shenker and L. Zhang, Supporting real time applications in an integrated services packet network: Architecture and mechanism, in: Proc.SIGCOMM’ 92, Baltimore, MD (1992) pp. 14–26.Google Scholar
  3. [3]
    A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm, in: Proc.ACM SIGCOM’ 89(1989) pp. 3–12.Google Scholar
  4. [4]
    K. Fendick and F. Bonomi, The rate-based flow control framework for the available bit rate ATM service, IEEE Network Magazine (March/April 1995) 25–39.Google Scholar
  5. [5]
    J. Golestani, A self-clocked fair queueing scheme for broadband applications, in: Proc.INFOCOM’ 94 (April 1994) pp. 636–646.Google Scholar
  6. [6]
    A. Hung and G. Kesidis, Bandwidth scheduling for wide area ATM networks using virtual finishing times, IEEE/ACM Transactions on Networking 14(1) (1996) 49–54.CrossRefGoogle Scholar
  7. [7]
    R. Jain, Congestion control and traffic management in ATM networks: Recent advances and a survey, Computer Networks and ISDN Systems 28(13) (1996) 1723–1738.CrossRefGoogle Scholar
  8. [8]
    H.T. Kung and R. Morris, Credit-based flow control for ATM networks, IEEE Network Magazine (March/April 1995) 40–48.Google Scholar
  9. [9]
    J. Nagle, On packet switches with infinite storages, IEEE Transactions on Communications 35 (1987) 435–438.CrossRefGoogle Scholar
  10. [10]
    C. ¨Ozveren, R. Simcoe and G. Varghese, Reliable and efficient hop-by-hop flow control, IEEE Journal on Selected Areas in Communications 13(2) (1995) 642–650.CrossRefGoogle Scholar
  11. [11]
    A. Parekh and R. Gallager, A generalized processor sharing approach to flow control integrated services networks – the single node case, in: Proc.INFOCOM’ 92(1992) pp. 915–924.Google Scholar
  12. [12]
    A. Parekh and R. Gallager, A generalized processor sharing approach to flow control integrated services networks – the multiple node case, in: Proc.INFOCOM’ 93(1993) pp. 521–530.Google Scholar
  13. [13]
    J. Roberts, Variable-bit-rate traffic control in B-ISDN, IEEE Communications Magazine (September 1991) 50–56.Google Scholar
  14. [14]
    J. Roberts, Virtual spacing for flexible traffic control, International Journal on Digital and Analog Communication (1994) 307–318.Google Scholar
  15. [15]
    Uni Specification, Version 4.0, The ATM Forum (June 1996).Google Scholar
  16. [16]
    L. Zhang, Virtual clock: A new traffic control algorithm for packet switching networks, in: Proc. ACM SIGCOM’ 90(1990) pp. 19–29.Google Scholar
  17. [17]
    Z.L. Zhang, D. Towsley and J. Kurose, Statistical analysis of generalized processor sharing scheduling discipline, in: Proc.ACM SIGCOM’ 94(1994) pp. 68–77.Google Scholar

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • Fabrice Guillemin
    • 1
  • Alain Dupuis
    • 1
  1. 1.BD‐CNET‐DAC/ARP, Technopole AnticipaFrance TelecomLannion CedexFrance E-mail:

Personalised recommendations