Study on Routing Protocol for Structured P2P Network Taking Account of the Nodes Which Behave Like a Byzantine Fault

In this study we discuss fault tolerant routing mechanism for the P2P network, Chord, considering the existence of faulty or malicious nodes. We propose a routing protocol which works despite existence of faulty nodes. We modify the original Chord routing protocol so that it can handle redundant lookups of multiple "knuckles," and replica or data fragments allocation on knuckles. Analysis based on mathematical models and simulations show that the proposed protocol effectively avoids the interruption of object supply caused by the target node fault and/or the acquisition failure of objects caused by malicious nodes tampering.