ABSTRACT
This chapter considers one-to-one, one-to-many, and one-to-all communication. Routing algorithms can be classified as general purpose and special purpose depending on the use of these algorithms. Some algorithms are designed based on selected objectives such as adaptivity, fault tolerance, and freedom from deadlock. General purpose algorithms are suitable for all types of networks but may not be efficient for a particular network. Special-purpose algorithms only fit specific types of networks such as hypercubes, meshes. A deadlock-free routing ensures freedom from deadlock through carefully designed routing algorithms. In a non deadlock-free routing no special provision is given to prevent or avoid the occurrence of a deadlock. The chapter discusses minimal routing on rings, meshes, and n-cubes, and considers both deterministic and adaptive routing. It classifies broadcasting algorithms based on network topologies, switching techniques, and system port models. The basic path-based approach is based on first constructing a Hamiltonian cycle and the multicast set is forwarded based on cycle.
