Abstract: We consider the operation of a network in overload situations, that is, when the incoming traffic is outside the feasibility region determined by the network topology. In such a situation nodes will be overloaded and it is important to maintain a balanced network overload while ensuring that maximum amount of traffic reaches the sink nodes. We formulate the problem as lexicographic optimization of node overloads, study the properties of the solution and provide a distributed flow reallocation mechanism whose node overloads converge to the optimal solution
0 Replies
Loading