|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2011 14th International Conference on Network-Based Information Systems
Hub Node Reinforcement against Forwarding Obstruction Attacks in Peer-to-Peer Networks
Tirana, Albania
September 07-September 09
ISBN: 978-0-7695-4458-8
| ASCII Text | x | ||
| Takashi Yajima, Asaki Matsumoto, Hiroshi Shigeno, "Hub Node Reinforcement against Forwarding Obstruction Attacks in Peer-to-Peer Networks," 2012 15th International Conference on Network-Based Information Systems, pp. 388-393, 2011 14th International Conference on Network-Based Information Systems, 2011. | |||
| BibTex | x | ||
| @article{ 10.1109/NBiS.2011.65, author = {Takashi Yajima and Asaki Matsumoto and Hiroshi Shigeno}, title = {Hub Node Reinforcement against Forwarding Obstruction Attacks in Peer-to-Peer Networks}, journal ={2012 15th International Conference on Network-Based Information Systems}, volume = {0}, year = {2011}, isbn = {978-0-7695-4458-8}, pages = {388-393}, doi = {http://doi.ieeecomputersociety.org/10.1109/NBiS.2011.65}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 15th International Conference on Network-Based Information Systems TI - Hub Node Reinforcement against Forwarding Obstruction Attacks in Peer-to-Peer Networks SN - 978-0-7695-4458-8 SP388 EP393 A1 - Takashi Yajima, A1 - Asaki Matsumoto, A1 - Hiroshi Shigeno, PY - 2011 KW - hub node reinforcement method KW - forwarding obstruction attack KW - Chord KW - peer-to-peer KW - overlay network VL - 0 JA - 2012 15th International Conference on Network-Based Information Systems ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NBiS.2011.65
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.
Index Terms:
hub node reinforcement method, forwarding obstruction attack, Chord, peer-to-peer, overlay network
Citation:
Takashi Yajima, Asaki Matsumoto, Hiroshi Shigeno, "Hub Node Reinforcement against Forwarding Obstruction Attacks in Peer-to-Peer Networks," nbis, pp.388-393, 2011 14th International Conference on Network-Based Information Systems, 2011
Usage of this product signifies your acceptance of the Terms of Use.