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 130
- Downloads 0
Improved Optimal Competitive Hopfield Network for the Maximum Stable Set Problem
A large number of problems in artificial intelligence and other areas of computer science can be viewed as special cases of the Maximum Stable Set Problem (MSSP). In this paper, we propose a new approach to solve the MSS...
Significance of Web 2.0 in Digital Libraries
The rapid development of Information and Communication Technologies has provided a well sophisticated environment to develop the digital libraries. A digital library is a large-scale, organized collection of complex and...
A Study on Relationship between Emotional Quotient and Recollection & Retention in E-learning
E-Learning plays a vital role in the field of education. Emotional Quotient (EQ) is one of the human factors. Similarly Recollection and Retention (R & R) is one of the cognitive factors of E-Learning process. The va...
Quantitative evaluation of Segmentation algorithms based on level set method for ISL datasets
The enormous potential research efforts have been taken for sophisticated and natural human computer interaction using gestures. This work has got motivated from long ago as 1980’s since sign language is the only communi...
A Modified Robust Queue Management with Feedback Compensation Technique to Manage the Congestion Control in Wireless Communication Networks
At present there has been a tremendous growth in the computer networks and wireless networks. Due to the enormous growth of voice, audio, video and data applications over the wireless networks, the requirement of congest...