{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T15:34:13Z","timestamp":1759073653378},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T00:00:00Z","timestamp":1227657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s11134-008-9096-3","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T10:25:42Z","timestamp":1228127142000},"page":"247-269","source":"Crossref","is-referenced-by-count":4,"title":["Linear programming relaxations and marginal productivity index policies for the buffer sharing problem"],"prefix":"10.1007","volume":"60","author":[{"given":"Jianhua","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Nyberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,26]]},"reference":[{"issue":"3","key":"9096_CR1","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/TCOM.1978.1094081","volume":"COM-26","author":"J.M. Aein","year":"1978","unstructured":"Aein, J.M.: A multi-user-class, blocked-calls-cleared, demand access model. IEEE Trans. Commun. COM-26(3), 378\u2013385 (1978)","journal-title":"IEEE Trans. Commun."},{"key":"9096_CR2","unstructured":"Ahlfors, U., Fyhn, A., Tufvesson, P.: Method and arrangement for managing packet queues in switches. US Patent 6977940 (Dec. 2005)"},{"key":"9096_CR3","unstructured":"Aweya, J., Montuno, D.Y., Ouellette, M.: Method and apparatus for active queue management based on desired queue occupancy. US Patent 6690645 (Feb. 2004)"},{"key":"9096_CR4","volume-title":"Dynamic Programming and Optimal Control","author":"D.P. Bertsekas","year":"2005","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, 3rd edn. Athena Scientific, Nashua (2005)","edition":"3"},{"issue":"1","key":"9096_CR5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/opre.48.1.80.12444","volume":"48","author":"D. Bertsimas","year":"2000","unstructured":"Bertsimas, D., Ni\u00f1o-Mora, J.: Restless bandits, linear programming relaxations and primal-dual index heuristic. Oper. Res. 48(1), 80\u201390 (2000)","journal-title":"Oper. Res."},{"key":"9096_CR6","unstructured":"Choudhury, A.K., Hahne, E.L.: Dynamic queue length thresholds in a shared memory ATM switch. US Patent 5541912 (July 1996)"},{"issue":"7","key":"9096_CR7","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1109\/49.414642","volume":"13","author":"I. Cidon","year":"1995","unstructured":"Cidon, I., Georgiadis, L., Guerin, R., Khamisy, A.: Optimal buffer sharing. IEEE J. Sel. Areas Commun. 13(7), 1229\u20131240 (1995)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9096_CR8","unstructured":"Eng, K.Y., Gitlin, R.D., Karol, M.J.: Channel sharing and memory sharing in a packet switching system. US Patent 5457679 (Oct. 1995)"},{"issue":"4","key":"9096_CR9","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01025868","volume":"57","author":"D. Freedman","year":"1981","unstructured":"Freedman, D., Diaconis, P.: On the histogram as a density estimator: L 2 theory. Z. Wahrsch. Verw. Geb. 57(4), 453\u2013476 (1981)","journal-title":"Z. Wahrsch. Verw. Geb."},{"issue":"3","key":"9096_CR10","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/TCOM.1983.1095819","volume":"COM-31","author":"G.J. Foschini","year":"1983","unstructured":"Foschini, G.J., Gopinath, B.: Sharing memory optimally. IEEE Trans. Commun. COM-31(3), 352\u2013360 (1983)","journal-title":"IEEE Trans. Commun."},{"issue":"7","key":"9096_CR11","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/TCOM.1981.1095090","volume":"COM-29","author":"G.J. Foschini","year":"1981","unstructured":"Foschini, G.J., Gopinath, B., Hayes, J.F.: Optimal allocation of servers to two types of competing customers. IEEE Trans. Commun. COM-29(7), 1051\u20131055 (1981)","journal-title":"IEEE Trans. Commun."},{"key":"9096_CR12","unstructured":"Han, M., Kwon, Y., Nam, H., Rhee, W.: Adaptive buffer partitioning method for shared buffer switch and switch therefor. US Patent 7009988 (Mar. 2006)"},{"key":"9096_CR13","unstructured":"Janoska, M.W., Heller, A.D., Pezeshki-Esfahani, H.: Method and apparatus for data buffer management in a communications switch. US Patent 6539024 (Mar. 2003)"},{"issue":"11","key":"9096_CR14","doi-asserted-by":"crossref","first-page":"2979","DOI":"10.1109\/26.328979","volume":"42","author":"S. Jordan","year":"1994","unstructured":"Jordan, S., Varaiya, P.P.: Control of multiple service, multiple resource communication networks. IEEE Trans. Commun. 42(11), 2979\u20132988 (1994)","journal-title":"IEEE Trans. Commun."},{"key":"9096_CR15","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set functions and 0-1 optimization. SIAM J. Optim. 166\u2013190 (1991)","DOI":"10.1137\/0801013"},{"key":"9096_CR16","unstructured":"Mitra, D.: Method for shared memory management in network nodes. US Patent 5909547 (June 1999)"},{"key":"9096_CR17","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1017\/S0001867800010648","volume":"33","author":"J. Ni\u00f1o-Mora","year":"2001","unstructured":"Ni\u00f1o-Mora, J.: Restless bandits, partial conservation laws and indexability. Adv. Appl. Probab. 33, 76\u201398 (2001)","journal-title":"Adv. Appl. Probab."},{"issue":"3","key":"9096_CR18","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10107-002-0362-6","volume":"93","author":"J. Ni\u00f1o-Mora","year":"2002","unstructured":"Ni\u00f1o-Mora, J.: Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach. Math. Program. Ser. A 93(3), 361\u2013413 (2002)","journal-title":"Math. Program. Ser. A"},{"issue":"4","key":"9096_CR19","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1287\/ijoc.1060.0206","volume":"19","author":"J. Ni\u00f1o-Mora","year":"2006","unstructured":"Ni\u00f1o-Mora, J.: A\u00a0(2\/3)n 3 fast-pivoting algorithm for the Gittins index and optimal stopping for a Markov chain. INFORMS J. Comput. 19(4), 596\u2013606 (2006)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"9096_CR20","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s11134-006-0302-x","volume":"54","author":"J. Ni\u00f1o-Mora","year":"2006","unstructured":"Ni\u00f1o-Mora, J.: Marginal productivity index policies for scheduling a multiclass delay-\/loss-sensitive queue. Queueing Syst. 54(4), 281\u2013312 (2006)","journal-title":"Queueing Syst."},{"issue":"1","key":"9096_CR21","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/moor.1050.0165","volume":"31","author":"J. Ni\u00f1o-Mora","year":"2006","unstructured":"Ni\u00f1o-Mora, J.: Restless bandit marginal productivity indices, diminishing returns and optimal control of make-to-order\/make-to-stock M\/G\/1 queues. Math. Oper. Res. 31(1), 50\u201384 (2006)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9096_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11750-007-0025-0","volume":"15","author":"J. Ni\u00f1o-Mora","year":"2007","unstructured":"Ni\u00f1o-Mora, J.: Dynamic priority allocation via restless bandit marginal productivity indices. Top 15(2), 161\u2013198 (2007)","journal-title":"Top"},{"key":"9096_CR23","unstructured":"Ren, J.-F., Landry, R.J.: Static and dynamic flow control using virtual input queueing for shared memory Ethernet switches. US Patent 6456590 (Sep. 2002)"},{"key":"9096_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-2126-8","volume-title":"Multiservice Loss Models for Broadband Telecommunication Networks","author":"K.W. Ross","year":"1995","unstructured":"Ross, K.W.: Multiservice Loss Models for Broadband Telecommunication Networks. Springer, New York (1995)"},{"key":"9096_CR25","unstructured":"Varma, S., Daniel, T.: Shared memory fabric architecture for very high speed ATM switches. US Patent 5831980 (Nov. 1998)"},{"key":"9096_CR26","doi-asserted-by":"crossref","first-page":"287","DOI":"10.2307\/3214163","volume":"25A","author":"P. Whittle","year":"1988","unstructured":"Whittle, P.: Restless bandits: activity allocation in a changing world. J. Appl. Probab. 25A, 287\u2013298 (1988)","journal-title":"J. Appl. Probab."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-008-9096-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-008-9096-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-008-9096-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:44:39Z","timestamp":1559360679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-008-9096-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,26]]},"references-count":26,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9096"],"URL":"https:\/\/doi.org\/10.1007\/s11134-008-9096-3","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,26]]}}}