Beruflich Dokumente
Kultur Dokumente
x
*""""*~ .~.
.
tep3:
Reconnecting a
Step I : Cangmg
Step 2:
. DDR rin
to a data Imk and
Reestablls!llg
g
enabling a DDR
a backup link
ri ng
Fig. 3. An example of peer departure in 3-level HRT6 structure.
.
:-': 8
/;
. - _ (
Step 3-J. ccstablishing
a backup Imk
Stc3-2. Chanyny toabacku
'.
Choosiny acci
4(u) Chosnyupccr.
Step 2: Rcconncctny thc ' link and disabling a DDRring
cctand its sibIiny
Step I: Connecting the pccrp and its pareni
and connecting the peerand its children
4(b) RcpIaciny IhcposiIion oIhcucparIcupccr.
Fig. . /D example of peer recovery i 3-level HRT6 structure.
(previous backup link) to the DDR rings formed by the
descendants of peer x; the branch peers of departed peer x
continue to transmit and obtain real-time multimedia data
through this backup link. Accordingly, the delay of messages
received by peers is minimized.
E. Recover Method
Although the DDR ring and backup link can be used as
temporary paths for transmitting streaming data and reduce the
delay caused by a lef peer, a swif recovery method for
stabilizing the whole topology is essential. The details of the
recovery operation are presented below.
1) Choosing a candidate and re-aining: To achieve swif
recovery, the proposed policy replaces a departed peer with a
descendant leaf-peer fom the bottom level of the branch of
the departed peer (Fig. 4(a)). The selected leaf peer (which
was the last to join) has the largest position number in the ring
with a particular parent. This replacement is fast and efcient
as very few peers have to be considered.
2) Building a DDR ring: Peer p is chosen fom the bottom
level of the branch of peer x. Fig. 4(b) shows the replacement
of peer x with peer p, and the corresponding DDR ring and
backup link that are established to preserve the stability of the
architecture.
3) Establishing a backup link and disabling the enabled
backup link and DDR ring: Afer replacement, the enabled
DDR ring and the backup link should be disabled (Fig. 4(b)).
If the departed peer originally has a backup link, the selected
peer will reestablish this backup link to ensure that each
branch on each level of the HRTarchitecture always includes a
backup link.
4) Updating the state: When a chosen leaf peer that
replaces another peer is moved, several peers are needed to
adjust the state on the entire branch. Therefore, all peers on the
branch may be affected. Accordingly, the parent of the leaf
peer must send to the root (maximum) a state-change message
to the affected peers from in the decentralized operation.
78
IV. PERORANCE EVALUATION
The following main metrics of performance are defned.
1) Loss rate: when a peer leaves or fails, some packets
will be lost. The loss rate is the ratio of the total number of
packets lost for all peers to the total number of packets that
should have been received by all peers.
2) End-to-end delay: the sum of the delays associated
with waking up each hop peer and the relaying of a packet to
its next-hop child peers fom the source to the end peer.
The Network Simulator (NS2) [14] was used as the
simulation platform and a GT-ITM Generator [17] was applied
to create a transit-stub graph as the network topology. The
source node was fxed in one stub-domain. First of all, we let k
4. Therefore, each node has at most four children. The
performance of the proposed HRTk architecture was compared
to that of the ZIGZAG approach.
A. Loss Rate
The loss rate is utilized as a metric of service reliability.
When the loss rate is sufciently small, users enjoy high flm
service, even when there is a large amount of leaving peers. In
this scenario, 1000 peers joined the system and 500 peers
1
~7L^\
9 -
8
|u
LvcPoOut
I_. 3. Comparison ofloss rate of HRT4 and Z!LZL
Av0rug Lss Rte Ui
0
08
0
06
C
o
05
04 C
=
0
U?
01
. . . .__. __
10 ZI 3|I 4I 50
|a\c|ccrLun|
_. o. The loss rate of 3upeers departure under HRTj of uupeers
departed subsequently. The constant bit rate (CBR) was used to
simulate media streaming. The packet size of each CBR, or
data stream, was 500 bytes, and the sending interval was 0.01 s
(the media streaming compression rate is 400kbps). Fig.5 plots
the loss rates obtained using the HRT4 mechanism and the
ZIGZAG approach. The proposed HRT limits the loss rate to
under O. 5%. However, for the ZIGZAG approach, when an
associate head departs, the total loss rate increases, because the
associate head must forward data to all peers within its cluster
and to other associate heads in a lower layer (the average loss
rate is 3.5%). Simulation results show that the proposed HRT4
has a lower loss rate than ZIGZAG; thus, the HRT is an
effective and robust P2P system for streaming multimedia data.
To validate the efectiveness of the proposed structure in
real world, some experiments were performed on a PlanetLab
based [9] environment. PlanetLab is one of the real network
test-beds on the Interet. The performance of HRTk under
various network environments (k 3, 4 and 5) are evaluated
with a focus on the following important measures; loss rate
(service reliability) and end-to-end delay (streaming delivery
quality). Three scenarios were examined. A total of 100
PlanetLab peers participated in our experiments. The session
length was 2500 seconds. A source server (root) in our
university delivers video streaming packets to PlanetLab with a
constant bandwidth. The other selected 99 peers were overlay
peers located in different locations of the world. In the absence
Avrug Ls Rte .U
U.
-HR{)
U.8
U.7
t
U.6
C
-
U.
o
U.4
0
U.2
U.I
1U 2 J 4
LavcP rOunt
_. . The loss rale of 3upeers departure under HRT, of uupeers
79
Av0rug0 L KuI0JJJ
0.
0.8
0.7
0.6
0.5
3
0.+
O
0.2
0.1
.1 A
10 20 J 4
LavcPcorOunI
_. . The loss rate of JU peers departure under HRT, of uupeers
of global knowledge of the topology in PlanetLab (and the
Interet), this setup was suitable for testing the proposed
distributed approach in HRTk.
In scenario 1, HRT3 is considered to evaluate the loss rate.
Fig. 6 illustrates the loss rate under 50 peers departure one by
one in HRT3 of 100 peers. The average loss rate was 0.008%.
HRT4 is then considered in scenario 2. Fig.7 depicts that the
average loss rate was 0.0094%. Finally HRT5 is adapted in
scenario 3 and Fig.8 demonstrates the collected average loss
rate of 0.0107%. The experimental results reveal that the loss
rate is relative to the value of k. When one peer possesses more
sub-trees, the peer affects more children peers under the peer
departure. Consequently, the average loss rate of the system is
raised during the children peers not receiving any packets, and
a bigger sub-tree conducts a higher loss rate.
B. End-ta-end Delay
The end-to-end delay is another key metric of overlay
performance. I [4,5], the end-to-end delay was defned as the
number of passing hop peers. We also adopt this defnition but
further provide an evaluation based on the PlanetLab test-bed
environment. Again, HRT3, HRT4, and HRT5 are considered. Fig.
9, 10 and 11 illustrate the average end-to-end delay measured
from the PlanetLab for HRT3, HRT4, and HRT5, respectively. It
A\egeHd+odD|q0.70s
Iu
V
:
D
c
l
0
-HR(3)
J 2J JJ 4 J
La" Peer \
!_. . The end-la-end delay of 50 peers deparure under HRlj of I Upeers
^vcLd-Iodby0b
V
E +
U IU 2U JU 4 b0
\OfLOFf
Fig. 10. The end-la-end delay of 50 peers departure under HRT4 of 100 peers
is interesting to see that for all cases, the measured end-to-end
delay was approximately 0.6 second. The reason to have this
low end-to-end delay is due to with 100 joined peers, the
multicast tree has a height of 3 or 4.
V. CONCLUSION
This study presents the novel HRT architecture for P2P live
multimedia streaming. The ring-tree-based overlay structure
can serve as an infastructure for P2P applications requiring
scalability, high robustness, fast communication, low overhead,
and practicable architectural topolog. The design of the DDR
rings with backup links signifcantly decreases the time
required by a peer to regain data. When one peer leaves, the
DDR ring and backup link quickly change to transmit data and
ensure robustness. The performance of the approach has been
evaluated over the PlanetLab network. Experimental results
indicate that the HRT approach achieves a good overlay
performance in terms of data loss rate, end-to-end delay, and
effectively reduces the related overheads, even when the
number of peers that join/leave is high. This indicates that the
proposed HRT architecture is very suitable for the live
multimedia streaming in multicast on a P2P network.
AvcLd-|odDlq 0.58I75
V
3
'E 4
IK()
10 IS 20 2S 30 35 40 45 0
Lve Pe Lul
Fig. JJ. The end-la-end dela_ of 50 peers departure uder HR1s of 100 peers
80
ACKNOWLEDGMENT
This work was supported by National Science Council
(NSC) of Taiwan under the grant numbers NSC-98-2221-E-
007-060-MY3 and 98-2219-E-007-013.
REFERENCES
[I] A Matrawy, I. Lambadaris, "A Real-Time Video Multicast Architecture
for Assured Forwarding Services," IEEE Transactions on Multimedia,
Vol. 7, No. 4, Aug. 2005, pp.688-699.
[2] B. Gedik, L. Liu, "A Scalable Peer-to-Peer Architecture for Distributed
Information Monitoring Applications," IEEE Transactions on
Computers, Vol. 54, No.6, June 2005, pp.767-782.
[3] B. Ye, M. Guo, D. Chen, and S. Lu, "A Degree-constrained QoS-aware
Routing Algorithm for Application Layer Multicast," lrormation
Sciences, Vol. 177, No. 17, Sep. 2007, pp.3613-3626.
[4] D. A Tran, K. A Hua, and T. Do, "ZIGZAG: An Efficient Peer-to-Peer
Scheme for Media Streaming," In Proc. of IEEE INFOCOM, Mar. 2003,
San Francisco, USA, pp.1283-1292.
[5] D. A Tran, K. A. Hua, and T. Do, "A Peer-to-Peer Architecture for
Media Streaming," IEEE Joural on Selected Areas in Communications
(JSAC), Jan. 2004, pp.121-133.
[6] H.-C. Hsiao and c.-P. He, "A Tree-Based Peer-to-Peer Network with
Quality Guaratees," IEEE Transactions on Parllel and Distributed
Systems, Vol. 19, No. 8, Aug. 2008, pp. 1099-1110.
[7] N. F. Huang, Y. 1. Tzang, H. Y. Chang, C. W. Ho, "Enhancing P2P
Overlay Network Architecture for Live Multimedia Streaming,"
In!ormation Sciences, Vol. 180, No. 17,2010,pp. 3210-3231.
[8] N. F. Huang, Y. 1. Tzang, H. F. Chen, and Y. M. Chu, "Live Multimedia
System Using Peer-to-Peer Architecture for Distance Education," ICWL
2006, LNCS 4181, Sep. 2006, pp.321-335.
[9] PlanetLab website, http://www.planet-lab.org/,2010.
[10] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, "Scalable
Application Layer Multicast," In Proc. of ACM SIGCOMM, Aug. 2002,
Pittsburgh, PA, pp.205-217.
[II] S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S Khuller,
"Construction of an Efficient Overlay Multicast Infrastructure for Real
time Applications," In Proc. of IEEE INFOCOM March 2003, San
Francisco, CA, pp.1521-1531.
[12] S. Liu, Z. S Rui, W. Jiang, 1. Rexford, and M. Chiang, "Performance
Bounds for Peer-Assisted Live Streaming," In Proc. of ACM
SIGMET June 26, 2008, Annapolis, Maryland, USA pp.313-324.
[13] S.-Y. Tseng, Y.-M. Hung, and c.-c. Lin, "Genetic Algorithm for Delay
and Degree-contrained Multimedia Broadcasting on Overlay Networks,"
Computer Communications, 2006, pp.3625-3632.
[14] The Network Simulator NS2 http://www.isi.edu/nsnamlns/.201O.
[15] V. N. Padmanabham, H. J. Wang, P. A Chou, and K. Sripanidkulchai,
"Distributing Streaming Media Content Using Cooperative networking,"
In Proc. of ACM NOSSDAV, May 2002, pp.I77-186.
[16] X. Zhang, 1. Liu, B. Li, and T.-S. P. Yum, "CooIStreaming/DONet: A
Data-driven Overlay Network for Live Media Streaming," In Proc. of
IEEE INFOCOM, Miami, USA, March 2005, Vol. 3. pp.21 02-2 I 11.
[17] Zegura E.W., Calvert K.L., and Bhattacharjee S , How to Model an
Internetwork, In Proc. of IEEE INFOCOM 24-28 March 1996, San
Francisco, CA, USA, pp.594-602.