Showing papers on "Hazy Sighted Link State Routing Protocol published in 1980"
TL;DR: An opUmal algorithm to route data in a mesh-connected parallel computer is presented that uses the minimum number of unit distance routing steps for every data permutation that can be specified as above.
Abstract: An opUmal algorithm to route data in a mesh-connected parallel computer is presented This algorithm can be used to perform any data routing that can be specified by the permutation and complementing of the bits in a PE address Matrix transpose, bit reversal, vector reversal, and perfect shuffle are examples of data permutations that can be specified in this way The algorithm presented uses the minimum number of unit distance routing steps for every data permutation that can be specified as above K~EV WORDS ANY PrmASES parallel algorithm, mesh-connected computer, ILLIAC IV, permutation, complexity, data routing CR CATEGORIES 5 25, 5 31, 6 22
142 citations
Patent•
29 Sep 1980TL;DR: In this article, a response message based upon stored data link status obtained when a message is received through the flood routing protocol selects the shortest time delay path for responding to that message.
Abstract: A distributed digital data communication network having widely dispursed nodes provides for effective transmission of messages between each node through the use of flood routing. A response message based upon stored data link status obtained when a message is received through the flood routing protocol selects the shortest time delay path for responding to that message. This process eliminates network instability.
101 citations
TL;DR: The problem of devising a good updating protocol is shown to be a problem in the management of a distributed data base and the requirements which any such protocol must meet are presented and discussed.
68 citations
TL;DR: This paper presents three recursive algorithms for computing end-to-end blocking probabilities in a network with alternate routing, based on link blocking probabilities, which are progressively more efficient.
Abstract: This paper presents three recursive algorithms for computing end-to-end blocking probabilities in a network with alternate routing, based on link blocking probabilities. The only assumption made is the statistical independence of link blocking probabilities. The first algorithm applies to arbitrary routing plans. The second algorithm applies to single-loss-route routing plans which include predictive routing plans used in advanced private networks. The second algorithm is also applicable to solving the terminal-pair reliability problem. The third algorithm applies to tandem-node-matrix-generated routing plans which include hierarchical routing plans similar to those used in North American public toll network, AT&T's CCSA, EPSCS, and ETN networks. These three algorithms are progressively more efficient.
23 citations