Advertisement

Determining end-to-end delay bounds in heterogeneous networks

  • Pawan Goyal
  • Simon S. Lam
  • Harrick M. Vin
Session VIII: Network Scheduling and Real-Time Networking
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1018)

Abstract

We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-by-Packet Generalized Processor Sharing and Self Clocked Fair Queuing. For networks that employ scheduling algorithms belonging to GR, we present a method for determining an upper bound on end-to-end delay. The method facilitates determination of end-to-end delay bounds for a variety of sources. We illustrate the method by determining end-to-end delay bounds for sources conforming to Leaky Bucket and Exponentially Bounded Burstiness.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D.D. Clark, S. Shenker, and L. Zhang. Supporting Real-Time Applications in an Integrated Services Packet Network. In Proceedings of ACM SIGCOMM, pages 14–26, August 1992.Google Scholar
  2. [2]
    R.L. Cruz. A Calculus for Network Delay, Part I: Network Elements in Isolation. IEEE Transactions on Information Theory, 37:114–131, Jan 1991.Google Scholar
  3. [3]
    R.L. Cruz. A Calculus for Network Delay, Part II: Network Analysis. IEEE Transactions on Information Theory, 37:132–141, Jan 1991.Google Scholar
  4. [4]
    A. Demers, S. Keshav, and S. Shenker. Analysis and Simulation of a Fair Queueing Algorithm. In Proceedings of ACM SIGCOMM, pages 1–12, September 1989.Google Scholar
  5. [5]
    D. Ferrari and D. C. Verma. A Scheme for Real-Time Channel Establishment in Wide-Area Networks. IEEE Journal on Selected Areas in Communications, 8(3):368–379, April 1990.Google Scholar
  6. [6]
    S.J. Golestani. A Framing Strategy for Congestion Management. IEEE Journal on Selected Areas in Communications, pages 1064–1077, September 1991.Google Scholar
  7. [7]
    S.J. Golestani. A Self-Clocked Fair Queueing Scheme for High Speed Applications. In Proceedings of INFOCOM, 1994.Google Scholar
  8. [8]
    P. Goyal, S.S. Lam, and H.M. Vin. Determining End-to-End Delay Bounds in Heterogeneous Networks. Technical report, Department of Computer Sciences, University of Texas at Austin, (available by anonymous ftp from ftp.cs.utexas.edu in directory pub/multimedia), March 1995.Google Scholar
  9. [9]
    C.R. Kalmanek, H. Kanakia, and S. Keshav. Rate Controlled Servers for Very High-Speed Networks. In Proceedings of IEEE GLOBECOM'90, San Diego, CA, pages 300.3.1–300.3.9, December 1990.Google Scholar
  10. [10]
    S.S. Lam and G.G. Xie. Burst Scheduling: Architecture and Algorithm for Switching Packet Video. In Proceedings of INFOCOM, April 1995.Google Scholar
  11. [11]
    A. K. Parekh and R. G. Gallager. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case. IEEE/ACM Transactions On Networking, 2(2): 137–150, April 1994.Google Scholar
  12. [12]
    A.K. Parekh. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, 1992.Google Scholar
  13. [13]
    S. Shenker. Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines. In Proceedings of ACM SIGCOMM, pages 47–57, 1994.Google Scholar
  14. [14]
    G.G. Xie and S.S. Lam. Delay Guarantee of Virtual Clock Server. Technical Report TR-94-24, Dept. of Computer Sciences, UT-Austin, October 1994. Presented at 9th IEEE Workshop on Computer Communications, October 1994.Google Scholar
  15. [15]
    O. Yaron and M. Sidi. Generalized Processor Sharing Networks with Exponentially Bounded Burstiness Arrivals. In Proceedings of INFOCOM, 1994.Google Scholar
  16. [16]
    H. Zhang and D. Ferrari. Rate Controlled Static Priority Queueing. In Proceedings of INFOCOM, volume 2, pages 227–236, 1993.Google Scholar
  17. [17]
    H. Zhang and S. Keshav. Comparison of Rate-Based Service Disciplines. In Proceedings of ACM SIGCOMM, pages 113–121, August 1991.Google Scholar
  18. [18]
    L. Zhang. VirtualClock: A New Traffic Control Algorithm for Packet Switching Networks. In Proceedings of ACM SIGCOMM, pages 19–29, August 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Pawan Goyal
    • 1
  • Simon S. Lam
    • 1
  • Harrick M. Vin
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustin

Personalised recommendations