{"title":"具有优先级的准入控制:多速率无线系统的方法","authors":"D. Ayyagari, A. Ephremides","doi":"10.1109/ICUPC.1998.732843","DOIUrl":null,"url":null,"abstract":"Priority based link-bandwidth partitioning is required to support wireless multimedia services. Having diverse QoS (delay, throughput) requirements. A new class of service disciplines, termed \"batch and prioritize\" or BP admission control (AC), is proposed. The BP algorithms use the delay tolerance of applications to batch requests in time slots. Bandwidth assignment is made either at the end of the slot, or during the slot, on a priority basis. Analytical and simulation models are developed to quantify the performance of the BP schemes. The results are compared with those obtained for a first-come-first-served (FCFS) service discipline. In a system with applications requiring multiple transmission rates, the class of BP schemes trade-off the delay and loss tolerance of applications to improve the net carried traffic on the link. Further, such schemes enable an easy implementation for adaptive prioritization, where the degree of precedence given to an application varies with offered load and the link capacity.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"42 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Admission control with priorities: approaches for multi-rate wireless systems\",\"authors\":\"D. Ayyagari, A. Ephremides\",\"doi\":\"10.1109/ICUPC.1998.732843\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Priority based link-bandwidth partitioning is required to support wireless multimedia services. Having diverse QoS (delay, throughput) requirements. A new class of service disciplines, termed \\\"batch and prioritize\\\" or BP admission control (AC), is proposed. The BP algorithms use the delay tolerance of applications to batch requests in time slots. Bandwidth assignment is made either at the end of the slot, or during the slot, on a priority basis. Analytical and simulation models are developed to quantify the performance of the BP schemes. The results are compared with those obtained for a first-come-first-served (FCFS) service discipline. In a system with applications requiring multiple transmission rates, the class of BP schemes trade-off the delay and loss tolerance of applications to improve the net carried traffic on the link. Further, such schemes enable an easy implementation for adaptive prioritization, where the degree of precedence given to an application varies with offered load and the link capacity.\",\"PeriodicalId\":341069,\"journal\":{\"name\":\"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)\",\"volume\":\"42 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-10-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICUPC.1998.732843\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUPC.1998.732843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Admission control with priorities: approaches for multi-rate wireless systems
Priority based link-bandwidth partitioning is required to support wireless multimedia services. Having diverse QoS (delay, throughput) requirements. A new class of service disciplines, termed "batch and prioritize" or BP admission control (AC), is proposed. The BP algorithms use the delay tolerance of applications to batch requests in time slots. Bandwidth assignment is made either at the end of the slot, or during the slot, on a priority basis. Analytical and simulation models are developed to quantify the performance of the BP schemes. The results are compared with those obtained for a first-come-first-served (FCFS) service discipline. In a system with applications requiring multiple transmission rates, the class of BP schemes trade-off the delay and loss tolerance of applications to improve the net carried traffic on the link. Further, such schemes enable an easy implementation for adaptive prioritization, where the degree of precedence given to an application varies with offered load and the link capacity.