A preemptive connection pool manager for web-based application collaboration

作者: Zhen Zhao

DOI: 10.4108/ICST.COLLABORATECOM.2012.250465

关键词:

摘要: Most of web-based applications are free marketing systems. They compete network resources usually in first-come-first-service (FCFS) mechanism. As a big company with thousands applications, Comcast faces how to maximize its revenue through all these applications. Currently, have no collaborations even they considered one system. When the resource limit is reached and increasing capacity not an applicable method, FCFS may degrade critical services running some less important We propose priority-based collaboration solution. Every application has pre-determined priority. occupied, new incoming requests from higher priorities preempt those lower so high priority work can be processed sacrificing low work's performance. Specifically, we implement connection pool manager that admits connections for at cost preempting out when system safety limitation approached. The major win here increase our usability most features during traffic burst exceeding capacity.

参考文章(19)
Yu Ke, Zhang Lin, Zhang Hui-min, A preemption-aware path selection algorithm for DiffServ/MPLS networks ip operations and management. pp. 129- 133 ,(2004) , 10.1109/IPOM.2004.1547604
F. Blanchy, L. Melon, G. Leduc, Routing in a MPLS network featuring preemption mechanisms international conference on telecommunications. ,vol. 1, pp. 253- 260 ,(2003) , 10.1109/ICTEL.2003.1191228
V. Stanisic, M. Devetsikiotis, A dynamic study of providing quality of service using preemption policies with random selection international conference on communications. ,vol. 3, pp. 1543- 1546 ,(2003) , 10.1109/ICC.2003.1203861
Douglas R. Miller, Computation of Steady-State Probabilities for M/M/1 Priority Queues Operations Research. ,vol. 29, pp. 945- 958 ,(1981) , 10.1287/OPRE.29.5.945
D. Calabrese, M. Fischer, B. Hoiem, E. Kaiser, Modeling a Voice Network with Preemption IEEE Transactions on Communications. ,vol. 28, pp. 22- 27 ,(1980) , 10.1109/TCOM.1980.1094574
J. Kaufman, Blocking in a Shared Resource Environment IEEE Transactions on Communications. ,vol. 29, pp. 1474- 1481 ,(1981) , 10.1109/TCOM.1981.1094894
J. Aein, A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model IEEE Transactions on Communications. ,vol. 26, pp. 378- 385 ,(1978) , 10.1109/TCOM.1978.1094081
Tugrul Dayar, William J. Stewart, Quasi Lumpability, Lower-Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains SIAM Journal on Matrix Analysis and Applications. ,vol. 18, pp. 482- 498 ,(1997) , 10.1137/S0895479895294277
Sung-eok Jeon, R.T. Abler, A.E. Goulart, The optimal connection preemption algorithm in a multi-class network international conference on communications. ,vol. 4, pp. 2294- 2298 ,(2002) , 10.1109/ICC.2002.997255