Evaluation of multicast routing algorithms for real-time communication on high-speed networks

Salama, Hussein F.; Reeves, Douglas S.; Viniotis, Yannis

doi:10.1109/49.564132

Cited by 287 publications

(66 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Chow [4] and Salama et al [5] proposed two exact algorithms for implementing multicast routing, but they are not viable in very large networks, because of their high degree of computational complexity. Heuristics proposed by Kompella et al [6], Widyono [7], Parsa et al [8] are the famous methods used to solve multicast routing problem, because they construct a feasible solution within reasonable time.…”

Section: Introductionmentioning

confidence: 99%

Neural networks based on adjustable-order statistic filters for multimedia multicast routing

Saber

Khouil

Mestari

2014

2014 Third IEEE International Colloquium in Information Science and Technology (CIST)

View full text Add to dashboard Cite

Multicast routing in communication networks is to transmit information from a single source to multiple destinations, using the network resources very effectively, and respecting several constraints, such as delay, cost, bandwidth or other. To guarantee optimal diffusion, it is necessary to determine a tree that connects the source node to all destination nodes minimizing the use of resources. In this paper, we propose an artificial neural network for the construction of the multicast tree, based on adjustable-order statistic filters. Our approach for solving this problem differs from the conventional approach used in the field of neural networks. Our primary concern is how to organize neurons into a network so that it can solve a specific problem, with an emphasis on fully utilizing the massive parallelism property offered by neural networks.

show abstract

Section: Introductionmentioning

confidence: 99%

Neural networks based on adjustable-order statistic filters for multimedia multicast routing

Saber

Khouil

Mestari

2014

2014 Third IEEE International Colloquium in Information Science and Technology (CIST)

View full text Add to dashboard Cite

show abstract

“…Typically, the shortest path based algorithms and Steiner tree based algorithms [7,9,20,23] are used as route selection algorithms, where the Steiner tree use minimum spanning tree algorithms due to Kruskal's [5] and Prim's [5] to minimize the cost of a tree that connects a source to a subset of nodes of a network. Salama [16] presents an excellent survey of various multicasting problems and algorithms. Using the shortest path based algorithms, a multicast tree is constructed by merging optimal paths from the source s to each of the destinations d ∈ MG, where MG is the multicast group, whereas the Steiner tree (or the minimum spanning tree) based algorithms organize a multicast tree that minimize the network resources in terms of the tree cost, where the tree cost is defined by summing costs of all links in the tree.…”

Section: Introductionmentioning

confidence: 99%

On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture

Bang

Choo

2005

J Supercomput

View full text Add to dashboard Cite

We have developed a novel algorithm to adjust link-bandwidths of a given multicast tree, which sends a message with size r from a source to a multiple destinations taking into consideration pipelined router. The algorithm that we have developed tries to minimize the end-to-end delay time and resources such as bandwidths of a multicast tree, and performs admirably well in any given multicast tree. Our evaluation shows that the proposed algorithm dramatically reduces the end-to-end delay time and resources reserved to satisfy the time-constraints.

show abstract

“…The bounded end-to-end delay [39], [29]. Other related end-to-end QoS metrics are the packet loss ratio and the required bandwidth of a connection, while end-to-end path length is a routing metric strongly correlated to QoS [46].…”

Section: Introductionmentioning

confidence: 99%

QoS-aware multicast routing for the Internet: the design and evaluation of QoSMIC

Yan¹,

Faloutsos

Banerjea³

2002

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

One of the main problems of the current Internet infrastructure is its inability to provide services at consistent quality-of-service (QoS) levels. At the same time, many emerging Internet applications, such as teleeducation, and teleconferencing, require multicast protocols that will provide the necessary QoS. In this paper, we propose QoSMIC, a multicast routing protocol for the Internet, that provides QoS-sensitive paths in a scalable, resource-efficient, and flexible way. QoSMIC differs from the previous protocols in that it identifies multiple paths and selects the one that can provide the required QoS. Two other key advantages of QoSMIC are its flexibility and adaptivity. First, the distribution tree does not have to be rooted at a preselected core router. Second, we can tradeoff between efficiency metrics depending on our needs; for example, we can tradeoff routing efficiency for a reduction in the control messages. Extensive simulations show that our protocol improves the resources utilization and the end-to-end performance compared to the current protocols. Specifically, our protocol reduces the call blocking probability by a factor of six and reduces the end-to-end delay by as much as 90% compared to the PIM protocol.Index Terms-Multicast routing, protocol evaluation, quality of service.

show abstract

Evaluation of multicast routing algorithms for real-time communication on high-speed networks

Cited by 287 publications

References 22 publications

Neural networks based on adjustable-order statistic filters for multimedia multicast routing

Neural networks based on adjustable-order statistic filters for multimedia multicast routing

On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture

QoS-aware multicast routing for the Internet: the design and evaluation of QoSMIC

Contact Info

Product

Resources

About