Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Worst Traffic Passing Virtual Frame Regulation: Analysis with Dynamic Programming

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This paper studies a discrete-time queueing system in which the traffic regulation places an upper bound on the number of arrivals in each of the non-overlapping time windows (virtual frames) of a fixed length. The worst traffic passing through this traffic regulation is characterized. As a criterion for traffic comparison, this paper employs the weighted sum of queueing delays with the weighting factors decaying geometrically over the time horizon. This paper uses dynamic programming techniques and convexity argument to characterize the worst traffic.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.M. Barceló, J. García and O. Casals, Comparison of models for the multiplexing of worst case traffic sources, in: First Workshop on ATM Traffic Management, Paris, France, December 1995.

  2. J.M. Barceló, J. García-Vidal and O. Casals, Worst-case traffic in a tree network of ATM multiplexers, IEEE/ACM Trans. Networking 8(4) (2000) 507-516.

    Google Scholar 

  3. D. Bertsekas, Dynamic Programming: Deterministic and Stochastic Models (Prentice-Hall, Englewood Cliffs, NJ, 1987).

    Google Scholar 

  4. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1992).

    Google Scholar 

  5. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang and W. Weiss, An architecture for differentiated services, Internet Society, RFC 2475 (December 1998).

  6. M. Bonatti and A.A. Gaivoronski, Worst case analysis of ATMsources with application to access engineering of broadband multiservice networks, in: The Fundamental Role of Teletraffic in the Evolution of Telecommunication Networks, eds. J. Labetoulle and J.W. Roberts (Elsevier Science, Amsterdam, 1994) pp. 559-569.

    Google Scholar 

  7. B.T. Doshi, Deterministic rule based traffic descriptors for broadband ISDN: Worst case behavior and connection acceptance control, in: The Fundamental Role of Teletraffic in the Evolution of Telecommunication Networks, eds. J. Labetoulle and J.W. Roberts (Elsevier Science, Amsterdam, 1994) pp. 591-600.

    Google Scholar 

  8. B. Erimli, J. Murphy and J. Murphy, On worst case traffic in ATM networks, in: Twelfth UK IEE Teletraffic Symposium, Windsor, United Kingdom, March 1995.

    Google Scholar 

  9. S.J. Golestani, Congestion-free communication in broadband packet networks, IEEE Trans. Commun. 39(12) (1991) 1802-1812.

    Google Scholar 

  10. A. Skliros, Characterizing the worst traffic profile passing through an ATM-UNI, in: First UK Workshop on Performance Modeling and Evaluation of ATM Networks, IFIP, 1993, pp. 74-84.

  11. T. Tsuchya and H. Saito, The worst case cell arrival patterns that conform to the GCRA in ATM networks, in: Proc. of GLOBECOM'95, November 1995, pp. 1432-1438.

  12. T. Tsuchya and H. Saito, The worst case cell arrival patterns in ATM networks, IEICE Trans. Commun. B 81(5) (1998) 996-1003.

    Google Scholar 

  13. J.S. Turner, New directions in communications (or which way to the information age?), IEEE Commun. Mag. (October 1986).

  14. T. Worster, Modelling deterministic queues: the leaky bucket as an arrival process, in: The Fundamental Role of Teletraffic in the Evolution of Telecommunication Networks, eds. J. Labetoulle and J.W. Roberts (Elsevier Science, Amsterdam, 1994) pp. 581-590.

    Google Scholar 

  15. N. Yamanaka, Y. Sato and K. Sato, Performance limitation of leaky bucket algorithm for usage parameter control and bandwidth allocation methods, IEICE Trans. Commun. E75-B(2) (1992) 82-86.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, D.C. Worst Traffic Passing Virtual Frame Regulation: Analysis with Dynamic Programming. Queueing Systems 38, 381–395 (2001). https://doi.org/10.1023/A:1010943810954

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010943810954

Navigation