Font Size: a A A

The Research Of Key Algorithms In QoS Multicast Routing

Posted on:2007-10-18Degree:MasterType:Thesis
Country:ChinaCandidate:D L ZouFull Text:PDF
GTID:2178360212957332Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
With the development of network technologies, improvement of link bandwidth and node processing capacity, current network can provide more real-time multimedia services. Meanwhile, many distributed multimedia services bring forward higher requirements on delay,delay variation,bandwidth and packet loss, and so on, which mean the support of quality-of-service (QoS) constraints. In addition, multicast communication has already replaced unicast communication and becomes the primary communication mode in the "one-to-many" and "many-to-many" services, by right of its less bandwidth need and radically lightening network load. Therefore, as an indispensable component in QoS-centric network architecture, research of algorithms in QoS multicast routing becomes an important part and hotspot issue of network research fields.This paper concentrates on research of key algorithms in QoS multicast routing, proposes several effective and practical resolutions to solve some classical multicast routing problems. The main contents and achievements in this paper are as follows:(1) To solve the problem of delay-constrained least cost multicast routing, an improved genetic algorithm is proposed, which can greatly decrease tranditional genetic algorithm's running time and finally return a least cost tree; to solve the problem of delay and delay-variation constrained least cost multicast routing, an algorithm based on dynamic penalty function and tabu search is proposed, which is also proved of holding better performances on the cost, delay and delay variation of the multicast tree.(2) To solve QoS-constrained routing problem and the problem of balancing network load, an algorithm based on tabu search is proposed, which has a better ability of balancing the cost of the multicast tree and the network load; upon this algorithm, a new algorithm based on degree-constrained and load-balance is proposed, which has a nicer integrative performance on equipoise the cost of multicast tree and the load of links and nodes.(3) To solve the multi-service QoS routing problem based on imprecise link state information an algorithm is proposed; on the basis of this algorithm, a new algorithm is proposed which considers the problem of node joining or leaving within a service's period, and this problem is usually called dynamic problem. The algorithm can get a multicast tree with lower cost and have a high accepting rate of requests.The algorithms above are asserted by the result of simulations.
Keywords/Search Tags:QoS multicast routing algorithm, Least cost, Tabu search, Load balance, Imprecise link state information
PDF Full Text Request
Related items