{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:01Z","timestamp":1740122641393,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T00:00:00Z","timestamp":1504483200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s11277-017-4941-5","type":"journal-article","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T07:52:02Z","timestamp":1504511522000},"page":"1719-1734","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-layer Resources Fair Allocation in Big Data with Heterogeneous Demands"],"prefix":"10.1007","volume":"98","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4529-6832","authenticated-orcid":false,"given":"Fuhong","family":"Lin","sequence":"first","affiliation":[]},{"given":"Jingtao","family":"Su","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,4]]},"reference":[{"issue":"7","key":"4941_CR1","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1109\/LCOMM.2013.060513.130351","volume":"17","author":"E Amaldi","year":"2013","unstructured":"Amaldi, E., Capone, A., Coniglio, S., & Gianoli, L. G. (2013). Network optimization problems subject to max\u2013min fair flow allocation. IEEE Communications Letters (ICL), 17(7), 1463\u20131466.","journal-title":"IEEE Communications Letters (ICL)"},{"issue":"8","key":"4941_CR2","doi-asserted-by":"publisher","first-page":"3907","DOI":"10.1109\/TVT.2011.2163431","volume":"60","author":"Y Kim","year":"2011","unstructured":"Kim, Y., & Sichitiu, M. L. (2011). Optimal max\u2013min fair resource allocation in multihop relay-enhanced WiMAX networks. IEEE Transactions on Vehicular Technology (TVT), 60(8), 3907\u20133918.","journal-title":"IEEE Transactions on Vehicular Technology (TVT)"},{"issue":"3","key":"4941_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/TIFS.2014.2384392","volume":"10","author":"S Karachontzitis","year":"2015","unstructured":"Karachontzitis, S., Timotheou, S., Krikidis, I., & Berberidis, K. (2015). Security-aware max\u2013min resource allocation in multiuser OFDMA downlink. IEEE Transactions on Information Forensics and Security (TIFS), 10(3), 529\u2013542.","journal-title":"IEEE Transactions on Information Forensics and Security (TIFS)"},{"issue":"4","key":"4941_CR4","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1109\/LCOMM.2015.2396525","volume":"19","author":"PD Mankar","year":"2015","unstructured":"Mankar, P. D., Das, G., & Pathak, S. S. (2015). A novel proportionally fair spectrum allocation in two tiered cellular networks. IEEE Communications Letters (ICL), 19(4), 629\u2013632.","journal-title":"IEEE Communications Letters (ICL)"},{"issue":"2","key":"4941_CR5","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1109\/TWC.2013.010214.131970","volume":"13","author":"K Illanko","year":"2014","unstructured":"Illanko, K., Anpalagan, A., Hossain, E., & Androutsos, D. (2014). On the power allocation problem in the Gaussian interference channel with proportional rate constraints. IEEE Transactions on Wireless Communications (TWC), 13(2), 1101\u20131115.","journal-title":"IEEE Transactions on Wireless Communications (TWC)"},{"issue":"6","key":"4941_CR6","doi-asserted-by":"publisher","first-page":"1819","DOI":"10.1109\/TNET.2013.2284494","volume":"22","author":"IH Hou","year":"2014","unstructured":"Hou, I. H., & Gupta, P. (2014). Proportionally fair distributed resource allocation in multiband wireless systems. IEEE\/ACM Transactions on Networking (TON), 22(6), 1819\u20131830.","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"issue":"3","key":"4941_CR7","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TPDS.2007.70755","volume":"19","author":"A Chandra","year":"2008","unstructured":"Chandra, A., & Shenoy, P. J. (2008). Hierarchical scheduling for symmetric multiprocessors. IEEE Transactions on Parallel Distributed Systems (TPDS), 19(3), 418\u2013431.","journal-title":"IEEE Transactions on Parallel Distributed Systems (TPDS)"},{"key":"4941_CR8","doi-asserted-by":"crossref","unstructured":"Goyal, P., Guo, X., & Vin, HM. (1996). A hierarchical CPU scheduler for multimedia operating systems. In Proceedings of OSDI (pp. 107\u2013121).","DOI":"10.1145\/238721.238766"},{"issue":"5","key":"4941_CR9","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1109\/90.649568","volume":"5","author":"JCR Bennett","year":"1997","unstructured":"Bennett, J. C. R., & Zhang, H. (1997). Hierarchical packet fair queueing algorithms. IEEE\/ACM Transactions on Networking (TON), 5(5), 675\u2013689.","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"key":"4941_CR10","doi-asserted-by":"crossref","unstructured":"Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., & Goldberg, A. (2009). Quincy: Fair scheduling for distributed computing clusters. In SOSP\u201909.","DOI":"10.1145\/1629575.1629601"},{"key":"4941_CR11","unstructured":"Ghodsi, A., Zaharia M., Hindman, B., Konwinski, A., Shenker, S., & Stoica, I. (2011). Dominant resource fairness: Fair allocation of multiple resource types. NSDI."},{"key":"4941_CR12","doi-asserted-by":"crossref","unstructured":"Dolev, D., Feitelson, D., Halpern, J., Kupferman, R., & Linial, N. (2012). No justified complaints: On fair sharing of multiple resources. In Proceedings of ACM ITCS.","DOI":"10.1145\/2090236.2090243"},{"key":"4941_CR13","doi-asserted-by":"crossref","unstructured":"Wang, W., Li, B., & Liang, B. (2014). Dominant resource fairness in cloud computing systems with heterogeneous servers. In Proceedings of INFOCOM 2014.","DOI":"10.1109\/INFOCOM.2014.6847983"},{"issue":"10","key":"4941_CR14","doi-asserted-by":"publisher","first-page":"2822","DOI":"10.1109\/TPDS.2014.2362139","volume":"26","author":"W Wang","year":"2015","unstructured":"Wang, W., Liang, B., & Li, B. (2015). Multi-resource fair allocation in heterogeneous cloud computing systems. IEEE Transactions on Parallel and Distributed Systems, 26(10), 2822\u20132835.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"4941_CR15","doi-asserted-by":"crossref","unstructured":"Ghodsi, A., Sekar, V., Zaharia, M., Stoica, I. (2012). Multi-resource fair queueing for packet processing. In Proceedings of SIGCOMM (pp. 1\u201312).","DOI":"10.1145\/2377677.2377679"},{"key":"4941_CR16","volume-title":"Delay scheduling: A simple technique for achieving locality and fairness in cluster scheduling","author":"M Zaharia","year":"2010","unstructured":"Zaharia, M., Borthakur, D., Sen Sarma, J., Elmeleegy, K., Shenker, S., & Stoica, I. (2010). Delay scheduling: A simple technique for achieving locality and fairness in cluster scheduling (Vol. 10). EuroSys: Prague."},{"key":"4941_CR17","unstructured":"Jaffe, J. M. (1980). A decentralized optimal multiple-user flow control algorithm. In Proceedings of Fifth International Conference on Computer Communication."},{"issue":"7","key":"4941_CR18","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TCOM.1981.1095081","volume":"29","author":"JM Jaffe","year":"1981","unstructured":"Jaffe, J. M. (1981). Bottleneck flow control. IEEE Transactions on Communications, 29(7), 954\u2013962.","journal-title":"IEEE Transactions on Communications"},{"key":"4941_CR19","unstructured":"Max\u2013min fairness, http:\/\/en.wikipedia.org\/wiki\/Max-min_fairness ."},{"key":"4941_CR20","unstructured":"Demers, A., Keshav, S., & Shenker, S. (1989). Analysis and simulation of a fair queueing algorithm. In SIGCOMM\u201989, (pp. 1\u201312). New York, NY: ACM."},{"key":"4941_CR21","unstructured":"Waldspurger, C. A. (1995). Lottery and stride scheduling: Flexible proportional share resource management. Ph.D. thesis, MIT, Laboratory of Computer Science, MIT\/LCS\/TR-667."},{"key":"4941_CR22","unstructured":"Waldspurger, C. A., & Weihl, W. E. (1994). Lottery scheduling: Flexible proportional-share resource management. In OSDI\u201994."},{"key":"4941_CR23","volume-title":"Digital communication systems","author":"JG Proakis","year":"2001","unstructured":"Proakis, J. G. (2001). Digital communication systems (4th ed.). New York: McGraw Hill.","edition":"4"},{"key":"4941_CR24","unstructured":"Kash, I., Procaccia, A., & Shah, N. (2013). No agent left behind: Dynamic fair division of multiple resources. In Proceedings of AAMAS."},{"key":"4941_CR25","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465387","volume-title":"Choosy: Max\u2013min fair sharing for datacenter jobs with constraints","author":"A Ghodsi","year":"2013","unstructured":"Ghodsi, A., Zaharia, M., Shenker, S., & Stoica, I. (2013). Choosy: Max\u2013min fair sharing for datacenter jobs with constraints. Prague: ACM EuroSys."},{"key":"4941_CR26","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2523637","volume-title":"Hierarchical scheduling for diverse datacenter workloads","author":"AA Bhattacharya","year":"2013","unstructured":"Bhattacharya, A. A., Culler, D. E., Friedman, E. J., Ghodsi, A., & Shenker, S. (2013). Hierarchical scheduling for diverse datacenter workloads. New York: SoCC."},{"key":"4941_CR27","doi-asserted-by":"crossref","unstructured":"Joe-Wong, C., Sen, S., Lan, T., & Chiang, M., (2012). Multi-resource allocation: Fairness-efficiency tradeoffs in a unifying framework. In Proceedings of IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2012.6195481"},{"key":"4941_CR28","doi-asserted-by":"crossref","unstructured":"Parkes, D., Procaccia, A., & Shah, N. (2012). Beyond dominant resource fairness: Extensions, limitations, and indivisibilities. In Proceedings of ACM EC.","DOI":"10.1145\/2229012.2229075"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-017-4941-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4941-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4941-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T23:35:44Z","timestamp":1570059344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-017-4941-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,4]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["4941"],"URL":"https:\/\/doi.org\/10.1007\/s11277-017-4941-5","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2017,9,4]]}}}