Showing papers on "Link-state routing protocol published in 1970"

Hybrid routing technique for switching communication network

Abstract: A hybrid routing technique for an analog or digital switching communication network containing several switching centers for contacting a called subscriber at a destination switching center whose location in the network need not be known to the calling subscriber and for providing a deterministic route back from the destination switching center to the originating switching center. The entire system is substantially simultaneously flooded once in parallel radial fashion with a flood signal of simple format containing information representing the calling switching center, the called subscriber and the time or origination of the call; local subscriber directories at each of the switching centers of the network are examined substantially simultaneously to determine which of the switching centers is the destination switching center. The selection of a route between the called and the calling subscribers is done independently of the locating of the called subscriber and allows effective selection of routes, based on an abundance of information available at the switching centers concerning the current status of the network and regardless of transmission delays along the routes.

Study of Optimal Path Finding Techniques

Abstract: Routing is a process of forwarding the data from a known source to the destination. In this process, the data may travel through several intermediate paths, and there exist a need to select the best possible optimal nodes to forward the data. This optimal selection of nodes will enable to achieve a high performance in the network. Large amount of worked has been carried out to find the optimal path in the network routing to improve its efficiency and to remove congestion problems. A good routing algorithm should be able to find an optimal path and it must be simple. It also must have low overhead, and be robust and stable, converging rapidly, and must remain flexible. There exists a lot of routing algorithm which have been developed for specific kind of network as well as for general routing purpose. In this paper, I studied some of the best optimal path techniques.

Routing Algorithm of Mobile Agents for Query Retrieval Using Genetic Algorithm

Abstract: Mobile agents often have a task to collect data from several predefined sites. This should be done in an efficient way by minimising the elapsed time. Usually these agents only know the list of sites but not the distances between them. This paper proposes a method to minimise a network routing time taken by the mobile agents to collect information from different sites using genetic algorithm (GA). The mobile agents repeat travelling over short routes and avoid longer ones. Mobile agents for query retrieval have used the GA to select the best routes that minimise the query retrieval time. The result shows that the proposed method provides good time minimisation in retrieving the query results by the mobile agents based on different GA parameters.

Adaptive routing in a large communications network

Abstract: This paper is concerned with the behavior of an adaptive routing system in a large communications network. The adaptive routing algorithm described uses stochastic switching matrices to automatically find and complete the traffic paths through a system. A realistic network and traffic which were derived from military field exercises are used to illustrate the real time behavior of the algorithm. Simulation experiments indicate that adaptive routing techniques can be effective in large communications networks.