AB-chord: An efficient approach for resource location in structured P2P networks

Yufeng Wang, Qun Jin, Xiangming Li, Jianhua Ma

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    8 Citations (Scopus)

    Abstract

    Recently, P2P (Peer-to-Peer) technology has witnessed a rapid development. Basically, one of key components in successful P2P applications is how to efficiently look up resources. Considering that structured P2P is a relatively efficient way to locate resources, this paper conducted two improvements to increase the search efficiency in Chord-based algorithms, one of the most popular structured P2P resource lookup protocols. In detail, our contributions are twofold. First, considering the fact that routing information in Chord is not abundant enough for efficient resource search, and looking up resource can only be enforced in clockwise direction, a new algorithm called AB-Chord is proposed to reconstruct the finger tables in Chord, in which counterclockwise finger table is added to achieve resource queries in both directions, and the density of neighboring fingers is increased. Additionally, AB-Chord implements a new operation to remove the redundant fingers introduced by adding fingers in AB-Chord. Experimental results show that AB-Chord's query efficiency has been improved in terms of the average lookup hops and average lookup delay. And furthermore, considering that the proposed AB-Chord algorithm enlarged the finger table which may cause the forwarding-storm of routing maintenance messages, we further propose AB-Chord+, which appropriately extends the periodic time of updating finger tables and makes the joining and leaving nodes actively send updating messages, to reduce the number of messages forwarded in the network. Simulated results show that AB-Chord+ reduced the network bandwidth consumption.

    Original languageEnglish
    Title of host publicationProceedings - IEEE 9th International Conference on Ubiquitous Intelligence and Computing and IEEE 9th International Conference on Autonomic and Trusted Computing, UIC-ATC 2012
    Pages278-284
    Number of pages7
    DOIs
    Publication statusPublished - 2012
    Event9th IEEE International Conference on Ubiquitous Intelligence and Computing, UIC 2012 and 9th IEEE International Conference on Autonomic and Trusted Computing, ATC 2012 - Fukuoka
    Duration: 2012 Sep 42012 Sep 7

    Other

    Other9th IEEE International Conference on Ubiquitous Intelligence and Computing, UIC 2012 and 9th IEEE International Conference on Autonomic and Trusted Computing, ATC 2012
    CityFukuoka
    Period12/9/412/9/7

    Fingerprint

    Joining
    Bandwidth

    Keywords

    • Chord
    • Lookup efficiency
    • Maintenance overhead
    • Structured Peer-to-Peer

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Computer Science Applications

    Cite this

    Wang, Y., Jin, Q., Li, X., & Ma, J. (2012). AB-chord: An efficient approach for resource location in structured P2P networks. In Proceedings - IEEE 9th International Conference on Ubiquitous Intelligence and Computing and IEEE 9th International Conference on Autonomic and Trusted Computing, UIC-ATC 2012 (pp. 278-284). [6332009] https://doi.org/10.1109/UIC-ATC.2012.158

    AB-chord : An efficient approach for resource location in structured P2P networks. / Wang, Yufeng; Jin, Qun; Li, Xiangming; Ma, Jianhua.

    Proceedings - IEEE 9th International Conference on Ubiquitous Intelligence and Computing and IEEE 9th International Conference on Autonomic and Trusted Computing, UIC-ATC 2012. 2012. p. 278-284 6332009.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Wang, Y, Jin, Q, Li, X & Ma, J 2012, AB-chord: An efficient approach for resource location in structured P2P networks. in Proceedings - IEEE 9th International Conference on Ubiquitous Intelligence and Computing and IEEE 9th International Conference on Autonomic and Trusted Computing, UIC-ATC 2012., 6332009, pp. 278-284, 9th IEEE International Conference on Ubiquitous Intelligence and Computing, UIC 2012 and 9th IEEE International Conference on Autonomic and Trusted Computing, ATC 2012, Fukuoka, 12/9/4. https://doi.org/10.1109/UIC-ATC.2012.158
    Wang Y, Jin Q, Li X, Ma J. AB-chord: An efficient approach for resource location in structured P2P networks. In Proceedings - IEEE 9th International Conference on Ubiquitous Intelligence and Computing and IEEE 9th International Conference on Autonomic and Trusted Computing, UIC-ATC 2012. 2012. p. 278-284. 6332009 https://doi.org/10.1109/UIC-ATC.2012.158
    Wang, Yufeng ; Jin, Qun ; Li, Xiangming ; Ma, Jianhua. / AB-chord : An efficient approach for resource location in structured P2P networks. Proceedings - IEEE 9th International Conference on Ubiquitous Intelligence and Computing and IEEE 9th International Conference on Autonomic and Trusted Computing, UIC-ATC 2012. 2012. pp. 278-284
    @inproceedings{78561fe72ba341eaaddb528e55cadb86,
    title = "AB-chord: An efficient approach for resource location in structured P2P networks",
    abstract = "Recently, P2P (Peer-to-Peer) technology has witnessed a rapid development. Basically, one of key components in successful P2P applications is how to efficiently look up resources. Considering that structured P2P is a relatively efficient way to locate resources, this paper conducted two improvements to increase the search efficiency in Chord-based algorithms, one of the most popular structured P2P resource lookup protocols. In detail, our contributions are twofold. First, considering the fact that routing information in Chord is not abundant enough for efficient resource search, and looking up resource can only be enforced in clockwise direction, a new algorithm called AB-Chord is proposed to reconstruct the finger tables in Chord, in which counterclockwise finger table is added to achieve resource queries in both directions, and the density of neighboring fingers is increased. Additionally, AB-Chord implements a new operation to remove the redundant fingers introduced by adding fingers in AB-Chord. Experimental results show that AB-Chord's query efficiency has been improved in terms of the average lookup hops and average lookup delay. And furthermore, considering that the proposed AB-Chord algorithm enlarged the finger table which may cause the forwarding-storm of routing maintenance messages, we further propose AB-Chord+, which appropriately extends the periodic time of updating finger tables and makes the joining and leaving nodes actively send updating messages, to reduce the number of messages forwarded in the network. Simulated results show that AB-Chord+ reduced the network bandwidth consumption.",
    keywords = "Chord, Lookup efficiency, Maintenance overhead, Structured Peer-to-Peer",
    author = "Yufeng Wang and Qun Jin and Xiangming Li and Jianhua Ma",
    year = "2012",
    doi = "10.1109/UIC-ATC.2012.158",
    language = "English",
    pages = "278--284",
    booktitle = "Proceedings - IEEE 9th International Conference on Ubiquitous Intelligence and Computing and IEEE 9th International Conference on Autonomic and Trusted Computing, UIC-ATC 2012",

    }

    TY - GEN

    T1 - AB-chord

    T2 - An efficient approach for resource location in structured P2P networks

    AU - Wang, Yufeng

    AU - Jin, Qun

    AU - Li, Xiangming

    AU - Ma, Jianhua

    PY - 2012

    Y1 - 2012

    N2 - Recently, P2P (Peer-to-Peer) technology has witnessed a rapid development. Basically, one of key components in successful P2P applications is how to efficiently look up resources. Considering that structured P2P is a relatively efficient way to locate resources, this paper conducted two improvements to increase the search efficiency in Chord-based algorithms, one of the most popular structured P2P resource lookup protocols. In detail, our contributions are twofold. First, considering the fact that routing information in Chord is not abundant enough for efficient resource search, and looking up resource can only be enforced in clockwise direction, a new algorithm called AB-Chord is proposed to reconstruct the finger tables in Chord, in which counterclockwise finger table is added to achieve resource queries in both directions, and the density of neighboring fingers is increased. Additionally, AB-Chord implements a new operation to remove the redundant fingers introduced by adding fingers in AB-Chord. Experimental results show that AB-Chord's query efficiency has been improved in terms of the average lookup hops and average lookup delay. And furthermore, considering that the proposed AB-Chord algorithm enlarged the finger table which may cause the forwarding-storm of routing maintenance messages, we further propose AB-Chord+, which appropriately extends the periodic time of updating finger tables and makes the joining and leaving nodes actively send updating messages, to reduce the number of messages forwarded in the network. Simulated results show that AB-Chord+ reduced the network bandwidth consumption.

    AB - Recently, P2P (Peer-to-Peer) technology has witnessed a rapid development. Basically, one of key components in successful P2P applications is how to efficiently look up resources. Considering that structured P2P is a relatively efficient way to locate resources, this paper conducted two improvements to increase the search efficiency in Chord-based algorithms, one of the most popular structured P2P resource lookup protocols. In detail, our contributions are twofold. First, considering the fact that routing information in Chord is not abundant enough for efficient resource search, and looking up resource can only be enforced in clockwise direction, a new algorithm called AB-Chord is proposed to reconstruct the finger tables in Chord, in which counterclockwise finger table is added to achieve resource queries in both directions, and the density of neighboring fingers is increased. Additionally, AB-Chord implements a new operation to remove the redundant fingers introduced by adding fingers in AB-Chord. Experimental results show that AB-Chord's query efficiency has been improved in terms of the average lookup hops and average lookup delay. And furthermore, considering that the proposed AB-Chord algorithm enlarged the finger table which may cause the forwarding-storm of routing maintenance messages, we further propose AB-Chord+, which appropriately extends the periodic time of updating finger tables and makes the joining and leaving nodes actively send updating messages, to reduce the number of messages forwarded in the network. Simulated results show that AB-Chord+ reduced the network bandwidth consumption.

    KW - Chord

    KW - Lookup efficiency

    KW - Maintenance overhead

    KW - Structured Peer-to-Peer

    UR - http://www.scopus.com/inward/record.url?scp=84869829997&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84869829997&partnerID=8YFLogxK

    U2 - 10.1109/UIC-ATC.2012.158

    DO - 10.1109/UIC-ATC.2012.158

    M3 - Conference contribution

    AN - SCOPUS:84869829997

    SP - 278

    EP - 284

    BT - Proceedings - IEEE 9th International Conference on Ubiquitous Intelligence and Computing and IEEE 9th International Conference on Autonomic and Trusted Computing, UIC-ATC 2012

    ER -