{"title":"动态信道分配的高效分布式算法","authors":"M. Choy, Ambuj K. Singh","doi":"10.1109/PIMRC.1996.567547","DOIUrl":null,"url":null,"abstract":"The efficiency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are verified by extensive simulations.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Efficient distributed algorithms for dynamic channel assignment\",\"authors\":\"M. Choy, Ambuj K. Singh\",\"doi\":\"10.1109/PIMRC.1996.567547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The efficiency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are verified by extensive simulations.\",\"PeriodicalId\":206655,\"journal\":{\"name\":\"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.1996.567547\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.1996.567547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient distributed algorithms for dynamic channel assignment
The efficiency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are verified by extensive simulations.