Survey of Routing Algorithms for Computer Networks

This thesis gives a general discussion of routing for computer networks, followed by an overview of a number of typical routing algorithms used or reported in the past few years. Attention is mainly focused on distributed adaptive routing algorithms for packet switching (or message switching) networks. Algorithms for major commercial networks (or network architectures) are reviewed as well, for the convenience of comparison

A failsafe distributed protocol for minimum delay routing

Bibliography: p. 695."May 1981." From: IEEE transactions on communications, Vol. COM-29, No. 5, May 1961.U.S. Department of Defense Contract N00015-74-C-1183 Office of Naval Research Contract ONR/N00014-77-C-0532Adrian Segall, Moshe Sidi

Optimal distributed routing for virtual line-switched data networks

Bibliography: p. 35."September 1978."Supported by the Advanced Research Project Agency (monitored by ONR) under Contract no. N00014-75-C-1183Adrian Segall

Distributed decision and communication problems, final report

"June 1987." Title from cover. "MIT OSP no. 85552."Includes bibliographical references.Funded by the Office of Naval Research. N00014-77-C-0532 NR 041-519.prepared by Michael Athans; submitted to J. Randolph Simpson, Code 111SP, Office of Naval Research

Self-stabilizing cluster routing in Manet using link-cluster architecture

We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called a clusterhead that contains the routing information about inter and intra-cluster communication. A cluster is comprised of all nodes that choose the corresponding clusterhead as their leader. The algorithm consists of two main tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, it is within two hops of the clusterhead, it knows the direct neighbor on the shortest path towards the clusterhead, and there exist no two adjacent clusterheads. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterheads (as per the link-cluster architecture), there is no need to check the consistency of the routing tables. Second, since all other nodes have significantly less work (they only forward messages), they use much less power than the clusterheads. Therefore, if a clusterhead runs out of power, a neighboring node (that is not a clusterhead) can accept the role of a clusterhead. (Abstract shortened by UMI.)

Distributed Path Computation without Transient Loops: An Intermediate Variables Approach

Paths with loops, even transient ones, pose significant stability problems in networks. As a result, much effort has been devoted over the past thirty years to designing distributed algorithms capable of avoiding loops. We present a new algorithm, Distributed path computation with Intermediate Variables (DIV), that guarantees that no loops, transient or steady-state, can ever form. DIV’s novelty is in that it is not restricted to shortest paths, can easily handle arbitrary sequences of changes and updates, and provably outperforms earlier approaches in several key metrics. In addition, when used with distance-vector style path computation algorithms, DIV also prevents counting-to-infinity; hence further improving convergence. The paper introduces DIV and its key properties. Simulation quantifying its performance gains are also presented

Communication Robustness Analysis and improvements in Leclanch'e BMS systems

This master thesis have been done in the circumstance of an internship contract in a Swiss company called Leclanch'e SA. This company is develops, designs and manufactures complete battery storage solutions, covering the entire technology chain. From cells to pack solutions for Hybrid Electric Vehicles (HEVs) and Battery Electric Vehicles (BEVs), as well as the Battery Management System which is the scope of this thesis. Customers of the company have reported errors on the communication interface of the Battery Management System of the company, known as G2 Leclanché BMS. The purpose of the study done in this thesis is to find root causes of problems in the communication interface and its constraints. To this end, faulty BMS samples returned by clients have been analysed and some special testing setups have been prepared in order to study communication constraints as baud rate, cable length, maximum number of nodes, etc. Conclusions extracted from this robustness analysis of communication on G2 Leclanch'e BMS will be used for the next generation of BMS which is being developed by the company