{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:43:21Z","timestamp":1777902201391,"version":"3.51.4"},"reference-count":21,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T00:00:00Z","timestamp":1284422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:p>The heavily loaded flows usually occupy more bandwidth than that of the lightly loaded flows under congested traffic conditions. Without effective bandwidth management mechanisms, malicious users may violate congestion control principles in order to get maximum bandwidth. Therefore, how to provide fair bandwidth sharing with low implementation complexity is a critical issue for high-speed networks. An active queue management mechanism, stateless fair admission control (SFAC), is proposed in this paper, which can provide good fairness on bandwidth allocation. Furthermore, the SFAC does not have to maintain per-flow state in each router. The main idea of the SFAC is that two admission thresholds can optimally change according to traffic variations. By comparing the admission thresholds with the hit number of each arrival packet, the SFAC is able to guarantee fair buffer occupancy for each flow. The SFAC employs a single first in, first out buffer, so that it can provide fair bandwidth sharing. In a word, the SFAC is completely stateless, so it possesses the great advantage of being easy to implement. Computer simulations concluded that the SFAC is capable of providing good fair bandwidth sharing under a range of traffic conditions.<\/jats:p>","DOI":"10.1177\/0037549710383610","type":"journal-article","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T20:50:47Z","timestamp":1284497447000},"page":"253-261","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Stateless Fair Admission Control"],"prefix":"10.1177","volume":"87","author":[{"given":"Jui-Pin","family":"Yang","sequence":"first","affiliation":[{"name":"Department of Information Technology and Communication, Shih Chien University, Taiwan, R.O.C.,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2010,9,14]]},"reference":[{"key":"atypb1","unstructured":"RFC 2309: Recommendations on Queue Management and Congestion Avoidance in the Internet, was written by B. Braden, D. Clark, J. Crowcroft, B. Davie, S. Deering, et al. 1998."},{"key":"atypb2","unstructured":"RFC 1254: Gateway Congestion Control Survey, A. Mankin and K. Ramakrishnan: 1991."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1109\/90.502236"},{"key":"atypb4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/263109.263154","author":"Lin D.","year":"1997","journal-title":"Proceedings of ACM SIGCOMM"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808414"},{"key":"atypb6","first-page":"23","volume":"1","author":"Stoica I.","year":"2002","journal-title":"Proceedings of IEEE INFOCOM"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1177\/0037549707080608"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"atypb9","first-page":"942","author":"Pan R.","year":"2000","journal-title":"Proceedings of IEEE INFOCOM"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.833162"},{"key":"atypb11","first-page":"186","author":"Chhabra P.","year":"2002","journal-title":"Proceedings of IEEE ICNP"},{"key":"atypb12","first-page":"16","author":"Victor V.","year":"2007","journal-title":"Proceedings of IEEE GLOBECOM"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1109\/90.234856"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1145\/75246.75248"},{"key":"atypb15","first-page":"1253","author":"Hasegawa G.","year":"2000","journal-title":"Proceeding of IEEE INFOCOM"},{"key":"atypb16","first-page":"1320","author":"Fang WC","year":"1999","journal-title":"Proceedings of IEEE INFOCOM"},{"key":"atypb17","first-page":"1600","author":"Alemu T.","year":"2004","journal-title":"Proceedings of IEEE GLOBECOM"},{"key":"atypb18","first-page":"1412","author":"Anjum FM","year":"1999","journal-title":"Proceedings of IEEE INFOCOM"},{"key":"atypb19","first-page":"59","author":"Wang P.","year":"2005","journal-title":"Proceedings of IEEE NCA"},{"key":"atypb20","first-page":"1413","volume":"84","author":"Kurimoto T.","year":"2001","journal-title":"IEICE Trans COMMUN"},{"key":"atypb21","first-page":"922","author":"Cao P.","year":"2000","journal-title":"Proceedings of IEEE INFOCOM"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549710383610","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549710383610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:22:45Z","timestamp":1777634565000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549710383610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,14]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["10.1177\/0037549710383610"],"URL":"https:\/\/doi.org\/10.1177\/0037549710383610","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,14]]}}}