Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(14)
Autonomic System
Cost Function
Dynamic Shortest Paths
Genetic Algorithm
Hybrid Genetic Algorithm
Network Congestion
Optimal Solution
Routing Protocol
Traffic Engineered
Interior Gateway Protocol
Local Search
Origin Destination
Open Shortest Path First
Shortest Path
Related Publications
(31)
Experimental Evaluation of Course Timetabling Algorithms
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAXSAT
Subscribe
Academic
Publications
A hybrid genetic algorithm for the weight setting problem in OSPF/ISIS routing
A hybrid genetic algorithm for the weight setting problem in OSPF/ISIS routing,10.1002/net.20070,Networks,Luciana S. Buriol,Mauricio G. C. Resende,Cel
Edit
A hybrid genetic algorithm for the weight setting problem in OSPF/ISIS routing
(
Citations: 69
)
BibTex

RIS

RefWorks
Download
Luciana S. Buriol
,
Mauricio G. C. Resende
,
Celso C. Ribeiro
,
Mikkel Thorup
Intradomain traffic engineering aims to make more effi cient use of network resources within an autonomous system. Interior Gateway Protocols such as OSPF (Open
Shortest Path
First) and ISIS (Intermediate System Intermediate System) are commonly used to select the paths along which traffic is routed within an autonomous system. These routing protocols direct traffic based on link weights assigned by the network operator. Each router in the autonomous system computes shortest paths and creates destination tables used to direct each packet to the next router on the path to its final desti nation. Given a set of traffic demands between origin destination pairs, the OSPF weight setting problem con sists of determining weights to be assigned to the links so as to optimize a cost function, typically associated with a
network congestion
measure. In this article, we propose a
genetic algorithm
with a local improvement procedure for the OSPF weightsetting problem. The local improvement procedure makes use of an efficient dynamic
shortest path algorithm
to recompute shortest paths after the modification of link weights. We test the algorithm on a set of real and synthetic test problems, and show that it produces nearoptimal solutions. We
Journal:
Networks
, vol. 46, no. 1, pp. 3656, 2005
DOI:
10.1002/net.20070
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
dx.doi.org
)
(
www.informatik.unitrier.de
)
(
www.cs.colostate.edu
)
(
doi.wiley.com
)
(
www.inf.ufrgs.br
)
(
www2.research.att.com
)
More »
Citation Context
(37)
...
Boschetti et al. (2002)
proposed new upper bounds derived from different relaxations of a new integer programming formulation of the constrained twodimensional nonguillotine cutting problem...
José Fernando Gonçalves
,
et al.
A parallel multipopulation genetic algorithm for a constrained twodi...
...must find heuristic approaches to the solution of the problem . Several proposed heuristic are based on GAs [7, 8,
11
]...
Matthew Roughan
,
et al.
GATEway: symbiotic interdomain traffic engineering
...Algorithms using local search, simulated annealing, or Lagrangian relaxation techniques with the routing lengths as primary decision variables are presented in [3, 9,
16
, 18, 19, 34], for example...
Andreas Bley
.
An Integer Programming Algorithm for Routing Optimization in IP Networ...
...Optimization algorithms that compute a set of optimal link weights in OSPFbased networks were addressed in [2], [3], [5], [
4
], [6] under the condition that the network topology and traffic matrix are given...
...Buriol et al. presented a genetic algorithm with a local improvement procedure [
4
]...
Islam Mohammad Kamrul
,
et al.
Optimization of OSPF Link Weight to Minimize WorstCase Network Conges...
...Algorithms that compute a set of optimal link weights in OSPFbased networks were addressed in [2], [3], [5], [
4
], [6] under the condition that the network topology and traffic matrix are given...
...Buriol et al. presented a genetic algorithm with a local improvement procedure [
4
]...
Islam Mohammad Kamrul
,
et al.
PSO: preventive starttime optimization of OSPF link weights to counte...
References
(30)
Genetic Algorithms and Random Keys for Sequencing and Optimization
(
Citations: 317
)
James C. Bean
Journal:
Informs Journal on Computing  INFORMS
, vol. 6, no. 2, pp. 154160, 1994
Characterizing the Internet Hierarchy from Multiple Vantage Points
(
Citations: 419
)
Lakshminarayanan Subramanian
,
Sharad Agarwal
,
Jennifer Rexford
,
Randy H. Katz
Conference:
IEEE INFOCOM  INFOCOM
, vol. 2, pp. 618627 vol.2, 2002
An Incremental Algorithm for a Generalization of the ShortestPath Problem
(
Citations: 161
)
G. Ramalingam
,
Thomas W. Reps
Journal:
Journal of Algorithms  JAL
, vol. 21, no. 2, pp. 267305, 1996
Design of Broadband Virtual Private Networks: Model and Heuristics for the BWiN
(
Citations: 29
)
Andreas Bley
,
Martin Grötschel
,
Roland Wessäly
Published in 1998.
Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract)
(
Citations: 15
)
Daniele Frigioni
,
Alberto Marchettispaccamela
,
Umberto Nanni
Conference:
ACMSIAM Symposium on Discrete Algorithms  SODA
, pp. 212221, 1996
Sort by:
Citations
(69)
Biased randomkey genetic algorithms with applications in telecommunications
Mauricio G. C. Resende
Journal:
Top
, pp. 124, 2012
A parallel multipopulation genetic algorithm for a constrained twodimensional orthogonal packing problem
(
Citations: 5
)
José Fernando Gonçalves
,
Mauricio G. C. Resende
Journal:
Journal of Combinatorial Optimization  JCO
, vol. 22, no. 2, pp. 180201, 2011
A biased randomkey genetic algorithm for routing and wavelength assignment
(
Citations: 5
)
Thiago F. Noronha
,
Mauricio G. C. Resende
,
Celso C. Ribeiro
Journal:
Journal of Global Optimization
, vol. 50, no. 3, pp. 503518, 2011
Biased randomkey genetic algorithm for fiber installation in Optical Network Optimization
Nata Goulart
,
Sergio R. de Souza
,
Luiz G. S. Dias
,
Thiago F. Noronha
Published in 2011.
GATEway: symbiotic interdomain traffic engineering
Matthew Roughan
,
Yin Zhang
Journal:
Telecommunication Systems  TELSYS
, vol. 47, no. 12, pp. 317, 2011