Advertisement

Delay Bounds for FIFO Aggregates: A Case Study

  • Luciano Lenzini
  • Enzo Mingozzi
  • Giovanni Stea
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2811)

Abstract

In a Diffserv architecture, packets with the same marking are treated as an aggregate at core routers, independently of the flow they belong to. Nevertheless, for the purpose of QoS provisioning, derivation of upper bounds on the delay of individual flows is of great importance. In this paper, we consider a case study network, composed by a tandem of rate-latency servers that is traversed by a tagged flow. At each different node, the tagged flow is multiplexed into a FIFO buffer with a different interfering flow. For the case study network, we derive an end-to-end delay bound for tagged flow traffic that, to the best of our knowledge, is better than any other applicable result available from the literature.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Firoiu, V., Le Boudec, J.Y., Towsley, D., Zhang, Z.-L.: Theories and models for Internet quality of service. Proceedings of the IEEE 90(9), 1565–1591 (2002)CrossRefGoogle Scholar
  2. 2.
    Le Boudec, J.-Y., Thiran, P.: Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001)zbMATHCrossRefGoogle Scholar
  3. 3.
    Agrawal, R., Cruz, R.L., Okino, C., Rajan, R.: Performance Bounds for Flow Control Protocols. IEEE/ACM Trans. Network 7(3) (June 1999)Google Scholar
  4. 4.
    Fidler, M.: Extending the Network Calculus Pay Bursts Only Once Principle to Aggregate Scheduling. In: Ajmone Marsan, M., Listanti, G.C.M., Roveri, A. (eds.) QoS-IP 2003. LNCS, vol. 2601, pp. 19–34. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Chang, C.S.: Performance Guarantees in Communication Networks. Springer, New York (2000)zbMATHGoogle Scholar
  6. 6.
    Charny, A., Le Boudec, J.-Y.: Delay Bounds in a Network with Aggregate Scheduling. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds.) QofIS 2000. LNCS, vol. 1922, pp. 1–13. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  7. 7.
    Yiang, Y.: Delay Bounds for a Network of Guaranteed Rate Servers with FIFO Aggregation. Computer Networks 40, 683–694 (2002)CrossRefGoogle Scholar
  8. 8.
    Bennett, J.C.R., Benson, K., Charny, A., Courtney, W.F., Le Boudec, J.-Y.: Delay Jitter Bounds and Packet Scale Rate Guarantee for Expedited Forwarding. IEEE/ACM Trans. on Networking 10(4), 529–540 (2002)CrossRefGoogle Scholar
  9. 9.
    Goyal, P., Vin, H.M.: Generalized guaranteed rate scheduling algorithms: A framework. IEEE/ACM Trans. on Networking 5(4), 561–571 (1997)CrossRefGoogle Scholar
  10. 10.
    Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services IETF RFC 2475 (1998)Google Scholar
  11. 11.
    Nichols, K., Jacobson, V., Zhang, L.: A Two-bit Differentiated Services Architecture for the Internet RFC 2638 (1999)Google Scholar
  12. 12.
    Davie, B., et al.: An expedited forwarding PHB (Per-Hop Behavior), IETF RFC 3246 (March 2002)Google Scholar
  13. 13.
    Charny, A., et al.: Supplemental Information for the New Definition of the EF PHB (Expedited Forwarding Per-Hop Behavior), IETF RFC 3247 (March 2002)Google Scholar
  14. 14.
    Lenzini, L., Mingozzi, E., Stea, G.: Delay Bounds For FIFO Aggregates: A Case Study. Technical Report, Dip. Ingegneria della Informazione, Pisa, Italy (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Luciano Lenzini
    • 1
  • Enzo Mingozzi
    • 1
  • Giovanni Stea
    • 1
  1. 1.Dipartimento di Ingegneria dell’InformazioneUniversity of PisaPisaItaly

Personalised recommendations