{"title":"多级分组交换互联ATM交换机性能分析","authors":"A. Tentov, A. Grnarov","doi":"10.1109/LCN.1996.558136","DOIUrl":null,"url":null,"abstract":"A mathematical method for analysis of ATM switches based on multistage packet switching interconnection networks with finite buffering capacity at the output of switching elements is presented. The proposed mathematical method is general in that it analyzed ATM switches under uniform and nonuniform traffic with blocking. The existing methods for analysis of ATM switches with buffered interconnection networks, have assumed either single or infinite buffers at each input (or output) port of a switch, as well as uniform traffic pattern of the networks. Firstly in the paper a general model of a synchronous buffered switching element, using output buffering, under the assumption of finite buffer size for a very general class of traffic patterns, is presented. It is assumed that the subsequent stages of the network are nearly independent and a model is extended for an entire network under this assumption. Analytical results obtained with the proposed model are then compared with each other and it is shown that the proposed mathematical method is more general than the known models.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Performance analysis of ATM switches with multistage packet switching interconnection networks\",\"authors\":\"A. Tentov, A. Grnarov\",\"doi\":\"10.1109/LCN.1996.558136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A mathematical method for analysis of ATM switches based on multistage packet switching interconnection networks with finite buffering capacity at the output of switching elements is presented. The proposed mathematical method is general in that it analyzed ATM switches under uniform and nonuniform traffic with blocking. The existing methods for analysis of ATM switches with buffered interconnection networks, have assumed either single or infinite buffers at each input (or output) port of a switch, as well as uniform traffic pattern of the networks. Firstly in the paper a general model of a synchronous buffered switching element, using output buffering, under the assumption of finite buffer size for a very general class of traffic patterns, is presented. It is assumed that the subsequent stages of the network are nearly independent and a model is extended for an entire network under this assumption. Analytical results obtained with the proposed model are then compared with each other and it is shown that the proposed mathematical method is more general than the known models.\",\"PeriodicalId\":420811,\"journal\":{\"name\":\"Proceedings of LCN - 21st Annual Conference on Local Computer Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of LCN - 21st Annual Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1996.558136\",\"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 LCN - 21st Annual Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1996.558136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance analysis of ATM switches with multistage packet switching interconnection networks
A mathematical method for analysis of ATM switches based on multistage packet switching interconnection networks with finite buffering capacity at the output of switching elements is presented. The proposed mathematical method is general in that it analyzed ATM switches under uniform and nonuniform traffic with blocking. The existing methods for analysis of ATM switches with buffered interconnection networks, have assumed either single or infinite buffers at each input (or output) port of a switch, as well as uniform traffic pattern of the networks. Firstly in the paper a general model of a synchronous buffered switching element, using output buffering, under the assumption of finite buffer size for a very general class of traffic patterns, is presented. It is assumed that the subsequent stages of the network are nearly independent and a model is extended for an entire network under this assumption. Analytical results obtained with the proposed model are then compared with each other and it is shown that the proposed mathematical method is more general than the known models.