{"title":"异构突发业务ATM网络的实时呼叫接纳控制","authors":"Tsern-Huei Lee, K. Lai, Shii-Tyng Duann","doi":"10.1109/ICC.1994.369018","DOIUrl":null,"url":null,"abstract":"We propose a real time computation algorithm based on the bufferless fluid flow model for call admission control in ATM networks with heterogeneous bursty traffic. Cell loss probability is adopted as the measure of quality of service. Our proposed computation algorithm requires a constant memory size and needs only two multiplications and one division to decide whether a connection request can be accepted or not. It is known that the individual cell loss probability for each type of traffic source may not meet the requirement even though the global one does. We provide a tight upper bound for individual cell loss probability which can be evaluated easily by our proposed computation algorithm. Numerical examples using typical traffic parameters are studied.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Real time call admission control for ATM networks with heterogeneous bursty traffic\",\"authors\":\"Tsern-Huei Lee, K. Lai, Shii-Tyng Duann\",\"doi\":\"10.1109/ICC.1994.369018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a real time computation algorithm based on the bufferless fluid flow model for call admission control in ATM networks with heterogeneous bursty traffic. Cell loss probability is adopted as the measure of quality of service. Our proposed computation algorithm requires a constant memory size and needs only two multiplications and one division to decide whether a connection request can be accepted or not. It is known that the individual cell loss probability for each type of traffic source may not meet the requirement even though the global one does. We provide a tight upper bound for individual cell loss probability which can be evaluated easily by our proposed computation algorithm. Numerical examples using typical traffic parameters are studied.<<ETX>>\",\"PeriodicalId\":112111,\"journal\":{\"name\":\"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1994.369018\",\"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 ICC/SUPERCOMM'94 - 1994 International Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1994.369018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Real time call admission control for ATM networks with heterogeneous bursty traffic
We propose a real time computation algorithm based on the bufferless fluid flow model for call admission control in ATM networks with heterogeneous bursty traffic. Cell loss probability is adopted as the measure of quality of service. Our proposed computation algorithm requires a constant memory size and needs only two multiplications and one division to decide whether a connection request can be accepted or not. It is known that the individual cell loss probability for each type of traffic source may not meet the requirement even though the global one does. We provide a tight upper bound for individual cell loss probability which can be evaluated easily by our proposed computation algorithm. Numerical examples using typical traffic parameters are studied.<>