{"title":"未来pc机的服务调度和CAC保障","authors":"J. X. Qiu, J. Mark","doi":"10.1109/GLOCOM.1998.775897","DOIUrl":null,"url":null,"abstract":"A distributed polling and channel reservation scheduling algorithm and a call admission control (CAC) algorithm, which make uses of the scheduling algorithm, for intra-cell resource allocation, and a novel virtual cluster allocation with scheduled retry (VCA/SR) algorithm for inter-cell resource reservation are proposed. The interworking of the algorithms ensures optimal channel utilization and reduces forced connection dropping probability for multimedia applications in a wireless communication environment. The major strength of combining service scheduling and CAC to form a complete system is to guarantee a predefined quality of service to all classes of traffic without making conflicting assumptions about each other.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"168 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Service scheduling and CAC for QoS guarantee in future PCS\",\"authors\":\"J. X. Qiu, J. Mark\",\"doi\":\"10.1109/GLOCOM.1998.775897\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A distributed polling and channel reservation scheduling algorithm and a call admission control (CAC) algorithm, which make uses of the scheduling algorithm, for intra-cell resource allocation, and a novel virtual cluster allocation with scheduled retry (VCA/SR) algorithm for inter-cell resource reservation are proposed. The interworking of the algorithms ensures optimal channel utilization and reduces forced connection dropping probability for multimedia applications in a wireless communication environment. The major strength of combining service scheduling and CAC to form a complete system is to guarantee a predefined quality of service to all classes of traffic without making conflicting assumptions about each other.\",\"PeriodicalId\":414137,\"journal\":{\"name\":\"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)\",\"volume\":\"168 5\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.1998.775897\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.1998.775897","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Service scheduling and CAC for QoS guarantee in future PCS
A distributed polling and channel reservation scheduling algorithm and a call admission control (CAC) algorithm, which make uses of the scheduling algorithm, for intra-cell resource allocation, and a novel virtual cluster allocation with scheduled retry (VCA/SR) algorithm for inter-cell resource reservation are proposed. The interworking of the algorithms ensures optimal channel utilization and reduces forced connection dropping probability for multimedia applications in a wireless communication environment. The major strength of combining service scheduling and CAC to form a complete system is to guarantee a predefined quality of service to all classes of traffic without making conflicting assumptions about each other.