A simulation study of the OSPF-OMP routing algorithm
| Autor: | Tamas Nemeth, G. Michael Schneider |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Routing protocol
Static routing Computer Networks and Communications Equal-cost multi-path routing Computer science computer.internet_protocol business.industry Distributed computing ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Open Shortest Path First Flooding (computer networking) Routing Information Protocol Distance-vector routing protocol Optimized Link State Routing Protocol Private Network-to-Network Interface Link-state routing protocol Default gateway Multipath routing Interior gateway protocol IS-IS business computer Constrained Shortest Path First Computer network |
| Zdroj: | Computer Networks. 39:457-468 |
| ISSN: | 1389-1286 |
| DOI: | 10.1016/s1389-1286(02)00231-1 |
| Popis: | Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the existence of multiple equal-cost paths between source and destination nodes. A well-known variation of OSPF, OSPF-ECMP (ECMP, equal-cost multipath), does exploit the presence of multiple equal-cost paths, but only on a static basis. A variation of OSPF, OSPF-OMP (OMP, optimized multipath), attempts to dynamically determine the optimal allocation of traffic among multiple equal-cost paths based on the exchange of special traffic-load control messages. This paper briefly describes the OSPF-OMP algorithm and the design of a discrete event simulator that models its behavior. We then use this simulator to carry out three experiments that compare the performance of OSPF, OSPF-ECMP, and OSPF-OMP under a range of traffic loads and distributions. Our results show that OSPF-OMP produces improvements in both delivery time and the number of lost messages when compared with the other two protocols. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect