ROUTE SEQUENCE ENUMERATION IN COMPUTER COMMUNICATION NETWORKS

Abstract

The problem of enumerating some or all paths in any Computer Communication Network (CCN) is an important step from the point of view of evaluation of the performance index of the network. This dissertation, first discusses the augmented route tree approach to derive the route sequence. An algebraic method is then explained and implemented to enumerate all paths between any node acting as source node to another node acting as terminating node for message switched networks. The concept of path enumeration is, further extended to obtain the path-loss sequence in circuit switched networks for various routing plans such as Successive Office Control (SOC), Originating Office Control (OOC) and OOC with spill-forward. These strategies are quite practical. The European AUTOVON network employs OOC with spill-forward and CONUS (Continental US) uses SOC. These paths/path-loss sequence can be used to obtain performance index of the network such as routing technique and reliability/end to end blocking for designing a CCN.