In this paper, a suitable generalized object-oriented formulation is devised, which can be used to find the shortest paths between machines for all types of networks. The use of object-oriented programming paradigm allows the programmer to add greater flexibility to the programs by modeling them as entities (called Objects) that have certain common properties (which are de-fined by the Class that they belong to). Apart from the flexibility offered to the programmer, a major advantage in Object Oriented protocols is in the teaching field. Non-object Oriented im-plementations make use of certain data structures which represent the parameters of a network (and thus its state at any point of time). But in Object Oriented implementation the Classes are modeled taking into account the physical parameters of a network. So it is not difficult to grasp the data structures used. Moreover, due to the use of Object Oriented methodologies, it is easier to visualize the operations in the algorithm. The same algorithm can be run without any modifi-cation, 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. Additionally, 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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.