A protocol for reliable decentralized conferencing

Lennox, Jonathan; Schulzrinne, Henning

doi:10.1145/776334.776335

Cited by 24 publications

(5 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Completely decentralized conferencing [28] can be used to establish a full-mesh signaling and media relationship among the participating members. The protocol works for concurrent join and leave of members in the conference.…”

Section: Multi-party Conferencingmentioning

confidence: 99%

Peer-to-peer internet telephony using SIP

Singh

Schulzrinne

2005

Proceedings of the International Workshop on Network and Operating Systems Support for Digital Audio and Video

Self Cite

172

123

View full text Add to dashboard Cite

P2P systems inherently have high scalability, robustness and fault tolerance because there is no centralized server and the network self-organizes itself. This is achieved at the cost of higher latency for locating the resources of interest in the P2P overlay network. Internet telephony can be viewed as an application of P2P architecture where the participants form a self-organizing P2P overlay network to locate and communicate with other participants. We propose a pure P2P architecture for the Session Initiation Protocol (SIP)-based IP telephony systems. Our P2P-SIP architecture supports basic user registration and call setup as well as advanced services such as offline message delivery, voice/video mails and multi-party conferencing. We also provide an overview of practical challenges for P2P-SIP such as firewall, Network Address Translator (NAT) traversal and security.

show abstract

Section: Multi-party Conferencingmentioning

confidence: 99%

Peer-to-peer internet telephony using SIP

Singh

Schulzrinne

2005

Proceedings of the International Workshop on Network and Operating Systems Support for Digital Audio and Video

Self Cite

172

123

View full text Add to dashboard Cite

show abstract

“…The second approach is to use a centralized server (Figure 1a) for forwarding and mixing of multimedia streams. The third approach is to construct a fully connected peer-to-peer overlay network ( Figure 1b) [18] that has all peers in direct contact with one another. The first approach enables server-free group communication, but currently IP multicast is not widely deployed, rendering this approach impractical over the general internet.…”

Section: Communication Among the Group Members Is N-to-nmentioning

confidence: 99%

RRG: redundancy reduced gossip protocol for real-time N-to-N dynamic group communication

Luk

Wong

Lea

et al. 2013

J Internet Serv Appl

View full text Add to dashboard Cite

Real-time group communication is an indispensable part of many interactive multimedia applications over the internet. In scenarios that involve large group sizes, sporadic sources, high user churns, and random network failures, gossip-based protocols can potentially provide advantages over structure-based group communication algorithms in ease of deployment, scalability, and resiliency against churns and failures. In this paper, we propose a novel protocol called Redundancy Reduced Gossip for real-time N-toN group communication. We show that our proposed protocol can achieve a considerably lower traffic load than conventional push-based gossip protocols and conventional push-pull gossip protocols for the same probability of successful delivery, with higher performance gains in networks with smaller delays. We derive a mathematical model for estimating the frame nondelivery probability and the traffic load from overhead, and demonstrate the general correctness of the model by simulation. We implement a functioning prototype conferencing system using the proposed protocol, completed with functions including NTP synchronization, dynamic group size estimation, redundancy suppression, and other features needed for proper operation. We perform experiments over the campus network and PlanetLab, and the prototype system demonstrates the ability of our protocol to maintain robust performance in real-world network environments.

show abstract

“…Horiuchi et al, 2007;Wu et al, 2007) and source-specific trees (e.g. Chu et al, 2001;Hosseini and Georganas, 2003;Lim et al, 2009;Lennox and Schulzrinne, 2003). Shared tree topology constructs one tree only to delivery data for all the multicast sessions with different source nodes.…”

Section: Multicast Scheme For Internet Conferencementioning

confidence: 99%

Minimising delay for video conference with network coding

Zhang

Zhou

Zhang

2011

IJICOT

View full text Add to dashboard Cite

Video conference is an attractive and promising application which allows immersive communication and discussion among people at different and distant places. However, its stringent delay and bandwidth requirements limit its scale and spread over current internet. This paper attempts to introduce the prosperous technology of network coding (NC) into video conference to minimise the maximal transmission delay between source and all the participants while retaining high bandwidth utilisation at the same time. Extensive numerical analysis and PlanetLab experiments demonstrate that the proposed innovative NC scheme can significantly improve the delay performance for video conference like multi-party interactive multimedia applications than conventional application level multicast.

show abstract

A protocol for reliable decentralized conferencing

Cited by 24 publications

References 3 publications

Peer-to-peer internet telephony using SIP

Peer-to-peer internet telephony using SIP

RRG: redundancy reduced gossip protocol for real-time N-to-N dynamic group communication

Minimising delay for video conference with network coding

Contact Info

Product

Resources

About