Uniformity of Direct Unions of Chord  

作　　者：Rafa Kapelko Karol Marchwicki 

机构地区：[1]Department of Computer Science, Faculty of Fundamental Problems of Technology, Wrocaw University of Technology

出　　处：《Acta Mathematicae Applicatae Sinica》2015年第1期225-234,共10页应用数学学报（英文版）

基　　金：Supported by grant nr 2013/S30028 of the Institute of Mathematics and Computers Science of the Wrocaw University of Technology,Poland

摘　　要：In this article we investigate the uniformity of direct union of k copies of Chord which is an improvedversion of Chord P2P system. We are interested in the maximal and the minimal areas controlled by nodes inthe system. We recall that the function n→k/k!.n-（1＋1/k）is a lower threshold and that the function n→1/n In（nlnk-k（n（k-1）1）/（k-1）1is an upper threshold for sizes of areas controlled by nodes in the direct union of kcopies of Chord.In this article we investigate the uniformity of direct union of k copies of Chord which is an improvedversion of Chord P2P system. We are interested in the maximal and the minimal areas controlled by nodes inthe system. We recall that the function n→k/k!.n-（1＋1/k）is a lower threshold and that the function n→1/n In（nlnk-k（n（k-1）1）/（k-1）1is an upper threshold for sizes of areas controlled by nodes in the direct union of kcopies of Chord.

关 键 词：peer-to-peer network modification of chord THRESHOLD ASYMPTOTIC order statistic 

分 类 号：O157.5[理学—数学]