A Hybrid Approach to Quality of Service Multicast Routing in High Speed Networks

Crawford, John (1998) A Hybrid Approach to Quality of Service Multicast Routing in High Speed Networks. Doctor of Philosophy (Ph.D.) thesis, University of Kent at Canterbury. (Full text available)

Postscript
Download (842kB)
[img]
Preview
PDF
Download (599kB)
[img]
Preview

Abstract

Multimedia services envisaged for high speed networks may have large numbers of users, require high volumes of network resources and have real-time delay constraints. For these reasons, several multicast routing heuristics that use two link metrics have been proposed with the objective of minimising multicast tree cost while maintaining a bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient. This thesis presents a detailed analysis and evaluation of these heuristics which illustrate that in some situations their average performance is prone to wide variance for a particular multicast in a specific network. It concludes that the efficiency of an heuristic solution depends on the topology of both the network and the multicast, which is difficult to predict. The integration of two heuristics with Dijkstras shortest path tree algorithm is proposed, to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. The evaluation results show good performance over a wide range of networks (flat and hierarchical) and multicast groups, within differing delay bounds. The more efficient the multicast tree is, the less stable it will be as multicast group membership changes. An efficient heuristic is extended to ensure multicast tree stability where multicast group membership is dynamic. This extension decreases the efficiency of the heuristics solutions, although they remain significantly cheaper than the worst case, a shortest delay path tree. This thesis also discusses how the hybrid and the extended heuristic might be applied to multicast routing protocols for the Internet and ATM Networks. Additionally, the behaviour of the heuristics is examined in networks that use a single link metric to calculate multicast trees and concludes one of the heuristics may be of benefit in such networks.

Item Type: Thesis (Doctor of Philosophy (Ph.D.))
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 24 Aug 2009 15:13
Last Modified: 06 Sep 2011 03:59
Resource URI: http://kar.kent.ac.uk/id/eprint/21585 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year