Locating Interested Subsets of Peers for P2PSIP

Author

Huang, Lican

Author_Institution

Sch. of Inf. & Electron., Zhejiang Sci-Tech Univ., Hangzhou, China

fYear

2009

fDate

June 30 2009-July 2 2009

Firstpage

1408

Lastpage

1413

Abstract

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.

Keywords

SQL; peer-to-peer computing; protocols; SQL-like query statement; VIRGO P2P technologies; flexible queries; n-tuple overlay virtual hierarchical tree; overlay network; session initiation protocol; tree structure; Access protocols; Distributed computing; IP networks; Informatics; Peer to peer computing; Proposals; Prototypes; Telecommunication traffic; Tree data structures; Virtual groups; P2PSIP; SQL-like statement; Scope query; Semantic P2P network; VIRGO;

fLanguage

English

Publisher

ieee

Conference_Titel

New Trends in Information and Service Science, 2009. NISS '09. International Conference on

Conference_Location

Beijing

Print_ISBN

978-0-7695-3687-3

Type

conf

DOI

10.1109/NISS.2009.85

Filename

5260580