{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T21:09:18Z","timestamp":1730236158510,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1109\/iccnc.2013.6504087","type":"proceedings-article","created":{"date-parts":[[2013,4,26]],"date-time":"2013-04-26T21:30:11Z","timestamp":1367011811000},"page":"237-242","source":"Crossref","is-referenced-by-count":0,"title":["A theoretical framework for solving the optimal admissions control with sigmoidal utility functions"],"prefix":"10.1109","author":[{"family":"Jun Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258369"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-006-5192-y"},{"journal-title":"Costas Courcoubetis and Richard Weber","year":"2003","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1023\/B:GRUP.0000003745.98183.8d"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/49.414634"},{"key":"13","first-page":"104","article-title":"Control and game-theoretic tools for communication networks","volume":"6","author":"basar","year":"2007","journal-title":"Applied Mathematics and Computation"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/90.811451"},{"key":"11","article-title":"Charging and rate control for elastic traffic","author":"frank","year":"1997","journal-title":"European Transactions on Telecommunications"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1561\/1300000007"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2003.1200404"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/26.983324"},{"journal-title":"Maximizing the Ratio of A Generalized Sigmoid to Its Argument","year":"2002","author":"rodriguez","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2000.5340798"},{"key":"7","first-page":"1","article-title":"Admission control with resource reallocation","author":"lundqvist","year":"2009","journal-title":"Proc 14th Int Teletraffic Congress (ITC)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2003.1200458"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS.2011.5931317"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2009.4918024"},{"key":"9","article-title":"Min common\/max crossing duality: A simple geometric framework for convex optimization and minimax theory","author":"bertsekas","year":"2002","journal-title":"MIT Technical Report LIDS-P-2536"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498551"}],"event":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC 2013)","start":{"date-parts":[[2013,1,28]]},"location":"San Diego, CA","end":{"date-parts":[[2013,1,31]]}},"container-title":["2013 International Conference on Computing, Networking and Communications (ICNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6495637\/6504039\/06504087.pdf?arnumber=6504087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T18:07:45Z","timestamp":1490206065000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6504087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/iccnc.2013.6504087","relation":{},"subject":[],"published":{"date-parts":[[2013,1]]}}}