2021-03-232013-01-010743166XWOS;000326335200075SCOPUS;2-s2.0-84883074760http://hdl.handle.net/10784/27134We consider the problem of distributed admission control without knowledge of the capacity region in single-hop wireless networks, for flows that require a pre-specified bandwidth from the network. We present an optimization framework that allows us to design a scheduler and resource allocator, and by properly choosing a suitable utility function in the resource allocator, we prove that existing flows can be served with a pre-specified bandwidth, while the link requesting admission can determine the largest rate that it can get such that it does not interfere with the allocation to the existing flows. © 2013 IEEE.enghttps://v2.sherpa.ac.uk/id/publication/issn/0743-166XDistributed admission control without knowledge of the capacity regioninfo:eu-repo/semantics/conferencePaperCapacity regionsDistributed admission controlOptimization frameworkResource allocatorSingle-hop wireless networksUtility functionsBandwidth2021-03-23Jose Jaramillo, JuanYing, Lei10.1109/INFCOM.2013.6566790