Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1132429#aggregation> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- aggregation classification "P1".
- aggregation creator B91786.
- aggregation creator B91787.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2010".
- aggregation format "application/pdf".
- aggregation hasFormat 1132429.bibtex.
- aggregation hasFormat 1132429.csv.
- aggregation hasFormat 1132429.dc.
- aggregation hasFormat 1132429.didl.
- aggregation hasFormat 1132429.doc.
- aggregation hasFormat 1132429.json.
- aggregation hasFormat 1132429.mets.
- aggregation hasFormat 1132429.mods.
- aggregation hasFormat 1132429.rdf.
- aggregation hasFormat 1132429.ris.
- aggregation hasFormat 1132429.txt.
- aggregation hasFormat 1132429.xls.
- aggregation hasFormat 1132429.yaml.
- aggregation isPartOf urn:isbn:9781424456376.
- aggregation isPartOf urn:isbn:9781424456383.
- aggregation isPartOf urn:issn:1930-529X.
- aggregation language "eng".
- aggregation publisher "IEEE".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Technology and Engineering".
- aggregation title "Column generation for dimensioning resilient optical grid networks with relocation".
- aggregation abstract "Nowadays, the Quality of Service (QoS) in Optical Grids has become a key issue. An important QoS factor is resiliency, namely the ability to survive from certain network failures. Although several traditional network protection schemes were devised in the past, they are not optimized for Optical Grids. In an earlier work, we proposed relocation strategies providing backup paths to alternate destinations, exploiting the anycast routing principle of grids. To show the advantage of relocation (compared to traditional network protection) in terms of reduced network capacity, we formulated the network dimensioning problem as an Integer Linear Program (ILP). Yet, its solution exhibited very poor scalability and appeared not practical for reasonably large scale case studies. Therefore, we propose a novel formulation for the relocation protection scheme, using column generation (CG). This approach decomposes the original ILP into two parts, specifically a Restricted Master Problem (RMP) and a Pricing Problem (PP) which are iteratively and alternatively solved until the optimality condition is satisfied. Such a CG decomposition has a significant impact on the complexity of the model, leading to a significant improvement over previous ILPs in term of scalability and running times. We demonstrate that the CG method is highly scalable and generates nearly optimal solutions using case studies with up to 300 connections, showing it to be highly competitive with a previously proposed heuristic. We also perform some comparisons of the anycast scheme with the classical shared path protection on larger network instances.".
- aggregation authorList BK236438.
- aggregation aggregates 1132519.
- aggregation aggregates 1132531.
- aggregation isDescribedBy 1132429.
- aggregation similarTo GLOCOM.2010.5684026.
- aggregation similarTo LU-1132429.