Establishing Virtual Circuits in Large Computer NETWORKS
Original Publication Date: 1986-Jan-01
Included in the Prior Art Database: 2005-Mar-08
This article describes an approach to economically obtain shortest path communication even in very large computer networks. 1.INTRODUCTION One of the most fundamental decisions faced in designing a data communication network is the choice of a routing technique. While dynamic routing gives the best performance, the dynamic determination of optimal paths is costly, and unacceptably costly for large networks. This is because of large storage and bandwidth costs. There are several approaches that have been proposed to cope with or solve the apparent incompatibility between the goals of shortest path routing and the realities of large networks. The following describes an approach that economically provides shortest paths even in large networks. 2.