Bandwidth Fair Application Layer Multicast for

Multi-party Video Conference Application

Lim Boon Ping †, Ettikan K.K †, Eiichi Muramoto Ω,

Lin En Shu †, Truong Khoa Phan*, Nam Thoai*
†Panasonic R&D Center Malaysia
ΩImmersive Communication Task Force, Panasonic Corporation

*Ho Chi Minh City University of Technology

IEEE CCNC
12 January 2009

Panasonic Kuala Lumpur Laboratory 1

 Outline

• Bandwidth Fair Application Layer Multicast

– Comparison between MST vs. N-Tree
• ALMCast
– Design & Implementation
• Related Work
• Conclusion
• Future Work

Panasonic Kuala Lumpur Laboratory 2

 Vision & Target
Multipoint small group communication over the internet
eg. SOHO business, remote office communication
Application Layer
Multicast

Malaysia Japan

Internet

Vietnam
Singapore
Intra-ALM-bandwidth fairness for
High Definition Video Streaming
Panasonic Kuala Lumpur Laboratory 3
 Prim-MST vs. N-Tree Construction
Step1: Node
Prim-MST based tree construction with Largest Bandwidth Fair N-tree construction
upload
bandwidth
VN JP VN JP VN JP
VN 1Mbps JP VN JP VN JP VN JP
Step2: Logical
1M

0.5Mbps
bp

2Mbps Link with

1
s

2Mbps 2Mbps 2Mbps 2Mbps

2Mbps Shortest Path
s

1M
1M

1M
bp

bp
bp

bp
2
5M

s
s

s
MY SG MY SG MY SG
0.

MY 3Mbps SG MY SG MY SG MY SG
1Mbps 1Mbps Loop 1, 2 Loop 3, 4, 5 Loop 6

MY Stream – 2 Mbps
a ir! VN JP VN JP VN JP
SG & JP Stream – 1 Mbps
th F
VN Stream – 512 Kbps wid
-B and
N o n MY SG MY SG MY SG

Loop 7 Loop 8 Loop 9

VN JP VN JP VN JP

MY SG MY SG MY SG

Loop 10, 11 Loop 12 Loop 13

MY Stream – 1 Mbps ai r!
th F
SG & JP Stream – 1 Mbps i d
VN Stream – 1 Mbps
Ba ndw
Panasonic Kuala Lumpur Laboratory 4
 ALMCast
• Kernel-based data replication & forwarding.

AlmCast – Process flow of send, receive and relay

interfacing with Linux kernel IP stack

Forwarding Table Lookup

Kernel-based Packet Replication

Source/Destination IP/ UDP Ports Change

Panasonic Kuala Lumpur Laboratory 5

 Experimental Result
.

N-Tree computation time Route lookup delay for Almcast packet delivery

• N-Tree is targeted for small group video conferencing application with number of
participants less than 12 nodes,
• 0.27ms for 6 nodes* and 2.5ms for 12 nodes* shall provide on time tree re-
computation for fast route convergence.
• Average lookup and forwarding time for Almcast are around 20-21us at node B
and less than 7us for node A, C and D*. *PCs of Pentium IV 1.8GHz with 512MB memory

Panasonic Kuala Lumpur Laboratory 6

 Feature of Bandwidth Fair N-Tree

This proposal achieves

• N source trees building concurrently in an N
participant session.
• acceptable perceived AV quality with equal
bandwidth slot allocation to all sources, a
crucial feature for high-definition video
streaming
• Kernel-based high speed data replication and
forwarding for ALM

Panasonic Kuala Lumpur Laboratory 7

 Related Work

• Most current art DO NOT ensures optimum

bandwidth allocation and utilization in multiple
source based trees scenario.
• Prim-MST
– bias towards shortest delay path
– builds source-based tree in sequence
• ALMI
– a single N source tree based on minimal delay
incurring high link stress on shared path

Panasonic Kuala Lumpur Laboratory 8

 Conclusion
• We have designed and implemented N-Tree algorithm
& Almcast with modified IP stack in Linux Kernel
2.6.11.12 to
– demonstrate the basic principles of N-Tree algorithm
– proved kernel-based packet replication and delivery for
small group AV communication is possible.

• Bandwidth Fair N-Tree algorithm is suitable for AV

conferencing applications where
– small group of participants exchange AV stream
– high degree of interactivity exist
– better AV quality throughout the session over the internet.

Panasonic Kuala Lumpur Laboratory 9

 Future Work
• Large-scale distributed deployment
– Dynamic member join/leave with distributed tree
construction in 100-1000 nodes clusters.
– Test bed with participants spanning across
different regions
(Japan/Malaysia/Singapore/Vietnam etc) for ALM-
based video conferencing.

• Near-Zero loss rate, fast route convergence

– Ensure short tree calculation time upon
membership change and network condition
change
– Ensure video quality with near-zero loss rate upon
route convergence.

Panasonic Kuala Lumpur Laboratory 10

 Thank You

Panasonic Kuala Lumpur Laboratory 11

 Why Bandwidth is important for HD Video Quality?

Shortest Delay Prim-MST based approach – Bandwidth Fair N-tree approach –

Sending high bitrate video resulting in Best perceived video quality 3Mbps
High Video Loss Rate

Panasonic Kuala Lumpur Laboratory 12

 Congestion Avoidance

MY JP MY JP

RTT: 150ms RTT: 250ms RTT: 500ms

BW: 1Mbps BW: 1Mbps BW: 1Mbps RTT: 200ms
BW: 2Mbps
SG Congested
Link SG

Congested Congested
Traffic from Traffic from
MY&JP to SG! MY to SG
(1) Without ALM (3) Network Congestion
<Legacy System>
13

RTT: 250ms
BW: 1Mbps

MY JP JP
MY
RTT: 150ms
BW: 1Mbps RTT: 200ms Redirected RTT: 200ms
BW: 2Mbps Link BW: 2Mbps
SG SG

Fair Fair
Bandwidth Bandwidth
Allocation Allocation
(2) With ALM (4) Congestion
Avoidance

Panasonic Kuala Lumpur Laboratory