No abstract

No abstract

In the HSDPA (High-Speed Downlink Packet Access) Iub Transport Network (TN) which connects the Radio Network Controller with base stations (Node Bs), congestion control is needed. Because of the TN's often narrow resources, fairness of resource sharing is an important issue. Basic Additive Increase Multiplicative Decrease (AIMD) congestion control guarantees convergence to fairness in the long run; all flows converge to an equal share of resources in steady state, where no flows join or leave. However, incoming flows decrease the level of fairness, that is why transient fairness should be taken into account as well. This paper proposes a method which provides fairness-optimal initial rate for incoming HSDPA flows. The proposed method improves average fairness. The method can be applied in a rate based congestion control where flows share the same bottleneck. The paper also gives a general solution for fairness-optimal initial rate in case of second-order fairness measures.

No abstract

No abstract