GRASP for traffic grooming and routing with simple path constraints in WDM mesh networks

Wu, Xinyun; Tao, Ye; Guo, Qi; Lu, Zhengding

doi:10.1016/j.comnet.2015.04.013

Cited by 7 publications

(4 citation statements)

References 33 publications

(34 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The other direction is to develop more semantic neighborhood move operators and perturbation operators that consider more problem specific knowledge. In addition, it is interesting to test the proposed neighborhood structure in other meta‐heuristic frameworks, such as simulated annealing, GRASP , or distributed algorithms. Finally, our proposed local search can also be effectively combined with other population‐based meta‐heuristic approaches, such as evolutionary algorithm, path relinking, and so on .…”

Section: Resultsmentioning

confidence: 99%

Restricted swap-based neighborhood search for the minimum connected dominating set problem

Galinier

2017

NETWORKS

Self Cite

View full text Add to dashboard Cite

The minimum connected dominating set problem (MCDSP) has become increasingly important in recent years due to its applicability to mobile ad hoc networks and sensor grids. This paper presents a restricted swap-based neighborhood (RSN) tailored for solving MCDSP. This novel neighborhood structure is embedded into tabu Search (TS) and a perturbation mechanism is employed to enhance diversification. The proposed RSN-TS algorithm is tested on four sets of public benchmark instances widely used in the literature. The results demonstrate the efficacy of the proposed algorithm in terms of both solution quality and computational efficiency. In particular, the RSN-TS algorithm was able to improve the best known results on 41 out of the 97 problem instances while matching the best known results on all the remaining 56 instances. Furthermore, the article analyzes some key features of the proposed approach in order to identify its critical success factors.

show abstract

Section: Resultsmentioning

confidence: 99%

Restricted swap-based neighborhood search for the minimum connected dominating set problem

Galinier

2017

NETWORKS

Self Cite

View full text Add to dashboard Cite

show abstract

“…This work held to be good whenever network efficiency was to be maintained in the cases of excessive traffic authorization. The issue of traffic routing and grooming in WDM mesh networks [19] was studied with the aid of the simple path constraint which was indicated as GR. The analysis of the simple path constraint was given as novelty in the research work.…”

Section: Related Workmentioning

confidence: 99%

Optimized Traffic Grooming through modified PSO based Iterative Hungarian algorithm in Optical Networks

Kumarnath

Batri

2021

ITC

View full text Add to dashboard Cite

Due to huge size of the data and quick transmission of data between the nodes present in the optical network, a condition of network traffic is created among the nodes of the network. This issue of traffic can be overcome by employing numerous traffic grooming techniques. In this research paper, the best suitable shortest path is determined by the multi objective modified PSO algorithm and an innovative visibility graph based Iterative Hungarian Traffic grooming algorithm is implemented to reduce the blocking ratio through improving the allocation of bandwidth between the users. Then finally the performance analysis is carried out by means of performance measures such as traffic throughput, transceivers count, average propagation delay, blocking ratio, and success ratio. It can be inferred that the proposed work obtains enhanced outcomes when compared to the other existing techniques.

show abstract

“…GRASP has been successfully applied to several problems arising in telecommunications, such as optical systems (Duarte et al, 2014), WDM systems (Wu et al, 2015), and WAN design (Robledo Amoza, 2005), and many other fields of knowledge. The recent application in a hard combinatorial problem coming from biological systems, which can be found in Ferone et al (2016).…”

Section: Graspmentioning

confidence: 99%

Two‐node‐connected star problem

Recoba

Robledo

Romero

et al. 2016

Int Trans Operational Res

View full text Add to dashboard Cite

In this study, a two‐node‐connected star problem (2NCSP) is introduced. We are given a simple graph and internal and external costs for each link of the graph. The goal is to find the minimum‐cost spanning subgraph, where the core is two‐node‐connected and the remaining external nodes are connected to the core. First, we show that the 2NCSP belongs to the class of NP‐hard computational problems. Therefore, a greedy randomized adaptive search procedure (GRASP) heuristic is developed, enriched with a variable neighborhood descent (VND). The neighborhood structures include exact integer linear programming models to find the best paths and two‐node‐connected replacements, as well as a shaking operation in order to prevent being trapped in a local minima. The ring star problem (RSP) represents a relevant model in network optimization, where the core is a ring instead of an arbitrary two‐node‐connected graph. We contrast our GRASP/VND methodology with a previous reference work on the RSP in order to highlight the effectiveness of our heuristic. The heuristic is competitive, and the best results produced for several instances so far are under study. In this study, a discussion of the results and trends for future work are provided.

show abstract

GRASP for traffic grooming and routing with simple path constraints in WDM mesh networks

Cited by 7 publications

References 33 publications

Restricted swap-based neighborhood search for the minimum connected dominating set problem

Restricted swap-based neighborhood search for the minimum connected dominating set problem

Optimized Traffic Grooming through modified PSO based Iterative Hungarian algorithm in Optical Networks

Two‐node‐connected star problem

Contact Info

Product

Resources

About