Open Access
49- https://doi.org/10.1109/icc.1993.397358
Minimax open shortest path first routing algorithms in networks supporting the SMDS service
- May 23, 1993
- F.y.s Lin +1 more
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
- # Open Shortest Path First Routing
- # Switched Multi-megabit Data Service
- # Open Shortest Path First Routing Protocol
- # Routing Algorithms In Networks
- # Open Shortest Path First
- # Nonlinear Mixed Integer Programming Problem
- # Algorithms In Networks
- # Arc Weight
- # Open Path
- # Routing Algorithms
