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

Keqin Zhu - One of the best experts on this subject based on the ideXlab platform.

  • IPDPS - Fault recovery for a distributed SP-based delay constrained Multicast Routing Algorithm
    Proceedings 16th International Parallel and Distributed Processing Symposium, 2002
    Co-Authors: Hasan Ural, Keqin Zhu
    Abstract:

    This paper proposes a new distributed shortest path (SP) based delay constrained Multicast Routing Algorithm which is capable of constructing a delay constrained Multicast tree when node,failures occur during the tree construction period and recovering from any node failure in a Multicast tree during the on-going Multicast session without interrupting the running traffic on the unaffected portion of the tree. The proposed Algorithm performs the failure recovery efficiently, which gives better performance in terms of the number of exchanged messages and the convergence time than the existing distributed SP-based delay constrained Multicast Routing Algorithms in a network where node failures occur.

  • An efficient distributed QoS based Multicast Routing Algorithm
    Conference Proceedings of the IEEE International Performance Computing and Communications Conference (Cat. No.02CH37326), 1
    Co-Authors: Hasan Ural, Keqin Zhu
    Abstract:

    This paper proposes an efficient distributed Multicast Routing Algorithm that provides quality of service (QoS) guarantees for real-time applications. It focuses on the delay-constrained minimum cost tree (or constrained Steiner tree) problem; that is, it constructs a Multicast tree that not only meets the constrained end-to-end delay requirements but also is the minimum cost Multicast tree. Two representative Algorithms DKPP and DSPH are MST and SP based heuristics, respectively. The MST based Algorithms like DKPP run with a high message and time complexity of O(n/sup 3/). Furthermore, the MST based Algorithms have a very low success rate in constructing a constrained Multicast tree especially under tight delay constraints. On the other hand, the SP based Algorithms like DSPH have a fatal deficiency; that is, these Algorithms will not be able to find a solution if the delay constraint is less than the maximum delay of a cost based shortest path tree. Both types of Algorithms try to construct the Multicast tree sequentially without taking advantage of the concurrency in a distributed Algorithm. This paper proposes an efficient distributed Multicast Routing Algorithm which builds the Multicast tree in a concurrent manner rather than in a sequential manner. As a result, the proposed Algorithm runs with a very low message and time complexity and has a near zero failure rate in constructing a Multicast tree even under tight delay constraints without any limitation on the value of delay constraints.

  • Fault recovery for a distributed QoS-based Multicast Routing Algorithm
    Proceedings 2001 International Conference on Computer Networks and Mobile Computing, 1
    Co-Authors: Hasan Ural, Keqin Zhu
    Abstract:

    This paper proposes a new minimum spanning tree (MST) based distributed QoS-based Multicast Routing Algorithm which is capable of constructing a delay constrained Multicast tree when node failures occur during the tree construction period and recovering from any node failure in a Multicast tree during the on-going Multicast session without interrupting the running traffic on the unaffected portion of the tree. The proposed Algorithm performs the failure recovery efficiently, which gives better performance in terms of the number of exchanged messages and the convergence time than the existing MST based distributed Multicast Routing Algorithms.

Yu Ping - One of the best experts on this subject based on the ideXlab platform.

  • A Survey on Multicast Routing Algorithm Based on Multiple QoS Constrained
    Computer Science, 2007
    Co-Authors: Yu Ping
    Abstract:

    This paper discusses the Multicast Routing problem with multiple QoS constraints,which may deal with the delay,bandwidth and cost metrics,and presents a network model for researching the Routing problem.It proposes a dy- namic Multicast Routing Algorithm with multiple QoS constraints.Simulations are showed to prove that the Algorithm is effective and stable.It can minimize the Multicast tree cost without violating the multi-constrained.

Nianshen Chen - One of the best experts on this subject based on the ideXlab platform.

  • SNPD (1) - A QoS Multicast Routing Algorithm for Wireless Mesh Networks
    Eighth ACIS International Conference on Software Engineering Artificial Intelligence Networking and Parallel Distributed Computing (SNPD 2007), 2007
    Co-Authors: Zongwu Ke, Layuan Li, Qiang Sun, Nianshen Chen
    Abstract:

    Wireless Mesh Networks (WMNs) have emerged as a key technology for the next-generation wireless networking. Because of their advantages over other wireless networks, WMNs have been wildly accepted in the traditional application sectors of ad hoc network. With increasing demand for real-time services in the next generation wireless networks, quality-of-service (QoS)-based Routing offers significant challenges in WMNs. In this paper we propose a multi-constrained QoS-based Multicast Routing Algorithm using the advantage of wireless mesh network. The multi- constrained QoS-Multicast Routing has been proved an NP-hard problem. Based on CHC genetic Algorithm approach, our solution attempts to optimize multiple QoS parameters simultaneously. The CHC selection can preserve the eminent individual in parent population that can solve the problem caused by random select of base GA. In this paper, we use the edge-set to represent Multicast tree and we describe initialization, crossover, and mutation operators for this representation. The Simulation results demonstrate that our Algorithm is efficient for the wireless mesh networks.

  • A QoS Multicast Routing Algorithm for Wireless Mesh Networks
    Eighth ACIS International Conference on Software Engineering Artificial Intelligence Networking and Parallel Distributed Computing (SNPD 2007), 2007
    Co-Authors: Zongwu Ke, Layuan Li, Qiang Sun, Nianshen Chen
    Abstract:

    Wireless Mesh Networks (WMNs) have emerged as a key technology for the next-generation wireless networking. Because of their advantages over other wireless networks, WMNs have been wildly accepted in the traditional application sectors of ad hoc network. With increasing demand for real-time services in the next generation wireless networks, quality-of-service (QoS)-based Routing offers significant challenges in WMNs. In this paper we propose a multi-constrained QoS-based Multicast Routing Algorithm using the advantage of wireless mesh network. The multi- constrained QoS-Multicast Routing has been proved an NP-hard problem. Based on CHC genetic Algorithm approach, our solution attempts to optimize multiple QoS parameters simultaneously. The CHC selection can preserve the eminent individual in parent population that can solve the problem caused by random select of base GA. In this paper, we use the edge-set to represent Multicast tree and we describe initialization, crossover, and mutation operators for this representation. The Simulation results demonstrate that our Algorithm is efficient for the wireless mesh networks.

