{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:32:24Z","timestamp":1740123144596,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"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-1329819"],"award-info":[{"award-number":["CNS-1329819"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"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-09695-x","type":"journal-article","created":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T17:03:01Z","timestamp":1614963781000},"page":"49-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heavy traffic queue length scaling in switches with reconfiguration delay"],"prefix":"10.1007","volume":"98","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6876-3272","authenticated-orcid":false,"given":"Chang-Heng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siva Theja","family":"Maguluri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tara","family":"Javidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"9695_CR1","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1214\/aoap\/1015345407","volume":"11","author":"D Bertsimas","year":"2001","unstructured":"Bertsimas, D., Gamarnik, D., Tsitsiklis, J.N.: Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions. Ann. Appl. Probab. 11, 1384\u20131428 (2001)","journal-title":"Ann. Appl. Probab."},{"issue":"1","key":"9695_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1019160803783","volume":"30","author":"M Bramson","year":"1998","unstructured":"Bramson, M.: State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Syst. 30(1), 89\u2013140 (1998). https:\/\/doi.org\/10.1023\/A:1019160803783","journal-title":"Queueing Syst."},{"key":"9695_CR3","doi-asserted-by":"crossref","unstructured":"\u00c7elik, G., Borst, S., Whiting, P., Modiano, E.: Variable frame based max-weight algorithms for networks with switchover delay. In: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 2537\u20132541 (2011)","DOI":"10.1109\/ISIT.2011.6034025"},{"issue":"1\u20132","key":"9695_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s11134-016-9471-4","volume":"83","author":"G Celik","year":"2016","unstructured":"Celik, G., Borst, S.C., Whiting, P.A., Modiano, E.: Dynamic scheduling with reconfiguration delays. Queueing Syst. Theory Appl. 83(1\u20132), 87\u2013129 (2016). https:\/\/doi.org\/10.1007\/s11134-016-9471-4","journal-title":"Queueing Syst. Theory Appl."},{"issue":"3\u20134","key":"9695_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s11134-015-9468-4","volume":"82","author":"CW Chan","year":"2016","unstructured":"Chan, C.W., Armony, M., Bambos, N.: Maximum weight matching with hysteresis in overloaded queues with setups. Queueing Syst. Theory Appl. 82(3\u20134), 315\u2013351 (2016). https:\/\/doi.org\/10.1007\/s11134-015-9468-4","journal-title":"Queueing Syst. Theory Appl."},{"issue":"3","key":"9695_CR6","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/35.989763","volume":"40","author":"P De Dobbelaere","year":"2002","unstructured":"De Dobbelaere, P., Falta, K., Gloeckner, S., Patra, S.: Digital mems for optical switching. IEEE Commun. Mag. 40(3), 88\u201395 (2002). https:\/\/doi.org\/10.1109\/35.989763","journal-title":"IEEE Commun. Mag."},{"issue":"3\u20134","key":"9695_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s11134-012-9305-y","volume":"72","author":"A Eryilmaz","year":"2012","unstructured":"Eryilmaz, A., Srikant, R.: Asymptotically tight steady-state queue length bounds implied by drift conditions. Queueing Syst. Theory Appl. 72(3\u20134), 311\u2013359 (2012). https:\/\/doi.org\/10.1007\/s11134-012-9305-y","journal-title":"Queueing Syst. Theory Appl."},{"issue":"5","key":"9695_CR8","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1214\/08-AAP591","volume":"19","author":"WN Kang","year":"2009","unstructured":"Kang, W.N., Kelly, F.P., Lee, N.H., Williams, R.J.: State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Ann. Appl. Probab. 19(5), 1719\u20131780 (2009)","journal-title":"Ann. Appl. Probab."},{"key":"9695_CR9","doi-asserted-by":"publisher","unstructured":"Keyworth, B.: Roadm subsystems and technologies. In: Optical Fiber Communication Conference, 2005. Technical Digest. OFC\/NFOEC, vol.\u00a03, pp. 3\u20134 (2005). https:\/\/doi.org\/10.1109\/OFC.2005.192706","DOI":"10.1109\/OFC.2005.192706"},{"issue":"7","key":"9695_CR10","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/JSAC.2003.815843","volume":"21","author":"X Li","year":"2003","unstructured":"Li, X., Hamdi, M.: On scheduling optical packet switches with reconfiguration delay. IEEE J. Sel. Areas Commun. 21(7), 1156\u20131164 (2003). https:\/\/doi.org\/10.1109\/JSAC.2003.815843","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9695_CR11","doi-asserted-by":"publisher","unstructured":"Li, Y., Panwar, S., Chao, H.: Frame-based matching algorithms for optical switches. In: 2003, HPSR. Workshop on High Performance Switching and Routing, pp. 97\u2013102 (2003). https:\/\/doi.org\/10.1109\/HPSR.2003.1226687","DOI":"10.1109\/HPSR.2003.1226687"},{"key":"9695_CR12","unstructured":"Liu, H., Lu, F., Forencich, A., Kapoor, R., Tewari, M., Voelker, G.M., Papen, G., Snoeren, A.C., Porter, G.: Circuit switching under the radar with reactor. In: Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation, NSDI\u201914, pp. 1\u201315. USENIX Association, Berkeley, CA, USA (2014). http:\/\/dl.acm.org\/citation.cfm?id=2616448.2616450"},{"key":"9695_CR13","doi-asserted-by":"crossref","unstructured":"Liu, H., Mukerjee, M.K., Li, C., Feltman, N., Papen, G., Savage, S., Seshan, S., Voelker, G.M., Andersen, D.G., Kaminsky, M., Porter, G., Snoeren, A.C.: Scheduling techniques for hybrid circuit\/packet networks. In: ACM CoNEXT, ACM CoNEXT\u201915. ACM, New York (2015)","DOI":"10.1145\/2716281.2836126"},{"issue":"1","key":"9695_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2964791.2901466","volume":"44","author":"ST Maguluri","year":"2016","unstructured":"Maguluri, S.T., Burle, S.K., Srikant, R.: Optimal heavy-traffic queue length scaling in an incompletely saturated switch. SIGMETRICS Perform. Eval. Rev. 44(1), 13\u201324 (2016). https:\/\/doi.org\/10.1145\/2964791.2901466","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"1","key":"9695_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1214\/15-SSY193","volume":"6","author":"ST Maguluri","year":"2016","unstructured":"Maguluri, S.T., Srikant, R.: Heavy traffic queue length behavior in a switch under the maxweight algorithm. Stoch. Syst. 6(1), 211\u2013250 (2016). https:\/\/doi.org\/10.1214\/15-SSY193","journal-title":"Stoch. Syst."},{"key":"9695_CR16","doi-asserted-by":"publisher","unstructured":"McKeown, N., Anantharam, V., Walrand, J.: Achieving 100% throughput in an input-queued switch. In: INFOCOM\u201996. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE, vol.\u00a01, pp. 296\u2013302 (1996). https:\/\/doi.org\/10.1109\/INFCOM.1996.497906","DOI":"10.1109\/INFCOM.1996.497906"},{"issue":"12","key":"9695_CR17","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1109\/9.182479","volume":"37","author":"L Tassiulas","year":"1992","unstructured":"Tassiulas, L., Ephremides, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control 37(12), 1936\u20131948 (1992). https:\/\/doi.org\/10.1109\/9.182479","journal-title":"IEEE Trans. Autom. Control"},{"key":"9695_CR18","doi-asserted-by":"crossref","unstructured":"Venkatakrishnan, S.B., Alizadeh, M., Viswanath, P.: Costly circuits, submodular schedules and approximate carath\u00e9odory theorems. In: Proceedings of the 13th ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS\u201916. ACM, New York (2016)","DOI":"10.1145\/2896377.2901479"},{"issue":"3","key":"9695_CR19","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1109\/TNET.2016.2644617","volume":"25","author":"C Wang","year":"2017","unstructured":"Wang, C., Javidi, T.: Adaptive policies for scheduling with reconfiguration delay: an end-to-end solution for all-optical data centers. IEEE\/ACM Trans. Netw. 25(3), 1555\u20131568 (2017). https:\/\/doi.org\/10.1109\/TNET.2016.2644617","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9695_CR20","doi-asserted-by":"crossref","unstructured":"Wang, C.H., Javidi, T., Porter, G.: End-to-end scheduling for all-optical data centers. In: INFOCOM, 2015 Proceedings IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218406"},{"issue":"3","key":"9695_CR21","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/3199524.3199565","volume":"45","author":"W Wang","year":"2018","unstructured":"Wang, W., Maguluri, S.T., Srikant, R., Ying, L.: Heavy-traffic delay insensitivity in connection-level models of data transfer with proportionally fair bandwidth sharing. SIGMETRICS Perform. Eval. Rev. 45(3), 232\u2013245 (2018). https:\/\/doi.org\/10.1145\/3199524.3199565","journal-title":"SIGMETRICS Perform. Eval. Rev."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-021-09695-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-021-09695-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-021-09695-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T08:29:26Z","timestamp":1621499366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-021-09695-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,5]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["9695"],"URL":"https:\/\/doi.org\/10.1007\/s11134-021-09695-x","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[2021,3,5]]},"assertion":[{"value":"9 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}