Priority Queueing Applied to Expedited Forwarding: A Measurement-Based Analysis

  • Tiziana Ferrari
  • Giovanni Pau
  • Carla Raffaelli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1922)


The priority queueing mechanism is analysed to verify its effectiveness when applied for the support of Expedited Forwarding-based services in the Differentiated Services environment. An experimental measurement-based methodology is adopted to outline its properties and end-to-end performance when supported in real transmission devices. A test layout has been set up over a metropolitan area for the estimation of one-way delay and instantaneous packet delay variation. The effect of relevant factors like the buffering architecture, the background traffic packet size distribution and the EF traffic profile are considered. In particular, the complementary one-way delay probability function is computed for a given packet size distribution and the Aggregation Degree parameter is defined to quantify the effect of traffic aggregation on end-to-end QoS.1


Priority Queueing Differentiated Services Expedited Forwarding Performance measurement One-way delay Instantaneous packet delay variation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 2.
    Nichols, K., Jacobson, V., Zhang, L.: A Two-bit Differentiated Services Architecture for the Internet 167Google Scholar
  2. 4.
    Bernet, Y., Smith, A., Blake, S.: A Conceptual Model for Diffserv Routers, diffserv draft, work in progress. 168Google Scholar
  3. 5.
    Zhang, H.: Service Disciplines For Guaranteed Performance Service in Packet-Switching Networks 168Google Scholar
  4. 6.
    Ferrari, T., Chimento, H., P.: A Measurement-Based Analysis of Expedited Forwarding PHB Mechanisms, Proceedings of the Eighth Int. Workshop on Quality of Service, IWQoS 2000, Page(s) 127–137 168Google Scholar
  5. 7.
    Bertsekas, D., Gallager, R.: Data Networks, Prentice Hall, Page(s) 203–205 171, 174, 175Google Scholar
  6. 8.
    Kleinrock, L.: Queueing Systems, John Wiley & Sons, Page(s) 106–147 171Google Scholar
  7. 9.
    Demichelis, C., Chimento, P.: Instantaneous Packet Delay Variation Metric for IPPM, ippm draft, work in progress. 171Google Scholar
  8. 11.
    Charny A.: Delay Bounds in a Network with Aggregate Scheduling 176Google Scholar
  9. 12.
    Ferrari, T.: End-to-End perfomance Analysis with Traffic Aggregation, TNC’2000 177Google Scholar
  10. 13.
    Law, K. L. E.: The bandwidth guaranteed prioritized queuing and its implementations law, Global Telecommunications Conference, 1997. GLOBECOM’ 97, IEEE Volume: 3, 1997, Page(s) 1445–1449 170CrossRefGoogle Scholar
  11. 14.
    Rönngren, R., Ayani, R.: Acomparative study of parallel and sequential priority queue algorithms, ACM Trans. Mod. Comp.. Sim. 7, 2 (Apr 1997), page(s) 157–209 170Google Scholar
  12. 15.
    Parekh, A., Gallager, R.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case; IEEE/ACM Transactions on Networking, Vol 1, No 3, June 1993 170CrossRefGoogle Scholar
  13. 16.
    Floyd, S, Jacobson, V.: Link-sharing and Resource Management Models for Packet Networks; ACM Transactions on Networking, Vol 3 No. 4, Aug 1995Google Scholar
  14. 17.
    Ferrari, T.: Differentiated Service Experiment Report, TF-TANT interim report Jun 99-Sep 99, 167

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Tiziana Ferrari
    • 1
  • Giovanni Pau
    • 2
  • Carla Raffaelli
    • 2
  1. 1.INFN - CNAFBolognaItaly
  2. 2.DEIS, University of BolognaBolognaItaly

Personalised recommendations