Elsevier

Computer Communications

Volume 20, Issue 12, 1 November 1997, Pages 1098-1106
Computer Communications

A real-time multicast routing algorithm for multimedia applications

https://doi.org/10.1016/S0140-3664(97)00095-9Get rights and content

Abstract

Multicast routing in real-time applications has two important requirements: minimal network cost and shortest network delay. It is very difficult to meet one requirement without compromising the other. This paper presents a real-time multicast routing algorithm which minimizes overall network cost without letting the delay from a source to any destination exceed a real-time constraint. The multicast routing with optimal overall network cost is an NP-complete problem. Our algorithm is based on the idea of the minimum spanning tree heuristic. Simulations have been done to compare the routing generated by our algorithm with those by other major algorithms.

References (16)

  • S.Y. Ammar et al.

    Scoglio, Routing multipoint connections using virtual paths in an ATM network

  • S. Ahn et al.

    A load balancing multicast tree approach for group-based multimedia applications

  • G.D.S. Johnson

    Computers and Intractability: A Guide to the Theory of NPcompleteness

    (1979)
  • K. Bharath-Kumar et al.

    Routing to multiple destinations in computer networks

    IEEE Trans. Commun.

    (1983)
  • T.H. Cormen et al.

    Introduction to Algorithms

    (1992)
  • R.L. Cruz

    A calculus for Network Delay and a Note on Topologies of Interconnection Networks

  • D. Ferrari et al.

    A scheme for real-time channel establishment in wide-area networks

    IEEE J. Selected Areas Commun.

    (1990)
  • E.N. Gilbert et al.

    Steiner minimal tree

    SIAM J. Appl. Math.

    (1968)
There are more references available in the full text version of this article.

Cited by (22)

  • A green intelligent routing algorithm supporting flexible QoS for many-to-many multicast

    2017, Computer Networks
    Citation Excerpt :

    In addition, considering that the user QoS requirements are greatly affected by subjective factors, such as his expectation, experience, physical and mental state, personal background (age, sex, education degree), and so on, hence are hard to be described precisely, and thus we adopt the form of interval to depict a user's inexact QoS requirements and provide flexible QoS support to him. The multicast routing with QoS constraints is known to be NP-Complete [26], which is a relaxed problem concerned by us, i.e., the many-to-many multicast routing with power consumption minimized and user satisfaction degree on QoS maximized under QoS requirement and system capacity constraints. Thus, the problem to be solved in this paper is NP-Complete.

  • Multiple many-to-many multicast routing scheme in green multi-granularity transport networks

    2015, Computer Networks
    Citation Excerpt :

    According to [46] and [47], the well-known routing and wavelength assignment (RWA) problem in optical WDM networks and QoS multicast routing problem in IP networks are NP-complete, and their mathematic formulations are the subsets of that of the problem to be solved in this paper. Under more constraints to be followed and with more objectives to be optimized, it is more complex mathematically than the problems in [46] and [47], and thus we propose a heuristic algorithm for it to find feasible solutions. The proposed routing scheme in this paper is oriented to the green multi-granularity transport networks.

  • Interference and power constrained broadcast and multicast routing in wireless ad hoc networks using directional antennas

    2010, Computer Communications
    Citation Excerpt :

    Broadcast and multicast are the important functions in applications of wireless ad hoc networks. There have been a lot of works on energy efficient broadcast/multicast routing [5–12]. However, most of these works do not take into account the low interference energy efficiency as optimization objectives simultaneously.

  • QoS multicast routing for multimedia group communications using intelligent computational methods

    2006, Computer Communications
    Citation Excerpt :

    Another example is that during a real-time streaming of stock quotes, the messages from the information source should be received at different user terminals simultaneously, otherwise, the users who receive the messages at later time probably lose the chance of making profit. To efficiently support multimedia group communications, the most important issue that needs to be addressed is QoS multicast [4–10]. An efficient QoS multicast algorithm should construct a multicast routing tree, by which the data can be transmitted from the source to all the destinations with guaranteed QoS.

View all citing articles on Scopus
View full text