Optimal behavior for the Kumar-Seidman network of switching servers
A.A.J. Lefeber, J.E. Rooda · TU/e Research Portal · 2008
In this paper we consider the two server switching network introduced by Kumar and Seidman. We consider the problem of minimizing the weighted average wip in the system, assuming non-increasing costs downstream. Assuming that both servers have the same period, optimal network behavior has been derived. By means of an illustrative example is shown that this optimal network behavior at rst glance can be counterintuitive. In particular this implies that currently existing ways for controlling these kind of networks do not achieve optimal network behavior.