Alternatively , too much time in dynamic allocation is spent on computing call blocking probabilities 动态分配带宽的时间很多都消耗在了计算呼叫损失率上。
And it is amended to be as subtracting one unit from the virtual path with lowest cbp in constrained links 然后,修正为:对全网中受限链路中的具有最小呼叫损失率的虚路径做减一操作。
However , recurrent kaufman formula used to compute call blocking probabilities ( cbps ) of virtual paths in “ step algorithm ” is time - consuming 然而,步进式算法中用来计算虚路径上的呼叫损失率的kaufman迭代公式非常的耗时。
Also , one step in “ step algorithm ” , which takes off one unit of bandwidth away from the virtual path with lowest cbp in the whole network , is explained to be immoderate 同时,对步进式算法中的一步:对全网中呼叫损失率最小的虚路径做带宽减一操作,本文解释了这个步骤的不合理性。
In this paper , a fast approximate algorithm , which is based on quasi - independent and used to compute cbps is generalized to the case of preserving bandwidth to replace kaufman formula 本文中,一种快速的基于准独立近似的计算呼叫损失率的公式被推广到了资源非完全共享的情况,以替代kaufman公式。
The process of analyzing “ step algorithm ” gives us food for thought . that is , whether equal increase or decrease in the bandwidth of two virtual paths will result in rearrangement of the sequence of cbps of these two 在对步进式算法的分析过程中,引出了这样一个问题:对两条虚路径增减相同的带宽,会不会改变它们呼叫损失率的大小关系。