Font Size: a A A

Research Of QoS-based Multicast Routing Algorithm And Network Simulations

Posted on:2006-06-25Degree:MasterType:Thesis
Country:ChinaCandidate:Y ZhangFull Text:PDF
GTID:2168360152489040Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
This thesis introduces multicast routing protocols and the method of constructing the spanning tree, describing the question model of Steiner tree supporting QoS constraint and presenting DMPH that is the arithmetic about the delay and cost constraint. Then this thesis puts DMPH into use in Core Based Tree(CBT), which can achieve the aim of improving service quality of CBT. Experiment shows that CBT improved was more efficient than the traditional algorithms.This thesis has seven chapters as below:Chapter 1 introduces the concept of mulsticast routing network, and introduces its use, and then analyses its characteristic and research hotspot, also introduces the origin and research meaning of this article.Chapter 2 describes in detail multicast routing protocols and the system of QoS guarantee.Chapter 3 brings the concept of network simulator, and introduces the configuration of the free free software NS2, and achieves an algorithm of computing delay.Chapter 4 introduces the algorithms of static Steiner-tree, and expounds its definition and the model of question. An algorithm of of static Steiner-tree is given, namely KTMPH. The availability and complexity of KTMPH have been proved.Chapter 5 expatiates dealy and cost based Steiner-tree, gives a new algorithm based on delay and cost constraint, namely DMPH. The experiment shows that it has lower complexity and nicer performance than the traditional algorithms.Chapter 6 integrates the DMPH with CBT and proposes an algorithm about QoS constrained routing protocol, namely DCMA. The experimental results show that while the the protocol improved is executed, the average top's number of the multicast nodes tops joining a multicast tree is more than CBT's, the delay of end-to-end and tree delay is lower.Chapter 7 summarizes this thesis, and suggestions for future research are given.This thesis mainly makes contribution to researching with the new method of integrating Steriner-tree arithmetic with multicast routing protocol. In experiment, NS2 has simulated the running state of the improved CBT protocol and showed its working process.
Keywords/Search Tags:QoS routing, multicast, Steiner-tree, delay constraint, CBT
PDF Full Text Request
Related items