ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Performance Evaluation
Volume 57, Issue 3, July 2004, Pages 279-306
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (330 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2003.10.009    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2003 Elsevier B.V. All rights reserved.

Allocating commodity resources in aggregate traffic networks

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

N. G. DuffieldCorresponding Author Contact Information, a, Corresponding Author Contact Information, E-mail The Corresponding Author and S. H. LowE-mail The Corresponding Author, E-mail The Corresponding Author, b

a AT&T Labs-Research, Room B139, 180 Park Avenue, Florham Park, NJ 07932-0971, USA

b Departments of CS and EE, Caltech, Pasadena, CA 91125, USA


Received 23 December 2001; 
accepted 16 October 2003. 
Available online 6 February 2004.

Abstract

We examine the relation between cost and quality in networks which carry aggregate traffic. A powerful tool in this is the burstiness or indifference curve associated with a stochastic traffic flow. We relate burstiness to quality and use this relation to explore the quality experienced by aggregated flows under various rules for allocating resources to them. An example is motivated by the controlled load service specification. We show how the imposition of costs associated with buffer space and service capacity leads to the notion of a cost-optimal allocation of resources. This defines the cheapest operating point in a network where resources are commodities to be purchased as necessary to satisfy quality requirements. We define a notion of cost-based admission control: a linear admission rule which can be based on declared or measured traffic parameters.

Author Keywords: Pricing; Economies of scale; Indifference curve; Admission control; Performance analysis; Large deviations; Stochastic networks

Article Outline

1. Introduction
2. Shape function, burstiness and quality
3. Departure processes and network quality
4. Resource allocation for aggregates
5. Summed rate summed buffer allocations
6. Summed rate maximum buffer for associated flows
7. The relation of cost and quality
8. Resource allocation for minimal cost
9. Admission control, costs and incentives
10. Conclusion: on the use of resource based pricing
Appendix A. Hypotheses for Theorem 1
References
Vitae


Corresponding Author Contact InformationCorresponding author.


Performance Evaluation
Volume 57, Issue 3, July 2004, Pages 279-306
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.