Efficient data lookup in non-DHT based low diameter structured P2P network

In this paper, we have considered a recently reported non-DHT based structured P2P system. The architecture is based on Linear Diophantine Equation (LDE) and it is an interest-based system; it offers very efficient data lookup. However, the architecture is restricted in that a peer cannot possess more than one distinct resource type. This may reduce the scope of its application. In this paper, we have extended the work by considering a generalization of the architecture, that is, a peer can possess multiple distinct resource types. We have proposed an efficient data lookup algorithm with time complexity bounded by (2+r/2); r is the number of distinct resource types. We have discussed about an alternative lookup scheme that needs constant number of hops and constant number of message exchanges. Besides, churn handling and ring maintenance have been shown to be very efficient.