中国物理B ›› 2004, Vol. 13 ›› Issue (4): 423-427.doi: 10.1088/1009-1963/13/4/001

• GENERAL •    下一篇

Mirror nodes in growing random networks

戴硕, 郭云均   

  1. Department of Physics, Nanjing University, Nanjing 210093, China
  • 收稿日期:2003-07-16 修回日期:2003-09-09 出版日期:2005-04-22 发布日期:2004-04-20

Mirror nodes in growing random networks

Dai Shuo (戴硕), Guo Yun-Jun (郭云均)   

  1. Department of Physics, Nanjing University, Nanjing 210093, China
  • Received:2003-07-16 Revised:2003-09-09 Online:2005-04-22 Published:2004-04-20

PDF (PC)

490

赞

摘要： In this article, we consider mirror nodes, which are widely used to reduce local burden, and present two models that are practical for the Internet and probably some other networks. One model introduces an upper limit to the number of links that a node can have, beyond which the node will share the total links with a newly introduced one. Similarly, in the second model, if the number of links exceeds a limit, a new node will be introduced. Unlike the first model, the new node shares with the old one the chance of receiving new links but not the existing links. These models are analytically treated, and from the degree distribution, we can see that the number of nodes with medium links (half the upper limit) increases at the expense of the loss of highly connected nodes. By reducing the burden, this may improve the robustness of the networks.

Abstract: In this article, we consider mirror nodes, which are widely used to reduce local burden, and present two models that are practical for the Internet and probably some other networks. One model introduces an upper limit to the number of links that a node can have, beyond which the node will share the total links with a newly introduced one. Similarly, in the second model, if the number of links exceeds a limit, a new node will be introduced. Unlike the first model, the new node shares with the old one the chance of receiving new links but not the existing links. These models are analytically treated, and from the degree distribution, we can see that the number of nodes with medium links (half the upper limit) increases at the expense of the loss of highly connected nodes. By reducing the burden, this may improve the robustness of the networks.

Key words: Internet, complex network systems, statistical mechanics

中图分类号:  (World Wide Web, Internet)

  • 89.20.Hh
89.75.Hc (Networks and genealogical trees)