Optimizing weights of Open Shortest Path First (OSPF)

Optimizing weights of Open Shortest Path First (OSPF)


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 4,396

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description

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.

Product Specifications
SKU :COC72761
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-10-08
0 Review(s)