Latest revision as of 18:08, 3 February 2021

Abstract

The volume of higher priority Internet applications is increasing as the Internet continues to evolve. Customers require quality of service (QoS) guarantees with not only guaranteed bandwidth and delay but also with high availability. Our objective is for each estimated traffic flow to find a primary path with improved availability and minimum failure impact while satisfying bandwidth constraints and also minimizing network resource consumption. We devise a heuristic algorithm with four different cost functions to achieve our objective. Our approach can enhance availability of primary paths, reduce the effect of failure and also reduce the total resource consumption for both primary and backup paths.

Original document

The different versions of the original document can be found in:

• http://epubs.surrey.ac.uk/1851

• http://epubs.surrey.ac.uk/1851/1/fulltext.pdf

• http://xplorestaging.ieee.org/ielx5/10000/32117/01493810.pdf?arnumber=1493810,

http://dx.doi.org/10.1109/iscc.2005.84

• https://dblp.uni-trier.de/db/conf/iscc/iscc2005.html#AminHPH05,

https://www.ee.ucl.ac.uk/~gpavlou/Publications/Conference-papers/Amin-05.pdf,

http://epubs.surrey.ac.uk/1851/1/fulltext.pdf,

https://ieeexplore.ieee.org/document/1493810,

http://epubs.surrey.ac.uk/1851,

http://doi.ieeecomputersociety.org/10.1109/ISCC.2005.84,

https://academic.microsoft.com/#/detail/2126104081