Packet transport along the shortest pathways in scale-free networks
Packet transport along the shortest pathways in scale-free networks
复制标题
DOI：
10.1140/epjb/e2004-00113-2
复制
发表时间：
2004-03
期刊：
影响因子：
--
通讯作者：
C. Ghim;Eunsoon Oh;Kwang-Il Goh;B. Kahng;D. Kim
中科院分区：
文献类型：
--
作者：
C. Ghim;Eunsoon Oh;Kwang-Il Goh;B. Kahng;D. Kim
研究无标度网络中无环或有少量环的一对顶点之间的数据包传输问题。通过将一个顶点的负载作为每对顶点之间沿最短路径传输的数据包的一小部分的累积和，发现负载分布遵循指数幂律。对于Barabási-Albert-type模型，随着循环次数的增加，指数从树形结构突然变化。荷载指数似乎对不同的度指数值不敏感，只要。
We investigate a problem of data packet transport between a pair of vertices on scale-free networks without loops or with a small number of loops. By introducing load of a vertex as accumulated sum of a fraction of data packets traveling along the shortest pathways between every pair of vertices, it is found that the load distribution follows a power law with an exponent. It is found for the Barabási-Albert-type model that the exponentchanges abruptly fromfor tree structure toas the number of loops increases. The load exponent seems to be insensitive to different values of the degree exponentas long as.