环网络中的呼叫接纳控制

Call admission control in ring networks

呼叫接纳控制是通讯网络设计与运营中的一个重要优化问题.环网络中,这一问题的目标是对于给定的具有边容量的环网络和任意利润的呼叫的集合,确定最大利润的呼叫子集并为其中每一个呼叫安排路径,使得任一边容量不被违反.对于无向和有向环网络呼叫接纳控制问题,均给出了多项式时间近似方案.

The call admission control problem is an important optimization problem encountered in the design and operation of communication networks. The goal of the problem in rings is to determine and route, for a given ring network with edge capacities and a set of calls with arbitrary profits, a maximum profit subset of the calls such that no edge capacity is violated. Polynomial time approximation schemes （PTASs） for both the undirected and the directed cases are presented.