最佳网络呼叫承载能力

R. Franks, R. Rishel
{"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}
引用次数: 11

摘要

考虑一个具有交换和中继拥塞的电话网络。用网络中各类服务的平均呼叫数和平均呼叫流率来表示优化问题。该优化问题给出的最大平均通话呼叫数是理论上最优网络管理下网络所能承载的平均通话呼叫数的上界。给出的例子表明,上界接近于实际可以得到的值。问题的优化是通过以下控制实现的:(i)限制从终端办公室进入网络的呼叫数量;(ii)将剩余呼叫的适当部分路由到各种可能的路由上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimum network call-carrying capacity
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信