A Protocol for Reliable Decentralized

Conferencing

Oct. 8. 2005

Sungmin Park
twilight@postech.ac.kr

DPNM Lab., Dept. of CSE, POSTECH

DP&NM Lab.
- 1/11- CSE, POSTECH
 Goal
 Multicast
– A decentralized network that is useful to handle multiple parties in
a conference with rather heavy traffic such as multimedia
communication.

 Mixing
– Reduces the network traffic amount, but can be a burden to the
nodes in charge

DP&NM Lab.
- 2/11- CSE, POSTECH
 Purpose
 Reduce of network bandwidth
– Due to the enormous increase of network traffic, multicast function
is required for the application such as internet broadcasting,
network game, in which data should be simultaneously delivered
to the participants
 Decentralized network
– Withstand to the unexpected failure
– Reduce the processing burden on the server

 New approach to p2p networks

– New approach needed to the network in which every participants
is a server and a client

DP&NM Lab.
- 3/11- CSE, POSTECH
 Existing Conferencing Models
 Existing Conferencing : Multicast
– One or more multicast addresses are allocated to the conference
– Each participant joins the multicast groups
– Sends their media to the groups

DP&NM Lab.
- 4/11- CSE, POSTECH
 Existing Conferencing Models
 Existing Conferencing: Mixing
– This model is probably the most common way of doing SIP
conferencing

Conferencing: end system mixing Conferencing: conference server mixing

DP&NM Lab.
- 5/11- CSE, POSTECH
 Proposed Model
 Data Mixing
– Reduces traffic of sound data

 Topology Management
– Minimum-spanning-tree problem
• Minimized total cost (latency)
• Constraint of Maximum outbound degree in each node
– Adapt to the dynamic change in the network
• Join
• leaving

DP&NM Lab.
- 6/11- CSE, POSTECH
 Proposed Model
 Minimized Spanning Tree with Mixing

B
∀i ∈ neighbors
outbound stream for i
= ∑inbound stream from j ( j ≠ i ) A+B+D
j

+ live stream

C D

DP&NM Lab.
- 7/11- CSE, POSTECH
 Conference Server
 Minimum Spanning Tree with
degree bound
– Each node has degree bound – Every nodes is a server and a
client as well
– The spanning tree is directed
1
100 1 A
1 100 40
1
C 40(?) B

– The tree should be balanced

1
1
100

DP&NM Lab.
- 8/11- CSE, POSTECH
 Node
 Node
– Each node has following information
• Route to the neighbors
• Synchronized state with conference server

 Operation

Mixer Mixer

∑ ∑

A B C A B C
DP&NM Lab.
- 9/11- CSE, POSTECH
 Schedule
– information gathering ~10.09
– requirements analysis ~10.14
– high-level design ~10.14
– detailed design ~11.05
– prototype implementation 10.22~11.12
– testing and debugging 10.30~12.04
– demo and submitting final report ~12.08

DP&NM Lab.
- 10/11- CSE, POSTECH
Question and Discussion

DP&NM Lab.
- 11/11- CSE, POSTECH