{"corpus_id":380758,"paper_sha":"69aaa5cc0f1906afd67174f7044b69631d689e9d","doi":"10.1109/TNET.2007.900405","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":2117363591,"dblp_id":"journals/ton/NeelyML08","acl_id":null,"title":"Fairness and Optimal Stochastic Control for Heterogeneous Networks","year":2005,"publication_date":"2005-03-13","venue":"IEEE/ACM Transactions on Networking","journal":{"name":"IEEE/ACM Transactions on Networking","pages":"396-409","volume":"16"},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle"],"pubmed_pub_types":null,"s2_fields_of_study":["Computer Science","Engineering"],"reference_count":54,"citation_count":729,"influential_citation_count":59,"is_open_access":true,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"http://www-bcf.usc.edu/~mjneely/pdf_papers/fairness-ton.pdf","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/69aaa5cc0f1906afd67174f7044b69631d689e9d","s2_open_access_license":null,"s2_open_access_status":"GREEN","pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capacity. The strategy is decoupled into separate algorithms for flow control, routing, and resource allocation, and allows each user to make decisions independent of the actions of others. The combined strategy is shown to yield data rates that are arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events. The cost of approaching this fair operating point is an end-to-end delay increase for data that is served by the network.","claims":[{"public_id":"cl_7d54bbcce86703db70efd79ce5764217","status":"active","text":"The combined strategy yields data rates arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events, at the cost of increased end-to-end delay for served data.","confidence":0.95,"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/claims/cl_7d54bbcce86703db70efd79ce5764217"},{"public_id":"cl_8dc817ad351a8e25528dd2f0fe4e4aa7","status":"active","text":"The dynamic strategy supports all traffic whenever possible and makes optimally fair decisions when inputs exceed network capacity.","confidence":0.95,"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/claims/cl_8dc817ad351a8e25528dd2f0fe4e4aa7"},{"public_id":"cl_2cb24e211b39a16588c34e5f14c7d00f","status":"active","text":"The strategy is decoupled into separate algorithms for flow control, routing, and resource allocation, allowing each user to make decisions independent of others.","confidence":0.95,"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/claims/cl_2cb24e211b39a16588c34e5f14c7d00f"}],"concepts":[{"public_id":"co_09083feac4e2e1b234572567c4b87353","status":"active","name":"optimal fairness","description":"The property of the dynamic strategy to make optimally fair decisions about which data to serve under overload.","types":["property"],"aliases":[],"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/concepts/co_09083feac4e2e1b234572567c4b87353"},{"public_id":"co_1009822afa4e4f4543b9a274bff906de","status":"active","name":"dynamic strategy","description":"The developed optimal control strategy for heterogeneous networks.","types":["method"],"aliases":[],"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/concepts/co_1009822afa4e4f4543b9a274bff906de"},{"public_id":"co_11d1a1b3815ece275859dbfcd0197f2b","status":"active","name":"end-to-end delay","description":"The increase in latency for data served by the network when approaching the fair operating point.","types":["metric"],"aliases":[],"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/concepts/co_11d1a1b3815ece275859dbfcd0197f2b"},{"public_id":"co_1f9463386aec35f632bbaaf763054e46","status":"active","name":"resource allocation","description":"A separate algorithm component for allocating network resources in the dynamic strategy.","types":["algorithm"],"aliases":[],"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/concepts/co_1f9463386aec35f632bbaaf763054e46"},{"public_id":"co_6c0107434521a2e14973b74b403f8958","status":"active","name":"data rates","description":"The throughput rates achieved by the combined dynamic strategy.","types":["metric"],"aliases":[],"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/concepts/co_6c0107434521a2e14973b74b403f8958"},{"public_id":"co_739d9aa7e52f2e79452f8d073b8a30b1","status":"active","name":"flow control","description":"A separate algorithm component of the dynamic strategy for controlling data flow.","types":["algorithm"],"aliases":[],"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/concepts/co_739d9aa7e52f2e79452f8d073b8a30b1"},{"public_id":"co_855993d699bd85d4528e970715d9c715","status":"active","name":"routing","description":"A separate algorithm component for routing decisions in the dynamic strategy.","types":["algorithm"],"aliases":[],"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/concepts/co_855993d699bd85d4528e970715d9c715"},{"public_id":"co_8850856185b856b85dfe8f8eb1cb0181","status":"active","name":"heterogeneous networks","description":"General networks with both wireless and wireline components and time-varying channels.","types":["network type"],"aliases":[],"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/concepts/co_8850856185b856b85dfe8f8eb1cb0181"},{"public_id":"co_f7f7a3f85ea996149c61e277b1d207b3","status":"active","name":"optimal operating point","description":"The theoretical best operating point achievable with coordinated controllers and perfect future knowledge.","types":["benchmark"],"aliases":[],"contributors":[{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["extraction"],"url":"https://sah.borca.ai/u/ezd9qvkvax"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"url":"https://sah.borca.ai/concepts/co_f7f7a3f85ea996149c61e277b1d207b3"}],"external_ids":{"DOI":"10.1109/TNET.2007.900405","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":2117363591,"DBLP":"journals/ton/NeelyML08","ACL":null},"open_access":{"is_open_access":true,"pdf_url":"http://www-bcf.usc.edu/~mjneely/pdf_papers/fairness-ton.pdf","landing_url":"https://www.semanticscholar.org/paper/69aaa5cc0f1906afd67174f7044b69631d689e9d","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":null,"status":"GREEN","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":631261,"paper_uid":"884e8f45-c462-482b-8332-9bcec42fbc8c","canonical_identity":{"paper_id":631261,"paper_uid":"884e8f45-c462-482b-8332-9bcec42fbc8c","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/380758"}