Bottlenecks identification in multiclass queueing networks using convex polytopes

Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

Volumn , Issue , 2004, Pages 223-230

  Casale, Giuliano ^a   Serazzi, Giuseppe ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MULTICAST MODELS; POLYTOPES; PRODUCT-FORM NETWORKS; RESOURCE UTILIZATION;

ALGORITHMS; APPROXIMATION THEORY; ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); LOCAL AREA NETWORKS; MATHEMATICAL MODELS;

QUEUEING NETWORKS;

EID: 16244389322     PISSN: 15267539     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOT.2004.1348242     Document Type: Conference Paper

References (18)

1. Avis, D., Bremner, D., & Seidel, R. (1997). How good are convex hull algorithms. Computational Geometry: Theory and Applications, 7, 265-302.
2. Balbo, G., & Serazzi, G. (1997). Asymptotic analysis of multiclass closed queueing networks: Multiple bottlenecks. Perform. Eval. 30(3), 115-152.
3. Barber, C. B., Dobkin, D. P., & Huhdanpaa, H. T. (1996). The Quickhull algorithm for convex hulls. ACM Trans. on Mathematical Software, 22(4),469-483.
4. Buzen, J. P. (1973). Computational algorithms for closed queueing networks with exponential servers. Commun. ACM,16(9), 527-531.
5. Casale, G. & Serazzi, G. (2003). Estimating Bottlenecks of Very Large Models. Performance Evaluation: Stories and Perspectives, (pp. 89-104). Austrian Computing Group (OGC) Press, December 2003.
6. Chandy, K. M., Neuse, D. (1982). Linearizer: A heuristic algorithm for queuing network models of computing systems. Commun. ACM, 25(2), 126-134.
7. Chazelle, B. (1993). An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom., 10,377-409.
8. Cremonesi, P., Schweitzer P. J. & Serazzi, G. (2002). A unifying framework for the approximate solution of closed multiclass queueing networks. IEEE Trans. Comp.,16(9), 527-531.
9. Denning, P. J., & Buzen, J. P. (1978). The Operational Analysis of Queueing Network Models. ACM Computing Surveys,10(3), 225-261.
10. Eager, D. L., Sevcik, K. C. (1986). Bound hierarchies for multiple-class queuing networks Journal of the ACM. 33(1), 179-206.
11. Fukuda, K. (1999). cdd/cdd+ reference manual, version 0.61/0.76. EPF Lausanne, Switzerland. http://www.cs.mcgill.ca/~fukuda/.
12. Kerola, T. The Composite Bound Method for Computing Throughput Bounds in Multiple Class Environments. Perform. Eval. 6(1), 1-9.
13. Knessl, C. & Tier, C. (1998). Asymptotic approximations and bottleneck analysis in product form queueing networks with large populations. Perform. Eval. 33(4), 219-248.
14. Lazowska, J., Zahorjan, J., Eager, D. L. & Galler, B. (1982). Balanced Job Bound Analysis of Queueing Networks. Commun. ACM. 25(2), 134-141.
15. Ottmann, T., Schuierer, S. & Soundaralakshmi, S. (1995). Enumerating extreme points in higher dimensions. Proc. of the 12th Annual Symp. on Theoretical Aspects of Comp. Science - LNCS 900 (pp. 562-570). New York: Springer-Verlag.
16. Reiser, M., & Lavenberg, S.S. (1980). Mean-value analysis of closed multichain queueing networks. Journal of the ACM, 27(2), 312-322.
17. Schweitzer, P. J. (1992). A fixed-point approximation to product-form networks with large populations. Presented at 2nd ORSA Telecomm. Conf, Boca Ration, FL.
18. Zahorjan, J., Eager, D. L. & Sweillam, H.M. (1988). Accuracy, Speed, and Convergence of Approximate Mean Value Analysis. Perform. Eval. 8(4), 255-270.