| Luận văn: | Topology Optimization for DHT-based Application Layer Multicast = Tối ưu hóa Topology của mạng hàng ngang có cấu trúc DHT phục vụ triển khai Multicast tần ứng dụng. Luận văn ThS. Công nghệ thông tin: 60 48 10 |
| Nhà xuất bản: | ĐHCN |
| Ngày: | 2012 |
| Chủ đề: | Công nghệ thông tin Khoa học máy tính Mạng hàng ngang |
| Miêu tả: | 44 p. + CD-ROM Luận văn ThS. Khoa học máy tính -- Trường Đại học Công nghệ. Đại học Quốc gia Hà Nội, 2012 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 Electronic Resources |
| Kiểu: | text |
| Định dạng: | text/pdf |
You must be registered for see links
You must be registered for see links