Skip to main content
SpringerLink
Log in

Evaluating scheduling in integrated‐services networks using a semi‐fluid‐flow model

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

An integrated‐services network carries diverse traffic, which leads to diverse performance objectives. For example, voice and video packets typically have performance objectives based on the fraction of packets that will be delivered within a given delay bound, while data packets often have objectives based on mean delay. Greater loads can be supported in networks in which a voice or video packet is given priority over data packets if and only if the former is in danger of missing its deadline. Algorithms that allow this include Cost‐Based Scheduling, occupancy‐based algorithms, the Priority Token Bank, and to a lesser extent, the Leaky Bucket. This paper presents an approach to evaluating performance with these algorithms in the realistic case where data arrivals are highly bursty, but voice and video packets are not. Mean queueing delay for data bursts is determined analytically in some important scenarios, and an efficient simulation approach based on the same model is described for cases where analysis is not currently possible. The model is a semi‐fluid‐flow model in which voice or video packets are assumed to arrive as a continuous fluid flow, whereas data packets arrive in large bursts at discrete instants in time.

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

Similar content being viewed by others

References

  1. D. Anick, D. Mitra and M.M. Sondhi, Stochastic theory of a data-handling system with multiple sources, The Bell System Technical Journal 8 (1982) 1871-1894.

    Google Scholar 

  2. H.G. Badr, I. Mitrani and J.R. Spirn, An adaptive priority queue, in: Applied Probability — Computer Science: The Interface, Vol. 2, eds. R.L. Disney and T.J. Ott, (ORSA-TIMS, 1982) pp. 345-371.

  3. J. Beran, R. Sherman, M.S. Taqqu and W. Willinger, Long-range dependence in variable-bit-rate video traffic, IEEE Transactions on Communications 2/3/4 (1994) 1566-1579.

    Google Scholar 

  4. R. Chipalkatti, J.F. Kurose and D. Towsley, Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer, in: Proc. IEEE INFOCOM (1989) pp. 774-783.

  5. A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm, in: Proc. ACM SIGCOMM (1989) pp. 1-12.

  6. A.E. Eckberg, Discussant's Report on ‘Algorithmic Analysis of a Dynamic Priority Queue,’ in: Applied Probability — Computer Science: The Interface, Vol. 2, eds. R.L. Disney and T.J. Ott, (ORSA-TIMS, 1982) pp. 205-206.

  7. S.J. Golestani, A framing strategy for congestion management, IEEE Journal on Selected Areas in Communications 7 (1991) 1064-1077.

    Google Scholar 

  8. C.R. Kalmanek, H. Kanakia and S. Keshav, Rate controlled servers for very high-speed networks, in: Proc. IEEE GLOBECOM (1990) pp. 12-20.

  9. L. Kleinrock, Queueing Systems, Vol. 2: Computer Applications (Wiley, New York, 1976) pp. 121-122.

    Google Scholar 

  10. K. Kümmerle, Multiplexer performance for integrated line and packet-switched traffic, in: Proc. Second International Conference on Computer Communication (1974) pp. 517-523.

  11. D. Lee and B. Sengupta, Queueing analysis of a threshold based priority scheme for ATM networks, IEEE/ACM Transactions on Networking 6 (1993) 709-717.

    Google Scholar 

  12. W.E. Leland, M.S. Taqqu, W. Willinger and D.V. Wilson, On the self-similar nature of Ethernet traffic (extended version), IEEE/ACM Transactions on Networking 1 (1994) 1-14.

    Google Scholar 

  13. N. Likhanov and B. Tsybakov, Analysis of an ATM buffer with self-similar ('fractal') input traffic, in: Proc. IEEE INFOCOM (1995) pp. 985-992.

  14. D.M. Lucantoni, M.F. Neuts and A.R. Reibman, Methods for performance evaluation of VBR video traffic models, IEEE/ACM Transactions on Networking 2 (1994) 176-180.

    Google Scholar 

  15. M.A. Lynn and J.M. Peha, Priority token bank scheduling in a network of queues, in: Proc. IEEE International Conference on Communications (ICC) (1997) pp. 1387-1391.

  16. B. Maglaris, D. Anastassiou, P. Sen, G. Karlsson and J.D. Robbins, Performance models of statistical multiplexing in packet video communications, IEEE Transactions on Communications 7 (1988) 834-844.

    Google Scholar 

  17. K.S. Meier-Hellstern, P.E. Wirth, Y.-L. Lan and D.A. Hoeflin, Traffic models for ISDN data users: office automation application, in: Proc. Thirteenth International Teletraffic Congress (1991) pp. 167-172.

  18. A.K. Parekh and R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: the single-node case, IEEE/ACM Transactions on Networking 3 (1993) 344-357.

    Google Scholar 

  19. 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 (1994) 137-150.

    Google Scholar 

  20. V. Paxson and S. Floyd, Wide area traffic: the failure of Poisson modeling, IEEE/ACM Transactions on Networking 3 (1995) 226-244.

    Google Scholar 

  21. J.M. Peha and F.A. Tobagi, A cost-based scheduling algorithm to support integrated services, in: Proc. IEEE INFOCOM (1991) pp. 741-753.

  22. J.M. Peha, Scheduling and dropping algorithms to support integrated services in packet-switched networks, Ph.D. thesis, CSL-TR-91-489, Computer Systems Laboratory, Stanford University (1991).

  23. J.M. Peha and F.A. Tobagi, Implementation strategies for scheduling algorithms in integrated services packet-switched networks, in: Proc. IEEE GLOBECOM (1991) pp. 1733-1740.

  24. J.M. Peha, The priority token bank: integrated scheduling and admission control for an integrated-services network, in: Proc. IEEE International Conference on Communications (ICC) (1993) pp. 345-351.

  25. J.M. Peha, Heterogeneous-criteria scheduling: minimizing weighted number of tardy jobs and weighted completion time, Computers and Operations Research 10 (1995) 1089-1100.

    Google Scholar 

  26. J.M. Peha and F.A. Tobagi, Cost-based scheduling and dropping algorithms to support integrated services, IEEE Transactions on Communications 2 (1996) 192-202.

    Google Scholar 

  27. J.M. Peha, Simulating ATM integrated-services networks, in: Proc. 29th Annual IEEE/ACM/SCS Simulation Symposium (1996) pp. 162-171.

  28. J.M. Peha, Retransmission mechanisms and self-similar traffic models, in: Proc. IEEE/ACM/SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (1997) pp. 47-52.

  29. J.M. Peha and S. Tewari, The results of competition between integrated-services telecommunications carriers, to appear in Information Economics and Policy, Special Issue on Multimedia Economics.

  30. P. Sen, B. Maglaris, N.-E. Rikli and D. Anastassiou, Models for packet switching of variable-bit-rate video sources, IEEE Journal on Selected Areas in Communications 5 (1989) 856-859.

    Google Scholar 

  31. C. Shim, I. Ryoo, J. Lee and S. Lee, Modeling and call admission control algorithm of variable bit rate video in ATM networks, IEEE Journal on Selected Areas in Communications 2 (1994) 332-344.

    Google Scholar 

  32. R.C.F. Tucker, Accurate method for analysis of a packet-speech multiplexer with limited delay, IEEE Transactions on Communications 4 (1988) 479-483.

    Google Scholar 

  33. J.S. Turner, New directions in communications (or which way to the information age?), IEEE Communications Magazine 10 (1986) 8-15.

    Google Scholar 

  34. Q. Wang, J.M. Peha and M. Sirbu, Optimal pricing for integrated-services networks, in: Internet Economics, eds. J. Bailey and L. McKnight (MIT Press, Cambridge, 1997) pp. 353-376.

    Google Scholar 

  35. W. Willinger, M.S. Taqqu, R. Sherman and D.V. Wilson, Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level, in: Proc. ACM SIGCOMM (1995) pp. 100-113.

Download references

Author information

Authors and Affiliations

  1. Department of ECE, Carnegie Mellon University, Pittsburgh, PA, 15213‐3890, USA E-mail:

    Jon M. Peha

Authors
  1. Jon M. Peha
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peha, J.M. Evaluating scheduling in integrated‐services networks using a semi‐fluid‐flow model. Telecommunication Systems 9, 59–77 (1998). https://doi.org/10.1023/A:1019186110028

Download citation

  • Issue Date:

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

Keywords

Search

Navigation