Welcome to the InfoSci Platform
Multiple Optimization of Network Carrier and Traffic Flow Goals Using a Heuristic Routing Decision System

Multiple Optimization of Network Carrier and Traffic Flow Goals Using a Heuristic Routing Decision System

Wayne S. Goodridge, Shyamala C. Sivakumar, William Robertson, William J. Phillips
Copyright: © 2010 |Pages: 25
ISBN13: 9781615207916|ISBN10: 1615207910|ISBN13 Softcover: 9781616922917|EISBN13: 9781615207923
DOI: 10.4018/978-1-61520-791-6.ch007
Cite Chapter Cite Chapter

MLA

Goodridge, Wayne S., et al. "Multiple Optimization of Network Carrier and Traffic Flow Goals Using a Heuristic Routing Decision System." Intelligent Quality of Service Technologies and Network Management: Models for Enhancing Communication, edited by Pattarasinee Bhattarakosol, IGI Global, 2010, pp. 113-137. https://doi.org/10.4018/978-1-61520-791-6.ch007

APA

Goodridge, W. S., Sivakumar, S. C., Robertson, W., & Phillips, W. J. (2010). Multiple Optimization of Network Carrier and Traffic Flow Goals Using a Heuristic Routing Decision System. In P. Bhattarakosol (Ed.), Intelligent Quality of Service Technologies and Network Management: Models for Enhancing Communication (pp. 113-137). IGI Global. https://doi.org/10.4018/978-1-61520-791-6.ch007

Chicago

Goodridge, Wayne S., et al. "Multiple Optimization of Network Carrier and Traffic Flow Goals Using a Heuristic Routing Decision System." In Intelligent Quality of Service Technologies and Network Management: Models for Enhancing Communication, edited by Pattarasinee Bhattarakosol, 113-137. Hershey, PA: IGI Global, 2010. https://doi.org/10.4018/978-1-61520-791-6.ch007

Export Reference

Mendeley
Favorite

Abstract

This chapter presents a multiple constraint optimization algorithm called routing decision system (RDS) that uses the concept of preference functions to address the problem of selecting paths in core networks that satisfy traffic-oriented QoS requirements while simultaneously satisfying network resource-oriented performance goals. The original contribution lies in the use of strong scales employed for constructing a multiple criteria preference function in an affine space. The use of preference functions makes it possible for paths that match both traffic-oriented and resource-oriented goals to be selected by the algorithm. The RDS algorithm is used in conjunction with a heuristic path finding algorithm called Constraint Path Heuristic (CP-H) algorithm which is a novel approach to finding a set of constraint paths between source and destination nodes in a network. The CP-H algorithm finds multiple paths for each metric and then passes all the paths to the RDS algorithm. Simulation results showed that the CP-H/RDS algorithm has a success rate of between 93 and 96% when used in Waxman graph topologies, and is shown to be significantly better than other heuristic based algorithms under strict constraints. In addition, it is shown that the associated execution time of the CP-H/RDS algorithm is slightly higher than other heuristic based algorithms but good enough for use in an online traffic engineering (TE) application. Simulations to assess the performance of CP-H/RDS algorithm in a TE environment show that the algorithms has lower call block rates than other TE algorithms. It is also shown that the CP-H/RDS has a 96% probability of providing at least two distinct feasible backup paths in addition to the main QoS path. A framework for implementing the CP-H/RDS as a routing server is proposed. The routing decision system server (RDSS) framework is novel in that the complexity introduced by QoS awareness remains outside the network.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.