ESTABLISHING VIRTUAL CIRCUITS IN LARGE COMPUTER-NETWORKS

Network routing algorithms general attempt to provide communication between two modes by sending data messages along the best or shortest path between them. We propose a new clustering technique which permits us to obtain optimal paths. However, determining these paths requires some effort and thus the methodology is appropriate even if the paths are then used for many messages in virtual circuit fashion. An application to planar networks gives a quantitative demonstration of obtaining optimal paths with reduced path determination cost.