Skip to main content
SpringerLink
Log in

Virtual partitioning by dynamic priorities: Fair and efficient resource-sharing by several services

  • Conference paper
  • First Online:
Broadband Communications Networks, Services, Applications, Future Directions (IZS 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1044))

Included in the following conference series:

Abstract

We propose a scheme for sharing an unbuffered resource, such as bandwidth or capacity, by various services. The scheme assigns a nominal capacity to each service class and implements a form of virtual partitioning by means of state-dependent priorities. That is, instead of each class of traffic having a fixed priority, as in traditional trunk reservation schemes, the priorities depend on the state of the system. An approximate method of analysis based on fixed point equations is given. Numerical results are obtained from the approximation, exact computations and simulations. The results show that the scheme is robust, fair and efficient.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ash, G.R., Chen, J.S., Frey, A.E., Huang, B.D.: Real-time network routing in an integrated network. Proceedings of the International Teletraffic Congress (ITC-13), Copenhagen (1991).

    Google Scholar 

  • Foschini, G.J., Gopinath, B., Hayes, J.F.: Optimum allocation of servers to two types of competing customers. IEEE Trans. Comm. COM-29 (1981) 1051–1055.

    Article  Google Scholar 

  • Gopal, I.S., Stern, T.E.: Optimal call blocking policies in an integrated services environment. Proceedings of the Conference on Information Sciences and Systems, Johns Hopkins University (1983) 383–388.

    Google Scholar 

  • Kelly, F.P.: Loss networks. Ann. Appl. Prob. 1 (1991) 319–378.

    Google Scholar 

  • Kraimeche, B., Schwartz, M.: Traffic access control strategies in integrated digital networks. Proceedings of Infocom '84 (1984) 230–235.

    Google Scholar 

  • Mason, L., Dziong, Z., Tetreault, N.: Fair-efficient call admission control policies for broadband networks. Proceedings of Globecom '92 (1992).

    Google Scholar 

  • Ross, K.W.: Multirate Loss Models for Broadband Telecommunications Networks. Springer (1995).

    Google Scholar 

  • Ross, S.M.: Introduction to Stochastic Dynamic Programming. Academic Press (1983).

    Google Scholar 

  • Tijms, H.C.: Stochastic Modelling and Analysis: A Computational Approach. Wiley (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Laboratories, 07974, Murray Hill, New Jersey, USA

    Debasis Mitra

  2. Dept. of Statistics, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Ilze Ziedins

Authors
  1. Debasis Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ilze Ziedins
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Plattner

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitra, D., Ziedins, I. (1996). Virtual partitioning by dynamic priorities: Fair and efficient resource-sharing by several services. In: Plattner, B. (eds) Broadband Communications Networks, Services, Applications, Future Directions. IZS 1996. Lecture Notes in Computer Science, vol 1044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022226

Download citation

  • DOI: https://doi.org/10.1007/BFb0022226

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60895-0

  • Online ISBN: 978-3-540-49669-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation