Minimax Open Shortest Path First Routing Algorithm in Networks Supporting the SMDS Service
Resource
IEEE ICCU_U93.
Journal
IEEE ICCU_U93
Pages
-
Date Issued
1993
Date
1993
Author(s)
Lin, F.Y.S.
Wang, J.L.
Abstract
Two quasi-static minimax open shortest path first (OSPF) routing algorithms in networks supporting the Switched Multi-megabit Data Service (SMDS) are presented and compared. In OSPF routing, the network is modeled as a graph and each link is associated with a nonnegative arc weight. A shortest path spanning tree is calculated for each origin to carry both the individually addressed and the group addressed (multicast) traffic. The OSPF routing protocol is adopted as a major part of the default inter-switching system interface (ISSI) routing algorithm for SMDS networks where arc weights are inversely proportional to the aggregate link set capacities. The problem of choosing a set of link set metrics is considered so that the maximum link utilization factor is minimized in an SMDS network. The problem is formulated as a nonlinear mixed integer programming problem.>
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
110.pdf
Size
23.21 KB
Format
Adobe PDF
Checksum
(MD5):260ffaeb5d1666054229e0a02069074d