We study the problem of distributed online admission control and routing of permanent virtual circuits in a capacitated network. We assume that we have k distinct decision makers, each of which is responsible for gathering its own information about the state of the network. Through simulation, we demonstrate that an exponential based routing scheme will perform well in a distributed model provided granularity is sufficiently high. In order to ground these results theoretically, we prove that exponential-based schemes attain best-possible competitive ratios (same as for the centralized case) provided each edge can accommodate at least\Omega\Gamma k log n) requests. A matching lower-bound shows that no deterministic algorithm can attain best-possible competitive ratios without requiring the same level of granularity. In the randomized case, we present a modified exponential-based approach which obtains best-possible competitive ratios provided the granularity is at least\Ome...

process planning