An object-oriented approach to data routing in a network

Abstract

In this paper, a suitable generalised object-oriented formulation is devised to find the shortest paths between machines for all types of networks. Modelling the network in an object-oriented paradigm allows greater flexibility to the analyser since each class is modelled using the physical parameters of a network. Moreover, it is easier to visualise the operations in the routing algorithm. The same algorithm can also be run without any modification, even if network characteristics and topology change. Addition or subtraction of routers and links can be achieved by simple addition and subtraction of nodes and edges. In addition, for this algorithm the weighting function just needs to be changed to incorporate the requisite changes for different types of subnets. Finally, the algorithm is aptly illustrated by means of two representative case studies.