See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/4316462

A review of routing optimization using OSPF

Conference Paper · June 2007

DOI: 10.1109/ICTMICC.2007.4448682 · Source: IEEE Xplore

CITATIONS READS

0 617

2 authors:

Nor Musliza binti Mustafa Mohamed Othman

International Islamic University College Selangor. Malaysia (KUIS) Universiti Putra Malaysia
13 PUBLICATIONS   22 CITATIONS    615 PUBLICATIONS   4,206 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Wi-fi fingerprint database construction using Chebyshev wavelet functions View project

Optical MINs View project

All content following this page was uploaded by Nor Musliza binti Mustafa on 04 May 2016.

The user has requested enhancement of the downloaded file.

235
A Review of Routing Optimization Using OSPF
Nor Musliza Mustafa, Mohamed Othman
 literature on routing optimization functions and to identify
Abstract— This paper reviews recent work on routing
optimization using OSPF, and identifies important areas where
further research is needed. Routing optimization provides a means
to balance the traffic load in the network with the goal to improve
quality of service since we are interested in the following question:
What is the issues and requirement arising in the routing
optimization in the context of Traffic Engineering when there is
the need to facilitate reliable network operations in the area of
Telecommunication industry?
Index Terms—Optimization, OSPF, Routing, Traffic Engineering.
I. INTRODUCTION
he characteristics of today’s competitive environment, such
T as the speed with which products are designed,
manufactured and distributed, as well as the need for
higher efficiency and lower operational costs, are forcing
companies to continuously search for ways to improve their
operations. Optimization models and algorithms, decision
support systems and computerized analysis tools are examples
of approaches taken by companies in an attempt to improve
their operational performance and remain competitive under
the threat of increasing competition. Recently, a new approach
to the routing optimization has been identified, which has
proven to be of significant relevance to companies that have
adopted it. This approach is based on the optimization of link
weights with different function that may affect shortest path
selection, traffic distribution and finally network routing cost
into a single optimization model. The problem of
simultaneously considering the characteristics and
requirements of different functions to perform an overall
optimization has attracted the attention of researchers in recent
years and some models have been proposed in this direction.
The basic idea behind these models is to simultaneously
optimize decision variables of different functions that have
traditionally been optimized sequentially, in the sense that the
optimized output of one stage becomes the input to the other.
However, a unified body of literature that deals
comprehensively with these types of routing optimization does
not exist yet. The objective of this paper is to review existing
Manuscript received January 31, 2007. This work was supported in part by
the Kolej Universiti Islam Antarabangsa Selangor under SLAK scheme.
Nor Musliza Mustafa is with the Department of Network Technolgy, Kolej
Universiti Islam Antarabangsa Selangor, Selangor 43300 Malaysia. (phone:
03-89254251 ext 1121; fax: 03-89244473; e-mail: ija_solehah@ yahoo.com).
Dr. M. Othman, Jr., was with University Putra Malaysia, Selangor 43400
Malaysia. He is now with the Department of Communication Technology and
Network, University Putra Malaysia (e-mail: mothman@fsktm.upm.edu.my).
areas where further research is needed. We wish to focus on
models that consider the usage of link in the OSPF network
explicitly since our main interest is to concentrate on the
following points: What is the issues and requirement arising in
the routing optimization in the context of Traffic Engineering
when there is the need to facilitate reliable network operations
in the area of Telecommunication industry?Given the focus of
our paper, we present the review of the work done on routing
optimization based on Traffic engineering which considers the
link weight explicitly.
II. ISSUES IN ROUTING OPTIMIZATION
A. Open Shortest Path First (OSPF)
OSPF is a dynamic link-state routing protocol that uses a
link-state database (LSDB) to build and calculate the shortest
path to all known destinations. It is through the use of
Dijkstra’s SPF algorithm that the information contained within
the LSDB is calculated into routes. Open Shortest Path First
(OSPF) was standardized by the IETF in 1998 as a solution for
large networks [12]. It belongs to the class of link state
protocols. Instead of exchanging distance metrics between
neighbor routers, all OSPF routers distribute link state
information associated with their interfaces to all other routers
in the network. This way, every router builds up and maintains
its own topology database, which contains elements
representing subnets (stub networks), OSPF routers, transit
networks (i.e., subnets that connect several routers), aggregated
networks (i.e., areas), and destination networks outside the AS.
Based on the global view of the network topology, every router
is able to perform shortest path computations independently
and determine the relevant outgoing interfaces.
B. Internet Traffic Engineering
Internet traffic engineering is defined as that aspect of
Internet network engineering dealing with the issue of
performance evaluation and performance optimization of
operational IP networks. Traffic Engineering encompasses the
application of technology and scientific principles to the
measurement, characterization, modeling, and control of
Internet traffic. Enhancing the performance of an operational
network, at both the traffic and resource levels, are major
objectives of Internet traffic engineering. This is accomplished
by addressing traffic oriented performance requirements, while
utilizing network resources economically and reliably. Traffic
235
oriented performance measures include delay, delay variation,
packet loss, and throughput.
An important objective of Internet traffic engineering is to
facilitate reliable network operations. Reliable network
operations can be facilitated by providing mechanisms that
enhance network integrity and by embracing policies
emphasizing network survivability. This results in a
minimization of the vulnerability of the network to service
outages arising from errors, faults, and failures occurring
within the infrastructure. The Internet exists in order to transfer
information from source nodes to destination nodes.
Accordingly, one of the most significant functions performed
by the Internet is the routing of traffic from ingress nodes to
egress nodes. Therefore, one of the most distinctive functions
performed by Internet traffic engineering is the control and
optimization of the routing function, to steer traffic through the
network in the most effective way.
Ultimately, it is the performance of the network as seen by
end users of network services that is truly paramount. This
crucial point should be considered throughout the development
of traffic engineering mechanisms and policies. The
characteristics visible to end users are the emergent properties
of the network, which are the characteristics of the network
when viewed as a whole. A central goal of the service
provider, therefore, is to enhance the emergent properties of
the network while taking economic considerations into
account. The importance of the above observation regarding
the emergent properties of networks is that special care must be
taken when choosing network performance measures to
optimize. Optimizing the wrong measures may achieve certain
local objectives, but may have disastrous consequences on the
emergent properties of the network and thereby on the quality
of service perceived by end-users of network services. A
subtle, but practical advantage of the systematic application of
traffic engineering concepts to operational networks is that it
helps to identify and structure goals and priorities in terms of
enhancing the quality of service delivered to end-users of
network services. The application of traffic engineering
concepts also aids in the measurement and analysis of the
achievement of these goals. The optimization aspects of traffic
engineering can be achieved through capacity management and
traffic management. As used in this document, capacity
management includes capacity planning, routing control, and
resource management. Network resources of particular interest
include link bandwidth, buffer space, and computational
resources. Likewise, as used in this document, traffic
management includes (1) nodal traffic control functions such
as traffic conditioning, queue management, scheduling, and
(2) other functions that regulate traffic flow through the
network or that arbitrate access to network resources between
different packets or between different traffic streams.
The optimization objectives of Internet traffic engineering
should be viewed as a continual and iterative process of
network performance improvement and not simply as a one
time goal. Traffic engineering also demands continual
development of new technologies and new methodologies for
network performance enhancement. The optimization
objectives of Internet traffic engineering may change over time
as new requirements are imposed, as new technologies
emerge, or as new insights are brought to bear on the
underlying problems. Moreover, different networks may have
different optimization objectives, depending upon their
business models, capabilities, and operating constraints. The
optimization aspects of traffic engineering are ultimately
concerned with network control regardless of the specific
optimization goals in any particular environment. Thus, the
optimization aspects of traffic engineering can be viewed from
a control perspective. The aspect of control within the Internet
traffic engineering arena can be pro-active and/or reactive. In
the pro-active case, the traffic engineering control system takes
preventive action to obviate predicted unfavorable future
network states. It may also take perfective action to induce a
more desirable state in the future. In the reactive case, the
control system responds correctively and perhaps adaptively to
events that have already transpired in the network.
The subsystems of Internet traffic engineering control
include: capacity augmentation, routing control, traffic control,
and resource control (including control of service policies at
network elements). When capacity is to be augmented for
tactical purposes, it may be desirable to devise a deployment
plan that expedites bandwidth provisioning while minimizing
installation costs.Inputs into the traffic engineering control
system include network state variables, policy variables, and
decision variables.
One major challenge of Internet traffic engineering is the
realization of automated control capabilities that adapt quickly
and cost effectively to significant changes in a network's state,
while still maintaining stability.
Another critical dimension of Internet traffic engineering is
network performance evaluation, which is important for
assessing the effectiveness of traffic engineering methods, and
for monitoring and verifying compliance with network
performance goals. Results from performance evaluation can
be used to identify existing problems, guide network re-
optimization, and aid in the prediction of potential future
problems.
Performance evaluation can be achieved in many different
ways. The most notable techniques include analytical methods,
simulation, and empirical methods based on measurements.
When analytical methods or simulation are used, network
nodes and links can be modeled to capture relevant operational
features such as topology, bandwidth, buffer space, and nodal
service policies (link scheduling, packet prioritization, buffer
management, etc.). Analytical traffic models can be used to
depict dynamic and behavioral traffic characteristics, such as
burstiness, statistical distributions, and dependence.
Performance evaluation can be quite complicated in practical
network contexts. A number of techniques can be used to
simplify the analysis, such as abstraction, decomposition, and
approximation. For example, simplifying concepts such as
effective bandwidth and effective buffer may be used to
approximate nodal behaviors at the packet level and simplify
235
the analysis at the connection level. Network analysis
techniques using, for example, queuing models and
approximation schemes based on asymptotic and
decomposition techniques can render the analysis even more
tractable. In particular, an emerging set of concepts known as
network calculus based on deterministic bounds may simplify
network analysis relative to classical stochastic techniques.
When using analytical techniques, care should be taken to
ensure that the models faithfully reflect the relevant operational
characteristics of the modeled network entities.
Simulation can be used to evaluate network performance or
to verify and validate analytical approximations. Simulation
can, however, be computationally costly and may not always
provide sufficient insights. An appropriate approach to a given
network performance evaluation problem may involve a hybrid
combination of analytical techniques, simulation, and empirical
methods.
As a general rule, traffic engineering concepts and
mechanisms must be sufficiently specific and well defined to
address known requirements, but simultaneously flexible and
extensible to accommodate unforeseen future demands.
C. Routing Recommendations
Routing control is a significant aspect of Internet traffic
engineering. Routing impacts many of the key performance
measures associated with networks, such as throughput, delay,
and utilization. Generally, it is very difficult to provide good
service quality in a wide area network without effective routing
control. A desirable routing system is one that takes traffic
characteristics and network constraints into account during
route selection while maintaining stability.
Traditional shortest path first (SPF) interior gateway
protocols are based on shortest path algorithms and have
limited control capabilities for traffic engineering [25]. These
limitations include : 1. The well known issues with pure SPF
protocols, which do not take network constraints and traffic
characteristics into account during route selection. For
example, since IGPs always use the shortest paths (based on
administratively assigned link metrics) to forward traffic, load
sharing cannot be accomplished among paths of different costs.
Constraint-based routing is desirable to evolve the routing
architecture of IP networks, especially public IP backbones
with complex topologies. Constraint-based routing computes
routes to fulfill requirements subject to constraints. Constraints
may include bandwidth, hop count, delay, and administrative
policy instruments such as resource class attributes. This makes
it possible to select routes that satisfy a given set of
requirements subject to network and administrative policy
constraints. Routes computed through constraint-based routing
are not necessarily the shortest paths. Constraint-based routing
works best with path oriented technologies that support explicit
routing, such as MPLS. Constraint-based routing can also be
used as a way to redistribute traffic onto the infrastructure
(even for best effort traffic). For example, if the bandwidth
requirements for path selection and reservable bandwidth
attributes of network links are appropriately defined and
configured, then congestion problems caused by uneven
traffic distribution may be avoided or reduced. In this way, the
performance and efficiency of the network can be improved.
A number of enhancements are needed to conventional link
state IGPs, such as OSPF and IS-IS, to allow them to distribute
additional state information required for constraint-based
routing. These extensions to OSPF were described in [26].
Essentially, these enhancements require the propagation of
additional information in link state advertisements.
Specifically, in addition to normal link-state information, an
enhanced IGP is required to propagate topology state
information needed for constraint-based routing. Some of the
additional topology state information include link attributes
such as reservable bandwidth and link resource class attribute
(an administratively specified property of the link).The
resource class attribute concept was defined in. An enhanced
link-state IGP may flood information more frequently than a
normal IGP. This is because even without changes in topology,
changes in reservable bandwidth or link affinity can trigger the
enhanced IGP to initiate flooding. A tradeoff is typically
required between the timeliness of the information flooded and
the flooding frequency to avoid excessive consumption of link
bandwidth and computational resources, and more importantly,
to avoid instability.
In a TE system, it is also desirable for the routing subsystem
to make the load splitting ratio among multiple paths (with
equal cost or different cost) configurable. This capability gives
network administrators more flexibility in the control of traffic
distribution across the network. It can be very useful for
avoiding/relieving congestion in certain situations. Examples
can be found in [27].
The routing system should also have the capability to control
the routes of subsets of traffic without affecting the routes of
other traffic if sufficient resources exist for this purpose. This
capability allows a more refined control over the distribution of
traffic across the network. For example, the ability to move
traffic from a source to a destination away from its original
path to another path (without affecting other traffic paths)
allows traffic to be moved from resource-poor network
segments to resource-rich segments. Path oriented technologies
such as MPLS inherently support this capability as discussed in
[25].
Additionally, the routing subsystem should be able to select
different paths for different classes of traffic (or for different
traffic behavior aggregates) if the network supports multiple
classes of service (different behavior aggregates).
III. ROUTING OPTIMIZATION USING OSPF
In a fairly recent review paper, [1],[2] address the issue of
using OSPF/IS-IS routing with optimized weight settings in
order to improve network QoS. The focus of their work is on
optimizing OSPF weights, given a set of projected demands to
avoid congestion. For solving the optimization problem, a
guided search heuristic similar to tabu search (however, with
235
hash tables instead of tabu lists) is proposed. This heuristic
explores the neighborhood of an initial weight vector by
modifying individual link metric settings in a greedy fashion.
In case of equal shortest paths, the load is evenly split up
(OSPF ECMP). To diversify the search process, random
perturbation of link weights is performed after finding a local
minimum. Within this problem, for proposed AT&T WorldNet
backbone, they found weight settings that performed within a
few percent from that of the optimal general routing where the
flow for each demand is optimally distributed over al paths
between sources to destination. This contrasts the common
belief that OSPF routing leads to congestion and its shows that
for the network and demand matrix studied we cannot get a
substantially better load balancing by switching to the
proposed more flexible Multi-Protocol Label Switching
(MPLS) technologies.
In [3] further investigations of routing optimization are
presented, taking into account failure situations, multiple load
periods, as well as noisy traffic matrices. For the considered
scenarios, mainly based on AT&T’s IP backbone with 90
nodes and 274 links, it can be demonstrated that routing
optimization is a suitable means for traffic engineering. In spite
of the focus of their work, the authors present a good weight
optimization and some literature review for the general routing
problem.
The work of [4] considers the same optimization problem
with identical objective function as in Fortz’s work. However,
a different search strategy for the weight setting problem is
proposed. Ericsson’s approach is based on a genetic algorithm,
where individual solutions of the problem are represented by
means of the link weights. This application of the genetic
algorithm framework corresponds in principle to the one
presented in [5]. In [6] presents a memetic version of the
algorithm, which in addition to the genetic algorithm
implements a local search heuristic [7].
In [8] discuss different forms of shortest-path routing
optimization. In this context they introduce the N commodity
linear program formulation for the general multicommodity
(MC) flow problem [9]. This formulation takes into account
the destination-based forwarding behavior of current intra-
domain routing protocols. It requires less variables and, thus, is
more efficient than the general MC formulation. However, the
formulation is not capable of capturing all relevant
characteristics of the OSPF protocol. Therefore, a
combinatorial search procedure is presented. Starting from an
initial network configuration, the link weights are iteratively
modified in order to drive network QoS towards a local
optimum. The average network delay (as computed for M/M/1
waiting systems) serves as an objective. The algorithm is
applied to a network with 16 nodes and 18 links.
[10] also approach the routing optimization problem through
use of the MC flow formulation. Their primary objective is the
minimization of the maximum link utilization, which results in
a well-balanced network. They show that any set of optimal
routes, which is obtained from the MC linear program, can be
represented by shortest path routing where the link weights are
determined by the dual problem. However, the presented
approach does not capture realistic features of existing
protocols such as the need for integer link weights or the
incapability of arbitrarily distributing traffic across equal-cost
paths.
Further work dealing with routing optimization in the
context of traffic engineering and performance improvement
has been published by [11],[12]. The protocols, which the
routing optimization procedures rely on, are again conventional
IGP protocols with one additive metric. The optimization
problem is formulated as a mixed-integer program, which is
then solved with CPLEX. As objective function, a weighted
sum of the average and the maximum link utilization is
considered. Due to the complexity of the problems, which
increase with the number of nodes, links, and flows, the
approach only works for smaller network sizes. The algorithm
was applied to a network with 6 nodes and 7 links. For a larger
network (14 nodes, 21 links) the solver could not always find
the optimum solution. Heuristic approaches are not presented
by the authors. However, for larger networks a separation
algorithm is proposed. Large networks are broken down into
smaller areas, which then are deals with individually before
being reunited [13]. The applicability of this approach is
demonstrated for networks up to 25 nodes and 42 links.
In [14],[15] propose a hybrid genetic algorithm for the
routing optimization problems. The objective function
considers a weighted sum of the average and the maximum link
utilization in the network. In a second approach, the maximum
link utilization is replaced by the number of modified link
weights. This way, weight changes can be taken into account
and minimized. However, it does not seem to be possible to set
a certain target value for the number of desired changes. Only
by varying the weight in the objective function, the emphasis of
the optimization can be shifted and, thus, different results can
be obtained. The algorithms were applied to networks with up
to 29 nodes and 100 links.
The work of [16] considers a mixed-integer program, which
extends the model of [17] and which is capable of capturing the
features of OSPF as well as of EIGRP [18]. For large networks
a genetic algorithm has been developed, whose principles were
first presented in [5] and which was enhanced by a search
algorithm [7]. A realization for OSPF-based routing adaptation
was published in [19]. In the field of MPLS routing
optimization, they propose label-switching as a complement to
conventional IP routing [19]. In principle, this approach is
similar to [20]. However, instead of using a heuristic, they
formulate a mixed-integer program, which can be solved
optimally for most cases. By applying their algorithm to some
of the problems in [20] a considerable QoS advantage could be
demonstrated.
In [17] consider routing optimization as an embedded
problem of network planning for IP networks. While the
overall objective is the minimization of capacity costs, the final
routing pattern has to follow the typical IP next-hop
destination-based paradigm. The problem is formulated as a
mixed-integer program. Again, only one additive metric is
235
considered. Furthermore, a special feature of the approach is
that it assures that shortest paths are unique. Thus, it does not
allow taking into account the possibility of load-sharing across
equal-cost paths. As the overall problem becomes very
complex for even medium size networks, heuristics are
presented for finding an initial topology and for improving it.
The improvement process carries out routing optimization
where the quality of a solution is determined by its required
capacity costs. The heuristic is based on a local search, which
iteratively scans the neighborhood for better solutions. The
overall method was applied to a network with 10 nodes and up
to 13 links. More work where routing optimization appears in
the context of network planning is presented by [21],[22]. This
work extends the mathematical formulation of [17] and
introduces the possibility of equal-cost load-sharing paths. The
objective function is again the total sum of all cost values in the
network plus a penalty component for traffic demand, which
cannot be served. The problem is solved by means of a
simulated annealing algorithm, which is applied to the set of
integer link weights. Given a certain link weight set, the
dimensioning result can be easily deduced. The algorithm was
applied to networks with up to 24 nodes and 76 links.
[23] have developed a simulation tool Netscope to
characterize some dynamic effect of the new OSPF weight
setting. Administrators can locate a heavily loaded link in the
network, identify the traffic demands that flow through it and
change the configuration to reduce the congestion. An
interesting question regarding TE by optimizing OSPF weights
is: How good is the best OSPF routing as compared to optimal
general routing. This question has been answered in [24]. In
[24] authors have constructed an example with nodes such that
the average utilization seen by the flow under OSPF routing
(with unit link weights on all links).is times higher than that
seen in optimal general routing.
It is not an easy task to classify the existing work on routing
optimization, mainly because of two reasons: (1) there are a
wide variety of assumptions and considerations that can be
made when proposing models for optimization, and (2) the
literature on the field is not extensive and a unified body does
not exist. A classification based on the objective function
cannot be done because most, if not all, models consider the
minimization of costs as their objective function. In this work
we attempt a classification based on the type of decisions to be
taken in the model, e.g., route selection in the model.
IV. DIRECTIONS FOR FURTHER RESEARCH
The models reviewed in this paper represent a significant
advance in the routing optimization based on Traffic
Engineering. However, research in this area is still relatively
fragmented, showing many gaps that further research must fill.
The full potential of the routing optimization has not been
completely explored yet.
The possible objectives of routing optimization are manifold
and there is no unique definition of what is considered an
optimum routing solution. Assuming that the network
infrastructure is given and that link and possibly node
capacities are assigned, two objective categories, which
intuitively are similar but which reflect two different
perspectives of network operation, are : (1) maximization of
achievable traffic throughput and (2) optimization of quality of
service.
Further research in the routing optimization could take into
consideration more complex networks for analysis. Algorithms
that explicitly consider the routing of vehicles setting are
needed for more complete dynamic scenarios. While optimal
solutions are very hard to obtain, heuristic procedures could be
developed to obtain approximate solutions for this complex
problem. Validation methods would as well be required.
Research is also needed for the explicit consideration of
multiple products in the routing technologies that would
constitute a significant contribution to the field. The analysis of
different instances of the weight problem under stochastic
demand considerations is still a largely open research area. As
Telecommunication industry move towards this reduction in
routing optimization levels, will become more important. in
terms of a desired network operational level, the analytical
formulation and solution of the problem. The benefits and
difficulties that these kinds of problems present remain as open
questions. A methodology to balance the complexity of this
kind of problems with the applicability of the results obtained
from them could be vital in the development of solution
methodologies that remain tractable and at the same time
suitable for practical application. Analytical formulation of
problems that consider more than two functions and exact or
approximate solution procedures are still needed. The review
of the work done on routing optimization makes evident that
the consideration of two or more functions and their
interrelations into a single model makes the optimization
problem much harder to solve than the previous disjoint
optimization problems. Comprehensive mathematical
programming formulations which incorporate simultaneously
all aspects of the optimization problems will, in general,
contain too many variables and constraints to be easily solved
using exact algorithms. Researchers should exercise increased
creativity in the analysis of the routing optimization models
and in the development of heuristic procedures capable of
handling the bigger challenge of integrated analyses. The
solution obtained from the optimization of the integrated
problem is not always more attractive than the sequential
optimization of the problem of each function. Depending on
system parameters and characteristics, the benefits obtained
from an routing optimization might not offset the increased
complexity of the problem and the greater solution effort. More
research is needed to identify overall frameworks for which
routing optimization are beneficial and compensate the
increased complexity of the problem. The routing optimization
using OSPF has proven to be of significant benefit to
companies that have applied it under adequate conditions.
Substantial savings and efficiency improvement have been
some of the results that the analysis of logistics integrated to
other services functions have granted to some companies.
235
Given the number of assumptions and constraints that the
analysis of routing functions can account for, a wide variety of
problems and models can arise. The identification of the
relevant instances of the optimized problem and their solutions,
is a task that still needs to be undertaken. The solutions to these
problems and their possible implementation into decision
support systems can provide companies with valuable tools to
gain competitive advantage as they move into higher
collaborative and competitive environments.
V. CONCLUSION
In this paper, various issues in routing optimization based on
Traffic Engineering have been discussed. However, there more
research needs to be undertaken in terms of routing
optimization. It presented an overview of some of the basic
issues surrounding traffic engineering in IP networks. A brief
historical review of pertinent developments related to routing
optimization based on traffic engineering was provided.
Additionally, the document specified a set of generic
requirements, recommendations, and options for better in area
of routing optimization based on Internet traffic engineering.
REFERENCES
[1] B. Fortz and M. Thorup. “Internet Traffic Engineering by Optimizing
OSPF Weights” In Proceedings of IEEE INFOCOM, pp 519-528,
March 2000.
[2] B. Fortz, J. Rexford, and M. Thorup. “Traffic Engineering with
Traditional IP Routing Protocols” IEEE Communications Magazine, vol
40, no 10, pp:118-124, October 2002.
[3] B. Fortz and M. Thorup. “Optimizing OSPF/IS-IS Weights in a
Changing World”. IEEE Journal on Selected Areas in Communications
(JSAC), 20(4):756-766, May 2002.
[4] M. Ericsson, M.G.C. Resende, and P.M. Pardalos. “A genetic algorithm
for the weight setting problem in OSPF routing” J. of Combinatorial
Optimization, no.6:pp 299-333, 2002.
[5] A. Riedl. “A Versatile Genetic Algorithm for Network Planning”. In
Proceedings of Open European Summer School on Network
Management and Operation (EUNICE’98), pp 97-103, Munich,
Germany, August/September 1998.
[6] Buriol L. S., Resende M. G. C., Ribeiro C. C., and Thorup M., “A
Hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS
routing, Networks”, vol. 46, no 1, pp. 36-56, 2005.
[7] A. Riedl. “A Hybrid Genetic Algorithm for Routing Optimization in IP
Networks Utilizing Bandwidth and Delay Metrics.” In Proceedings of
IEEE Workshop on IP Operations and Management (IPOM), Dallas,
USA, October 2002.
[8] K.G. Ramakrishnan and M.A. Rodrigues. “Optimal Routing in Shortest-
Path Data Networks.” Bell Labs Technical Journal, pp 117-138,
January/June 2001.
[9] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. “Network Flows-Theory,
Algorithms and Applications” Prentice Hall, Upper Saddle River, NJ,
1993.
[10] Y. Wang, Z. Wang, and L. Zhang. “Internet Traffic Engineering without
Full Mesh Overlaying.” In Proceedings of IEEE INFOCOM, pp 565-571,
April 2001.
[11] D. Staehle, S. Köhler, and U. Kohlhaas. “Towards an optimization of the
routing parameters for IP networks.” Technical Report 258, University
of Würzburg, May 2000.
[12] S. Köhler, D. Staehle, and U. Kohlhaas. “Optimization of IP Routing by
Link Cost Specification. In Internet Traffic Engineering and Traffic
Management”,15-th ITC Specialist Seminar, Wuerzburg Germany, July
2002.
View publication stats
[13] J. Milbrandt, S. Köhler, D. Staehle, and L. Berry. “Decomposition of
Large IP Networks for Routing Optimization”. Technical Report 293,
University of Würzburg, February 2002.
[14] E. Mulyana and U. Killat. “A Hybrid Genetic Algorithm Approach for
OSPF Weight Setting Problem”In Proceedings of the 2nd Polish-German
Teletraffic Symposium PGTS 2002, Gdansk Poland, September 2002.
[15] E. Mulyana and U. Killat “An Alternative Genetic Algorithm to
Optimize OSPF Weights” In Internet Traffic Engineering and Traffic
Management,15-th ITC Specialist Seminar,Wuerzburg Germany,July
2002.
[16] A. Riedl. “Optimized Routing Adaptation in IP Networks Utilizing
OSPF and MPLS.” In Proceedings of IEEE International Conference on
Communications (ICC), Anchorage, USA, May 2003.
[17] A. Bley, M. Grötschel, and R. Wessäly. “Design of Broadband Virtual
Private Networks: Model and Heuristics for the B-WiN.”Preprint SC 98-
13, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, March 1998.
[18] A. Riedl and D.A. Schupke. “A Flow-Based Approach for IP Traffic
Engineering Utilizing Routing Protocols With Multiple Metric Types”.
Presented at the Sixth INFORMS Telecom Conference, March 2002.
[19] A. Riedl. “Optimized Routing Adaptation in IP Networks Utilizing
OSPF and MPLS.” In Proceedings of IEEE International Conference on
Communications (ICC), Anchorage, USA, May 2003.
[20] S. Köhler and A. Binzenhöfer. MPLS Traffic Engineering in OSPF
Networks-a combined Approach. Technical Report 304, University of
Würzburg, February 2003.
[21] K. Holmberg and D. Yuan. “Optimal Network Design and Routing for
IP Traffic.”In Third International Workshop on Design of Reliable
Communication Networks (DRCN 2001), Budapest, Hungary, October
2001.
[22] K. Holmberg and D. Yuan. “Optimization of Internet Protocol Network
Design and Routing.” Research Report LiTH-MAT-R-2001-07,
Department of Mathematics, Linkoping Institute of Technology,
Sweden, March 2001.
[23] A.Feldman, A. Greenberg, C.Lund, N.Reingold, J.Rexford.
“Netscope:Traffic Engineering for IP Networks.” IEEE Network
Magazine, March 2000.
[24] B. Fortz and M. Thorup. “Increasing Internet Capacity Using Local
Search” Preprint, http://smg.ulb.ac.be.preprint/Fortz00_21.html, 2000.
[25] D. Awduche, "MPLS and Traffic Engineering in IP Networks", IEEE
Communications Magazine, Dec. 1999.
[26] Katz, D., Yeung, D. and K. Kompella, "Traffic Engineering Extensions
to OSPF", Work in Progress, February 2001.
[27] X. Xiao, A. Hannan, B. Bailey, L. Ni, "Traffic Engineering with MPLS
in the Internet", IEEE Network magazine, Mar. 2000.
Nor Musliza Mustafa obtained her B.Sc. in Computer Science from
University Putra Malaysia, 2001. Currently she is a M.Sc. in Computer
Network student at Faculty of Computer Science and Information Technology,
University Putra Malaysia. His research interests are in Computer Networks
and algorithm.
Dr. M. Othman is a Associate Professor at the Department of
Communication Technology and Network, University Putra Malaysia. He
received his PhD from the National University of Malaysia with distinction
(Best PhD Thesis in 2000 awarded by Sime Darby Malaysia and Malaysian
Mathematical Science Society). In 2002, 2003, 2004, 2005 and 2006, he
received gold medal award for Research and Development Exhibition. His
main research interests are in the fields of parallel and distributed algorithms,
high-speed computer network, Network Management (security and traffic
monitoring) and scientific computing. He already published more than eighty
National and International journal papers. He is also an associate researcher
and coordinator of High Speed Machine at Institute of Mathematical Science
(INSPEM), University Putra Malaysia.