Evaluation of Routing with Robustness to the Variation in Traffic Demand.

Saved in:
Bibliographic Details
Title: Evaluation of Routing with Robustness to the Variation in Traffic Demand.
Authors: Agrawal, Himanshu1 himanshu.agrawal@rmit.edu.au, Jennings, Andrew1 andrew.jennings@rmit.edu.au
Source: Journal of Network & Systems Management. Dec2011, Vol. 19 Issue 4, p513-528. 16p.
Subjects: Traffic engineering software, Routing (Computer network management), Algorithms, Internet traffic, Quality of service, Internet service providers
Abstract: In this paper, we focus on routing problem in the face of variation in traffic demands. We implement a Robust Routing algorithm (RRT) with an aim of satisfying networking goals such as load balancing, routing robustness to the range of traffic demand matrices or to the traffic changes caused by uncertain traffic demands. We conduct simulation experiments on range of topologies that includes, real network and randomly generated synthetic network topologies. Simulation results show marked improvement in the maximum link utilization compare to Open Shortest Path First. K-shortest path implementation of RRT can be extended for Multi Protocol Level Switching. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Network & Systems Management is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, we focus on routing problem in the face of variation in traffic demands. We implement a Robust Routing algorithm (RRT) with an aim of satisfying networking goals such as load balancing, routing robustness to the range of traffic demand matrices or to the traffic changes caused by uncertain traffic demands. We conduct simulation experiments on range of topologies that includes, real network and randomly generated synthetic network topologies. Simulation results show marked improvement in the maximum link utilization compare to Open Shortest Path First. K-shortest path implementation of RRT can be extended for Multi Protocol Level Switching. [ABSTRACT FROM AUTHOR]
ISSN:10647570
DOI:10.1007/s10922-010-9193-6