A Multi-core Shared Tree Algorithm Based on Network Coding for Multi-point Optical Multicast

2015 ◽  
Vol 36 (1) ◽  
Author(s):  
Huanlin Liu ◽  
Yuming Yang ◽  
Yuan Li ◽  
Yong Chen ◽  
Sheng Huang
Keyword(s):  
Network Coding ◽  
Wavelength Division Multiplexing ◽  
Heuristic Method ◽  
Wdm Networks ◽  
Multicast Tree ◽  
Tree Algorithm ◽  
Network Bandwidth ◽  
The Core ◽  
Core Node ◽  
Shared Tree

AbstractWith the growth of multi-point to multi-point multicast applications, the optical network bandwidth resource consumption is increasing rapidly. It attracted more and more researchers to improve the limited wavelength bandwidth utilization for multicast applications in wavelength division multiplexing (WDM) networks. In the paper, a multi-core shared multicast tree algorithm based on network coding is proposed to minimize the fiber link stress. The proposed algorithm includes three processes: searching the core node candidate set excluding core node loop path, selecting the core nodes from the convergence matrix based on heuristic algorithm, and constructing the multi-core nodes shared trees. The convergence matrix based on the heuristic method is constructed for selecting the core nodes from candidate core node set. To improve the limited wavelength utilization, we introduce network coding into the shared tree to compress the transmitting information. The simulation results show that the proposed algorithm’s performance is better than the existing algorithms’ performance in terms of link stress and balance degree.

A Multicast Sparse-Grooming Algorithm Based on Network Coding in WDM Networks

2015 ◽  
Vol 36 (1) ◽  
Author(s):  
Shengfeng Zhang ◽  
Han Peng ◽  
Meng Sui ◽  
Huanlin Liu
Keyword(s):  
Network Coding ◽  
Wavelength Division Multiplexing ◽  
Blocking Probability ◽  
Wdm Networks ◽  
Transmission Mechanism ◽  
Disjoint Paths ◽  
Routing Problem ◽  
Wavelength Division ◽  
Edge Disjoint ◽  
Dynamic Multicast

AbstractTo improve the limited number of wavelength utilization and decrease the traffic blocking probability in sparse-grooming wavelength-division multiplexing (WDM) networks, a multicast sparse-grooming algorithm based on network coding (MCSA-NC) is put forward to solve the routing problem for dynamic multicast requests in this paper. In the proposed algorithm, a traffic partition strategy, that the coarse-granularity multicast request with grooming capability on the source node is split into several fine-granularity multicast requests, is designed so as to increase the probability for traffic grooming successfully in MCSA-NC. Besides considering that multiple destinations should receive the data from source of the multicast request at the same time, the traditional transmission mechanism is improved by constructing edge-disjoint paths for each split multicast request. Moreover, in order to reduce the number of wavelengths required and further decrease the traffic blocking probability, a light-tree reconfiguration mechanism is presented in the MCSA-NC, which can select a minimal cost light tree from the established edge-disjoint paths for a new multicast request.

Maximization Network Throughput Based on Improved Genetic Algorithm and Network Coding for Optical Multicast Networks

2017 ◽  
Vol 39 (1) ◽  
Author(s):  
Chengying Wei ◽  
Cuilian Xiong ◽  
Huanlin Liu
Keyword(s):  
Genetic Algorithm ◽  
Network Coding ◽  
Wavelength Division Multiplexing ◽  
Multicast Routing ◽  
Fitness Function ◽  
Wdm Networks ◽  
Network Throughput ◽  
Improved Genetic Algorithm ◽  
Wavelength Division ◽  
Optical Multicast

AbstractMaximal multicast stream algorithm based on network coding (NC) can improve the network’s throughput for wavelength-division multiplexing (WDM) networks, which however is far less than the network’s maximal throughput in terms of theory. And the existing multicast stream algorithms do not give the information distribution pattern and routing in the meantime. In the paper, an improved genetic algorithm is brought forward to maximize the optical multicast throughput by NC and to determine the multicast stream distribution by hybrid chromosomes construction for multicast with single source and multiple destinations. The proposed hybrid chromosomes are constructed by the binary chromosomes and integer chromosomes, while the binary chromosomes represent optical multicast routing and the integer chromosomes indicate the multicast stream distribution. A fitness function is designed to guarantee that each destination can receive the maximum number of decoding multicast streams. The simulation results showed that the proposed method is far superior over the typical maximal multicast stream algorithms based on NC in terms of network throughput in WDM networks.

