Load Balanced Routing using OSPF
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 8
Abstract
Today’s Internet applications are in need of additional bandwidth. The Internet nature changes and its traffic are growing because of new applications. Initially when the file transfers dominated the internet we don’t require bandwidth reservations but because of multimedia applications we require bandwidth reservations. Pair to Pair applications are making traffic patterns impossible to predict, and the traffic loads generated at nodes need to be routed regardless of the traffic pattern. Bandwidth reservations can be made simple, if the guaranteed node traffic loads are known, as it will be explained in the paper. The shortest path routing protocols used on the Internet today neither maximize the guaranteed node traffic loads nor provide scalable and fast bandwidth reservations. Load balancing can improve the network throughput for arbitrary traffic pattern. In this paper we analyze and implement a routing protocol that is based on load balancing and a commonly used shortest path routing protocol, and is, consequently, termed as Load Balancing-Shortest Path Routing. LB-SPR is not assumed a particular traffic matrix as it optimized for an arbitrary traffic pattern. Optimization assumes only the weights assigned to the network nodes according to their estimated demands. The throughput achieve by the current SPR protocols, such as OSPF or RIP is less efficient as compare to optimize routing. Importantly, to support of triple-play applications, including video and audio applications that require high QoS, LB-SPR can be used as it calculates the guaranteed traffic loads and so allows fast autonomic bandwidth reservations. An actual modification of the TCP/IP stack that includes LBSPR is also described. Whenever the network topology changes the information needed to perform the routing optimization is automatically distributed among the network nodes using the signaling mechanisms of the OSPF protocol.
Authors and Affiliations
Mr. Ritesh Dayama , Mr. S. P. Pingat
Keywords
Related Articles
- EP ID EP119207
- DOI -
- Views 125
- Downloads 0
Shortest Distance Message Broadcasting for an Applications in an irregular Mobile Topologies
This paper introduces data forwarding algorithm for a articular applications within Mobile Adhoc etworks that is based on the concept of electing the neighbor node from a set of esignated nodes. The algorithm, which...
ALORITHM FOR SHADOW DETECTION IN REAL COLOUR IMAGES
Shadow detection in real scene images is always a challenging but yet interesting area. Most shadow detection and segmentation methods are based on image analysis. This paper aimed to give a comprehensive and critical st...
Color and Texture Based Identification and Classification of food Grains using different Color Models and Haralick features
This paper presents the study on identification and classification of food grains using different color models such as L*a*b, HSV, HSI and YCbCr by combining color and texture features without performing preprocessing. T...
An Accurate Volume Measurement of Solid Lesions by correcting Partial Volume Effects on CT images
Under digital image processing, medical images have lots of applications like oncological diagnosis of tumors and chemotherapy. Computed Tomography (CT) images are used to capture images of solid lesions like lung or liv...
Parsing Complementizer Phrases In Machine Translation System
Every language has a finite number of words and finite number of rules but infinite number of sentences. Sentences are not formed by the words alone but by structural units known as constituents. Analysis of the sentence...