Problemy Peredachi Informatsii
General information
Latest issue
Impact factor
Guidelines for authors

Search papers
Search references

Latest issue
Current issues
Archive issues
What is RSS

Probl. Peredachi Inf.:

Personal entry:
Save password
Forgotten password?

Probl. Peredachi Inf., 1996, Volume 32, Issue 1, Pages 20–34 (Mi ppi298)  

This article is cited in 93 scientific papers (total in 94 papers)

Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach

N. D. Vvedenskaya, R. L. Dobrushin, F. I. Karpelevich

Abstract: Consider a system that consists of $N$ servers with a Poisson input flow of demands of intensity $N\lambda$. Each demand arriving to the system randomly selects two servers and is instantly sent to the one with the shorter queue. The service time is distributed exponentially with mean 1. It turns out that for $\lambda<1$ it is possible to investigate the asymptotic distribution of the queue lengths as $N\to\infty$. In the limit the queue length probability decreases superexponentially as the queue length increases.

Full text: PDF file (1491 kB)

English version:
Problems of Information Transmission, 1996, 32:1, 15–27

Bibliographic databases:

UDC: 621.391.1:621.394/395.74:519.2

Citation: N. D. Vvedenskaya, R. L. Dobrushin, F. I. Karpelevich, “Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach”, Probl. Peredachi Inf., 32:1 (1996), 20–34; Problems Inform. Transmission, 32:1 (1996), 15–27

Citation in format AMSBIB
\by N.~D.~Vvedenskaya, R.~L.~Dobrushin, F.~I.~Karpelevich
\paper Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach
\jour Probl. Peredachi Inf.
\yr 1996
\vol 32
\issue 1
\pages 20--34
\jour Problems Inform. Transmission
\yr 1996
\vol 32
\issue 1
\pages 15--27