Core Selection to Solve Multicast Routing with Delay and Delay-Variation Constraints

2014 ◽  
Vol 556-562 ◽  
pp. 5343-5347
Author(s):  
Cheng Zhang ◽  
Wu Ma
Keyword(s):  
Multicast Routing ◽  
Cost Minimization ◽  
Low Complexity ◽  
Multicast Tree ◽  
Selection Function ◽  
The Core ◽  
Core Selection ◽  
And Performance ◽  
Shared Tree ◽  
Delay Variation

The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a multicast tree is the selection of the root of the shared tree or the core point. Therefore, the algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. The core selection function in this algorithm achieves a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance.

scholarly journals WDM Network and Multicasting Protocol Strategies

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Pinar Kirci ◽  
Abdul Halim Zaim
Keyword(s):  
Optical Networks ◽  
Wavelength Division Multiplexing ◽  
Multicast Routing ◽  
Wdm Networks ◽  
Just In Time ◽  
Wavelength Division ◽  
Burst Switching ◽  
Internet Users ◽  
Data Transparency ◽  
Optical Burst

Optical technology gains extensive attention and ever increasing improvement because of the huge amount of network traffic caused by the growing number of internet users and their rising demands. However, with wavelength division multiplexing (WDM), it is easier to take the advantage of optical networks and optical burst switching (OBS) and to construct WDM networks with low delay rates and better data transparency these technologies are the best choices. Furthermore, multicasting in WDM is an urgent solution for bandwidth-intensive applications. In the paper, a new multicasting protocol with OBS is proposed. The protocol depends on a leaf initiated structure. The network is composed of source, ingress switches, intermediate switches, edge switches, and client nodes. The performance of the protocol is examined with Just Enough Time (JET) and Just In Time (JIT) reservation protocols. Also, the paper involves most of the recent advances about WDM multicasting in optical networks. WDM multicasting in optical networks is given as three common subtitles: Broadcast and-select networks, wavelength-routed networks, and OBS networks. Also, in the paper, multicast routing protocols are briefly summarized and optical burst switched WDM networks are investigated with the proposed multicast schemes.

scholarly journals An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Huanlin Liu ◽  
Qinren Shen ◽  
Yong Chen
Keyword(s):  
Network Coding ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Wdm Networks ◽  
The Other ◽  
Optical Wdm Networks ◽  
Optical Wdm ◽  
Optical Multicast ◽  
Multicast Routing Algorithm ◽  
Maximal Capacity

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.

scholarly journals Joint Redundant and Random Network Coding for Robust Video Transmission over Lossy Networks

2012 ◽  
Vol 8 (3) ◽  
pp. 213-230 ◽  
Author(s):  
Xingjun Zhang ◽  
Cuiping Jing ◽  
Feilong Tang ◽  
Scott Fowler ◽  
Huali Cui ◽  
...  
Keyword(s):  
Network Coding ◽  
Packet Loss ◽  
Video Transmission ◽  
Random Network ◽  
Scalable Video Coding ◽  
Lossy Networks ◽  
Random Network Coding ◽  
Network Bandwidth ◽  
The Impact ◽  
Global Coding

In this paper a novel unequal packet loss protection scheme R2NC based on low-triangular global coding matrix with ladder-shaped partition is presented, which combines redundant and random network coding for robust H.264/SVC video transmission. Firstly, the error-correcting capabilities of redundant network coding make our scheme resilient to loss. Secondly, the implementation of random network coding at the intermediate nodes with multiple input links can reduce the cost of network bandwidth, thus reducing the end-to-end delay for video transmission. Thirdly, the low-triangular global coding matrix with ladder-shaped partition is maintained throughout the R2NC processes to reduce the impact of global coding matrix's rank deficiency on video transmission and provide unequal erasure protection for H.264/SVC priority layers. The redundant network coding avoids the retransmission of lost packets and improves error-correcting capabilities of lost packets. Based only on the knowledge of the packet loss rates on the output links, the source node and intermediate nodes can make decisions for redundant network coding and random network coding (i.e., how much redundancy to add at this node). However, the redundancy caused by redundant network coding makes the network load increases. In order to improve network throughput, we performed random network coding at the intermediate nodes. Our approach is grounded on the overall distortion of reconstructed video minimization by optimizing the amount of redundancy assigned to each layer. The convex optimization model is constructed under the constraint of network coding and scalable video coding. Experimental results are shown to demonstrate the significant improvement of H.264/SVC video reconstruction quality with R2NC over packet lossy networks.

Sign in / Sign up

Export Citation Format

Share Document