Optimizing weights of Open Shortest Path First (OSPF)
Algorithms, Techniques, and Methods
Versandkostenfrei!
Versandfertig in 6-10 Tagen
38,99 €
inkl. MwSt.
PAYBACK Punkte
19 °P sammeln!
The problem of computing weights on the links and routing data in shortest paths known as OSPF weights setting problem (OSPFWSP) is NP complete. OSPFWSP is defined as given a set of traffic demands between origin-destination pairs, the OSPF weight setting problem consists in determining weights to be assigned to the links so as to make efficient use of network resources. In this book, a problem of OSPF traffic routing in hybrid network is stated. Three different methods are proposed for solution and implemented in real environment. Also three proposed algorithms are introduced for solving OSPF...
The problem of computing weights on the links and routing data in shortest paths known as OSPF weights setting problem (OSPFWSP) is NP complete. OSPFWSP is defined as given a set of traffic demands between origin-destination pairs, the OSPF weight setting problem consists in determining weights to be assigned to the links so as to make efficient use of network resources. In this book, a problem of OSPF traffic routing in hybrid network is stated. Three different methods are proposed for solution and implemented in real environment. Also three proposed algorithms are introduced for solving OSPFWS problem. The proposed algorithms used different techniques for optimizing weights. Two methods are proposed for updating weights. The first method is updating weights according to unallocated bandwidth, where increasing weights values of links with large empty bandwidth and decreasing weights of links with small empty bandwidth. This method is denoted by Empty Bandwidth (EM). The second depends on mixing EM method with another technique. Such technique depends on either increasing weights of the more utilized links, or decreasing link weights of the less utilized links.
Andere Kunden interessierten sich für
