On 1-rate and 2-rate multicast 3-stage Clos networks

The 3-stage Clos network C（n, m, r） is considered as the most basic and popular multistage interconnection network which has been widely employed for data communications and parallel computing systems. Quite a lot of efforts has been put on the research of the 3- stage Clos network. Unfortunately, very little is known for the multirate multicast Clos network which is the most complicated case. Firstly a sufficient condition for 1-rate multicast networks to be SNB is given, from which a result for 2-rate multicast networks to be WSNB can easily be gotten. Furthermore, by using a reservation-scheme routing, more specific result for 2-rate multicast networks to be WSNB can be obtained for the case of one of them exceeding 1/2.

Green Multicast Grooming Based on Cross-Shared Protection in Optical WDM Networks

Currently,multicast survivability in optical network obtains more attention.This paper focuses on the field of multicast grooming shared protection in green optical network and designs a novel auxiliary graph and a shared matrix to address the survivable multicast resource consumption.This paper also proposes a new heuristic called Green Multicast Grooming algorithm based on spanning path Cross-Shared protection(GMGCSP),in which network reliability,energy efficiency and resource utilization are jointly considered.Simulation results testify that,compared to other algorithms,the proposed GMG-CSP not only has lower blocking probability and higher bandwidth utilization ratio,but also saves more energy.

Multicast routing algorithm of multiple QoS based on widest-bandwidth

A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth

A Self-Adaptive Quantum Genetic Algorithm for Network Flow Vehicle Scheduling Problem

Bicycle sharing scheduling is a complex mathematical optimization problem, and it is challenging to design a general algorithm to solve it well due to the uncertainty of its influencing factors. This paper creatively establishes a new mathematical model to determine the appropriate number of vehicles to be placed at each placement point by calculating the traffic weights of the placement points and optimizes the hyperparameters in the algorithm by adaptive quantum genetic algorithm, and at the same time combines the network flow algorithm in graph theory to calculate the most suitable scheduling scheme for shared bicycles by establishing the minimum cost maximum flow network. Through experimental validation, the network flow-based algorithm proposed in this paper allows for a more convenient calculation of the daily bike-sharing scheduling scheme compared to previous algorithms. An adaptive quantum genetic algorithm optimizes the hyperparameters appearing in the algorithm. The experimental results show that the algorithm achieves good results as the transportation cost is only 1/15th of the GA algorithm and 1/9th of the QGA algorithm.

Performance evaluation of multicast relay network using LDPC and convolutional channel codes along-with XOR network coding

In this paper, we have compared the performance of joint network channel coding （JNCC） for multicast relay network using low density parity check （LDPC） codes and Convolutional codes as channel codes while exclusive or （XOR） network coding used at the intermediate relay nodes. Multicast relay transmission is a type of transmission scheme in which two fixed relay nodes contribute in the second hop of end-to-end transmission between base transceiver station （BTS） and a pair of mobile stations. We have considered one way and two way multicast scenarios to evaluate the bit error rate （BER） and throughput performance. It has been shown that when using XOR network coding at the intermediate relay nodes, the same transmission becomes possible in less time slots hence throughput performance can be improved. Moreover we have also discussed two possible scenarios in the proposed system model, in which both diversity and multiplexing gain has been considered. It is worth notifying that BER and throughput achieved for LDPC codes is better than Convolutional codes for all the schemes discussed.

Dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network

Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3 m2 n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges.

Hamming-distance-based adaptive quantum-inspired evolutionary algorithm for network coding resources optimization

An adaptive quantum-inspired evolutionary algorithm based on Hamming distance （HD-QEA） was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was taken into consideration, and a suitable rotation angle step （RAS） was assigned to each individual according to the Hamming distance. Performance comparisons were conducted among the HD-QEA, a basic quantum-inspired evolutionary algorithm （QEA） and an individual＇s fitness based adaptive QEA. A solid demonstration was provided that the proposed HD-QEA is better than the other two algorithms in terms of the convergence speed and the global optimization capability when they are employed to optimize the network coding resources in multicast networks.