{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T05:13:02Z","timestamp":1744953182272,"version":"3.37.3"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["18\/CRT\/6224"],"award-info":[{"award-number":["18\/CRT\/6224"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8,4]]},"DOI":"10.1109\/bmsb53066.2021.9547096","type":"proceedings-article","created":{"date-parts":[[2021,10,2]],"date-time":"2021-10-02T06:28:26Z","timestamp":1633156106000},"page":"1-6","source":"Crossref","is-referenced-by-count":5,"title":["A Fairness-Driven Resource Allocation Scheme Based on a Weighted Interference Graph in HetNets"],"prefix":"10.1109","author":[{"given":"Bharat","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Amine","family":"Togou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Ruffini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel-Miro","family":"Muntean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996667"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2933689"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2555840"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996534"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925894"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3390\/s17112553"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2988334"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2016.2613864"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/BMSB47279.2019.8971921"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2018.2822873"},{"key":"ref4","first-page":"1","article-title":"PIRS3A: A Low Complexity Multi-knapsack-based Approach for User Association and Resource Allocation in HetNets","author":"agarwal","year":"2021","journal-title":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2532458"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2006.886451"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2006.875612"},{"key":"ref8","first-page":"904","article-title":"MiceTrap: Scalable traffic engineering of datacenter mice flows using OpenFlow","author":"trestian","year":"0","journal-title":"IFIP\/IEEE International Symposium on Integrated Network Management (IM)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISBMSB.2010.5463147"},{"journal-title":"Cisco Annual Internet Report - Cisco Annual Internet Report (2018–2023) White Paper","year":"2020","key":"ref2"},{"journal-title":"Cisco Annual Internet Report - Cisco Annual Internet Report Highlights Tool","year":"2020","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2873418"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LCN48667.2020.9314834"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2672701"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref23","first-page":"1","article-title":"PIRS3A: A Low Complexity Multi-knapsack-based Approach for User Association and Resource Allocation in HetNets","author":"agarwal","year":"2021","journal-title":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)"}],"event":{"name":"2021 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)","start":{"date-parts":[[2021,8,4]]},"location":"Chengdu, China","end":{"date-parts":[[2021,8,6]]}},"container-title":["2021 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9547051\/9547014\/09547096.pdf?arnumber=9547096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:25Z","timestamp":1652197585000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9547096\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,4]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/bmsb53066.2021.9547096","relation":{},"subject":[],"published":{"date-parts":[[2021,8,4]]}}}