{"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}
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.