A network flow framework for online dynamic channel allocation

We present a framework based on network flows for dynamic channel allocation. The framework allows us to gracefully extend previously proposed heuristics, while avoiding the problems associated with the optimal packing schemes. The framework is shown to yield parametrizable algorithms that tradeoff the benefit of channel reassignments with the costs. Channel reassignments are allowed to be performed not just at new call arrivals, but also at various other trigger points like call terminations and channel quality deterioration