Net-planner: a capacity allocation tool

Abstract

The Internet abounds today because of the interconnection of a vast number of sub-networks worldwide. This type of network requires special routing to form connections between end stations. Computing and procuring the necessary equipment to support a network's demands is called provisioning. Reliable network provisioning should include spare capacity allocations, in addition to the usual working capacity allocations. Given that provisioning must start somewhere, planners estimate the demands they will encounter. Once this is done, algorithms may be applied which compute the shortest path for each demand according to the best route types. This paper will describe our solution to this provisioning problem. It will also show how we incorporated it into a comprehensive planning tool which was developed in cooperation with a major U.S. carrier.