有线和无线电通信网络中的载荷和空间定位

B. Abernathy, T. G. Robertazzi
{"title":"有线和无线电通信网络中的载荷和空间定位","authors":"B. Abernathy, T. G. Robertazzi","doi":"10.1109/MILCOM.1991.258281","DOIUrl":null,"url":null,"abstract":"Two algorithms and related performance measures for calculating traffic intensity as a function of spatial location are presented. The first measure of traffic loading is the product of the number of links per area, the average link distance, and the average load per link in a given area. This measure gives a sense of the joint amount of traffic load and cabling for wire networks. The second measure is simply the product of the number of links per area and the average load per link in a given area. This measure gives a sense of traffic load only for wire and radio networks. An example of the algorithms' use for a circular network operating under a shortest path routing is included.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Loading and spatial location in wire and radio communications networks\",\"authors\":\"B. Abernathy, T. G. Robertazzi\",\"doi\":\"10.1109/MILCOM.1991.258281\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two algorithms and related performance measures for calculating traffic intensity as a function of spatial location are presented. The first measure of traffic loading is the product of the number of links per area, the average link distance, and the average load per link in a given area. This measure gives a sense of the joint amount of traffic load and cabling for wire networks. The second measure is simply the product of the number of links per area and the average load per link in a given area. This measure gives a sense of traffic load only for wire and radio networks. An example of the algorithms' use for a circular network operating under a shortest path routing is included.<<ETX>>\",\"PeriodicalId\":212388,\"journal\":{\"name\":\"MILCOM 91 - Conference record\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MILCOM 91 - Conference record\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.1991.258281\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 91 - Conference record","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1991.258281","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了两种计算交通强度作为空间位置函数的算法和相关性能度量。流量负载的第一个度量是每个区域的链接数、平均链接距离和给定区域中每个链接的平均负载的乘积。该措施提供了有线网络的流量负载和布线的联合量的感觉。第二个指标是每个区域的链接数与给定区域中每个链接的平均负载的乘积。这一措施只对有线和无线网络提供流量负载感。文中还包括了在最短路径路由下运行的圆形网络中使用这些算法的一个例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Loading and spatial location in wire and radio communications networks
Two algorithms and related performance measures for calculating traffic intensity as a function of spatial location are presented. The first measure of traffic loading is the product of the number of links per area, the average link distance, and the average load per link in a given area. This measure gives a sense of the joint amount of traffic load and cabling for wire networks. The second measure is simply the product of the number of links per area and the average load per link in a given area. This measure gives a sense of traffic load only for wire and radio networks. An example of the algorithms' use for a circular network operating under a shortest path routing is included.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A methodology for employing modulation quality factors in the analysis of LPI waveforms FDDI-a high speed data highway for warship system integration Personal and thin-route communications via K-band satellite transponders Fairness issues for mixed TCP/OSI internets Communications to support distributed command and control systems
×
引用
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