A heuristic routing algorithm for network coding aware 1+1 protection route design for instantaneous recovery

Author(s):  
Abu Hena Al Muktadir ◽  
Eiji Oki
2012 ◽  
Vol 1 (1) ◽  
pp. 28-32 ◽  
Author(s):  
Agostinho Antonio Jose ◽  
Abu Hena Al Muktadir ◽  
Eiji Oki

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Huanlin Liu ◽  
Qinren Shen ◽  
Yong Chen

Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the formerKshortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.


2018 ◽  
Vol 12 (1) ◽  
pp. 2-8 ◽  
Author(s):  
Wenchao Xu ◽  
Meng Jiang ◽  
Feilong Tang ◽  
Yanqin Yang

2013 ◽  
Vol 756-759 ◽  
pp. 2214-2219 ◽  
Author(s):  
Yu Kun Yao ◽  
Zhi Hu Liu ◽  
Zhi Ren ◽  
Ya Di Wen

To address the problems in Opportunistic Networks that nodes employing routing algorithms based on epidemic mechanism cant sense their neighboring nodes timely and many redundant data packets permeate through the network, an efficient routing algorithm based on XOR network coding was proposed (Xor Network Coding based Epidemic Routing, XNCER). When a node gets a Hello message, it broadcasts, instead of unicasting, a SV(Summary Vector) packet, in return, to all its neighboring nodes. Therefore, the data transmission can be initiated immediately, and the XOR network coding can also be leveraged so as to enhance the efficiency of data transmission. Moreover, the packets destined to the one hop neighboring nodes obtain the priority in transmission, and are determined whether to be deleted based on the ACK mechanism running in the MAC layer in order to cut down the memory overhead and restrain redundant packets from dissemination. Theoretical analysis and extensive simulation results show that the new algorithm obtains an overall improvement in terms of network overhead, average end-to-end delay as well as delivery rate. The novel algorithm can effectively solve the problems of sensing neighboring nodes and data redundancy.


Author(s):  
Tao Shaoguo ◽  
Huang Jiaqing ◽  
Yang Zongkai ◽  
Rami S. Youail ◽  
Cheng Wenqing

2013 ◽  
Vol 765-767 ◽  
pp. 1775-1779
Author(s):  
Ding De Jiang ◽  
Ya Li ◽  
Wei Han Zhang ◽  
Wen Pan Li ◽  
Chun Ping Yao

In this paper, an energy-efficient multicast routing algorithm in multi-hop wireless networks is proposed aiming at new generation wireless communications. Different from the previous methods, this paper targets maximizing the energy efficiency of networks. In order to get the optimal energy efficiency to build the network multicast route, our proposed method tries to maximize the network throughput and minimize the network energy consumption by exploiting network coding and sleeping scheme. Simulation results show that the proposed algorithm has better energy efficiency and performance improvements comparing with the existing methods.


2014 ◽  
Vol 35 (4) ◽  
Author(s):  
Huanlin Liu ◽  
Bangtao Zhou ◽  
Yong Chen

AbstractMulticast routing based on network coding can save large wavelength channels with high network coding operation costs for the all-optical WDM network. An optical multicast routing algorithm based on minimum network coding cells to reach the multicast max-flow is proposed in the paper. The algorithm selects path in the


Sign in / Sign up

Export Citation Format

Share Document