A simplified fairness measure providing balanced interference in window flow controlled networks

A fairness criterion is introduced which avoids the time-consuming computation of the congestion measure. A suboptimal algorithm which minimizes the measure is used to select the window sizes for the vital circuits in two network examples. The numerical results show that the solution obtained has several pleasing properties: the bottlenecks are fairly shared; users who do not pass through congested areas of the net are allowed to have a higher throughput; and session delays are roughly proportional to their respective path length. It is shown that the method can be easily extended to allow network users to have a preferential performance measure. The fairness measure could also be used for the case of finding the window size for a virtual circuit which is about to be established, assuming that the windows of the users already in the network cannot be changed