{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:11:45Z","timestamp":1762272705336,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,4,17]],"date-time":"2021-04-17T00:00:00Z","timestamp":1618617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,17]],"date-time":"2021-04-17T00:00:00Z","timestamp":1618617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1617437"],"award-info":[{"award-number":["CNS-1617437"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"U.S. ARL and the U.K. MoD","award":["W911NF-16-3-0001"],"award-info":[{"award-number":["W911NF-16-3-0001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s11134-021-09703-0","type":"journal-article","created":{"date-parts":[[2021,4,17]],"date-time":"2021-04-17T03:26:01Z","timestamp":1618629961000},"page":"181-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["One-dimensional service networks and batch service queues"],"prefix":"10.1007","volume":"98","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3186-0842","authenticated-orcid":false,"given":"Philippe","family":"Nain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9859-6794","authenticated-orcid":false,"given":"Nitish K.","family":"Panigrahy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prithwish","family":"Basu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,17]]},"reference":[{"key":"9703_CR1","unstructured":"Abadi, H.\u00a0K., Prabhakar, B.: Stable Matchings in Metric Spaces: Modeling Real-World Preferences using Proximity. arXiv:1710.05262, (2017)"},{"key":"9703_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. In: 11th Annual ACM Symposium on Computational Geometry, pp. 39\u201350 (1995)","DOI":"10.1145\/220279.220284"},{"key":"9703_CR3","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc, Oxford (1993)"},{"key":"9703_CR4","volume-title":"Mathematical Methods for Physicists","author":"GB Arfken","year":"1985","unstructured":"Arfken, G.B., Weber, H.J.: Mathematical Methods for Physicists, 3rd edn. Academic Press, London (1985)","edition":"3"},{"issue":"10","key":"9703_CR5","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1016\/j.apm.2005.02.013","volume":"29","author":"R Arumuganathan","year":"2005","unstructured":"Arumuganathan, R., Jeyakumar, S.: Steady state analysis of a bulk queue with multiple vacations, setup times with n-policy and closedown times. Appl. Math. Model. 29(10), 972\u2013986 (2005)","journal-title":"Appl. Math. Model."},{"key":"9703_CR6","doi-asserted-by":"crossref","unstructured":"Baba, Y.: On M\/G\/1 queues with the first $$n$$ customers of each busy period receiving exceptional services. J. Oper. Res. Soc. Japan 42(4), 490\u2013500 (1999)","DOI":"10.15807\/jorsj.42.490"},{"key":"9703_CR7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1111\/j.2517-6161.1954.tb00149.x","volume":"16","author":"NTJ Bailey","year":"1954","unstructured":"Bailey, N.T.J.: On queueing processes with bulk service. J. R. Stat. Soc. 16, 80\u201387 (1954)","journal-title":"J. R. Stat. Soc."},{"issue":"1","key":"9703_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.peva.2011.09.002","volume":"69","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Gupta, U.: Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service. Perform. Eval. 69(1), 53\u201370 (2012)","journal-title":"Perform. Eval."},{"issue":"2","key":"9703_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11134-005-0510-9","volume":"50","author":"SH Chang","year":"2005","unstructured":"Chang, S.H., Takine, T.: Factorization and Stochastic decomposition properties in bulk queues with generalized vacations. Queu. Syst. 50(2), 165\u2013183 (2005)","journal-title":"Queu. Syst."},{"key":"9703_CR10","volume-title":"A First Course in Bulk Queues","author":"ML Chaudhry","year":"1983","unstructured":"Chaudhry, M.L., Templeton, J.G.C.: A First Course in Bulk Queues. Wiley, New York (1983)"},{"key":"9703_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0378-3758(86)90143-6","volume":"13","author":"N Cressie","year":"1986","unstructured":"Cressie, N., Borkent, M.: The moment generating function has its moments. J. Stat. Plan. Inference 13, 337\u2013344 (1986)","journal-title":"J. Stat. Plan. Inference"},{"issue":"1","key":"9703_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1287\/moor.5.1.147","volume":"5","author":"D Le Minh","year":"1980","unstructured":"Le Minh, D.: Analysis of the exceptional queueing system by the use of regenerative processes and analytical methods. Math. Oper. Res. 5(1), 147\u2013159 (1980)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9703_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/581291.581300","volume":"6","author":"S Doshi","year":"2002","unstructured":"Doshi, S., Bhandare, S.: An on-demand minimum energy routing protocol for a wireless ad-hoc network. ACM Mobile Comput. Commun. Rev. 6(3), 113 (2002)","journal-title":"ACM Mobile Comput. Commun. Rev."},{"issue":"2","key":"9703_CR14","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1111\/j.2517-6161.1955.tb00199.x","volume":"17","author":"F Downton","year":"1955","unstructured":"Downton, F.: Waiting time in bulk service queues. J. Roy. Stat. Soc.: Ser. B (Methodol.) 17(2), 256\u2013261 (1955)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"key":"9703_CR15","doi-asserted-by":"crossref","unstructured":"Goswami, V., Laxmi, P.\u00a0V.: A renewal input single and batch service queues with accessibility to batches. In: International Journal of Management Science and Engineering Management, pp. 366\u2013373 (2011)","DOI":"10.1080\/17509653.2011.10671185"},{"issue":"1","key":"9703_CR16","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1016\/j.amc.2006.04.047","volume":"182","author":"V Goswami","year":"2006","unstructured":"Goswami, V., Mohanty, J.R., Samanta, S.K.: Discrete-time bulk-service queues with accessible and non-accessible batches. Appl. Math. Comput. 182(1), 898\u2013906 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"10","key":"9703_CR17","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1016\/S0305-0548(01)00034-X","volume":"29","author":"U Gupta","year":"2002","unstructured":"Gupta, U., Goswami, V.: Performance analysis of finite buffer discrete-time queue with bulk service. Comput. Oper. Res. 29(10), 1331\u20131341 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9703_CR18","first-page":"53","volume":"147","author":"PG Harrison","year":"2000","unstructured":"Harrison, P.G.: Teaching M\/G\/1 theory with extension to priority queues. IEEE Proc. Comput. Dig. Tech. 147(1), 53 (2000)","journal-title":"IEEE Proc. Comput. Dig. Tech."},{"key":"9703_CR19","volume-title":"Performance Modeling of Communication Networks and Computer Architectures","author":"PG Harrison","year":"1993","unstructured":"Harrison, P.G., Patel, N.M.: Performance Modeling of Communication Networks and Computer Architectures. Addison-Wesley, New York (1993)"},{"issue":"1","key":"9703_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1109\/TNET.2010.2057257","volume":"19","author":"IWH Ho","year":"2011","unstructured":"Ho, I.W.H., Leung, K.K., Polak, J.W.: Stochastic model and connectivity dynamics for vanets in signalized road systems. IEEE\/ACM Trans. Netw. 19(1), 195\u2013208 (2011)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9703_CR21","first-page":"266","volume":"45","author":"AE Holroyd","year":"2009","unstructured":"Holroyd, A.E., Pemantle, R., Peres, R., Schramm, O.: Poisson matching. Annales de l IHP Probabilites et Statistiques 45, 266\u2013287 (2009)","journal-title":"Annales de l IHP Probabilites et Statistiques"},{"issue":"2","key":"9703_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11134-005-0402-z","volume":"50","author":"AJEM Janssen","year":"2005","unstructured":"Janssen, A.J.E.M., van Leeuwaarden, J.S.H.: Analytic computation schemes for the discrete-time bulk service queue. Queu. Syst. 50(2), 141\u2013163 (2005)","journal-title":"Queu. Syst."},{"issue":"4","key":"9703_CR23","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1080\/07362990600751852","volume":"24","author":"NK Kim","year":"2006","unstructured":"Kim, N.K., Chaudhry, M.L.: Equivalences of batch-service queues and multi-server queues and their complete simple solutions in terms of roots. Stoch. Anal. Appl. 24(4), 753\u2013766 (2006)","journal-title":"Stoch. Anal. Appl."},{"issue":"2\u20133","key":"9703_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0895-7177(99)00226-5","volume":"31","author":"A Krishnamoorthy","year":"2000","unstructured":"Krishnamoorthy, A., Ushakumari, P.V.: A queueing system with single arrival bulk service and single departure. Math. Comput. Model. 31(2\u20133), 99\u2013108 (2000)","journal-title":"Math. Comput. Model."},{"key":"9703_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Log. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Log. Q."},{"issue":"8","key":"9703_CR26","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1109\/49.329340","volume":"12","author":"KK Leung","year":"1994","unstructured":"Leung, K.K., Massey, W.A., Whitt, W.: Traffic models for wireless communication networks. IEEE J. Sel. Areas Commun. 12(8), 1353\u20131364 (1994)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9703_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/wcm.1087","volume":"13","author":"L Li","year":"2013","unstructured":"Li, L., Zhang, B., Zheng, J.: A study on one-dimensional $$k$$-coverage problem in wireless sensor networks. Wirel. Commun. Mob. Comput. 13, 1\u201311 (2013)","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"9703_CR28","doi-asserted-by":"crossref","unstructured":"Nain, P., Panigrahy, N.K., Basu, P., Towsley, D.: One-dimensional service networks and batch service queues. hal-03066179 3066179, 110 (2020)","DOI":"10.1007\/s11134-021-09703-0"},{"key":"9703_CR29","first-page":"109","volume":"78","author":"J Orlin","year":"1997","unstructured":"Orlin, J.: A polynomial time primal network simplex algorithm for minimum cost flows. Math. Program. 78, 109\u2013129 (1997)","journal-title":"Math. Program."},{"key":"9703_CR30","doi-asserted-by":"publisher","first-page":"192","DOI":"10.2307\/3212506","volume":"10","author":"AG Pakes","year":"1973","unstructured":"Pakes, A.G.: On the busy period of the modified GI\/G\/1 queue. J. Appl. Prob. 10, 192\u2013197 (1973)","journal-title":"J. Appl. Prob."},{"key":"9703_CR31","doi-asserted-by":"crossref","unstructured":"Panigrahy, N.K., Basu, P., Nain, P., Towsley, D., Swami, A., Chan, K.S., Leung, K.K.: Resource allocation in one-dimensional distributed service networks with applications. Perform. Eval. 142, 102 (2020)","DOI":"10.1016\/j.peva.2020.102110"},{"key":"9703_CR32","unstructured":"Shirer, M.: The Growth in Connected IoT Devices. Businesswire (2019)"},{"issue":"4","key":"9703_CR33","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.cor.2003.09.007","volume":"32","author":"K Sikdar","year":"2005","unstructured":"Sikdar, K., Gupta, U.: Analytic and numerical aspects of batch service queues with single vacation. Comput. Oper. Res. 32(4), 943\u2013966 (2005)","journal-title":"Comput. Oper. Res."},{"key":"9703_CR34","series-title":"Schaum\u2019s Outline Series","volume-title":"Schaum\u2019s Outline of Theory and Problems of Laplace Transforms","author":"MR Spiegel","year":"1965","unstructured":"Spiegel, M.R.: Schaum\u2019s Outline of Theory and Problems of Laplace Transforms. Schaum\u2019s Outline Series. McGraw-Hill, London (1965)"},{"key":"9703_CR35","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/0218080","volume":"18","author":"PM Vaidya","year":"1989","unstructured":"Vaidya, P.M.: Geometry helps in matching. SIAM J. Comput. 18, 1201\u20131225 (1989)","journal-title":"SIAM J. Comput."},{"key":"9703_CR36","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1287\/opre.12.5.736","volume":"12","author":"P Welch","year":"1964","unstructured":"Welch, P.: On a generalized M\/G\/1 queuing process in which the first customer of each busy period receives exceptional service. Oper. Res. 12, 736\u2013752 (1964)","journal-title":"Oper. Res."},{"issue":"1","key":"9703_CR37","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01159401","volume":"22","author":"YQ Zhao","year":"1996","unstructured":"Zhao, Y.Q., Campbell, L.L.: Equilibrium probability calculations for a discrete-time bulk queue model. Queu. Syst. 22(1), 189\u2013198 (1996)","journal-title":"Queu. Syst."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-021-09703-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-021-09703-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-021-09703-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T16:18:24Z","timestamp":1724861904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-021-09703-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,17]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["9703"],"URL":"https:\/\/doi.org\/10.1007\/s11134-021-09703-0","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[2021,4,17]]},"assertion":[{"value":"14 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}