Recently, Li and Pan proposed a deterministic network coding resource optimization method built to overcome the issue of severe performance degradation of networkcoding in the presence of erasures. Considering a mult...
详细信息
ISBN:
(纸本)9781479976003
Recently, Li and Pan proposed a deterministic network coding resource optimization method built to overcome the issue of severe performance degradation of networkcoding in the presence of erasures. Considering a multicast scenario, their method relied on the use of Ant Colony Optimization (ACO) to find shortest disjoint paths from a source to each sink and identified the coding nodes as the heads of the overlapping path segments among multiple sinks. Although their technique appears to be suitable for the small artificial topologies on which it has been exemplified, there is no clear study regarding the scalability of the proposed solution for larger Internet-like networks where properties such as clustering are observed. Throughout this paper we point out and provide solutions to several problematic aspects that were not previously brought up for discussion. We conduct extensive network measurements on scale-free networks, deriving a probability function for link erasures and construct a software simulation platform to assess and enhance the practicality of their solution.
Starting from a recently proposed networkcoding resource optimization method, we discuss the scalability of this solution to larger scale-free topologies that are also characterized by a realistic link loss distribut...
详细信息
ISBN:
(纸本)9781479976003
Starting from a recently proposed networkcoding resource optimization method, we discuss the scalability of this solution to larger scale-free topologies that are also characterized by a realistic link loss distribution which we derive from measurements. We sketch a possibility of designing a networkcoding aware multicast routing scheme for hierarchical networks.
作者：
Wu, H.Zheng, J.Southeast Univ
Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China Xidian Univ
State Key Lab Integrated Serv Networks Xian 710071 Shaanxi Peoples R China
This study proposes a networkcoding-based RETransmission (CoRET) mechanism for supporting multicast service in mobile communication networks. CoRET introduces deterministic network coding to improve retransmission ef...
详细信息
This study proposes a networkcoding-based RETransmission (CoRET) mechanism for supporting multicast service in mobile communication networks. CoRET introduces deterministic network coding to improve retransmission efficiency and retransmission reliability. To support CoRET, a couple of efficient packet selection algorithms are proposed, one is called 'Most-Least' selection and the other is called Hamming distance-based ('Hamming-D') selection, to select packets when performing networkcoding for retransmission. Most-Least selects the packets with the most retransmission requests and the least retransmission requests, whereas Hamming-D selects the packets with the largest Hamming distance. Simulation results show that with Most-Least or Hamming-D CoRET outperforms an existing retransmission scheme, 'Random Pick', in terms of both retransmission efficiency and retransmission reliability. To achieve the best performance of the Hamming-D algorithm, a mathematical model is further developed to analyse the impact of the number of original packets encoded into a packet for retransmission on the retransmission performance to find an optimal encoding number that can achieve the best performance.
暂无评论