Low-cost ATM Multicast Routing with Constrained Delays

Waters, A. Gill and Crawford, John (1996) Low-cost ATM Multicast Routing with Constrained Delays. In: Multimedia Telecommunications and Applications. (Full text available)

Download (322kB) Preview
Download (193kB)


An increasing number of networking applications involve multiple participants and are therefore best supported by multicasting. Where multicast applications consume high bandwidth, it is important to minimise the effect on the network by offering economical multicast routes. Many new applications involve real-time components and are therefore also delay-sensitive. This paper discusses reasonably simple techniques for multicast routing which tackle both of these constraints, that is: first, the route makes efficient use of network resources and, secondly, delays to all recipients are kept within a bound. The problem is NP-complete, so we present heuristics which build up a directed graph containing potential routing solutions and use a greedy approach to select a solution from that graph. The heuristics are discussed and evaluated and are shown to offer good results for a variety of situations including both small and large multicast groups. Our approach is also compared with a previous solution to this problem, which has a greater time complexity.

Item Type: Conference or workshop item (UNSPECIFIED)
Uncontrolled keywords: multicast, routing, low cost, delay constrained, Steiner tree, NP complete
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Systems Architecture Group
Faculties > Sciences > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 25 Aug 2009 20:00 UTC
Last Modified: 15 May 2014 13:59 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21319 (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year