外文翻译两种动态路由协议性能比较.docVIP

Performance Comparison of Two Dynamic Routing Protocols: RIP and OSPF ABSTRACT: There are two main classes of adaptive routing protocols in the internet: distance vector and link state. This paper presents the comparison between distance vector and link state. It also outlines the pros and cons of RIP and OSPF protocols and a performance analysis with some possible enhancement is presented. Network Simulator (NS2) is used to obtain the performance results of the two classes using different metrics such as throughput, packet delay and packet loss. Results of the simulation show that OSPF has a better performance than RIP in terms of average throughput and packet delay in different network sizes, while RIP is better than OSPF in terms of number of packet loss in large networks. Keywords: Dynamic Routing Protocols, RIP, OSPF, NS2 1.INTRODUCTION Networks rely on routing protocols to keep the routing tables updated. Routing is used in networks to control and forward data. For a router to be efficient and effective, the critical factor is the choice of the routing protocol. Routing protocols find a path between network nodes; if multiple paths exist for a given node then the shortest path is selected by protocol. Each protocol has a cost metric that it applies to each path. The path with lowest metric is selected by protocol. Metrics to compare one routing protocol with another are based on convergence time to adapt to topology changes, optimality is to choose the best path, not necessarily at minimum cost but to ensure a minimum delay or to minimize overhead and space requirements to store the routing table [1][5][7]. The rest of paper is organized as follows: Section 2 is an overview of routing protocols. In Section 3 and 4 RIP and OSPF are discussed. We studied RIP and OSPF because this interior routing protocol is widely used in the internet. In addition the pros and cons of these routing protocols are studied in brief. In Section 5 the system mod