{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:48:07Z","timestamp":1740174487024,"version":"3.37.3"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Hong Kong RGC GRF","award":["11216618"],"award-info":[{"award-number":["11216618"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1109\/tnse.2020.3031347","type":"journal-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T19:52:05Z","timestamp":1602791525000},"page":"149-162","source":"Crossref","is-referenced-by-count":0,"title":["Leveraging Multiplexing Gain in Network Slice Bundles"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9350-8273","authenticated-orcid":false,"given":"Qian","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2069-0032","authenticated-orcid":false,"given":"Kui","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9318-1482","authenticated-orcid":false,"given":"Jianping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6315-2031","authenticated-orcid":false,"given":"Kejie","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9172-6955","authenticated-orcid":false,"given":"Weiwei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Knapsack problems: Algorithms and computer implementations","author":"martello","year":"0","journal-title":"Wiley-Interscience Series in Discrete Mathematics"},{"key":"ref38","first-page":"3585","article-title":"Analyzing and modeling spatio-temporal dependence of cellular traffic at city scale","author":"xiaming","year":"0","journal-title":"Proc IEEE Int Communications Conf"},{"key":"ref33","first-page":"415","article-title":"On the existence of fast approximation schemes","author":"korte","year":"1981","journal-title":"Proc Nonlinear Program 4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1008861.1008867"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336517"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"year":"0","key":"ref37","article-title":"NORDUnet network statistics"},{"article-title":"An overview of gradient descent optimization algorithms","year":"2016","author":"ruder","key":"ref36"},{"key":"ref35","first-page":"6278","article-title":"Learning to perform local rewriting for combinatorial optimization","author":"chen","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","first-page":"1134","article-title":"Knapsack based optimal policies for budgetlimited multiarmed bandits","author":"tran-thanh","year":"0","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2019.1800498"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42432-3_37"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1109\/CloudNet47604.2019.9064107","article-title":"On the cost-optimality trade-off for service function chain reconfiguration","author":"noghani","year":"2019"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1109\/TNET.2007.896501","article-title":"A network calculus with effective bandwidth","volume":"15","author":"li","year":"2007","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-011-0321-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2870184"},{"key":"ref15","first-page":"539","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","author":"li","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","first-page":"15 554","article-title":"Exact combinatorial optimization with graph convolutional neural networks","author":"gasse","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90005-6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68155-7_4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.98"},{"article-title":"A basic introduction to large deviations: Theory, applications, simulations","year":"2011","author":"touchette","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600940"},{"key":"ref27","first-page":"141","article-title":"Notes on effective bandwidths","author":"kelly","year":"0","journal-title":"Proc Stochastic Netw Theory Appl Roy Stat Soc Lecture Notes Series 4"},{"year":"2016","key":"ref3","article-title":"Network slicing for 5G networks & services"},{"year":"0","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0459-9"},{"year":"2018","key":"ref5","article-title":"Network slicing: Use case requirements"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2895378"},{"year":"0","key":"ref7"},{"article-title":"Network slicing use cases: Network customization and differentiated services","year":"2017","author":"makhijani","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2930059"},{"year":"2019","key":"ref1","article-title":"Cisco visual networking index: Global mobile data traffic forecast update, 2017-2022"},{"key":"ref46","first-page":"1","article-title":"Network slicing games: Enabling customization in multi-tenant networks","author":"caballero","year":"0","journal-title":"Proc IEEE Int Conf Comput Commun"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925498"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737517"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/TSMCB.2006.879012","article-title":"Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation","volume":"37","author":"granmo","year":"2007","journal-title":"IEEE Trans Syst Man Cybern B (Cybern )"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3209582.3209606"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2720668"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057090"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737660"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/49.400651"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737488"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/9780470515099"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7514161"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.22215\/etd\/2000-04500","article-title":"Statistical estimation of effective bandwidth","author":"rabinovitch","year":"2000"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM.2017.8255993"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/047120644X.ch1"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9380808\/09224926.pdf?arnumber=9224926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:37Z","timestamp":1652194417000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9224926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":48,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2020.3031347","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}