Low-bandwidth routing and electrical power networks

Abstract

Given a graph G and a (multi-)set of pairs of vertices in it, the classical NP-hard maximum edge-disjoint-paths problem (MDP) is to connect as many of the given pairs as possible using pairwise edge-disjoint paths in G. We study a relative of this problem: we have a network with fixed link capacities that may have to service large demands when necessary. In particular, individual demands are allowed to exceed capacities, and thus flows for some request pairs necessarily have to be split into different flow-paths. This is the framework for computational problems arising from: (i) electrical power networks due to the proposed deregulation of the electric utility industry in the USA, and (ii) applications such as real-time Internet services (e.g., telephone, fax, video). We show that these problems come in a few variants, some efficiently solvable and many NP-hard; we also present approximation algorithms for many of the NP-hard variants presented. Some of our approximation algorithms benefit from certain improved tail estimates that we derive; the latter also yield improved approximations for a family of packing integer programs.

This work has been supported by EPRI and Department of Energy under Contract W-7405-ENG-36.

Work done while visiting Los Alamos National Laboratory, Los Alamos NM 87545.

Supported in part by National University of Singapore Academic Research Fund Grant RP970607.

Part of this work was done while visiting Los Alamos National Laboratory, Los Alamos NM 87545. Supported in part by NSF CAREER Award CCR-9501355.