• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Wang Miao, Peng Ge, Zhang Yujun, Li Guojie. Altruism Driven Application-Layer Multicast[J]. Journal of Computer Research and Development, 2011, 48(5): 729-735.
Citation: Wang Miao, Peng Ge, Zhang Yujun, Li Guojie. Altruism Driven Application-Layer Multicast[J]. Journal of Computer Research and Development, 2011, 48(5): 729-735.

Altruism Driven Application-Layer Multicast

More Information
  • Published Date: May 14, 2011
  • Selfishness issue is one of big challenges of current application-layer multicast techniques. The selfish participants might stop forwarding data accidentally or deliberately, which will affect the overall streaming quality. To address the selfishness issue in the application-layer multicast, an altruism driven application-layer multicast (ADALM) is presented. ADALM defines an altruism value for each node associative to its contributions to the system. The multicast tree is constructed to place the nodes with greater altruism value at the higher layer of the tree. As compared with other studies in this area, ADALM exhibits innovative advantages in both altruism value computation and multicast tree construction. Firstly, the nodes altruism value is generated from the feedback from its parent and children, which enables the system to detect the selfish nodes effectively. Peers dont need the extra probe messages to measure the QoS of their neighbors. During the process of tree construction and maintenance, only O(lg N) nodes needs to be adjusted. Lastly, the altruism value calculation and multicast tree construction are realized in a decentralized manner without any single point of failure. Simulation results show that even with a significant portion of nodes being selfish, ADALM is able to build a dissemination tree that provides high overall streaming quality with low control overhead.
  • Related Articles

    [1]Zhang Xiaoyu, Shang Tao, Liu Jianwei. Detect-Defray Mechanism Based Motivation Scheme for Selfish Nodes of Network Coding[J]. Journal of Computer Research and Development, 2017, 54(11): 2620-2627. DOI: 10.7544/issn1000-1239.2017.20160777
    [2]Mei Xiaoyong, Li Shixian, Huang Changqin, Zheng Xiaolin. Failure-Recovery-Strategies-Based QoS Estimation for Web Composition Transaction[J]. Journal of Computer Research and Development, 2012, 49(11): 2464-2480.
    [3]Zhang Peiyun, Huang Bo, Sun Yamin. A Web Services Matching Mechanism Based on Semantics and QoS-Aware Aspect[J]. Journal of Computer Research and Development, 2010, 47(5): 780-787.
    [4]Fu Wei, Xiao Nong, and Lu Xicheng. Replica Placement and Update Mechanism for Individual QoS-Restricted Requirement in Data Grids[J]. Journal of Computer Research and Development, 2009, 46(8): 1408-1415.
    [5]Deng Xiaopeng, Xing Chunxiao, Zhang Yong, Cai Lianhong. A QoS-Oriented Approach for Web Service Group Testing[J]. Journal of Computer Research and Development, 2009, 46(8): 1285-1293.
    [6]Chen Ting, Li Jiandong, Zhong Shaobo, Li Changle. A Fair-Oriented Two-Level Scheduling Scheme for QoS Guarantee in WiMAX[J]. Journal of Computer Research and Development, 2009, 46(7): 1094-1101.
    [7]Wang Xianlei, Wu Zhimei. QoS Optimized Spanning Tree for Layer 2 Multicast Applications[J]. Journal of Computer Research and Development, 2007, 44(5): 882-889.
    [8]Zhang Weizhe, Hu Mingzeng, Zhang Hongli, and Liu Kaipeng. A Multiobjective Evolutionary Algorithm for Grid Job Scheduling of Multi-QoS Constraints[J]. Journal of Computer Research and Development, 2006, 43(11): 1855-1862.
    [9]Liao Yuan, Huai Xiaoyong, Li Mingshu. QuCOM: A QoS Management Model for Component System[J]. Journal of Computer Research and Development, 2005, 42(10): 1802-1808.
    [10]Huang Dongjun, Chen Songqiao, and Wang Jianxin. A QoS-Aware Multicast Routing Protocol Based on Centralized and Distributed Algorithms[J]. Journal of Computer Research and Development, 2005, 42(8): 1403-1408.

Catalog

    Article views (715) PDF downloads (450) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return