Abstract
Routing protocol based on Floyd-Warshall algorithm which allows maximization of throughput is proposed. The metric function in the proposed routing protocol is throughput including not only send packets but also retransmission packets in order for improving effectiveness and efficiency of the network in concern. Through simulation studies, it is found that the proposed routing protocol is superior to the conventional Open Shortest Path First: OSPF based on Dijkstra algorithm for shortest path determination from the point of view of maximizing throughput. A routing protocol for Virtual Private Network (VPN) in Autonomous System (AS) based on maximizing throughput is proposed. Through a comparison between the proposed protocol and the existing protocols, OSPF (Widely used), it is also found that the required time for transmission of packets from one node to another node of the proposed protocol is 56.54% less than that of the OSPF protocol.
Highlights
Routing protocol based on Floyd-Warshall algorithm which allows maximization of throughput is proposed
Considering the throughput Ti as “Ni”, the number of packets arriving at an arbitrary node i in a unit time, the time t1 from the arrival of an arbitrary packet at an arbitrary node i to another arbitrary node j is determined by nodes i, j If the communication capacity of the link between is α, it can be expressed by equation (1)
Routing protocol based on Floyd-Warshall algorithm allowing maximization of throughput is proposed
Summary
There are two types of adaptive protocols (Interior Gateway Protocol: IGP) 1 used for path control in an autonomous system (Autonomous System: AS): one based on vector distance and one based on link state 3. Open Shortest Path First (OSPF) has been put to practical use and used frequently7 This is basically one of the adaptive protocols like RIP, and rewrites RT based on the link state (shortest distance). The shortest route is obtained by Dijkstra Algorithm: DA [1], the shortest route to all target nodes is found, and the method of rewriting RT is Link State Protocol: LSP. In LSP, the broadcast interval is 30 seconds, so if there is a change during that time, the tracking may be delayed If this interval is shortened, the following speeds up, but only the link state packet may occupy the network.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
