Admission control in a packet network

Abstract

In embodiments of the invention when a session request is received the value assigned to that session is compared to present congestion costs in the network at the present time. If the value of the session exceeds the cost then the session is accepted; otherwise it is rejected. It is possible to show mathematically that, provided this strategy is used for all session requests, then, when demand exceeds supply for a given resource, the congestion measurement for that resource rises to become equal to its shadow price. Here, in a model of a capacity constrained network, the shadow price of a capacity constraint is the cost to other users of using one unit of capacity. Congestion measurements can therefore be used to provide a 'cost' (to other users) of admitting the flow to the network, which can then be compared against the 'value' (to the network operator) of admitting the flow during the admission control evaluation. Additionally, this “cost” vs. “value” comparison can be used for path selection, as well as any other resource management decision. For example, in particularly preferred embodiments a session is not only admitted based upon the cost value comparison, but is also assigned to a particular path which maximizes value minus cost.