{"title":"最佳网络呼叫承载能力","authors":"R. Franks, R. Rishel","doi":"10.1002/J.1538-7305.1973.TB02013.X","DOIUrl":null,"url":null,"abstract":"A telephone network with switching and trunk congestion is considered. An optimization problem expressed in terms of mean numbers of calls and mean rates of flow of calls in various categories of service throughout the network is formulated. The maximum mean number of talking calls given by this optimization problem is an upper bound on the mean number of talking calls which could be carried by the network using theoretically optimum network management. Examples are given suggesting that the upper bound is close to values which actually can be attained. The optimum of the problem is achieved by controls which (i) restrict the number of calls coming into the network from the end offices and (ii) route appropriate fractions of the remaining calls over the various possible routes.","PeriodicalId":55391,"journal":{"name":"Bell System Technical Journal","volume":"71 1","pages":"1195-1214"},"PeriodicalIF":0.0000,"publicationDate":"1973-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Optimum network call-carrying capacity\",\"authors\":\"R. Franks, R. Rishel\",\"doi\":\"10.1002/J.1538-7305.1973.TB02013.X\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A telephone network with switching and trunk congestion is considered. An optimization problem expressed in terms of mean numbers of calls and mean rates of flow of calls in various categories of service throughout the network is formulated. The maximum mean number of talking calls given by this optimization problem is an upper bound on the mean number of talking calls which could be carried by the network using theoretically optimum network management. Examples are given suggesting that the upper bound is close to values which actually can be attained. The optimum of the problem is achieved by controls which (i) restrict the number of calls coming into the network from the end offices and (ii) route appropriate fractions of the remaining calls over the various possible routes.\",\"PeriodicalId\":55391,\"journal\":{\"name\":\"Bell System Technical Journal\",\"volume\":\"71 1\",\"pages\":\"1195-1214\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1973-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bell System Technical Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/J.1538-7305.1973.TB02013.X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bell System Technical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/J.1538-7305.1973.TB02013.X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A telephone network with switching and trunk congestion is considered. An optimization problem expressed in terms of mean numbers of calls and mean rates of flow of calls in various categories of service throughout the network is formulated. The maximum mean number of talking calls given by this optimization problem is an upper bound on the mean number of talking calls which could be carried by the network using theoretically optimum network management. Examples are given suggesting that the upper bound is close to values which actually can be attained. The optimum of the problem is achieved by controls which (i) restrict the number of calls coming into the network from the end offices and (ii) route appropriate fractions of the remaining calls over the various possible routes.