The Experts below are selected from a list of 5619 Experts worldwide ranked by ideXlab platform

L M Mackenzie - One of the best experts on this subject based on the ideXlab platform.

  • on balancing network traffic in Path based Multicast communication
    Future Generation Computer Systems, 2006
    Co-Authors: Ahmed Aldubai, M Ouldkhaoua, L M Mackenzie
    Abstract:

    This paper presents a new Multicast Path-based algorithm, referred to here as the Qualified Groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the Multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-Path, multiple-Path, and column-Path algorithm.

  • an efficient Path based Multicast algorithm for mesh networks
    International Parallel and Distributed Processing Symposium, 2003
    Co-Authors: Y Aldubai, M Ouldkhaoua, L M Mackenzie
    Abstract:

    This paper presents a new Multicast Path-based algorithm, referred to here as the qualified groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the Multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-Path, multiple-Path, and column-Path algorithms.

Ahmed Aldubai - One of the best experts on this subject based on the ideXlab platform.

  • on balancing network traffic in Path based Multicast communication
    Future Generation Computer Systems, 2006
    Co-Authors: Ahmed Aldubai, M Ouldkhaoua, L M Mackenzie
    Abstract:

    This paper presents a new Multicast Path-based algorithm, referred to here as the Qualified Groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the Multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-Path, multiple-Path, and column-Path algorithm.

M Ouldkhaoua - One of the best experts on this subject based on the ideXlab platform.

  • on balancing network traffic in Path based Multicast communication
    Future Generation Computer Systems, 2006
    Co-Authors: Ahmed Aldubai, M Ouldkhaoua, L M Mackenzie
    Abstract:

    This paper presents a new Multicast Path-based algorithm, referred to here as the Qualified Groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the Multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-Path, multiple-Path, and column-Path algorithm.

  • an efficient Path based Multicast algorithm for mesh networks
    International Parallel and Distributed Processing Symposium, 2003
    Co-Authors: Y Aldubai, M Ouldkhaoua, L M Mackenzie
    Abstract:

    This paper presents a new Multicast Path-based algorithm, referred to here as the qualified groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the Multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-Path, multiple-Path, and column-Path algorithms.

Mylara Reddy - One of the best experts on this subject based on the ideXlab platform.

  • Link stability based Multicast routing scheme in MANET
    Computer Networks, 2010
    Co-Authors: Rajashekhar C. Biradar, Sunilkumar S. Manvi, Mylara Reddy
    Abstract:

    The group-oriented services are one of the primary application classes that are addressed by Mobile Ad hoc Networks (MANETs) in recent years. To support such services, Multicast routing is used. Thus, there is a need to design stable and reliable Multicast routing protocols for MANETs to ensure better packet delivery ratio, lower delays and reduced overheads. In this paper, we propose a mesh based Multicast routing scheme that finds stable Multicast Path from source to receivers. The Multicast mesh is constructed by using route request and route reply packets with the help of Multicast routing information cache and link stability database maintained at every node. The stable Paths are found based on selection of stable forwarding nodes that have high stability of link connectivity. The link stability is computed by using the parameters such as received power, distance between neighboring nodes and the link quality that is assessed using bit errors in a packet. The proposed scheme is simulated over a large number of MANET nodes with wide range of mobility and the performance is evaluated. Performance of the proposed scheme is compared with two well known mesh-based Multicast routing protocols, i.e., on-demand Multicast routing protocol (ODMRP) and enhanced on-demand Multicast routing protocol (EODMRP). It is observed that the proposed scheme produces better packet delivery ratio, reduced packet delay and reduced overheads (such as control, memory, computation, and message overheads).

Anujan Varma - One of the best experts on this subject based on the ideXlab platform.

  • distributed algorithms for Multicast Path setup in data networks
    IEEE ACM Transactions on Networking, 1996
    Co-Authors: F Bauer, Anujan Varma
    Abstract:

    Establishing a Multicast tree in a point-to-point network of switch nodes, such as a wide-area asynchronous transfer mode (ATM) network, can be modeled as the NP-complete Steiner problem in networks. In this paper, we introduce and evaluate two distributed algorithms for finding Multicast trees in point-to-point data networks. These algorithms are based on the centralized Steiner heuristics, the shortest Path heuristic (SPH) and the Kruskal-based shortest Path heuristic (K-SPH), and have the advantage that only the Multicast members and nodes in the neighborhood of the Multicast tree need to participate in the execution of the algorithm. We compare our algorithms by simulation against a baseline algorithm, the pruned minimum spanning-tree heuristic that is the basis of many previously published algorithms for finding Multicast trees. Our results show that the competitiveness (the ratio of the sum of the heuristic tree's edge weights to that of the best solution found) of both of our algorithms was, on the average, 25% better in comparison to that of the pruned spanning-tree approach. In addition, the competitiveness of our algorithms was, in almost all cases, within 10% of the best solution found by any of the Steiner heuristics considered, including both centralized and distributed algorithms. Limiting the execution of the algorithm to a subset of the nodes in the network results in an increase in convergence time over the pruned spanning-tree approach, but this overhead can be reduced by careful implementation.

  • distributed algorithms for Multicast Path setup in data networks
    Global Communications Conference, 1995
    Co-Authors: F Bauer, Anujan Varma
    Abstract:

    Establishing a Multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, can be modeled as the NP-complete Steiner problem in networks. In this paper, we introduce and evaluate two distributed algorithms for finding Multicast trees in point-to-point data networks. These algorithms are based on two centralized Steiner heuristics, the shortest Path heuristic (SPH) and the Kruskal-based shortest Path heuristic (K-SPH), and have the advantage that only the Multicast members and nodes in the neighborhood of the Multicast tree need to participate in the execution of the algorithm. We compare our algorithms by simulation against a baseline algorithm, the pruned minimum spanning-tree heuristic, which is the basis of many previously published algorithms for finding Multicast trees. Our results show that the competitiveness (the ratio of the sum of the heuristic tree's edge weights to that of the best solution found) of both of our algorithms was on the average 25 percent better in comparison to those produced by the pruned spanning-tree approach. In addition, our algorithm's competitiveness in almost all cases was within 10 percent of the best solution found by any of the Steiner heuristics considered, including both centralized and distributed algorithms.