A heuristic algorithm of establishing a minimum coding nodes multicast tree on which a two-channel all-optical network coding scheme can be performed is presented. To minimize the coding nodes, the heuristic graph-sea...A heuristic algorithm of establishing a minimum coding nodes multicast tree on which a two-channel all-optical network coding scheme can be performed is presented. To minimize the coding nodes, the heuristic graph-search control strategies are investigated. Firstly, a minimum relatedness principle is proposed to balance and minimize the out-degrees of the conventionally directed multicast tree. Secondly, a set of rules about bottom-up path search are presented to recover another path in the conventionally directed multicast tree, and a conflict-backtracking principle is given to minimize the coding nodes in this process. To evaluate the algorithm, some results are given. The results indicate that the algorithm can perform the expected function. Moreover, to further test and verify the algorithm, performances of different multicast modes are compared and analyzed. The results show that the multicast performances will be impaired if a multicast tree contains redundant coding nodes.展开更多
Providing services on demand is a major contributing factor to drive the increasingly development of the software defined network. However, it should supply all the current popular applications before it really attain...Providing services on demand is a major contributing factor to drive the increasingly development of the software defined network. However, it should supply all the current popular applications before it really attains widespread development. Multiple Description Coding(MDC) video applications, as a popular application in the current network, should be reasonably supported in this novel network virtualization environment. In this paper, we address this issue to assign MDC video application into virtual networks with an efficient centralized algorithm(CAMDV). Since this problem is an NP-hard problem, we design an algorithm that can effectively balance the user satisfaction and network resource cost. Previous work just builds a global multicast tree for each description to connect all the destination nodes by breadth-first search strategy or shortest path tree algorithm. But those methods could not achieve an optimal balance or a high-level user satisfaction. By introducing the hierarchical clustering scheme, our algorithm decomposes the whole mapping procedure into multicast tree construction and multipath description distribution. A serial of simulation experiments show that our centralized algorithm could achieve a better performance in balancing the user satisfaction and average mapping cost in comparison with its rivals.展开更多
针对现有的多跳无线网络中基于网络编码的可靠组播算法,节点在数据恢复阶段存在冗余的控制开销和编码包的冗余传输问题,提出一种基于网络编码的高效可靠组播路由算法(high-efficiency reliable multicast routing algorithm based on ne...针对现有的多跳无线网络中基于网络编码的可靠组播算法,节点在数据恢复阶段存在冗余的控制开销和编码包的冗余传输问题,提出一种基于网络编码的高效可靠组播路由算法(high-efficiency reliable multicast routing algorithm based on network coding,HMNC)。该算法通过采取在数据恢复阶段用组播树上游节点的反馈信息替代下游节点的冗余反馈信息以及新增节点缓存机制等措施达到减小网络控制开销和降低数据的平均恢复时延的目的。理论分析和仿真结果表明,与基于网络编码的可靠组播(network coding reliable multicast,NCRM)算法相比,HMNC算法在节点数据的平均恢复时延、网络控制开销等方面的性能均得到了提升。展开更多
基金supported the National Natural Science Foundation of China (1171103)the Doctoral Research Fund of Shandong University of Technology (4041-411023)
文摘A heuristic algorithm of establishing a minimum coding nodes multicast tree on which a two-channel all-optical network coding scheme can be performed is presented. To minimize the coding nodes, the heuristic graph-search control strategies are investigated. Firstly, a minimum relatedness principle is proposed to balance and minimize the out-degrees of the conventionally directed multicast tree. Secondly, a set of rules about bottom-up path search are presented to recover another path in the conventionally directed multicast tree, and a conflict-backtracking principle is given to minimize the coding nodes in this process. To evaluate the algorithm, some results are given. The results indicate that the algorithm can perform the expected function. Moreover, to further test and verify the algorithm, performances of different multicast modes are compared and analyzed. The results show that the multicast performances will be impaired if a multicast tree contains redundant coding nodes.
基金supported by the National Basic Research Program of China (2012CB315903)the National Science and Technology Support Program (2014BAH24F01)+3 种基金the Program for Key Science and Technology Innovation Team of Zhejiang Province (2011R50010-21, 2013TD20)863 Program of China (2015AA016103)the National Natural Science Foundation of China (61379118)the Fundamental Research Funds for the Central Universities
文摘Providing services on demand is a major contributing factor to drive the increasingly development of the software defined network. However, it should supply all the current popular applications before it really attains widespread development. Multiple Description Coding(MDC) video applications, as a popular application in the current network, should be reasonably supported in this novel network virtualization environment. In this paper, we address this issue to assign MDC video application into virtual networks with an efficient centralized algorithm(CAMDV). Since this problem is an NP-hard problem, we design an algorithm that can effectively balance the user satisfaction and network resource cost. Previous work just builds a global multicast tree for each description to connect all the destination nodes by breadth-first search strategy or shortest path tree algorithm. But those methods could not achieve an optimal balance or a high-level user satisfaction. By introducing the hierarchical clustering scheme, our algorithm decomposes the whole mapping procedure into multicast tree construction and multipath description distribution. A serial of simulation experiments show that our centralized algorithm could achieve a better performance in balancing the user satisfaction and average mapping cost in comparison with its rivals.
