An O(1) Lookup and Decentralized Bootstrapping Peer to Peer SIP System

Author

Gu, Lanzhi ; Zhang, Chunhong ; Ji, Yang ; Li, Lichun

Author_Institution

Telecommun. Eng. Dept., Beijing Univ. of Posts & Telecom, Beijing

fYear

2009

fDate

10-13 Jan. 2009

Firstpage

1

Lastpage

2

Abstract

This paper addresses two research challenges of P2PSIP: i) call setup latency ii) decentralized bootstrapping. To optimize the call setup latency of P2PSIP, we design an O(1) lookup protocol which completes the overlay routing within 3 hops most time. We also leverage the routing table of O(l) DHT to achieve decentralized bootstrapping. Experimental results indicate that 90% of bootstrapping latency is less than 446 ms even if there´s no active node within LAN. Analytic and simulation results also demonstrate the feasibility and efficiency of our proposed schemes.

Keywords

peer-to-peer computing; routing protocols; signalling protocols; table lookup; call setup latency; decentralized bootstrapping; lookup protocol; overlay routing; peer to peer SIP system; routing table; Analytical models; Costs; Delay; Design optimization; Fingers; Local area networks; Peer to peer computing; Public key; Routing protocols; Telecommunications;

fLanguage

English

Publisher

ieee

Conference_Titel

Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE

Conference_Location

Las Vegas, NV

Print_ISBN

978-1-4244-2308-8

Electronic_ISBN

978-1-4244-2309-5

Type

conf

DOI

10.1109/CCNC.2009.4784817

Filename

4784817