We investigate a trunk reservation policy for an asynchronous transfer mode network with multiple end-to-end virtual paths. We develop a performance model for the network using a stochastic Petri net, which can exactly compute the call blocking probability for each call class. We suggest a strategy, most loaded routing with trunk reservation, for controlling the call traffic load on the virtual paths. We also develop an efficient heuristic procedure to optimize the trunk reservation parameter for each call class. We also examine the sensitivity of call holding time distributions to call blocking probabilities.
