In virtual circuit networks, the routing problem involves the selection of the best path among all the available candidate paths connecting the source to the destination at the beginning of a session. In this thesis, we propose a pre-selection path routing scheme that not only takes the current network status into account, but also considers the number of requests being issued by other nodes in the next period. The routing algorithm allows each source node to hold and collect its connection setup requests during the current period and broadcast this information to the rest of the nodes at the next network update. Each source node applies the same path selection algorithm to choose the optimal paths for its requests. In the next period, the hold requests will be issued along these pre-selected paths to set up connections. We formulate this routing scheme as a linear integer optimization problem. The cutting plane technique and two-phase simplex method are applied to develop the routing path arrays. We compare the setup blocking rates of this algorithm to that of a cost function routing algorithm. Our algorithm outperforms a cost function routing algorithm under different traffic loads and network configurations.