IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v56y2002i2p151-167.html
   My bibliography  Save this article

A pricing methodology for resource allocation and routing in integrated-services networks with quality of service requirements

Author

Listed:
  • Tudor Mihai Stoenescu
  • Demosthenis Teneketzis

Abstract

We present an approach to the admission control, resource allocation and routing problem in connection-oriented networks that offer multiple services to users. Users' preferences are summarized by means of their utility functions, and each user is allowed to request more than one type of service. Each requested service may be delivered over one of many possible routes. Multiple types of resources are allocated at each link along the path of a connection. We assume that the relation between Quality of Service (QoS) and resource allocation is given, and we incorporate it as a constraint into a static optimization problem. The objective is to determine the amount of required resources and route for each type of service to maximize a welfare function that is equal to the sum of the users' utilities. We describe a competitive market economy that achieves the objective and satisfies the informational constraints imposed by the nature of the decentralized resource allocation and routing problem. Copyright Springer-Verlag Berlin Heidelberg 2002

Suggested Citation

  • Tudor Mihai Stoenescu & Demosthenis Teneketzis, 2002. "A pricing methodology for resource allocation and routing in integrated-services networks with quality of service requirements," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(2), pages 151-167, November.
    • Handle: RePEc:spr:mathme:v:56:y:2002:i:2:p:151-167
    DOI: 10.1007/s001860200226
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860200226
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860200226?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Tudor Stoenescu & Mingyan Liu & Demosthenis Teneketzis, 2007. "Multirate multicast service provisioning II: a tâtonnement process for rate allocation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(3), pages 389-415, June.
    2. Tudor Stoenescu & Mingyan Liu & Demosthenis Teneketzis, 2007. "Multirate multicast service provisioning I: an algorithm for optimal price splitting along multicast trees," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(2), pages 199-228, April.
    3. Panos Parpas & Berç Rustem, 2008. "A Pricing Mechanism for Resource Management in Grid Computing," Computational Economics, Springer;Society for Computational Economics, vol. 31(4), pages 381-395, May.

    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:mathme:v:56:y:2002:i:2:p:151-167. 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.