IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-25477-7_6.html
   My bibliography  Save this book chapter

Providing QoS in Large Networks: Statistical Multiplexing and Admission Control

In: Analysis, Control and Optimization of Complex Dynamic Systems

Author

Listed:
  • Nikolay B. Likhanov
  • Ravi R. Mazumdar
  • François Théberge

Abstract

In this paper we consider the problem of providing statistical Quality of Service (QoS) guarantees defined in terms of packet loss when independent heterogeneous traffic streams access a network router of high capacity. By using a scaling technique we show how this problem becomes tractable when the server capacity is large and many traffic streams are present. In particular we show that we can define an effective bandwidth for the sources that allows us to map the model onto a multirate loss model. In particular we show several insights on the multiplexing problem as the capacity becomes large. We also provide numerical and simulation evidence to show how the largeness of networks can be used to advantage in providing very simple admission control schemes. The techniques are based on large deviations, local limit theorems, and the product-form associated with co-ordinate convex policies.

Suggested Citation

  • Nikolay B. Likhanov & Ravi R. Mazumdar & François Théberge, 2005. "Providing QoS in Large Networks: Statistical Multiplexing and Admission Control," Springer Books, in: El Kébir Boukas & Roland P. Malhamé (ed.), Analysis, Control and Optimization of Complex Dynamic Systems, chapter 0, pages 137-167, Springer.
  • Handle: RePEc:spr:sprchp:978-0-387-25477-7_6
    DOI: 10.1007/0-387-25477-3_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Marco Cello & Giorgio Gnecco & Mario Marchese & Marcello Sanguineti, 2015. "Narrowing the Search for Optimal Call-Admission Policies Via a Nonlinear Stochastic Knapsack Model," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 819-841, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-387-25477-7_6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.