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 142
- Downloads 0
A Comparison of the TCP VariantsPerformance over different Routing Protocols on Mobile Ad Hoc Networks
Abstract: We describe a variant of TCP (Tahoe, Vegas), TCP is most widely used transport protocol in both wired and wireless networks. In mobile ad hoc networks, the topology changes frequently due to mobile nodes, this...
Graph based Approach and Clustering of Patterns (GACP) for Sequential Pattern Mining
The sequential pattern mining generates the sequential patterns. It can be used as the input of another program for retrieving the information from the large collection of data. It requires a large amount of memory as we...
Integration of Web mining and web crawler: Relevance and State of Art
This study presents the role of web crawler in web mining environment. As the growth of the World Wide Web exceeded all expectations,the research on Web mining is growing more and more.web mining research topic which com...
Recovery based Time Synchronization for Wireless Networks
Time synchronization schemes in Wireless Sensor Net- works have been subjected to various security threats and attacks. In this paper we throw light on some of these at- tacks. Nevertheless we are more concerned with the...
CP-Miner : A hybrid Approach for Colorectal Polyp Detection
Computed Tomography Colonography (CTC) is the new eneration technique for detecting colorectal polyps using volumetric CT data combined with Computer Aided Detection (CAD) system. The aim of this paper is to detail the i...