%0 Journal Article
%T Mirror nodes in growing random networks
%A Dai Shuo
%A Guo Yun-Jun
%A <br>戴硕
%A 郭云均
%J 中国物理 B
%D 2004
%I 
%X 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.
%K Internet
%K complex network systems
%K statistical mechanics<br>镜像点
%K 互联网
%K 复合网络系统
%K 统计力学
%K 数字连接
%K 随机成长网络模型
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=47EA7CFDDEBB28E0&jid=CD8D6A6897B9334F09D8D1648C376FB4&aid=9108B3DA9BA5395A46DB99160B54E2A7&yid=D0E58B75BFD8E51C&vid=FC0714F8D2EB605D&iid=E158A972A605785F&sid=F27A401E323B6FAD&eid=CB3428B1EFB1C133&journal_id=1009-1963&journal_name=中国物理&referenced_num=1&reference_num=10