Font Size: a A A

Research On Algorithms In Qos Multicast Routing

Posted on:2009-09-03Degree:MasterType:Thesis
Country:ChinaCandidate:H L CuiFull Text:PDF
GTID:2198360308978685Subject:Operational Research and Cybernetics
Abstract/Summary:PDF Full Text Request
With recent advances in high-speed communication network, the demand for providing more multi-media applications is increasing. These applications, for instance, can be video on demand,net game,distributed database. These application require the underlying network to providing quality of service (QoS), for example, distributed multimedia applications have various demands on delay, delay variation, bandwidth and packet loss. These requires current network to transmit real-time multimedia information with these quality of service constraints. So research on multicast routing algorithms based on QoS constraint becomes an important part and hotspot issue of network research fields.First, this thesis introduces background and the present research of QoS multicast routing. This thesis concentrates on the multicast routing problem with bounded delay and delay variation. Aiming at the delay constrained multicast routing problem and delay-variation constrained multicast routing problem, we present each algorithm respectively. Generally, the main content and achievements in this paper are as follows:1. This thesis concentrates on multicast routing problem with delay constraint and low cost, we present an integrated heuristic multicast routing algorithm DLCMR algorithm which can be used to optimize delay and network cost is lower. We design a choosing the best link function to reflect the routing algorithms'ability in balancing the delay and the cost. The algotithm based on delay constraint realizes traffic load in networks. Theoretical analysis indicates the time complexity and the correctness of our algorithm2. This thesis concentrates on researching the delay and delay variation constrained minimum Steiner tree problem. And it proposes an effective QoS multicast routing heuristic algorithm DVCMR algorithm to solve this problem. This algorithm translates delay and delay variation constraint into one constraint. That reduces the complexity of the delay and delay variation constrained multicast routing problem. It is proven that the time complexity of DVLCMR algorithm is O(kn3).
Keywords/Search Tags:multicast routing algorithm, quality-of-service, multicast tree, delay constraint, delay variation constraint, least-cost
PDF Full Text Request
Related items