×

Product-form solutions for integrated services packet networks and cloud computing systems. (English) Zbl 1407.90111

Summary: We iteratively derive the product-form solutions of stationary distributions for a type of preemptive priority multiclass queueing networks with multiserver stations. This type of queueing systems can typically be used to model the stochastic dynamics of some large scale backbone networks with multiprocessor shared-memory switches or local (edge) cloud computing centers with parallel-server pools. The queueing networks are Markovian with exponential interarrival and service time distributions. The obtained iterative solutions can be used to conduct performance analysis or as comparison criteria for approximation and simulation studies. Numerical comparisons with existing Brownian approximating model (BAM) related to general interarrival and service times are provided to show the effectiveness of our current designed algorithm and our previous derived BAM. Furthermore, based on the iterative solutions, we can also give some analysis concerning network stability for some cases of these queueing systems, which provides some insight for more general study.

MSC:

90B22 Queues and service in operations research
90B10 Deterministic network models in operations research
68M10 Network design and communication in computer systems
60K25 Queueing theory (aspects of probability theory)
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Mullender, S. J.; Wood, T. L., Cloud computing: new opportunities for telecom providers, Bell Labs Technical Journal, 17, 2, 1-4 (2012) · doi:10.1002/bltj.21550
[2] Mell, P.; Grance, T., The NIST definition of cloud computing, NIST Special Publication, 800-145 (2011), Gaithersburg, Md, USA: National Institute of Standards and Technology, U.S. Department of Commerce, Gaithersburg, Md, USA
[3] Rhoton, J.; Haukioja, R., Cloud Computing Architected: Solution Design Handbook (2013), Wellington, New Zealand: Recursive Limited, Wellington, New Zealand
[4] Tobagi, F. A., Fast packet switch architectures for broadband integrated services digital networks, Proceedings of the IEEE, 78, 1, 133-167 (1990) · doi:10.1109/5.52203
[5] Rao, M. H. L.; Tripathi, R., FPGA implementation of reconfigurable switch architecture for next generation communication networks, International Journal of Engineering and Technology, 4, 6, 770-773 (2012)
[6] Dai, W., Optimal rate scheduling via utility-maximization for \(J\)-user MIMO Markov fading wireless channels with cooperation, Operations Research, 61, 6, 1450-1462 (2013) · Zbl 1291.90105 · doi:10.1287/opre.2013.1224
[7] Schwarz, M., Broadband Integrated Networks (1996), Upper Saddle River, NJ, USA: Prentice Hall, Upper Saddle River, NJ, USA
[8] Nikolaidis, I.; Akyildiz, I. F.; Walrand, J.; Bachi, K.; Zobrist, G., An overview of source characterization in ATM networks, Modeling and Simulation of Computer and Communications Networks: Techniques, Tools, and Tutorials, 123-150 (1997), Gordon and Breach Publishing
[9] Dai, W., On the conflict of truncated random variable vs. heavy-tail and long range dependence in computer and network simulation, Journal of Computational Information Systems, 7, 5, 1488-1499 (2011)
[10] Dai, W., Heavy traffic limit theorems for a queue with Poisson ON/OFF long-range dependent sources and general service time distribution, Acta Mathematicae Applicatae Sinica, 28, 4, 807-822 (2012) · Zbl 1255.60162 · doi:10.1007/s10255-012-0190-2
[11] Cao, J.; Cleveland, W. S.; Lin, D.; Sun, D. X., Internet traffic tends to poisson and independent as the load increases, Bell Labs Technical Report (2001)
[12] Dai, W., Brownian approximations for queueing networks with finite buffers: modeling, heavy traffic analysis and numerical implementations [Ph.D. thesis] (1996), Atlanta, Ga, USA: Georgia Institute of Technology, Atlanta, Ga, USA
[13] Dai, W., Diffusion approximations for multiclass queueing networks under preemptive priority service discipline, Applied Mathematics and Mechanics, 28, 10, 1331-1342 (2007) · Zbl 1231.60026 · doi:10.1007/s10483-007-1006-x
[14] Dai, J. G.; Dai, W., A heavy traffic limit theorem for a class of open queueing networks with finite buffers, Queueing Systems, 32, 5-40 (1999) · Zbl 0997.90030 · doi:10.1023/A:1019178802391
[15] Shen, X.; Chen, H.; Dai, J. G.; Dai, W., The finite element method for computing the stationary distribution of an SRBM in a hypercube with applications to finite buffer queueing networks, Queueing Systems, 42, 1, 33-62 (2002) · Zbl 1036.90032 · doi:10.1023/A:1019942711261
[16] Serfozo, R., Introduction to Stochastic Networks (1999), New York, NY, USA: Springer, New York, NY, USA · Zbl 0983.60006 · doi:10.1007/978-1-4612-1482-3
[17] Baskett, F.; Chandy, K. M.; Muntz, R. R.; Palacios, F. G., Open, closed and mixed networks of queues with different classes of customers, Journal of the Association for Computing Machinery, 22, 248-260 (1975) · Zbl 0313.68055 · doi:10.1145/321879.321887
[18] Harrison, P. G., Reversed processes, product forms and a non-product form, Linear Algebra and Its Applications, 386, 359-381 (2004) · Zbl 1049.60076 · doi:10.1016/j.laa.2004.02.020
[19] Harrison, P. G., Process algebraic non-product-forms, Electronic Notes in Theoretical Computer Science, 151, 3, 61-76 (2006) · doi:10.1016/j.entcs.2006.03.012
[20] Dai, W., Product-form solutions for integrated services packet networks, Proceedings of the 5th Mexican International Conference on Artificial Intelligence (MICAI ’06), IEEE · doi:10.1109/MICAI.2006.50
[21] Chen, H.; Yao, D., Fundamentals of Queueing Networks (2001), New York, NY, USA: Springer, New York, NY, USA · Zbl 0992.60003 · doi:10.1007/978-1-4757-5301-1
[22] Dai, J. G.; Yeh, D. H.; Zhou, C., The QNET method for re-entrant queueing networks with priority disciplines, Operations Research, 45, 4, 610-623 (1997) · Zbl 0887.90073 · doi:10.1287/opre.45.4.610
[23] Harrison, J. M., Brownian Motion and Stochastic Flow Systems (1985), New York, NY, USA: Wiley, New York, NY, USA · Zbl 0659.60112
[24] Jackson, J. R., Networks of waiting lines, Operations Research, 5, 518-521 (1957) · Zbl 1414.90067 · doi:10.1287/opre.5.4.518
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.