The Choice of Parameters in Arc Length Algorithm

Author

Nie, Xiao-wen ; Lu, Xian-Liang ; Xu, Hai-mei ; Peng, Yong-Xiang

Author_Institution

Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu

fYear

2008

fDate

13-15 Dec. 2008

Firstpage

85

Lastpage

88

Abstract

To improve the efficiency of the arc length (AL) algorithm, the paper presents a quantitative method to choose the parameters of AL. The paper analyzes the condition to guarantee the correctness of AL, and gives the approaches to set the parameters. Moreover, the latency of AL under the new method is discussed in detail. The analysis and simulation shows that the latency of AL with the parameters chosen under the new method remains constant, while is not increasing as the size of network grows.

Keywords

computational complexity; distributed algorithms; random processes; sampling methods; AL latency; algorithm complexity; arc length algorithm; arc length parameters; distributed hash table; random sampling; Algorithm design and analysis; Analytical models; Computer science; Delay; Indexing; Paper technology; Peer to peer computing; Probability density function; Robustness; Sampling methods; Distributed hash table (DHT); algorithm complexity; random sampling;

fLanguage

English

Publisher

ieee

Conference_Titel

Apperceiving Computing and Intelligence Analysis, 2008. ICACIA 2008. International Conference on

Conference_Location

Chengdu

Print_ISBN

978-1-4244-3427-5

Electronic_ISBN

978-1-4244-3426-8

Type

conf

DOI

10.1109/ICACIA.2008.4769977

Filename

4769977