Linking options:

    SHARE: FaceBook Twitter Livejournal

    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. E. A. Pechersky, Yu. M. Sukhov, “Dobrushin's ideas in the theory of queuing networks”, Russian Math. Surveys, 52:2 (1997), 265–269  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi
    2. N. D. Vvedenskaya, “Large Queueing System where Messages are Transmitted via Several Routes”, Problems Inform. Transmission, 34:2 (1998), 180–189  mathnet  mathscinet  zmath
    3. V. I. Oseledets, D. V. Khmelev, “Global Stability of Infinite Systems of Nonlinear Differential Equations and Nonhomogeneous Countable Markov Chains”, Problems Inform. Transmission, 36:1 (2000), 54–70  mathnet  mathscinet  zmath
    4. F. I. Karpelevich, A. N. Rybko, “Asymptotic Behavior of the Thermodynamical Limit for Symmetric Closed Queueing Networks”, Problems Inform. Transmission, 36:2 (2000), 154–179  mathnet  mathscinet  zmath
    5. È. B. Vinberg, I. M. Gel'fand, S. G. Gindikin, E. B. Dynkin, V. A. Malyshev, R. A. Minlos, A. L. Onishchik, I. I. Pyatetskii-Shapiro, A. N. Rybko, Yu. M. Sukhov, S. B. Shlosman, “Fridrikh Israilevich Karpelevich (obituary)”, Russian Math. Surveys, 56:1 (2001), 141–147  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi
    6. Yu. M. Suhov, N. D. Vvedenskaya, “Fast Jackson Networks with Dynamic Routing”, Problems Inform. Transmission, 38:2 (2002), 136–153  mathnet  crossref  mathscinet  zmath
    7. A. N. Rybko, S. B. Shlosman, “Poisson hypothesis for information networks. I”, Mosc. Math. J., 5:3 (2005), 679–704  mathnet  crossref  mathscinet  zmath
    8. A. N. Rybko, S. B. Shlosman, “Poisson hypothesis for information networks. II”, Mosc. Math. J., 5:4 (2005), 927–959  mathnet  crossref  mathscinet  zmath
    9. A. A. Sergeev, “Limit theorems for one class of Polling models”, Theory Probab. Appl., 50:3 (2006), 510–518  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
    10. Anagnostopoulos, A, “Steady state analysis of balanced-allocation routing”, Random Structures & Algorithms, 26:4 (2005), 446  crossref  mathscinet  zmath  isi
    11. Dawson, DA, “Balancing queues by mean field interaction”, Queueing Systems, 49:3–4 (2005), 335  crossref  mathscinet  zmath  isi  elib
    12. N. D. Vvedenskaya, Yu. M. Suhov, “Multiuser Multiple-Access System: Stability and Metastability”, Problems Inform. Transmission, 43:3 (2007), 263–269  mathnet  crossref  mathscinet  zmath  isi
    13. Suh K., Diot Ch., Kurose J., Massoulie L., Neumann Ch., Towsley D., Varvello M., “Push-to-peer video-on-demand system: Design and evaluation”, IEEE Journal on Selected Areas in Communications, 25:9 (2007), 1706–1716  crossref  isi
    14. Rybko, A, “Spontaneous Resonances and the Coherent States of the Queuing Networks”, Journal of Statistical Physics, 134:1 (2009), 67  crossref  mathscinet  zmath  adsnasa  isi
    15. Chabchoub Y., Fricker Ch., Mohamed H., “Analysis of a Bloom Filter Algorithm via the Supermarket Model”, 2009 21st International Teletraffic Congress (Itc 21), 2009, 113–120  isi
    16. Bramson M., Lu Y., Prabhakar B., “Randomized Load Balancing with General Service Time Distributions”, Sigmetrics 2010: Proceedings of the 2010 Acm Sigmetrics International Conference on Measurement and Modeling of Computer Systems, Acm Sigmetrics Performance Evaluation Review Special Issue, 38, no. 1, 2010, 275–286  crossref  isi
    17. N. D. Vvedenskaya, “Configuration of overloaded servers with dynamic routing”, Problems Inform. Transmission, 47:3 (2011), 289–303  mathnet  crossref  mathscinet  isi
    18. Vvedenskaya N., Suhov Y., Belitsky V., “A non-linear model of limit order book dynamics”, 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), 2011, 1260–1262  crossref  isi
    19. Lu Y., Xie Q., Kliot G., Geller A., Larus J.R., Greenberg A., “Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services”, Performance Evaluation, 68:11 (2011), 1056–1071  crossref  isi
    20. Bramson M., “Stability of Join the Shortest Queue Networks”, Ann Appl Probab, 21:4 (2011), 1568–1625  crossref  mathscinet  zmath  isi  elib
    21. A. P. Kotenko, M. B. Bukarenko, “Sistema massovogo obsluzhivaniya s razlichimymi kanalami kak konechnyi avtomat”, Vestn. Sam. gos. tekhn. un-ta. Ser. Fiz.-mat. nauki, 3(28) (2012), 114–124  mathnet  crossref  zmath
    22. Ganesh A., Lilienthal S., Manjunath D., Proutiere A., Simatos F., “Load Balancing via Random Local Search in Closed and Open Systems”, Queueing Syst., 71:3, SI (2012), 321–345  crossref  mathscinet  zmath  isi
    23. Maguluri S.T., Srikant R., Ying L., “Heavy Traffic Optimal Resource Allocation Algorithms for Cloud Computing Clusters”, 2012 24th International Teletraffic Congress (Itc 24), IEEE Computer Soc, 2012, 65–72  isi
    24. M. B. Bukarenko, “Yavnye uravneniya sostoyaniya sistemy massovogo obsluzhivaniya, predstavlennoi konechnym avtomatom”, Vestn. SamGU. Estestvennonauchn. ser., 2013, no. 9/1(110), 94–101  mathnet
    25. Li Q.-L. Dai G. Lui J.C.S. Wang Ya., “the Mean-Field Computation in a Supermarket Model With Server Multiple Vacations”, Discret. Event Dyn. Syst.-Theory Appl., 24:4 (2014), 473–522  crossref  mathscinet  zmath  isi
    26. Maguluri S.T., Srikant R., Ying L., “Heavy Traffic Optimal Resource Allocation Algorithms For Cloud Computing Clusters”, Perform. Eval., 81 (2014), 20–39  crossref  isi
    27. Minnebo W., Van Houdt B., “a Fair Comparison of Pull and Push Strategies in Large Distributed Networks”, IEEE-ACM Trans. Netw., 22:3 (2014), 996–1006  crossref  isi
    28. Van Houdt B., “a Mean Field Model For a Class of Garbage Collection Algorithms in Flash-Based Solid State Drives”, Queueing Syst., 77:2, SI (2014), 149–176  crossref  mathscinet  zmath  isi
    29. Krapivsky P.L., Redner S., “Choice-Driven Phase Transition in Complex Networks”, J. Stat. Mech.-Theory Exp., 2014, P04021  crossref  mathscinet  isi
    30. M. G. Konovalov, R. V. Razumchik, “Obzor modelei i algoritmov razmescheniya zadanii v sistemakh s parallelnym obsluzhivaniem”, Inform. i ee primen., 9:4 (2015), 56–67  mathnet  crossref  elib
    31. Dieker A.B., Suk T., “Randomized Longest-Queue-First Scheduling For Large-Scale Buffered Systems”, Adv. Appl. Probab., 47:4 (2015), 1015–1038  crossref  mathscinet  zmath  isi
    32. Li Q.-L. Du Y. Dai G. Wang M., “on a Doubly Dynamically Controlled Supermarket Model With Impatient Customers”, Comput. Oper. Res., 55 (2015), 76–87  crossref  mathscinet  isi
    33. Van Houdt B., “on the Power of Asymmetry and Memory in Flash-Based Ssd Garbage Collection”, Perform. Eval., 97 (2016), 1–15  crossref  isi
    34. F. Baccelli, A. N. Rybko, S. B. Shlosman, “Queueing networks with mobile servers: the mean-field approach”, Problems Inform. Transmission, 52:2 (2016), 178–199  mathnet  crossref  mathscinet  isi  elib
    35. Foss S., Stolyar A.L., “Large-Scale Join-Idle-Queue System With General Service Times”, J. Appl. Probab., 54:4 (2017), 995–1007  crossref  mathscinet  zmath  isi  scopus
    36. Dester P.S., Fricker Ch., Tibi D., “Stationary Analysis of the Shortest Queue Problem”, Queueing Syst., 87:3-4 (2017), 211–243  crossref  mathscinet  zmath  isi  scopus
    37. Izagirre A., Makowski A.M., “Light Traffic Behavior Under the Power-of-Two Load Balancing Strategy: the Case of Heterogeneous Servers”, Perform. Eval., 116 (2017), 26–52  crossref  isi  scopus
    38. Ying L., Srikant R., Kang X., “The Power of Slightly More Than One Sample in Randomized Load Balancing”, Math. Oper. Res., 42:3 (2017), 692–722  crossref  mathscinet  zmath  isi  scopus
    39. Minnebo W., Hellemans T., Van Houdt B., “On a Class of Push and Pull Strategies With Single Migrations and Limited Probe Rate”, Perform. Eval., 113 (2017), 42–67  crossref  isi  scopus
    40. Gardner K., Harchol-Balter M., Scheller-Wolf A., Velednitsky M., Zbarsky S., “Redundancy-D: the Power of D Choices For Redundancy”, Oper. Res., 65:4 (2017), 1078–1094  crossref  mathscinet  zmath  isi  scopus
    41. Dai H., Lu J., Wang Y., Pan T., Liu B., “Bfast: High-Speed and Memory-Efficient Approach For Ndn Forwarding Engine”, IEEE-ACM Trans. Netw., 25:2 (2017), 1235–1248  crossref  isi  scopus
    42. Stolyar A.L., “Large-Scale Heterogeneous Service Systems With General Packing Constraints”, Adv. Appl. Probab., 49:1 (2017), 61–83  crossref  mathscinet  isi  scopus
    43. Karthik A., Mukhopadhyay A., Mazumdar R.R., “Choosing Among Heterogeneous Server Clouds”, Queueing Syst., 85:1-2 (2017), 1–29  crossref  mathscinet  zmath  isi  scopus
    44. Stolyar A.L., “Pull-Based Load Distribution Among Heterogeneous Parallel Servers: the Case of Multiple Routers”, Queueing Syst., 85:1-2 (2017), 31–65  crossref  mathscinet  zmath  isi  scopus
    45. Liang Q., Borst S., “Delay Versus Stickiness Violation Trade-Offs For Load Balancing in Large-Scale Data Centers”, 2017 IEEE 25Th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (Mascots), International Symposium on Modeling Analysis and Simulation of Computer and Telecommunication Systems Proceedings, IEEE Computer Soc, 2017, 63–72  crossref  isi  scopus
    46. Garcia-Carballeira F., Calderon A., “Reducing Randomization in the Power of Two Choices Load Balancing Algorithm”, 2017 International Conference on High Performance Computing & Simulation (Hpcs), ed. Smari W., IEEE, 2017, 365–372  crossref  isi  scopus
    47. van der Boor M., Borst S., van Leeuwaarden J., IEEE Infocom 2017 - IEEE Conference on Computer Communications, IEEE Infocom, IEEE, 2017  isi
    48. Vasantam T., Mukhopadhyay A., Mazumdar R.R., “Mean-Field Analysis of Loss Models With Mixed-Erlang Distributions Under Power-of-D Routing”, 2017 Proceedings of the 29Th International Teletraffic Congress (Itc 29), Vol 1, eds. Bolla R., Ciucu F., IEEE, 2017, 250–258  crossref  isi
    49. Raaijmakers Y., Borst S., Boxma O., “Delta Probing Policies For Redundancy”, Perform. Eval., 127 (2018), 21–35  crossref  isi  scopus
    50. Vasantam T., Mukhopadhyay A., Mazumdar R.R., “The Mean-Field Behavior of Processor Sharing Systems With General Job Lengths Under the Sq(D) Policy”, Perform. Eval., 127 (2018), 120–153  crossref  isi  scopus
    51. Brightwell G., Fairthorne M., Luczak M.J., “The Supermarket Model With Bounded Queue Lengths in Equilibrium”, J. Stat. Phys., 173:3-4, SI (2018), 1149–1194  crossref  mathscinet  zmath  isi  scopus
    52. Gast N., Latella D., Massink M., “A Refined Mean Field Approximation of Synchronous Discrete-Time Population Models”, Perform. Eval., 126 (2018), 1–21  crossref  isi  scopus
    53. Eschenfeldt P., Gamarnik D., “Join the Shortest Queue With Many Servers. the Heavy-Traffic Asymptotics”, Math. Oper. Res., 43:3 (2018), 867–886  crossref  mathscinet  isi  scopus
    54. Jonckheere M., Prabhu B.J., “Asymptotics of Insensitive Load Balancing and Blocking Phases”, Queueing Syst., 88:3-4, SI (2018), 243–278  crossref  mathscinet  zmath  isi  scopus
    55. Li B., Ramamoorthy A., Srikant R., “Mean-Field Analysis of Coding Versus Replication in Large Data Storage Systems”, ACM Trans. Modeling Perform. Eval. Comput. Syst., 3:1 (2018), UNSP 3  crossref  isi
    56. Bonaventura M., Castro R., Jonckheere M., “Simulation Study of Dynamic Load Balancing For Processor Sharing Servers With Finite Capacity Under Generalized Halfin-Whitt Regimes”, 2018 Winter Simulation Conference (Wsc), Winter Simulation Conference Proceedings, IEEE, 2018, 3873–3884  crossref  isi
    57. Li B., Ji B., Liu J., 2018 16Th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (Wiopt), IEEE, 2018  isi
    58. A. Madankan, A. Delavarkhalafi, S. M. Karbassi, F. Adibnia, “Resource allocation in cloud computing via optimal control to queuing systems”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 12:4 (2019), 67–81  mathnet  crossref
    59. Cardinaels E., Borst S.C., van Leeuwaarden J.S.H., “Job Assignment in Large-Scale Service Systems With Affinity Relations”, Queueing Syst., 93:3-4, SI (2019), 227–268  crossref  mathscinet  zmath  isi  scopus
    60. Al-Abbasi A.O., Aggarwal V., Lan T., “Ttloc: Taming Tail Latency For Erasure-Coded Cloud Storage Systems”, IEEE Trans. Netw. Serv. Manag., 16:4 (2019), 1609–1623  crossref  isi  scopus
    61. Vasantam T., Mukhopadhyay A., Mazumdar R.R., “Insensitivity of the Mean Field Limit of Loss Systems Under Sq(D) Routeing”, Adv. Appl. Probab., 51:4 (2019), 1027–1066  crossref  mathscinet  zmath  isi  scopus
    62. Atar R., Keslassy I., Mendelson G., “Subdiffusive Load Balancing in Time-Varying Queueing Systems”, Oper. Res., 67:6 (2019), 1678–1698  crossref  mathscinet  isi  scopus
    63. Tibi D., “Martingales and Buffer Overflow For the Symmetric Shortest Queue Model”, Queueing Syst., 93:1-2, SI (2019), 153–190  crossref  mathscinet  zmath  isi  scopus
    64. Liu X., Ying L., “on Achieving Zero Delay With Power-of-D-Choices Load Balancing”, IEEE Trans. Netw. Sci. Eng., 6:4 (2019), 909–916  crossref  mathscinet  isi  scopus
    65. Van Houdt B., “Randomized Work Stealing Versus Sharing in Large-Scale Systems With Non-Exponential Job Sizes”, IEEE-ACM Trans. Netw., 27:5 (2019), 2137–2149  crossref  mathscinet  isi  scopus
    66. Sankararaman A., Baccelli F., Foss S., “Interference Queueing Networks on Grids”, Ann. Appl. Probab., 29:5 (2019), 2929–2987  crossref  mathscinet  zmath  isi  scopus
    67. van Leeuwaarden J.S.H., Mathijsen B.W.J., Zwart B., “Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the Qed Halfin-Whitt Heavy-Traffic Regime”, SIAM Rev., 61:3 (2019), 403–440  crossref  mathscinet  zmath  isi  scopus
    68. Aghajani R., Ramanan K., “the Hydrodynamic Limit of a Randomized Load Balancing Network”, Ann. Appl. Probab., 29:4 (2019), 2114–2174  crossref  mathscinet  zmath  isi  scopus
    69. Dawson D.A. Tang J. Zhao Y.Q., “Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues”, Asia Pac. J. Oper. Res., 36:4 (2019), 1950019  crossref  mathscinet  zmath  isi  scopus
    70. Yang L., Debo L.G., Gupta V., “Search Among Queues Under Quality Differentiation”, Manage. Sci., 65:8 (2019), 3605–3623  crossref  isi  scopus
    71. Budhiraja A., Mukherjee D., Wu R., “Supermarket Model on Graphs”, Ann. Appl. Probab., 29:3 (2019), 1740–1777  crossref  mathscinet  zmath  isi  scopus
    72. Yang F., Jiang Ya., Li Q., “Mean-Field Macro Computation in Large-Scale Cloud Service Systems With Resource Management and Job Scheduling”, J. Syst. Sci. Syst. Eng., 28:2 (2019), 238–261  crossref  isi  scopus
    73. Budhiraja A., Friedlander E., “Diffusion Approximations For Load Balancing Mechanisms in Cloud Storage Systems”, Adv. Appl. Probab., 51:1 (2019), 41–86  crossref  mathscinet  zmath  isi  scopus
    74. Gast N., Bortolussi L., Tribastone M., “Size Expansions of Mean Field Approximation: Transient and Steady-State Analysis”, Perform. Eval., 129 (2019), 60–80  crossref  isi  scopus
    75. Al-Abbasi A.O., Elghariani A., Elgabli A., Aggarwal V., 2019 IEEE Global Communications Conference (Globecom), IEEE Global Communications Conference, IEEE, 2019  isi
    76. Baccelli F., Taillefumier T., “Replica-Mean-Field Limits For Intensity-Based Neural Networks”, SIAM J. Appl. Dyn. Syst., 18:4 (2019), 1756–1797  crossref  mathscinet  zmath  isi  scopus
    77. Prabu U., Malarvizhi N., Amudhavel J., Sriram R., Ravisasthiri P., “Load Balancing Policies of Web Servers: Research Analysis, Classification and Perspectives”, EAI Endorsed Trans. Scalable Inform. Syst., 6:21 (2019), e7  crossref  isi
    78. Sun W., Robert Ph., “Analysis of Large Urn Models With Local Mean-Field Interactions”, Electron. J. Probab., 24 (2019), 45  crossref  mathscinet  zmath  isi  scopus
    79. Gupta V., Walton N., “Load Balancing in the Nondegenerate Slowdown Regime”, Oper. Res., 67:1 (2019), 281–294  crossref  mathscinet  isi  scopus
    80. M. P. Savelov, “Sistema gruppovogo obsluzhivaniya trekh ocheredei so sbalansirovannym postupleniem zayavok”, Diskret. matem., 32:4 (2020), 103–119  mathnet  crossref  mathscinet
    81. Al-Abbasi A.O., Aggarwal V., “Vidcloud: Joint Stall Andquality Optimization For Video Streaming Over Cloud”, ACM Trans. Modeling Perform. Eval. Comput. Syst., 5:4 (2020), 17  crossref  isi  scopus
    82. KhudaBukhsh W.R., Kar S., Alt B., Rizk A., Koeppl H., “Generalized Cost-Based Job Scheduling in Very Large Heterogeneous Cluster Systems”, IEEE Trans. Parallel Distrib. Syst., 31:11 (2020), 2594–2604  crossref  isi  scopus
    83. Xu K., Zhong Yu., “Information and Memory in Dynamic Resource Allocation”, Oper. Res., 68:6 (2020), 1698–1715  crossref  mathscinet  zmath  isi  scopus
    84. Mukherjee D., Borst S.C., van Leeuwaarden J.S.H., Whiting Ph.A., “Asymptotic Optimality of Power-of-D Load Balancing in Large-Scale Systems”, Math. Oper. Res., 45:4 (2020), 1535–1571  crossref  mathscinet  zmath  isi  scopus
    85. Van Spilbeeck I., Van Houdt B., “on the Impact of Job Size Variability on Heterogeneity-Aware Load Balancing”, Ann. Oper. Res., 293:1, SI (2020), 371–399  crossref  mathscinet  zmath  isi  scopus
    86. Kim S.-H., Yang H.-J., Ngoc Anh Thi Nguyen, Mehmood R.M., Lee S.-W., “Parameter Estimation Using Unscented Kalman Filter on the Gray-Box Model For Dynamic Eeg System Modeling”, IEEE Trans. Instrum. Meas., 69:9 (2020), 6175–6185  crossref  isi  scopus
    87. Al-Abbasi A.O., Aggarwal V., “Ttlcache: Taming Latency in Erasure-Coded Storage Through Ttl Caching”, IEEE Trans. Netw. Serv. Manag., 17:3 (2020), 1582–1596  crossref  isi  scopus
    88. Anselmi J., Dufour F., “Power-of-D-Choices With Memory: Fluid Limit and Optimality”, Math. Oper. Res., 45:3 (2020), 862–888  crossref  mathscinet  zmath  isi  scopus
    89. Cruise J., Jonckheere M., Shneer S., “Stability of Jsq in Queues With General Server-Job Class Compatibilities”, Queueing Syst., 95:3-4 (2020), 271–279  crossref  mathscinet  zmath  isi  scopus
    90. Liu X., Ying L., “Steady-State Analysis of Load-Balancing Algorithms in the Sub-Halfin-Whitt Regime”, J. Appl. Probab., 57:2 (2020), PII S0021900220000133, 578–596  crossref  mathscinet  zmath  isi  scopus
    91. van der Boor M., Zubeldia M., Borst S., “Zero-Wait Load Balancing With Sparse Messaging”, Oper. Res. Lett., 48:3 (2020), 368–375  crossref  mathscinet  zmath  isi  scopus
    92. Gamarnik D., Tsitsiklis J.N., Zubeldia M., “a Lower Bound on the Queueing Delay in Resource Constrained Load Balancing”, Ann. Appl. Probab., 30:2 (2020), 870–901  crossref  mathscinet  zmath  isi  scopus
    93. Hellemans T., Van Houdt B., “Performance Analysis of Load Balancing Policies With Memory”, Proceedings of the 13Th Eai International Conference on Performance Evaluation Methodologies and Tools ( Valuetools 2020), Assoc Computing Machinery, 2020, 27–34  crossref  isi  scopus
    94. Garcia-Carballeira F., Calderon A., Carretero J., “Enhancing the Power of Two Choices Load Balancing Algorithm Using Round Robin Policy”, Cluster Comput., 24:2 (2021), 611–624  crossref  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:3408
    Full text:1318
    First page:2

    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021