Skip to main content
SpringerLink
Log in

Ordonnancement de paquets équitable par les disciplinesgps etdgps

Fair packet scheduling using gps and dgps disciplines

  • Published:
Annales Des Télécommunications Aims and scope Submit manuscript

Résumé

La fourniture de garanties de qualité de service efficientes etflexibles dans les réseaux à intégration de services passe par l’usage de disciplines d’ordonnancement évoluées. Cet article se concentre sur la classe d’algorithmes d’ordonnancement équitable, passant en revue dans un premier temps le principe gveneral et les approximations connues de ce procédé, puis se focalise dans un second temps sur le service d’applications adaptatives en mettant en évidence la nécessité d’introduire un nouveau paradigme d’ordonnancement, nommé (dgps); pour ce dernier une technique d’approximation est introduite et évaluée.

Abstract

Providing efficient and flexible quality of service guarantees within interogated services packet networks requires the deployment of advanced scheduling disciplines. This paper concentrates on the class of so-called fair queuing algorithms, firstly reviewing the general principle and its known approximations, then focusing on the service of adaptive applications, shedding light on the need to introduce a new scheduling paradigm, named dgps for decoupled generalized processor sharing; for the latter scheme an approximation technique is introduced and evaluated.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Bibliographie

  1. Bennett (J. C. R.), Zhang (H.), WF2Q: worst-case fair queueing.Proceedings of IEEE Infocom, pp. 120–128, San Francisco, CA, (March 1996).

  2. Bennett (J. C. R.), Zhang (H.), Hierarchical packet fair queueing algorithms.Proc.Acm Sigcomm’96, Stanford, CA, (August 1996).

  3. Demers (A.), Keshav (S.), Shenker (S.), Analysis and simulation of a fair queueing algorithm.Journal of Internetworking Research and Experiment, pp. 3–26, (October 1990). AlsoPro.Acm Sigcomm’89, pp. 3–12.

  4. Greenberg (A. G.),Madras (N.), How fair is fair queueing?Journal of the Acm 39, no. 3, (July 1992), pp. 568–598.

    Article  MATH  MathSciNet  Google Scholar 

  5. Golestani (S. J.), A self-clocked fair queueing scheme for broadband applications.Proc. Ieee Infocom’94, pp. 636– 646, Toronto, CA, (June 1994).

  6. Golestani (S. J.), Fair queueing algorithms for packet scheduling in Bisdn.Proc. IZS’96, Zurich, (1996).

  7. Goyal (P.), Vin (H. M), Cheng (H.), Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks.Proc. tAcm Sigcomm’96, Stanford, CA, (August 1996).

  8. Keshav (S.), Congestion control in computer networks.Ph’D thesis, University of California, Berkeley, (June 1991).

  9. Parekh (A. K.), Gallager (R. G.), A generalized processor sharing approach to flow control in integrated services networks-the single node case.Proceedings of Infocom, pp. 914–924. Ieee, (1992).

  10. Rexford (J. L.), Greenberg (A. G.), Bonomi (E. G.), Hardware-efficient fair queueing architecture for high-speed networks.Proc Ieee Infocom’96, San Francisco, (1996), pp. 638–646.

  11. Stiliadis (D.), Varma (A.), Design and analysis of framebased fair queueing: a new traffic scheduling algorithm for packet-switched networks.Proc.Acm Sigmetrics’96, Philadelphia, PA, (1996).

  12. Suri (S.), Varghese (G.), Chandranmenon, Leap forward virtual clock: An O(log log n) fair queueing scheme with guaranteed delays and throughput fairness.Proc. Ieee Infocom ’97, Kobe, Japan, (Apr. 1997).

  13. Towsley (D.), Providing quality of service in packet switched networks. Performance Evaluation of Computer and Communication System (ed. L. Donatello, R. Nelson), pp. 560–586,Springer Verlag, (1993).

  14. Zhang (L.), Virtual clock: A new traffic control algorithm for packet switching networks.Proc. Acm Sigcomm’90, pp. 19–29, Philadephia, PA, (September 1990).

  15. Toutain (E.). Gestion préemptive et équitable de la qualité de service dans les réseaux de paquets à intégration de services.Thèse de Doctoral de l’Université de Rennes I, (juillet 1997).

  16. Toutain (E.), Decoupled generalized processor sharing: A fair queueing principle for adaptive multimedia applications.Proc. Ieee lnfocom’98,1, pp. 291–298, San Francisco, CA, (March 1998).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA/INRIA Rennes, Campus Universitaire de Beaulieu, F 35042, Rennes Cedex, France

    Françis Toutain

Authors
  1. Françis Toutain
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Françis Toutain.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Toutain, F. Ordonnancement de paquets équitable par les disciplinesgps etdgps . Ann. Télécommun. 53, 389–405 (1998). https://doi.org/10.1007/BF02998504

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02998504

Mots clés

Key words

Search

Navigation