一种支持负载分割选路算法的网络链路集维数计算方法

Jonathan L. Wang
{"title":"一种支持负载分割选路算法的网络链路集维数计算方法","authors":"Jonathan L. Wang","doi":"10.1109/INFCOM.1993.253390","DOIUrl":null,"url":null,"abstract":"The load splitting link selection algorithm used in the Common Channel Signaling (CCS) network and proposed for use in the interswitching system interface in the network supporting the Switched Multimegabit Data Service (SMDS) is considered. The algorithm uses a randomly generated bit pattern to select a link for transmission. The author discusses how the traffic loads are distributed among the links in a link set based on the load splitting link selection algorithm and shows that, in some cases, the overall traffic capacity of the link set does not increase even when the number of installed links increases. A theorem that shows how to construct the set of links to increase the line set capacity is demonstrated. The theorem is used as the basis for an efficient and flexible procedure for implementing the link dimensioning algorithm in software, to support the mechanization of the CCS and SMDS network planning and traffic engineering functions.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel link set dimensioning procedure for networks supporting the load splitting link selection algorithm\",\"authors\":\"Jonathan L. Wang\",\"doi\":\"10.1109/INFCOM.1993.253390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The load splitting link selection algorithm used in the Common Channel Signaling (CCS) network and proposed for use in the interswitching system interface in the network supporting the Switched Multimegabit Data Service (SMDS) is considered. The algorithm uses a randomly generated bit pattern to select a link for transmission. The author discusses how the traffic loads are distributed among the links in a link set based on the load splitting link selection algorithm and shows that, in some cases, the overall traffic capacity of the link set does not increase even when the number of installed links increases. A theorem that shows how to construct the set of links to increase the line set capacity is demonstrated. The theorem is used as the basis for an efficient and flexible procedure for implementing the link dimensioning algorithm in software, to support the mechanization of the CCS and SMDS network planning and traffic engineering functions.<<ETX>>\",\"PeriodicalId\":166966,\"journal\":{\"name\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.253390\",\"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.253390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

考虑了通用信道信令(CCS)网络中用于支持交换多兆数据服务(SMDS)网络的交换系统接口的负载分路选路算法。该算法使用随机生成的位模式来选择传输链路。本文讨论了基于负载分割选路算法的链路集中的流量负载是如何分配的,并指出在某些情况下,即使安装的链路数量增加,链路集中的总流量容量也不会增加。给出了一个构造链路集以增加线路集容量的定理。该定理为在软件中高效灵活地实现链路量纲算法提供了基础,以支持CCS和SMDS网络规划和交通工程功能的机械化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A novel link set dimensioning procedure for networks supporting the load splitting link selection algorithm
The load splitting link selection algorithm used in the Common Channel Signaling (CCS) network and proposed for use in the interswitching system interface in the network supporting the Switched Multimegabit Data Service (SMDS) is considered. The algorithm uses a randomly generated bit pattern to select a link for transmission. The author discusses how the traffic loads are distributed among the links in a link set based on the load splitting link selection algorithm and shows that, in some cases, the overall traffic capacity of the link set does not increase even when the number of installed links increases. A theorem that shows how to construct the set of links to increase the line set capacity is demonstrated. The theorem is used as the basis for an efficient and flexible procedure for implementing the link dimensioning algorithm in software, to support the mechanization of the CCS and SMDS network planning and traffic engineering functions.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Translation of QoS parameters into ATM performance parameters in B-ISDN Traffic control scheme for interconnection of FDDI networks through ATM network An approximate analysis of broadcasting in multichannel metropolitan area networks Blocking evaluation for networks with reward maximization routing Characterization of a CBR connection over a channel with known bounded delay variation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1