S. Dhawan and R. Kumar (India)
Routing algorithms, DCOM Implementation
Method is presented to develop a distributed component object model (DCOM) for network routing. By applying object-oriented approaches for the development of DCOM processes, feedback can be obtained to help understand, routing behavior of DCOM under different environments. Most of the infrastructures development problems like route planning, facility location, and allocation of resources are based on the network topology created from maps with spatial and non-spatial attributes. The problem is where do you locate new facilities? In this research paper, the facility can be on any node i.e. at any road junction. It is also possible to locate a facility in the middle of the road segment but for the sake of simplicity in the optimizing process, the facilities are normally located at the roads. They can be then moved over the connected arcs for more sophisticated facility location. However the optimization remains valid whether the location is made on node or on arc. The main areas of its application will be in planning of infrastructure at village level, city level, district level, and state level. The allocation of the facilities to the demand nodes is another infrastructure requirement, which has lot of potential uses. Some practical areas where this has good use are in location and allocation of facilities like hospital, health centers, schools etc. in an optimum way. So that distance between facility and demand nodes will be minimized. In real world scenario, there are numerous such applications where these types of software tools are very essential in order to develop DCOM for network routing. This paper is organised into three parts: part I describes the routing algorithms, which were implemented using a single shortest path routing approach, part II presents the DCOM design implementation phases by using object-oriented approach of software development, and part III investigates and shows the results with the use of DCOM for network routing.
Important Links:
Go Back
