2010IEEE Communications LettersRequires access

Cost reduction of reliable networks using load balanced routing

Marija Antić, Aleksandra Smiljanić

Open publisher page 4 citations

Abstract

The routing based on load balancing and shortest path routing (LB-SPR) was recently introduced, and it was shown to have advantages over the standard shortest path routing (SPR) algorithms: it can support higher guaranteed traffic loads, and it simplifies the resource reservation processes. In this paper, the cost of setting up the reliable network which is resilient to node or link failures is analyzed. In such a network, enough capacity has to be provisioned on all the links for routing the traffic even in the case of a failure. The cost of setting up the reliable network using the shortest path routing (SPR) is compared to the cost of setting up the reliable network using the load balanced shortest path routing (LB-SPR). It is shown that LB-SPR can significantly decrease the network cost.

About this research paper

What this paper is about

The routing based on load balancing and shortest path routing (LB-SPR) was recently introduced, and it was shown to have advantages over the standard shortest path routing (SPR) algorithms: it can support higher guaranteed traffic loads, and it simplifies the resource reservation processes. In this paper, the cost of setting up the reliable network which is resilient to node or link failures is analyzed. In such a network, enough capacity has to be provisioned on all the links for routing the traffic even in the case of a failure. The cost of setting up the reliable network using the shortest path routing (SPR) is compared to the cost of setting up the reliable network using the load balanced shortest path routing (LB-SPR). It is shown that LB-SPR can significantly decrease the network cost.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The routing based on load balancing and shortest path routing (LB-SPR) was recently introduced, and it was shown to have advantages over the standard shortest path routing (SPR) algorithms: it can support higher guaranteed traffic loads, and it simplifies the resource reservation processes. In this paper, the cost of setting up the reliable network which is resilient to node or link failures is analyzed. In such a network, enough capacity has to be provisioned on all the links for routing the traffic even in the case of a failure. The cost of setting up the reliable network using the shortest path routing (SPR) is compared to the cost of setting up the reliable network using the load balanced shortest path routing (LB-SPR). It is shown that LB-SPR can significantly decrease the network cost.

Key concepts: Equal-cost multi-path routing, Private Network-to-Network Interface, Computer science, Computer network, Static routing, Link-state routing protocol, Path vector protocol, Multipath routing

Related papers

Back to paper searchBrowse research topicsOriginal source
Cost reduction of reliable networks using load balanced routing — Research Paper | ScholarLens