Search

Dominating-set-based routing in ad hoc wireless networks with unidirectional links is examined and discussed.

The concept of a restricted area for conducting message routing and balancing buffer utilization is proposed. The aim is to minimize traffic congestion.

The High-Performance Efficient Router (HiPER), a multidimensional router that accommodates high-throughput error-corrected communication channels, is discussed. HiPER combines flit-level error control and mad postman (bit-pipelined) switching.

A single, unified theory is described for design of deadlock-free fully adaptive routing algorithms for all classes of network topologies and all switching procedures. A general theory is proposed that applies to direct and indirect networks, and to regular and irregular networks.

Localized routing algorithms are discussed, which aim to minimize the total energy per packet and/or the lifetime of each node. Power consumption in static networks is a primary focus of interest.

The superiority of flooding-based methods and hybrid single-path/flooding variants, compared to LAR2, is discussed. It is shown that an approach involving loop-free, single-path algorithms and guaranteed delivery is more successful than existing procedures.

An object-oriented discrete-event simulation environment, pp-mess-sim, acts as a flexible and extensible simulator that evaluates multicomputer networks in message-passing systems. The simulation environment pp-mess-sim is capable of analyzing various network topologies, routing-switching policies, and router models, under different levels of communication workload. The object-oriented pp-mess-sim simulates computer networks that can handle multiple routing and switching schemes simultaneously, by correlating routing-switching policies and traffic patterns with collections of packets.

An associative approach involving the mapping of algorithms onto a set of bit-patterns, matched in parallel, provides flexibility and quick execution for implicit routing algorithms. The mapping of a large number of routing algorithms for a broad range of interconnection network topologies indicates that the number of required bit-patterns and the topology degree are of the same order. The hardware requirement for the scheme is low. Three cases showing the capabilities of the router approach are discussed.

The hot potato algorithms are asymptotically optimal for the two-dimensional grid and torus. An O(n squared) hot potato algorithm analyzes the n-dimensional Boolean equation. The algorithm produces three time bounds for permutation routing. A complexity of o(2 to the nth power) steps was attained for the first time by the deterministic algorithm for the 2 raised to the nth power -nodes Boolean cube. The experimental procedure for the development of algorithm is discussed.

An optimal broadcast algorithm developed for dealing with broadcasting problems in hypercubes includes wormhole, e-cube routing and all-port communication. The algorithm involves only O(n/log to the base 2 (n + 1)) wormhole routing steps. Simple recursive functions illustrated in pseudocodes are capable of representing the algorithm. Specific upper and lower bounds for n less than or equal to 10 help enhance the (n/2) upper bound.

A network-partitioning approach for one-to-all broadcasting on wormhole routed networks was proposed. This was based on constructing multiple independent subnetworks which can work concurrently to increase the parallelism in communication. It was distinguished from the traditional edge-disjoint-spanning-trees-based approach. Its application to tori, meshes and hypercubes was described.

A general theoretical framework for the analysis of deadlock-free routing functions is described. The theory captures most of the definitions of a routing function which include vertex-dependent, source-dependent, path-dependent and input-dependent. Its application is not restricted to one-to-one routing that selects the output channel as a function of the current node or the current input channel but also to one-to-many routing.