Proposal of a Flooding-based Flexible Search Method for Chord Networks

α
Keiichi Endo
Keiichi Endo
σ
Kensuke Kanetada
Kensuke Kanetada
ρ
Dai Okano
Dai Okano
Ѡ
Kaname Amano
Kaname Amano
α Ehime University Ehime University

Send Message

To: Author

Proposal of a Flooding-based Flexible Search Method for Chord Networks

Article Fingerprint

ReserarchID

NW14J

Proposal of a Flooding-based Flexible Search Method for Chord Networks Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

Recently, peer-to-peer (P2P) network models have been attracting considerable attention. P2P models can be classified into structured and unstructured P2P models. Representative search methods for structured and unstructured P2P networks are Chord and Flooding, respectively. It is difficult to realize flexible search in Chord networks. On the other hand, a large number of query transmissions are required for Flooding. In this study, we propose a Flooding-based search method for Chord networks. Our method works separately from the traditional search method for Chord networks. It suppresses the transmission of redundant queries by considering the topological properties of the structured networks and enables flexible search in Chord networks. Through simulation experiments, we evaluate the performance of the proposed search method and show its effectiveness.

References

16 Cites in Article
  1. M Ripeanu,A Iamnitchi (2002). Mapping the Gnutella Network.
  2. S Ratnasamy,P Francis,M Handley,R Karp (2001). A Scalable Content-Addressable Network.
  3. I Stoica,R Morris,D Karger,M Kaashoek,H Balakrishnan (2001). Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications.
  4. A Rowstron,P Druschel (2001). Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems.
  5. Ben Zhao,John Kubiatowicz,Anthony Joseph (2001). Tapestry.
  6. Petar Maymounkov,David Mazières (2002). Kademlia: A Peer-to-Peer Information System Based on the XOR Metric.
  7. Theoni Pitoura,Nikos Ntarmos,Peter Triantafillou (2006). Replication, Load Balancing and Efficient Range Query Processing in DHTs.
  8. J Aspnes,G Shah (2007). Skip Graphs.
  9. Nicholas Harvey,Michael Jones,Marvin Theimer,Alec Wolman (2003). Efficient Recovery from Organizational Disconnects in SkipNet.
  10. A González-Beltrán,P Milligan,P Sage (2008). Range queries over skip tree graphs.
  11. Q Lv,P Cao,E Cohen,K Li,S Shenker (2002). Search and Replication in Unstructured Peer-to-Peer Networks.
  12. N Bisnik,A Abouzeid (2005). Modeling and Analysis of Random Walk Search Algorithms in P2P Networks.
  13. C Gkantsidis,M Mihail,A Saberi (2005). Hybrid search schemes for unstructured peer-to-peer networks.
  14. S El-Ansary,L Alima,P Brand,S Haridi (2003). Efficient Broadcast in Structured P2P Networks.
  15. H Jagadish,B Ooi,Q Vu (2005). BATON: a Balanced Tree Structure for Peer-to-Peer Networks.
  16. Salma Ktari,Artur Hecker,Houda Labiod (2011). Structured flooding search in Chord overlays.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Keiichi Endo. 1970. \u201cProposal of a Flooding-based Flexible Search Method for Chord Networks\u201d. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 11): .

Download Citation

Journal Specifications
Version of record

v1.2

Issue date

July 6, 2011

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 20393
Total Downloads: 10735
2026 Trends
Related Research

Published Article

Recently, peer-to-peer (P2P) network models have been attracting considerable attention. P2P models can be classified into structured and unstructured P2P models. Representative search methods for structured and unstructured P2P networks are Chord and Flooding, respectively. It is difficult to realize flexible search in Chord networks. On the other hand, a large number of query transmissions are required for Flooding. In this study, we propose a Flooding-based search method for Chord networks. Our method works separately from the traditional search method for Chord networks. It suppresses the transmission of redundant queries by considering the topological properties of the structured networks and enables flexible search in Chord networks. Through simulation experiments, we evaluate the performance of the proposed search method and show its effectiveness.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Proposal of a Flooding-based Flexible Search Method for Chord Networks

Keiichi Endo
Keiichi Endo Ehime University
Kensuke Kanetada
Kensuke Kanetada
Dai Okano
Dai Okano
Kaname Amano
Kaname Amano

Research Journals