An object-oriented approach to data routing in a network

Priyam Chatterjee and Suman Chakraborty

International Journal of Industrial and Systems Engineering, 2010, vol. 5, issue 4, 391-404

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.

Keywords: data networks; object-oriented modelling; OOM; data routing. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=32963 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:5:y:2010:i:4:p:391-404

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().