A Novel Optimal routing using Hop-by-Hop Adaptive linking

I am presenting the first of its kind project, the first link-state routing solution carrying traffic through packet-switched networks. At each node, for every other node, the algorithm independently and iteratively updates the fraction of traffic destined to that leaves on each of its outgoing links. At each iteration, the updates are calculated based on the shortest path to each destination as determined by the marginal costs of the network’s links. The marginal link costs used to find the shortest paths are in turn obtained from link-state updates that are flooded through the network after each iteration. For stationary input traffic, we prove that our project converges to the routing assignment that minimizes the cost of the network. Furthermore, I observe that our technique is adaptive, automatically converging to the new optimal routing assignment for quasi-static network changes. I also report numerical and experimental evaluations to confirm our theoretical predictions, explore additional aspects of the solution, and outline a proof-of-concept implementation of proposal

Hop-by-Hop Adaptive linking A Novel Approach for Finest routing

Using Hop-by-Hop Adaptive linking for achieving finest routing is an unprecedented approach. And it is the first link-state routing solution carrying traffic through packet-switched networks. At each node, for every other node, the algorithm independently and iteratively updates the fraction of traffic destined to that leaves on each of its outgoing links. At each iteration, the updates are calculated based on the shortest path to each destination as determined by the marginal costs of the network’s links. The marginal link costs used to find the shortest paths are in turn obtained from link-state updates that are flooded through the network after each iteration. For stationary input traffic, we prove that our project converges to the routing assignment that minimizes the cost of the network. Furthermore, I observe that our technique is adaptive, automatically converging to the new optimal routing assignment for quasi-static network changes. I also report numerical and experimental evaluations to confirm our theoretical predictions, explore additional aspects of the solution, and outline a proof-of-concept implementation of proposal

Simulation and analysis of adaptive routing and flow control in wide area communication networks

This thesis presents the development of new simulation and analytic models for the performance analysis of wide area communication networks. The models are used to analyse adaptive routing and flow control in fully connected circuit switched and sparsely connected packet switched networks. In particular the performance of routing algorithms derived from the L(_R-I) linear learning automata model are assessed for both types of network. A novel architecture using the INMOS Transputer is constructed for simulation of both circuit and packet switched networks in a loosely coupled multi- microprocessor environment. The network topology is mapped onto an identically configured array of processing centres to overcome the processing bottleneck of conventional Von Neumann architecture machines. Previous analytic work in circuit switched work is extended to include both asymmetrical networks and adaptive routing policies. In the analysis of packet switched networks analytic models of adaptive routing and flow control are integrated to produce a powerful, integrated environment for performance analysis The work concludes that routing algorithms based on linear learning automata have significant potential in both fully connected circuit switched networks and sparsely connected packet switched networks

Simulation of a minimum delay distributed routing algorithm

Bibliography: p. 139.Prepared under National Science Foundation Grant NSF/ENG76-24447.Originally presented as the author's thesis, (M.S.) in the M.I.T. Dept. of Electrical Engineering and Computer Science, 1977.by John Christopher Poulos

Analysis of new protocols for computer communication networks

An advanced forward 'area tactical radar network, now under conceptual development by the Air Force Electronic Systems Division, can be viewed as a novel form of computer network but with other unique problems resulting from the specialized nature of the application. The proposed network will link together a number of short-range radars, each with associated data processing equipment, so that each radar site has a complete file of tracks for all targets seen by any radar in the network. In addition, the communication network is expected to be used for transmission of a variety of other types of command and control messages. A new class of adaptive routing protocols for computer communication networks have been developed in this thesis, using the radar network as a basis, but applicable to any computer comrnunication network. These new routing protocols utilize new techniques for searching out and using both reciprocal paths (paths over which messages can travel in either direction) and non-reciprocal paths (paths over which messages can travel in only one direction) for directed message routing. The computations required by the new routing protocols are carried out in a distributed manner at each network node. The only information on network structure which a node needs to store in order to carry out any of the routing computations is the identity of its neighbors. A GPSS simulation model of a 13 node radar network was used to determine the steady state characteristics of the new routing protocols in an undamaged network, from which a performance model was developed, and to determine the transient characteristics of the new routing protocols while adapting to various cases of network damage. The transient tests indicate that each of the new routing algorithms possess varying degrees of adaptability to network damage. Some of the new routing algorithms were shown to possess the capability to adapt to extreme cases of network damage. Further transient tests indicated that when some of the new routing algorithms are combined with acknowledgement techniques, complete protocols which reliably deliver all messages to their destinations, even following severe network damage, are formed. The new protocols developed in this thesis are suitable for use in conventional computer communication networks. Overhead comparisons with an ARPA type routing protocol indicate that the new routing protocols developed in this thesis generally require less overhead for large networks with low connectivity