Multicast, or one-to-many, communication arises frequently in parallel computing and telecommunication applications. Multicast networks can simultaneously support multiple multicast connections between the network inputs and network outputs. However, due to the complex communication patterns and routing control in multicast networks, there is still a considerably large gap in network cost betwe...

Today, the use of anycast address is quite limited. One of the reasons is that there is no routing protocol providing a global anycasting service. In this paper we design and implement a new anycast routing protocol called PIA-SM (Protocol Independent Anycast – Sparse Mode). We focus on PIM-SM (Protocol Independent Multicast – Sparse Mode), which is one of multicast routing protocols available ...

As a NP-Complete problem, multicast routing with delay constraint is a research difficulty in routing problem. Tabu Search is artificial intelligence algorithm, which is an extension of local search algorithm and has simple realization and well properties. In this paper, an efficient algorithm based on Tabu Search for Delay-Constrained Low-Cost Multicast Routing is proposed to solve delay-const...

IP Multicast is a hotly debated topic since many years. F o r t h i s many reasons are responsible. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This paper proposes HBH (Hop-ByHop multicast routing pr...

1 Technical University of Cluj-Napoca, Communications Department, 26-28 Baritiu Street, 400027 Cluj-Napoca, Romania, Tel/Fax: +40-264-597083, E-mail: {Tudor.Blaga, Virgil.Dobrota}@com.utcluj.ro Abstract – This paper is focused on the study of routing protocols in IPv4 and IPv6. Their classification is based on type of updating (distance-vector versus link-state), working domains (intraversus in...

1 Technical University of Cluj-Napoca, Department of Communications, 26-28 Baritiu Street, 400027 Cluj-Napoca, Romania, Tel/Fax: +40-264-597083, E-mail: {Tudor.Blaga, Virgil.Dobrota, Daniel.Zinca, Gabriel.Lazar}@com.utcluj.ro Abstract – This paper is focused on the study of multicast routing protocols in IPv4 and IPv6. The work is backed up by the practical experiments, using the GateD software...

Multicast routing algorithms for mobile ad-hoc networks have been extensively researched in the recent past. In this paper, we present two algorithms for dealing with multicast routing problem using the notion of virtual forces. We look at the effective force exerted on a packet and determine whether a node could be considered as a Steiner node. The nodes' location information is used to genera...

This paper addresses the problem of multicast (i.e., mul-tipoint) routing in computer networks carrying a mix of uni-cast and multicast traac. In particular, we derive a closed form mathematical expression to predict the average link usage for multicast calls in a two-dimensional rectangular mesh network. The analytical expression is used to evaluate the relative performance of three simple mul...

Multicast support in a Multipro-tocol Label Switching (MPLS) network has yet to be deened. An MPLS network consists of label switching devices such as ATM. This document discusses both dense-mode and sparse-mode IP multicast within the context of MPLS networks. Unlike unicast routing, dense-mode multicast routing trees are established in a data-driven manner and it is not possible to topologica...

Multicast is a convenient and important mode of communication in internetworks, and there has been a number of studies on eecient routing of multicast traac. In particular , simulation has been performed to evaluate the trade-oos between source-speciic trees and shared trees, and between various routing algorithms. In this paper, we show that the consideration of security brings a new set of tr...