Dynamic nodeID based heterogeneity aware p2p system

A lot of research papers discussed Distributed Hash Table (DHT) based p2p systems to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and they will generate heavy information maintenance traffic to keep the efficiency of DHT based p2p systems under churn. In this paper, we suggest a dynamic nodeID based heterogeneity aware p2p system to reduce the overhead by exploiting the heterogeneity of participant nodes efficiently. Unlike the DHT based p2p systems, the nodeID of a node changes on the fly according to its characteristic and each node takes different responsibility in accordance with its nodeID to support p2p systems efficiently. A nodeID is composed of Load-Balanced ID (LBID) which balances the loads of reliable nodes and Load-Free ID (LFID) which reduces the responsibility of normal nodes and eliminates compulsory maintenance overhead. We conduct an event-driven simulation and show that our p2p system reduces data maintenance traffic and makes routing process more efficient and more reliable.