ACM Home Page
Please provide us with feedback. Feedback
Optimal capacity planning in stochastic loss networks
Full text PdfPdf (11.88 MB)
Source
ACM SIGMETRICS Performance Evaluation Review archive
Volume 35 ,  Issue 2  (September 2007) table of contents
SPECIAL ISSUE: Special issue on the Workshop on MAthematical performance Modeling and Analysis (MAMA2007) table of contents
Pages 39-41  
Year of Publication: 2007
ISSN:0163-5999
Authors
Yingdong Lu  IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Ana Radovanović  IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Mark S. Squillante  IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 22,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1330555.1330571
What is a DOI?

ABSTRACT

A large number of application areas involve resource allocation problems in which resources of different capabilities are used to provide service to various classes of customers at their arrival instants, otherwise the opportunity to serve the customer is lost. Stochastic loss networks are often used to capture the dynamics and uncertainty of this class of resource allocation problems. A wide variety of examples include applications in telephony and data networks, distributed computing and data centers, inventory control and manufacturing systems, and call and contact centers. Another emerging application area is workforce management where, e.g., an IT services company offers a collection of service products, each requiring a set of resources with certain capabilities. The customer demands for such IT service products are stochastic and the IT services company seeks to determine its per-class resource capacity levels in order to maximize its profits over the long run.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Bazaraa, H. Sherali, C. Shetty. Nonlinear Programming: Theory and Algorithms. John Wiley, Second edition, 1993.
 
2
D. Jagerman. Methods in traffic calculations. AT&T Bell Lab. Tech. Journal, 63(7):1283--1310, 1984.
 
3
F. Kelly. Blocking probabilities in large circuit-switched networks. Adv. App. Prob., 18(2):473--505, 1986.
 
4
F. Kelly. Routing in circuit-switched networks: Optimization, shadow prices and decentralization. Adv. App. Prob., 20(1):112--144, 1988.
 
5
L. Liu, B. Kashyap, J. Templeton. On the GIX/G/∞ System, J. App. Prob., 27(3):671--683, 1990.
 
6
W. Whitt. On the heavy traffic limit theorem for GI/G/∞ queues. Adv. App. Prob., 14(1):171--190, 1982.
 
7
W. Whitt. Blocking when service is required from several facilities simultaneously. AT&T Bell Lab. Tech. Journal, 64(8):1807--1856, 1985.
 
8
W. Whitt. Stochastic-Process Limits. Springer-Verlag, 2002.


Collaborative Colleagues:
Yingdong Lu: colleagues
Ana Radovanović: colleagues
Mark S. Squillante: colleagues