Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices

Fu, Zhang-Hua; Chen, Sibo; Ming, Yi-Fei; Yongquan, Chen; Lai, Xiangjing

doi:10.1109/access.2019.2894829

Cited by 4 publications

(1 citation statement)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The metaheuristic strategy studied in this chapter is in the class of memetic algorithms [31], effectively combining elements from local search and evolutionary search paradigms. Local search heuristics have been widely used in combinatorial optimization [3,12], and they have especially been successful when applied to treerelated problems [14]. For tackling the SPG, a local search procedure initiates from a prior defined solution.…”

mentioning

confidence: 99%

Memetic Strategies for Network Design Problems

Amirghasemi

Duong

Hutchison

et al. 2021

Springer Tracts in Nature-Inspired Computing

View full text Add to dashboard Cite

Network design problems appear in many areas such as supply chain management, transportation, telecommunication, and Internet of Things (IoT). Many of such problems can be seen as a problem of finding a subset of links and/or nodes, in order to optimize one or more objectives. The nodes can be cities, telecommunication nodes, IoT sensors, warehouse facilities, and the links between those nodes could be roads, network infrastructure, and routes, respectively.In IoT domain, for example, the architecture commonly consists of a number of sensors, devices, cloud servers, and communication protocols to facilitate a wide range of applications such as transportation, smart city, digital living, and e-agriculture [41]. In effect, a typical IoT or telecommunication infrastructure will relay data from remote connected devices to an application. The coverage, robust-

show abstract

mentioning

confidence: 99%

Memetic Strategies for Network Design Problems

Amirghasemi

Duong

Hutchison

et al. 2021

Springer Tracts in Nature-Inspired Computing

View full text Add to dashboard Cite

show abstract

Efficient multicasting technique for elastic optical network

et al. 2020

View full text Add to dashboard Cite

The elastic optical network (EON) is the latest solution to increase the capacity of optical networks, as a response to the ever‐increasing demand for traffic. To meet the EON mission, new algorithms and frameworks need to be designed. In this paper, a new algorithm based on EON is proposed that employs a subtree‐based scheme to establish multicast transmissions. To solve the problems of routing, modulation level and spectrum allocation, the primary problem of EON with regard to resource allocation under wavelength continuity and wavelength contiguity constraints, as well as distance adaptive transmission, the proposed algorithm solves each subproblem by considering the existence of a solution for other subproblems. The authors take into account the effects of splitting the transient light at the intermediary nodes on the signal‐to‐noise ratio to enhance the accuracy of the resource allocation. The proposed scheme is extensively examined under different networks and compared with the existing multicasting benchmark. The simulation results show that the proposed scheme considerably increases the network capacity without placing any burden on the network.

show abstract

A Layered Subtree Scheme for Multicast Communications in Large-Scale Elastic Translucent Optical Networks

2020

View full text Add to dashboard Cite

To exploit the capacity introduced by elastic optical networks, efficient algorithms must be developed. Efficient modulation techniques have limited reach, so for distant destination nodes, the regeneration of a signal at a few intermediary nodes along the lightpath can effectively reduce the spectrum utilization and offset the extra cost, in terms of overall transceiver use, introduced by enabling the regeneration. In the context of multicast provisioning, although regeneration can be complex, it, in turn, due to its flexibility, further emphasizes the advantage of tree based routing over serving individual destinations. In this paper, we investigate the problem of routing, modulation level, spectrum allocation, and regenerator placement (RMSA-RP) for multicast provisioning, which, to the best of our knowledge, has not been previously addressed in the literature. Accordingly, we present a networking model through comprehensive integer linear programming, jointly enabling a routing method based on a subtree scheme as well as assigning a few nodes as regenerators of the signal. By means of an algorithm, we also propose a scalable framework to address RMSA-RP when the network is in operation. This algorithm implements a dynamic and automatic geographic partitioning of the destination nodes and then forms the corresponding subtree structures. Constraints taken into account include wavelength contiguity, wavelength continuity, and light splitting that affects the reach of the modulation techniques. Extensive simulation results show that the model can effectively support a greater number of demands without increasing transceiver use.

show abstract

Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices

Cited by 4 publications

References 36 publications

Memetic Strategies for Network Design Problems

Memetic Strategies for Network Design Problems

Efficient multicasting technique for elastic optical network

A Layered Subtree Scheme for Multicast Communications in Large-Scale Elastic Translucent Optical Networks

Contact Info

Product

Resources

About