Hub node reinforcement against forwarding obstruction attacks in peer-to-peer networks

Takashi Yajima, Asaki Matsumoto, Hiroshi Shigeno

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

In this paper, Forwarding Obstruction Attack, an attack on overlay networks is focused on, and Hub Node Reinforcement Method to suppress affects of forwarding obstruction is proposed. An inquiry is sent to a randomly selected nodes to receive the number of forwarding search queries. Then the node can know how often it forwards queries in comparison to other nodes. As a result, if the node realizes that it is a Hub node, it expands its routing table. By carrying out the above procedures in a dynamic network, each node determines whether it is a Hub node or not, and decreases the chances of a search query reaching a node which obstructs forwarding. Through computer simulations, the proposed method is compared with no countermeasure and equally reinforced method in the following criteria: search success rate and memory overhead. Compared to the equally reinforced method, the proposed method increases the success search rate by 10% and decreases the memory overhead of the whole network by 30% and shows that the proposed scheme is efficient in the above two criteria.

本文言語English
ホスト出版物のタイトルProceedings - 2011 International Conference on Network-Based Information Systems, NBiS 2011
ページ388-393
ページ数6
DOI
出版ステータスPublished - 2011 11 9
イベント2011 International Conference on Network-Based Information Systems, NBiS 2011 - Tirana, Albania
継続期間: 2011 9 72011 9 9

出版物シリーズ

名前Proceedings - 2011 International Conference on Network-Based Information Systems, NBiS 2011

Other

Other2011 International Conference on Network-Based Information Systems, NBiS 2011
国/地域Albania
CityTirana
Period11/9/711/9/9

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信
  • 情報システム

フィンガープリント

「Hub node reinforcement against forwarding obstruction attacks in peer-to-peer networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル