Two-stage evolutionary algorithm for dynamic multicast routing in mesh network

In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.

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.

Dynamic multicast traffic grooming in WDM networks

Dynamic multicast traffic grooming in wave-length division multiplexing(WDM)networks was analyzed to minimize networkwide costs and to increase the network resource utilization.A network model was developed for dynamic multicast traffic grooming with resource constraints and an algorithm that can provide quality of service(QoS)was proposed.The QoS is measured by the maximum number of lightpaths passing between the source and the destinations.The blocking probability of the algorithm was assessed in simulations.The results show that a higher QoS requirement results in higher blocking probability,and when the QoS requirement is low,changes in the QoS require-ments have only small effects on the blocking probability.

A Dynamic Adaptive Layered Multicast Congestion Control Mechanism

To solve the problem that most of existing layered multicast protocols cannot adapt todynamic network conditions because their layers are coarsely granulated and static,a new congestioncontrol mechanism for dynamic adaptive layered multicast(DALM) is presented.In this mechanism,anovel feedback aggregating algorithm is put forward,which can dynamically determine the number oflayers and the rate of each layer,and can efficiently improve network bandwidth utilization ratio.Additionally,because all layers is transmitted in only one group,the intricate and time-consuminginternet group management protocol(IGMP) operations,caused by receiver joining a new layer orleaving the topmost subscribed layer,are thoroughly eliminated.And this mechanism also avoids otherproblems resulted from multiple groups.Simulation results show that DALM is adaptive and TCPfriendly.