Scalable signaling protocol for Web real-time communication based on a distributed hash table

  • Paik, Jung Ha; 
  • Lee, Dong Hoon
Citations

WEB OF SCIENCE

6
Citations

SCOPUS

13

초록

Web real-time communication (WebRTC) provides browser-to-browser communications without installing any plug-in. In WebRTC, peers have to prepare their communication session through a signaling protocol which coordinates peers and exchanges Session Description Protocol (SDP) message between two peers. The problem is that the most well known signaling method cannot provide the scalability because the method relies on only single server. To overcome the problem, this paper presents a scalable WebRTC signaling protocol. The main idea is that each peer forms a peer-to-peer topology by structuring relevant WebRTC connections with each other and then sends signals across those connections. The central server needs to handle only a few connection establishments for newly joining peers. The rest of the signaling process can be performed by peers. We define and justify such a protocol including a bootstrap method, a stabilization scheme, and peer lookup. The procedures are designed to be suitable for WebRTC connections and to be resilient against the churn condition. Furthermore, we implement the proposed protocol in pure JavaScript to show that it is realizable. The performance of the implementation is practical, with signaling latency averaging 0.5 s when the number of peers is 1000. Each peer still correctly locates the other peers even when the network is very congested. (C) 2015 Elsevier B.V. All rights reserved.

키워드

WebRTC; Distributed hash table; Signaling protocol; Peer-to-peer; SERVICE; CHORD
제목
Scalable signaling protocol for Web real-time communication based on a distributed hash table
저자
Paik, Jung Ha; Lee, Dong Hoon
DOI
10.1016/j.comcom.2015.05.013
발행일
2015-10-01
유형
Article
저널명
Computer Communications
권
70
페이지
28 ~ 39