Controlling alternate routing in general-mesh packet flow networks
Controlling alternate routing in general-mesh packet flow networks
复制标题
控制通用网状数据包流网络中的备用路由
DOI：
10.1145/190314.190330
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
A. DeSimone
中科院分区：
文献类型：
--
作者：
S. Sibal;A. DeSimone
高速分组网络将开始支持需要服务质量(Qos)保证的业务。保证服务质量通常意味着为呼叫持续时间预留资源。我们提出了一种状态相关的路由方案，该方案建立在任何基本状态无关的路由方案的基础上，通过以在一定的泊松假设下保证的方式将阻塞在其主路径(由状态无关方案选择的)上的流路由到备用路径上，以提高基本状态无关方案的性能。我们的方案只要求每个节点具有与其关联的那些链路的状态信息。当基本状态无关方案已经就位并且不希望彻底检修路由算法时，或者当链路的状态(预留流)改变得足够快以至于状态信息的及时更新对于所有可能的呼叫发起者来说都不可行时，这样的方案是有价值的。在完全连接的4节点网络上以及在NSFnet T3主干上模拟的稀疏连接的12节点网络上进行的模拟表明，我们的受控替代路由方案带来的性能改进。
High-speed packet networks will begin to support services that need Quality-of-Service (QoS) guarantees. Guaranteeing QoS typically translates to reserving resources for the duration of a call. We propose a state-dependent routing scheme that builds on any base state-independent routing scheme, by routing flows which are blocked on their primary paths (as selected by the state-independent scheme) onto alternate paths in a manner that is guaranteed—under certain Poisson assumptions— to improve on the performance of the base state-independent scheme. Our scheme only requires each node to have state information of those links that are incident on it. Such a scheme is of value when either the base state-independent scheme is already in place and a complete overhaul of the routing algorithm is undesirable, or when the state (reserved flows) of a link changes fast enough that the timely update of state information is infeasible to all possible call-originators. The performance improvements due to our controlled alternate routing scheme are borne out from simulations conducted on a fully-connected 4-node network, as well as on a sparsely-connected 12-node network modeled on the NSFNet T3 Backbone.