A Scalable Peer-to-Peer Overlay for Applications with Time Constraints

With the development of Internet, p2p is increasingly receiving attention in research. Recently, a class of p2p applications with time constraints appear. These applications require a short time to locate the resource and(or) a low transit delay between the resource user and the resource holder, such as Skype, MSN. In this paper we propose a scalable p2p overlay for applications with time constraints. Our system provides supports for just two operations for uplayered p2p applications: (1) Given a resource key and the node´s IP who holds the resource, it registers the resource information to the associated node in at most two overlay hops; and (2) Given a resource key and a time constraint(0 for no constraint), it returns if possible a path(one or two overlay hops) to the resource holder, and the transit delay of the path is lower than the time constraint. Results from theoretical analysis and simulations show that our system is viable and scalable.