Enhancing the reliability of SIP service in large-scale P2P-SIP networks

Authors:
Fei Xu;Hai Jin;Xiaofei Liao;Fei Qiu
Affiliations:
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China
Venue:
GPC'11 Proceedings of the 6th international conference on Advances in grid and pervasive computing
Year:
2011

Citing 3
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Peer-to-peer internet telephony using SIP

NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
P2PNS: A Secure Distributed Name Service for P2PSIP

PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently P2P-SIP (Peer-to-Peer Session Initiation Protocol) has been proposed to improve the scalability and reliability of the traditional SIP (Session Initiation Protocol) networks. However, P2P-SIP makes SIP service unreliable because large-scale P2P-SIP networks are probably more dynamic than traditional SIP networks and the service nodes are very likely to fail or leave the P2P-SIP networks. To deal with this issue, we propose a novel and lightweight algorithm, which replicates SIP transactions information among the nodes in P2P-SIP networks and selects one of the successors of the failed or departed node as the takeover server. Moreover, to reduce the retrieving delay of SIP transactions replicas, we optimize our algorithm by storing these replicas directly in the successors of the failed or departed node. The simulation results demonstrate that our algorithm maintains 99% dialogs correctly in the presence of nodes failure with acceptable overheads over the Internet.