Search this article in Google Scholar


分類 国際会議
著者名 (author) Akira Ohtsubo,Daisuke Takemoto,Shigeaki Tagashira,Satoshi Fujita
英文著者名 (author)
編者名 (editor)
編者名 (英文)
キー (key)
表題 (title) The Power of Shortcuts in Greedy Routing in Content Addressable Networks
表題 (英文)
書籍・会議録表題 (booktitle) Embedded and Ubiquitous Computing, International Conference EUC 2004, LNCS
書籍・会議録表題(英文)
巻数 (volume) 3207
号数 (number)
ページ範囲 (pages) 994-1003
組織名 (organization)
出版元 (publisher)
出版元 (英文)
出版社住所 (address)
刊行月 (month) August
出版年 (year) 2004
付加情報 (note) Aizu-Wakamatsu
注釈 (annote) Acceptance rate: 104/260 = 40%, http://www.springerlink.com/content/e7gp88tgwnk0gyj7/
内容梗概 (abstract) In this paper, we propose a scheme to dynamically establish shortcut links in Content Addressable Networks (CAN), based on a probabilistic method suggested by Kleinberg in 2000. The proposed scheme consists of the following three steps: 1) estimation of the total number of nodes participating to the P2P system, 2) dynamic adjustment of the probability distribution for selecting the target point of shortcut based on the estimated number, and 3) the establishment of shortcut to the nodes corresponding to the selected points. The performance of the resulting scheme is evaluated by simulation. The result of simulations implies that the shortcut significantly reduces the average number of hop counts, and the rate of improvement increases as increasing the number of nodes; e.g., the proposed method improves the hop counts in conventional CAN by 49% when it contains 4096 nodes. In addition, dynamic adjustment of the probability distribution improves the performance of the overall scheme, although the amount of improvement is less than “one hop” for relatively small netwotks examined in the simulation.
論文電子ファイル Not available.


[1-53]  Akira Ohtsubo, Daisuke Takemoto, Shigeaki Tagashira, and Satoshi Fujita, ``The Power of Shortcuts in Greedy Routing in Content Addressable Networks,'' In Embedded and Ubiquitous Computing, International Conference EUC 2004, LNCS, vol. 3207, pp. 994-1003, August 2004. (Aizu-Wakamatsu)

@inproceedings{1_53,
    author = {Akira Ohtsubo and Daisuke Takemoto and Shigeaki Tagashira and
    Satoshi Fujita},
    author_e = {},
    editor = {},
    editor_e = {},
    title = {The Power of Shortcuts in Greedy Routing in Content Addressable
    Networks},
    title_e = {},
    booktitle = {Embedded and Ubiquitous Computing, International Conference EUC
    2004, LNCS},
    booktitle_e = {},
    volume = {3207},
    number = {},
    pages = {994-1003},
    organization = {},
    publisher = {},
    publisher_e = {},
    address = {},
    month = {August},
    year = {2004},
    note = {Aizu-Wakamatsu},
    annote = {Acceptance rate: 104/260 = 40%, http://www.springerlink.com/
    content/e7gp88tgwnk0gyj7/}
}

This site is maintained by Distributed System Laboratory.

PMAN 2.5.5 - Paper MANagement system / (C) 2002-2008, Osamu Mizuno / All rights reserved.