通信网络分析与设计中节点使用概率的概念

Jiajing Wu, C. Tse, F. Lau, I. W. Ho
{"title":"通信网络分析与设计中节点使用概率的概念","authors":"Jiajing Wu, C. Tse, F. Lau, I. W. Ho","doi":"10.1109/IWCFTA.2012.43","DOIUrl":null,"url":null,"abstract":"In this paper we study the performance of communication networks from a network science perspective. We study the traffic performance of scale-free network under shortest path and minimum degree routing. We introduce the node usage probability, which depends on both the network topology and routing algorithm, to characterize the traffic load distribution and show that resource allocation based on the node usage probability outperforms the uniform and degree-based allocation scheme.","PeriodicalId":354870,"journal":{"name":"2012 Fifth International Workshop on Chaos-fractals Theories and Applications","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Concept of Node Usage Probability for Analysis and Design of Communication Networks\",\"authors\":\"Jiajing Wu, C. Tse, F. Lau, I. W. Ho\",\"doi\":\"10.1109/IWCFTA.2012.43\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we study the performance of communication networks from a network science perspective. We study the traffic performance of scale-free network under shortest path and minimum degree routing. We introduce the node usage probability, which depends on both the network topology and routing algorithm, to characterize the traffic load distribution and show that resource allocation based on the node usage probability outperforms the uniform and degree-based allocation scheme.\",\"PeriodicalId\":354870,\"journal\":{\"name\":\"2012 Fifth International Workshop on Chaos-fractals Theories and Applications\",\"volume\":\"130 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fifth International Workshop on Chaos-fractals Theories and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWCFTA.2012.43\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fifth International Workshop on Chaos-fractals Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCFTA.2012.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文从网络科学的角度研究通信网络的性能。研究了最短路径和最小度路由下无标度网络的流量性能。我们引入了依赖于网络拓扑结构和路由算法的节点使用概率来表征流量负载分布,并表明基于节点使用概率的资源分配优于均匀和基于程度的分配方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Concept of Node Usage Probability for Analysis and Design of Communication Networks
In this paper we study the performance of communication networks from a network science perspective. We study the traffic performance of scale-free network under shortest path and minimum degree routing. We introduce the node usage probability, which depends on both the network topology and routing algorithm, to characterize the traffic load distribution and show that resource allocation based on the node usage probability outperforms the uniform and degree-based allocation scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信