A data transmission network comprises a plurality of interconnected nodes and input/output units. In response to receipt of a data message for onward transmission through the network, each node accesses information which it stores relating to the then current topology of the network and transmits the message through the appropriate connecting links. Each node operates according to a predetermined algorithm to up-date its stored topology information. Each node at any given time assumes a particular state, state n. When in this state, it interrogates immediately each neighboring node with the question "Who are the neighbors of node of distance (n-1) from you?" where "distance" is defined in terms of the number of links. The addressed nodes respond either by returning the requested information in the form of a positive reply or by responding "Don't yet know". Each node advances to state (n+1) after it has received a consistent set of positive replies from all its neighbors and then repeats the question, again to each of its immediate neighbors but now concerning the identities of the next more distant nodes. The information received as it advances through the states is stored and thus up-dates the topology information.

Information transmission network including a plurality of nodes interconnected by links and methods for the transmission of information through a network including a plurality of nodes interconnected by links

Computer networks and distributed systems

Supersystems are general purpose computers achieving throughputs in excess of 1 billion instructions per second (BIPS). As such, supersystems present formidable design challenges in the areas of technology and architecture. This paper examines three of the classical design options: high-speed monoprocessors, array processors, and distributed processors. The latter approach appears most desirable for supersystems, but will require improved interconnection networks.

Supersystems: Technology and Architecture

Current generation sonar acoustic signal processing systems operate at throughputs comparable to those in 5th generation computer systems; for example systems currently deployed operate with processing throughputs in excess of 100 million operations per second. These processing speeds are achieved using distributed processing graph networks employing hardware based primitives or macros that can be programmed to perform the basic signal processing functions. The primitive network is configured by simple control to implement complete signal processing flow graphs that define the entire sonar procesing function.

https://link.springer.com/content/pdf/10.1007/978-94-009-5361-1_51

Digital Signal Processing for Sonar

A network performance measure, called receptivity, is introduced which quantifies a computer network's ability to accommodate concurrent communication. Receptivity is basically defined as the probability that a rejection of a communication request does not occur, i.e., it is the probability that the network will be receptive to all expected concurrent communication requests. A graph-theoretic result is derived which places upper bounds on the maximum number of concurrently communicating origin-destination pairs which a given computer network can accommodate. The bound is dependent on several important network parameters including the number of network links, the maximum link capacity, and a measure of the network's average minimum hop distance. The upper bound result is used as a basis for estimating receptivity. The estimate for receptivity compares favorably with simulated values of receptivity for several example networks. >

Receptivity: a measure of computer networks' ability to accommodate concurrent communication

Algorithms are described here which are suitable for control of a distributed network of signal processors which are interconnected with dedicated paths using decentralized routing control. This paper discusses the algorithm used to implement the processing required at the switching node processor, which can be realized with any of several LSI technologies. Although centralized systems are more efficient in terms of hardware, a single failure in the controller may disable the entire network. This distributed network is implemented with a crossbar switch at each node which facilitates the simultaneous utilization of multiple paths in the network. Index Terms-Computer networks, data routing algorithms, digital signal processing, distributed processing, signal processing networks.

Heath

Papers

A Routing Algorithm for Signal Processing Networks