Dynamic resource allocation in enterprise systems

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn , Issue , 2008, Pages 203-212

  Xue, James W J ^a   Chester, Adam P ^a   He, Ligang ^a   Jarvis, Stephen A ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS; ECONOMICS; INTERNET; PLANNING; RESOURCE ALLOCATION; SERVERS; SWITCHES; SWITCHING; TELECOMMUNICATION NETWORKS;

ADMISSION CONTROL SCHEMES; CLOSED QUEUEING NETWORKS; DYNAMIC RESOURCE ALLOCATIONS; ENTERPRISE SYSTEMS; INTERNET SERVICES; MULTI CLASS; MULTI-TIERED; MULTIPLE APPLICATIONS; NETWORK STATIONS; PERFORMANCE EVALUATIONS; SERVER RESOURCES; SIMPLE ADMISSION CONTROLS; TOTAL REVENUES;

QUEUEING NETWORKS;

EID: 60649105587     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2008.104     Document Type: Conference Paper

References (26)

1. M. Arlitt and T. Jin. A Workload Characterization Study of the 1998 World Cup Web Site. IEEE Network, 14(3):30-37, 2000.
2. G. Balbo and G. Serazzi. Asymptotic Analysis of Multiclass Closed Queueing Networks: Multiple Bottlenecks. Performance Evaluation, 30(3):115-152, 1997.
3. P. Barford and M. Crovella. Generating Representative Web Workloads for Network and Server Performance Evaluation. ACM SIGMETRICS Performance Evaluation Review, 26(1):151-160, 1998.
4. G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi. Queueing Networks and Markov Chains: modelling and performance evaluation with computer science applications. Wiley, 2nd edition, 2006.
5. J. Y. L. Boudec. Rate Adaptation, Congestion Control and Fairness: A Tutorial, Nov 2005.
6. G. Casale and G. Serazzi. Bottlenecks Identification in Multiclass Queueing Networks Using Convex Polytopes. In 12th Annual Meeting of the IEEE Int'l Symposium on Modelling, Analysis, and Simulation of Comp. and Telecommunication Systems (MASCOTS), 2004.
7. J. S. Chase and D. C. Anderson. Managing Energy and Server Resources in Hosing Centers. In 18th ACM Symposium on Operating Systems Principles, 2001.
8. L. Cherkasova and P. Phaal. Session Based Admission Control: a Mechanism for Peak Load Management of Commercial Web Sites. IEEE Transactions on Computers, 51(6), Jan 2002.
9. P. J. Denning and J. P. Buzen. The Operational Analysis of Queueing Network Models. ACM Computing Surveys, 10(3):225-261, 1978.
10. D. L. Eager and K. C. Sevcik. Bound Hierarchies for Multiple-class Queueing Networks. Journal of ACM, 33(1):179-206, 1986.
11. S. Elnikety, E. Nahum, J. Tracey, and W. Zwaenepoel. A Method for Transparent Admission Control and Request Scheduling in e-Commerce Web Sites. In International WWW Conference, New York, USA, 2004.
12. L. He, W. J. Xue, and S. A. Jarvis. Partition-based Profit Optimisation for Multi-class Requests in Clusters of Servers. In the IEEE International Conference on e-Business Engineering, 2007.
13. T. Kerola. The Composite Bound Method for Computing Throughput Bounds in Multiple Class Environments. Performance Evaluation, 6(1):1-9, 1986.
14. M. Litoiu. A Performance Analysis Method for Autonomic Computing Systems. ACM Transaction on Autonomous and Adaptive Systems, 2(1):3, 2007.
15. J. Little. A Proof of the Queueing Formula L = λW. Operations Research, 9(3):383-387, May 1961.
16. Z. Liu, M. Squillante, and J. Wolf. On Maximizing Service-level-agreement Profits. ACM SIGMETRICS Performance Evaluation, 29:43-44, 01.
17. D. A. Menasce and V. A. F. Almeida. Capacity Planning for Web Performance-metrics, models, and methods. Prentice Hall PTR, 1998.
18. D. A. Menasce, V. A. F. Almeida, R. Fonseca, and M. A. Mendes. Business-oriented Resource Management Policies for e-Commerce Servers. Performance Evaluation, 42:223-239, 2000.
19. J. Palmer and I. Mitrani. Optimal and Heuristic Policies for Dynamic Server Allocation. Journal of Parallel and Distributed Computing, 65(10):1204-1211, 2005.
20. M. Reiser and S. Lavenberg. Mean-value Analysis of Closed Multi-Chain Queueing Networks. Journal of the Association for Computing Machinary, 27:313-322, 1980.
21. K. Sevcik and I. Mitrani. The Distribution of Queueing Network States at Input and Output Instants. Journal of the ACM, 28(2), April, 1981.
22. B. Urgaonkar, G. Pacifici, P. J. Shenoy, M. Spreitzer, and A. Tantawi. An Analytical Model for Multi-tier Internet Services and its Applications. ACM SIGMETRICS Performance Evaluation Review, pages 291-302, 2005.
23. B. Urgaonkar and P. Shenoy. Cataclysm: Policing Extreme Overloads in Internet Applications. In Proceedings of the WWW2005, Chiba, Japan, May 2005.
24. M. Welsh and D. Culler. Adaptive Overload Control for Busy Internet Servers. In the 2003 USENIX Symposium on Internet Technologies and Systems, 2003.
25. A. Zalewski and A. Ratkowski. Evaluation of Dependability of Multi-tier Internet Business Applications with Queueing Networks. In International Conference on Dependability of Computer Systems (DEPCOS-RELCOMEX'06), 2006.
26. J. Y. Zhou and T. Yang. Selective Early Request Termination for Busy Internet Services. In 15th International Conference on World Wide Web, Edinburgh, Scotland, 2006.