An object-oriented approach to data routing in a network
by Priyam Chatterjee, Suman Chakraborty
International Journal of Industrial and Systems Engineering (IJISE), Vol. 5, No. 4, 2010

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.

Online publication date: Wed, 05-May-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com