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 119
- Downloads 0
Record Matching : Improving Performance in Classification
Duplication detection identifies the records that represent the same real-world entity. This is a vital process in data integration. Record matching refers to the task of finding entries that refer to the same entity in...
An Automated Microcontroller Based Liquid Mixing System
This paper introduces a systematic approach to design and realize a temp and volume based liquid mixing system using three low cost micro controllers. The primary function of this system is to mix different liquids of re...
Non-Linear Segmentation of Touched Roman Characters Based on Genetic Algorithm
The segmentation accuracy of Roman cursive characters, especially touched characters, is essential for the high performance of Optical Character Recognition Systems. This paper presents a new approach for non-linear seg...
AHP and Group Decision Making for Access Network Selection in Multi-Homed Mobile Terminals
The evolving fourth generation wireless networks provide heterogeneous wireless access. This feature enables the multi homed mobile devices to seamlessly roam across various wireless access technologies and to connect al...
Association Rules Extraction from Incremental Databases through ICPT
Association Rule Mining is an important task in data mining. This paper proposes two stage ICPT (Incremental Compact Pattern Tree) Construction Methodology. This methodology facilitates to obtain incidental association r...