Zhenhua Chen - One of the best experts on this subject based on the ideXlab platform.

  • topology control based collaborative Multicast Routing Algorithm with minimum energy consumption
    International Journal of Communication Systems, 2017
    Co-Authors: Zhengzheng Xu, Dingde Jiang, Wenpan Li, Zhenhua Chen
    Abstract:

    SUMMARY This paper studies the Multicast Routing problem in the multi-hop wireless network. We exploit topology control to put forward a Multicast Routing Algorithm with minimum energy consumption. First, network nodes are classified as different clusters. Then, the end-to-end Multicast Routing is appropriately built by using the cooperation among clusters and in each cluster and by minimizing the energy consumption. Unlike previous methods, we employ the appropriate cooperation among/in clusters and the optimal cross-layer design to attain the information from the different layers and the different nodes. In a result, on the basis of the information, the needed clusters of nodes are correctly created. This is helpful to avoid clustering blindly network nodes and to reduce computational overheads. Simulation results show that the proposed Algorithm is promising and effective. Copyright © 2014 John Wiley & Sons, Ltd.

  • network coding based energy efficient Multicast Routing Algorithm for multi hop wireless networks
    Journal of Systems and Software, 2015
    Co-Authors: Dingde Jiang, Zhenhua Chen
    Abstract:

    We study energy-efficient Multicast communication in multi-hop wireless networks.We present energy-efficient network model for multi-hop wireless networks.We exploit network coding idea to improve energy efficiency of networks.We propose the corresponding Algorithm and perform detailed simulation analysis. Multi-hop Multicast Routing can provide better communication performance in multi-hop wireless networks. However, existing multi-hop Multicast Routing hardly take into account energy efficiency of networks. This paper studies the energy-efficient Multicast communication aiming at multi-hop wireless networks. Firstly, we analyze energy metric and energy efficiency metric of multi-hop networks. Then the corresponding models are given. Secondly, network coding is used to improve network throughput. Different from previous methods, we here consider that network nodes are satisfied with a certain random distribution. In such a case, it is a challenge to construct the network structure that network coding requires. For the above random network topology, we propose three basic structures of network coding to overcome this problem. Thirdly, we present a flexible energy-efficient Multicast Routing Algorithm for multi-hop wireless networks to extensively exploit the network structure proposed above to maximize network throughput and decrease network energy consumption. Finally, we perform numerical experiments by network simulation. Simulation results indicate that our approach is significantly promising.

  • A Multicast Routing Algorithm in cognitive ad hoc networks
    2010
    Co-Authors: Zhenhua Chen, Dingde Jiang, Yang Han, Peng Zhang
    Abstract:

    This paper investigates the global optimal Multicast Routing in the cognitive ad hoc networks, which is based on the directional antenna model. By analyzing directional antenna model and based on the end-to-end performance parameters, a Multicast Routing Algorithm, which is to obtain the global optimal performance and refers to the energy utilization as metric, is proposed. Simulation results show that the Routing Algorithm put forward can obtain the maximum lifetime of a Multicast tree effectively, and obtain the optimal end-to-end performance at the same time. This shows the effectiveness and feasibility of our Algorithm.

Shao Birui - One of the best experts on this subject based on the ideXlab platform.

  • GCC - An Energy-Balanced Multicast Routing Algorithm in Wireless Sensor Networks
    2010 Ninth International Conference on Grid and Cloud Computing, 2010
    Co-Authors: Wang Fangfang, Tao Jun, Shao Birui
    Abstract:

    An energy-balanced Multicast Routing Algorithm EBMR in wireless sensor networks (WSNs) is proposed. The objective of EMBR Algorithm is to improve the energy efficiency and extend the network lifetime in Multicast. To achieve this goal, the energy consumption model in WSNs is analyzed and an energy-constrained metric for Multicast forwarder selecting is studied. Then the framework of EBMR Algorithm is discussed. Simulation results show that EBMR Algorithm is able to reduce energy consumption of the whole network evenly. Compared with shortest path tree (SPT) Multicast Routing Algorithm, EMBR Algorithm will extend the network lifetime.