Locating Interested Subsets of Peers for P2PSIP
Lican Huang · 2009
Location for Peers plays an important role on SIP applications. This paper presents a proposal for location and discovery of interested peers based on virgo P2P technologies. The peers are virtually grouped by classifying their interested topics into hierarchical domains. They construct n-tuple overlay virtual hierarchical tree overlay network according to their domains. With cached addresses of peers, the overload of traffic in tree structure can be avoided. This proposal supports flexible queries for subsets of filtered interested peers by a SQL-like query statement. In this paper, we also describe the protocols of VIRGOP2PSIP and the primary implementation of the prototype.