Unified framework and an algorithm for searching in pure P2P-hop-value-based query-packet forwarding

Masato Uchida, Shinya Nogami

Research output: Contribution to journalArticle

Abstract

In pure peer-to-peer (P2P) file sharing applications and protocols using a flooding-based query algorithm, a large number of control packets (query packets) are transmitted on the network to search, for target files. This flooding-based query-packet-forwarding algorithm is clearly not scalable because it will lead to an overhead, such as an overwhelming amount of query traffic and a high CPU load, as more servents (servent = server + client) join the overlay network. To solve such problems, this paper proposes a new query algorithm based on a unified framework that describes a wide variety of query algorithms for pure P2P. This framework determines the number of destinations for query packets based on the hop value recorded in received query packets. Simulation results revealed that the proposed query algorithm can reduce the overhead in the flooding-based query algorithm without decreasing the succeess rate of retrieval regardless of the density of target files in the network.

Original languageEnglish
Pages (from-to)43-48
Number of pages6
JournalNTT Technical Review
Volume2
Issue number6
Publication statusPublished - 2004 Jun
Externally publishedYes

Fingerprint

Overlay networks
Program processors
Servers
Network protocols

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Unified framework and an algorithm for searching in pure P2P-hop-value-based query-packet forwarding. / Uchida, Masato; Nogami, Shinya.

In: NTT Technical Review, Vol. 2, No. 6, 06.2004, p. 43-48.

Research output: Contribution to journalArticle

@article{5581eda165124e9dae261f3c3d2b5a20,
title = "Unified framework and an algorithm for searching in pure P2P-hop-value-based query-packet forwarding",
abstract = "In pure peer-to-peer (P2P) file sharing applications and protocols using a flooding-based query algorithm, a large number of control packets (query packets) are transmitted on the network to search, for target files. This flooding-based query-packet-forwarding algorithm is clearly not scalable because it will lead to an overhead, such as an overwhelming amount of query traffic and a high CPU load, as more servents (servent = server + client) join the overlay network. To solve such problems, this paper proposes a new query algorithm based on a unified framework that describes a wide variety of query algorithms for pure P2P. This framework determines the number of destinations for query packets based on the hop value recorded in received query packets. Simulation results revealed that the proposed query algorithm can reduce the overhead in the flooding-based query algorithm without decreasing the succeess rate of retrieval regardless of the density of target files in the network.",
author = "Masato Uchida and Shinya Nogami",
year = "2004",
month = "6",
language = "English",
volume = "2",
pages = "43--48",
journal = "NTT Technical Review",
issn = "1348-3447",
publisher = "Nippon Telegraph and Telephone Corp.",
number = "6",

}

TY - JOUR

T1 - Unified framework and an algorithm for searching in pure P2P-hop-value-based query-packet forwarding

AU - Uchida, Masato

AU - Nogami, Shinya

PY - 2004/6

Y1 - 2004/6

N2 - In pure peer-to-peer (P2P) file sharing applications and protocols using a flooding-based query algorithm, a large number of control packets (query packets) are transmitted on the network to search, for target files. This flooding-based query-packet-forwarding algorithm is clearly not scalable because it will lead to an overhead, such as an overwhelming amount of query traffic and a high CPU load, as more servents (servent = server + client) join the overlay network. To solve such problems, this paper proposes a new query algorithm based on a unified framework that describes a wide variety of query algorithms for pure P2P. This framework determines the number of destinations for query packets based on the hop value recorded in received query packets. Simulation results revealed that the proposed query algorithm can reduce the overhead in the flooding-based query algorithm without decreasing the succeess rate of retrieval regardless of the density of target files in the network.

AB - In pure peer-to-peer (P2P) file sharing applications and protocols using a flooding-based query algorithm, a large number of control packets (query packets) are transmitted on the network to search, for target files. This flooding-based query-packet-forwarding algorithm is clearly not scalable because it will lead to an overhead, such as an overwhelming amount of query traffic and a high CPU load, as more servents (servent = server + client) join the overlay network. To solve such problems, this paper proposes a new query algorithm based on a unified framework that describes a wide variety of query algorithms for pure P2P. This framework determines the number of destinations for query packets based on the hop value recorded in received query packets. Simulation results revealed that the proposed query algorithm can reduce the overhead in the flooding-based query algorithm without decreasing the succeess rate of retrieval regardless of the density of target files in the network.

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

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

M3 - Article

AN - SCOPUS:4344646960

VL - 2

SP - 43

EP - 48

JO - NTT Technical Review

JF - NTT Technical Review

SN - 1348-3447

IS - 6

ER -