DSpace at VNU: Topology Optimization for DHT-based Application Layer Multicast

Topology Optimization for DHT-based Application Layer Multicast Nguyễn Ngọc Anh Trường Đại học Công nghệ Luận văn Thạc sĩ ngành: Khoa học máy tính; Mã số: 60 48 01 Người hướng dẫn: TS

Topology Optimization for DHT-based

Application Layer Multicast

Nguyễn Ngọc Anh

Trường Đại học Công nghệ Luận văn Thạc sĩ ngành: Khoa học máy tính; Mã số: 60 48 01

Người hướng dẫn: TS Nguyễn Hoài Sơn

Năm bảo vệ: 2012

Abstract In recent years, Distributed Hash Table (DHT) becomes active and

ongoing area of research at a lot of universities and labs DHT has many advantages: Decentralization, scalability, fault tolerance, load balancing, data integrity, and performance, Those properties make DHTs are very suitable for deploying multicast services at application layer and in fact, DHT-based network such as CAN, Chord, Pastry, Tapestry, etc can be used to implement Internet-scale application layer multicast However, early DHT-based multicast systems are insufficient in addressing all of these issues: Heterogeneous node capacity, large- scale multicast and dynamic membership Moreover, in those system, when one node joins into system through an arbitrary way, some factors are not considered: node’s bandwidth, node’s positon on DHT network (i.e node identifiers),… thus, the multicast tree can

be built inefficiently and not balance in structure The solution for assigning an appropriate number of child nodes to each node is far from optimal in term of bandwidth: If the number of child nodes is too high, low capacity node will be overloaded, therefore slows the entire session multicast down If the number of child nodes is too low, high capacity nodes will be used inefficiently In this thesis, we study the method to optimize topology for DHT-based multicast We propose a DHT- based bandwidth adaptive multicast system that forcus on host heterogeneity, scalibility, fault tolerate In our system, node’s bandwidth is firstly considered, result

of this process is the basis for determining the level of the node and correlatively caculating node’s identify Level of a node is used to define maximum number of its child nodes As a result, in our model, each node is assigned an optimal numbers of child nodes to forward multicast data Thus, our method can make tradeoff between depth of the multicast tree and bandwidth of every node and take advandtages of DHTs in maintaining multicast tree in churn overlay System chosen for implementation and avaluation is Chord This model is called Bandwidth Adaptive

Multicast over Chord: BAM-Chord

Keywords Công nghệ thông tin; Khoa học máy tính; Mạng hàng ngang

Content

Table of Contents

1.1 Motivation 2

1.2 Objectives 4

1.3 Contributions 5

1.4 Thesis structure 5

2 Background 6 2.1 Multicast 6

2.1.1 Introduction 6

2.1.1.1 IP Multicast 7

2.1.1.2 Application Layer Multicast 8

2.1.2 Application layer multicast protocols 9

2.1.2.1 Application Domain 10

2.1.2.2 Deployment Level 10

2.1.2.3 Group Management 10

2.1.2.4 Routing Mechanism 11

2.2 DHT-based multicast 12

2.2.1 Introduction of P2P Networks 12

2.2.1.1 Unstructured P2P Network model 13

2.2.1.2 Hybrid P2P Network model 14

2.2.1.3 Structured P2P Network model 15

2.2.1.4 DHT-based structure P2P networks 16

2.2.1.5.Chord Network 18

2.2.1.6.Content Adressable Network 20

2.2.2 DHT-based multicast 22

2.2.2.1 CAN-based multicast 22

2.2.2.2 Chord-based multicast 24

2.2.2.3 Scribe 25

2.2.3 Topology optimization issues forDHT-based multicast 26

2.3 Related works on topology optimization for DHT-based multicast 26

2.3.1 SplitStream 26

2.3.2 Capacity Aware Multicastbased on Overlay Network - CAM- Chord 27

2.3.3 DHT-based lightweightbroadcast algorithms in large-scale computing infrastructures 28 3 Bandwidth Adaptive Multicast over Chord : BAM Chord 31 3.1 Overview 31

3.1.1 Node identifier 32

3.1.2 Finger table 34

3.2 Network Construction 35

3.3 Multicast method 36

4 Simulations and Evaluations 38 4.1 Simulation description 38

4.2 Evaluation 38

4.2.1 The depth of multicast tree 38

4.2.2 Control Overhead 40

5 Conclusions

References

(6-10 June 2005) Resilient capacity-aware multicasting based on overlay networks

Proc of the 25th IEEE Int’l Conf on Distributed Computing Systems,, pp 565574

A Bharambe, S Rao, V P S S., & Zhang, H (February 24-25 2005.) The impact

of heterogeneous bandwidth constraints on dht-based multicast protocols Proc

4th Int’l Workshop on Peer-to-Peer Systems

Chao Liang, Yong Liu, K W R (2009) Topology optimization in multi-tree based

p2p streaming system ICTAI ’09 Proceedings of the 2009 21st IEEE International

Conference on Tools with Artificial Intelligence

Cheng Huang, Jin Li, K W R (2007) Can internet video-on-demand be profitable?

SIGCOMM ’07 Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications

Distribution, P Pareto distribution http://www.math.uah.edu/stat/special/pareto.pdf

G Bianchi, N Blefari Melazzi, L B F L P S S (10 July 2009) Streamline: An

optimal distribution algorithm for peer-to-peer real-time streaming Parallel and

Distributed Systems, IEEE Transactions on, Vol PP, No 99

Huang, K., & Zhang, D (March, 2010) Dht-based lightweight broadcast algorithms

in large-scale computing infrastructures Future Generation Computer Systems,

Volume 26 Issue 3, Pages 291-303

J Li, K S., & Lim, D.-Y (2005) Implementing aggregation and broadcast over

distributed hash tables, ACM Computer Communication Reviews 35 (1) , 81-92

M Castro, P Druschel, A.-M K., & Rowstron, A (2002) Scribe: a large-scale and

decentralized application-level multicast infrastructure, IEEE Journal on Selected Areas in

Communications 20 (8)

M Hosseini, D T Ahmed, S S N D G (2007) A survey of application-layer multicast

protocols IEEE Communications Surveys & Tutorials In Communications Surveys &

Tutorials, IEEE, No 3., Vol 9,, , pp 58-74,

M.Castro, P.Druschel, A.-M A A a splitstream: high-bandwidth multicast in cooperative environments:, in proceedings of 19th acm symposium on operating systemsprinciples2003,pp.298-313

S El-Ansary, L Alima, P B., & Haridi, S (February 2003) Efficient broadcast in

structured p2p networks, Second Int’l Workshop on Peer-to-Peer Systems (IPTPS 03),

Berkeley, CA, USA, 20-21

S Ratnasamy, M Handley, R K., & Shenker, S (Nov 7-9 2001) Application-level

multicast using content-addressable networks Proc of the Third International Workshop on

Networked Group Communication

S.Q.Zhuang, B.Y.Zhao, A R., & J.D.Kubiatowicz (2001) Bayeux:anarchitecture for

scalable and fault-tolerant wide-area data dissemination In ACM NOSSDAV

Stoica, R Morris, D K., Kaashoek, M., & Balakrisnan, H (2001) Chord: A scalable

peer-to-peer lookup service for internet applications ACM SIGCOMMOl

Sylvia Ratnasamy, Paul Francis, M H., & Karp., R (2001) A scalable content addressable

network SIGCOMM