Minimax open shortest path first routing algorithms in networks supporting the SMDS service
Minimax open shortest path first routing algorithms in networks supporting the SMDS service
复制标题
支持 SMDS 服务的网络中 Minimax 开放最短路径优先路由算法
DOI：
10.1109/icc.1993.397358
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
J.L. Wang
中科院分区：
文献类型：
--
作者：
F. Lin;J.L. Wang
提出并比较了两种支持交换式多兆比特数据业务（SMDS）的准静态最小最大开放最短路径优先（OSPF）路由算法。在OSPF路由中，网络被建模为一个图，每条链路都与一个非负的弧权重相关联。计算每个源的最短路径生成树，以承载单独寻址和组寻址（多播）流量。OSPF路由协议被采用作为SMDS网络的默认交换系统间接口（ISSI）路由算法的主要部分，其中弧权重与聚合链路集容量成反比。考虑SMDS网络中链路利用率最小化的链路集度量的选择问题。该问题是一个非线性混合整数规划问题。<<ETX>>
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>>