{"title":"通信网络中性能界限的计算","authors":"Opher Yaron, M. Sidi","doi":"10.1109/INFCOM.1993.253320","DOIUrl":null,"url":null,"abstract":"A way to calculate the performance of packet switching communication networks under a fixed (session-based) routing strategy, based on properly bounding the probability distribution functions of the system input processes, is proposed. The bounds suggested, which are decaying exponentials, posses three convenient properties. When the inputs to an isolated network element are all bounded, they result in bounded outputs and ensure that the delays and queues in this element have exponentially decaying distribution. In some network settings, the bounded inputs result in bounded outputs. Finally, natural traffic processes can be shown to satisfy such bounds. These properties enable the calculation of upper bounds for all the interesting parameters of network performance, in a variety of settings.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":"{\"title\":\"Calculating performance bounds in communication networks\",\"authors\":\"Opher Yaron, M. Sidi\",\"doi\":\"10.1109/INFCOM.1993.253320\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A way to calculate the performance of packet switching communication networks under a fixed (session-based) routing strategy, based on properly bounding the probability distribution functions of the system input processes, is proposed. The bounds suggested, which are decaying exponentials, posses three convenient properties. When the inputs to an isolated network element are all bounded, they result in bounded outputs and ensure that the delays and queues in this element have exponentially decaying distribution. In some network settings, the bounded inputs result in bounded outputs. Finally, natural traffic processes can be shown to satisfy such bounds. These properties enable the calculation of upper bounds for all the interesting parameters of network performance, in a variety of settings.<<ETX>>\",\"PeriodicalId\":166966,\"journal\":{\"name\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"39\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1993.253320\",\"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 INFOCOM '93 The Conference on Computer Communications, Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1993.253320","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Calculating performance bounds in communication networks
A way to calculate the performance of packet switching communication networks under a fixed (session-based) routing strategy, based on properly bounding the probability distribution functions of the system input processes, is proposed. The bounds suggested, which are decaying exponentials, posses three convenient properties. When the inputs to an isolated network element are all bounded, they result in bounded outputs and ensure that the delays and queues in this element have exponentially decaying distribution. In some network settings, the bounded inputs result in bounded outputs. Finally, natural traffic processes can be shown to satisfy such bounds. These properties enable the calculation of upper bounds for all the interesting parameters of network performance, in a variety of settings.<>