{"title":"ATM网络中的准入控制仿真","authors":"T. Yuk, K. Tse, M. H. Leung, B. Kamali","doi":"10.1109/ICC.1992.268190","DOIUrl":null,"url":null,"abstract":"The call admission decision in asynchronous transfer mode (ATM) networks requires decisions to be made in real time using simple and fast algorithms. A measurement-based call admission control approach is proposed. It is based on measurements of the network loading over a period that is long enough to reflect multiplexed traffic behavior. A heuristic call admission rule based on periodic measurement of line utilization is formulated. The admission rule can keep the cell loss ratio below certain level for a given set of control parameters. The cell loss ratio depends on the sample period of network loading measurement. The performance of the admission rule was evaluated by simulation and the results are presented.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Simulation of admission control in ATM network\",\"authors\":\"T. Yuk, K. Tse, M. H. Leung, B. Kamali\",\"doi\":\"10.1109/ICC.1992.268190\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The call admission decision in asynchronous transfer mode (ATM) networks requires decisions to be made in real time using simple and fast algorithms. A measurement-based call admission control approach is proposed. It is based on measurements of the network loading over a period that is long enough to reflect multiplexed traffic behavior. A heuristic call admission rule based on periodic measurement of line utilization is formulated. The admission rule can keep the cell loss ratio below certain level for a given set of control parameters. The cell loss ratio depends on the sample period of network loading measurement. The performance of the admission rule was evaluated by simulation and the results are presented.<<ETX>>\",\"PeriodicalId\":170618,\"journal\":{\"name\":\"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1992.268190\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1992.268190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The call admission decision in asynchronous transfer mode (ATM) networks requires decisions to be made in real time using simple and fast algorithms. A measurement-based call admission control approach is proposed. It is based on measurements of the network loading over a period that is long enough to reflect multiplexed traffic behavior. A heuristic call admission rule based on periodic measurement of line utilization is formulated. The admission rule can keep the cell loss ratio below certain level for a given set of control parameters. The cell loss ratio depends on the sample period of network loading measurement. The performance of the admission rule was evaluated by simulation and the results are presented.<>