Basic mathematical programming models for capacity allocation in mesh-based survivable networks

Kennington, Jeffery L.; Olinick, Eli V.; Spiride, G.

doi:10.1016/j.omega.2006.04.011

Cited by 31 publications

(25 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The integer linear programming (ILP) approach has been surveyed by Kennington et al [6], but this only works well for small problems with linear objective functions and constraints [3]. The limitations of ILP models have led to the introduction of diverse heuristic algorithms.…”

Section: Survivability In Optical Mesh Networkmentioning

confidence: 99%

See 1 more Smart Citation

Survivable wavelength‐routed optical network design using genetic algorithms

Leeson

Kavian

Ren

et al. 2007

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYThe provision of acceptable service in the presence of failures and attacks is a major issue in the design of next generation dense wavelength division multiplexing (DWDM) networks. Survivability is provided by the establishment of spare lightpaths for each connection request to protect the working lightpaths. This paper presents a genetic algorithm (GA) solver for the routing and wavelength assignment problem with working and spare lightpaths to design survivable optical networks in the presence of a single link failure. Lightpaths are encoded into chromosomes made up of a fixed number of genes equal to the number of entries in the traffic demand matrix. Each gene represents one valid path and is thus coded as a variable length binary string. After crossover and mutation, each member of the population represents a set of valid but possibly incompatible paths and those that do not satisfy the problem constraints are discarded. The best paths are then found by use of a fitness function and these are assigned the minimum number of wavelengths according to the problem constraints. The proposed approach has been evaluated on dedicated path protection and shared path protection. Simulation results show that the GA method is efficient and able to design DWDM survivable real-world optical mesh networks.

show abstract

Section: Survivability In Optical Mesh Networkmentioning

confidence: 99%

“…The GA population size was 50 for 40 generations with crossover probability of 0.9 and mutation probability of 0.01. The demand matrix used was D ¼ [ (1,11,10); (2,7,6); (3,4,7); (6,4,5); (5,17,8); (6,11,9); (17,10,6); (11,4,11); (13,8,13) …”

Section: Assumptionsmentioning

confidence: 99%

Survivable wavelength‐routed optical network design using genetic algorithms

Leeson

Kavian

Ren

et al. 2007

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…In the distributed networking the program or tasks are also often developed with the subsets of independent units under distributed environments. Some of the task allocation methods have been reported in the literature, such as Integer Programming [6,8], Branch and Bound technique [3], Load Balancing [1,2], Reliability Optimization [11,4], and M odeling [5]. It has seen that this concept is cost-effective and reliable to meet the optimal solution.…”

Section: Introductionmentioning

confidence: 99%

A Modified and Efficient Algorithm for Static Task Assignment in Distributed Processing Environment

Govil¹,

Kumar²

2011

IJCA

View full text Add to dashboard Cite

The Distributed Processing Environment [DPE] in which services provided for the network reside at multiple sites. Instead of single large machine being responsible for all aspects of process, each separate processor handles subset. In the distributed environments the program or tasks are also often developed with the subsets of independent units under various environments. The Allocation problems in any computer system play the key role for deciding the performance of the system. The allocation put the direct impact of software resources as well as hardware resources. In DPE, partitioning of the application software in to module and the proper allocation of these modules dissimilar processors are important factors, which determine the efficient utilization of resources. The static model discussed in this paper provide an optimal solution for assigning a set of "m" modules of a task to a set of "n" processors where m > n in a distributed system for evaluation for optimal time of the system.

show abstract

“…The key advantage of pre-configured protection cycles, or p-cycles for short, lies in their switching speed and simplicity, similar to ring networks, as the protection paths around the surviving portions of the cycle are pre-connected at the outset and the only required switching actions take place at the end nodes of the failure. In spite of many existing studies on protection/restoration schemes (Kennington et al, 2007;Wang et al, 2002;Zhang & Mukherjee, 2004) and although it is known that p-cycles are less capacity efficient, there has been no systematic analysis of how much bandwidth p-cycles schemes require in comparison with the basic shared link and path protection. Due to the highly combinatorial nature of p-cycle designs, nearly all studies are based on an explicit enumeration of cycles, resulting in difficulties for assessing the quality of the solutions provided by the resulting huge ILP models.…”

Section: Introductionmentioning

confidence: 99%

A unified framework for shared protection schemes in optical mesh network

Rocha

Jaumard

2009

Pesqui. Oper.

View full text Add to dashboard Cite

While the advantages of p-cycles and FIPP p-cycles are well established, there has been no systematic analysis of how much bandwidth they consume in comparison with the classical shared link and path protection schemes. It was recently observed that, even enumerating a huge number of cycles, is not necessarily a guarantee for obtaining good quality solutions with the ILP models if tools for large scale programming are not used. We propose to investigate the bandwidth protection costs of p-cycles and FIPP p-cycles in comparison with those of shared link and path protection by applying the column generation technique to solve relaxed LP models for the four protection schemes, and then solving the resulting ILP models. Provably near-optimal solutions allow us to perform accurate quantitative comparisons on real-world networks.Keywords: optical networks; shared protection; column generation. ResumoEmbora as vantagens dos p-ciclos e FIPP p-ciclos estejam bem estabelecidas, não existe uma análise sistemática de quanta largura de banda eles consomem em comparação aos mecanismos clássicos de proteção compartilhada por caminhos e por links. Foi observado recentemente que a enumeração de um enorme número de ciclos não é necessariamente uma garantia de se obter soluções de boa qualidade se ferramentas para programação de larga escala não forem usadas. Nós propomos investigar os custos de proteção de largura de banda dos p-ciclos e FIPP p-ciclos em comparação com aqueles de proteção compartilhada por links e por caminhos, através da aplicação da técnica de geração de colunas para resolver modelos relaxados para os quatro esquemas de proteção. Em seguida, resolvemos os modelos de programação inteira resultantes. Soluções próximas da otimalidade nos permitem desempenhar comparações quantitativas exatas em redes reais.Palavras-chave: redes óticas; proteção compartilhada; geração de colunas.

show abstract

Basic mathematical programming models for capacity allocation in mesh-based survivable networks

Cited by 31 publications

References 42 publications

Survivable wavelength‐routed optical network design using genetic algorithms

Survivable wavelength‐routed optical network design using genetic algorithms

A Modified and Efficient Algorithm for Static Task Assignment in Distributed Processing Environment

A unified framework for shared protection schemes in optical mesh network

Contact Info

Product

Resources

About