Research: Cost-effective algorithms for multicast connection in ATM switches based on self-routing multistage networks

  • Authors:
  • Jaehyung Park;Hyunsoo Yoon

  • Affiliations:
  • Department of Computer Science and Center for Artificial Intelligence Research, Korea Advanced Institute of Science and Technology 373-1, Kusong-Dong, Yusung-Gu, Taejon 305-701, South Korea;Department of Computer Science and Center for Artificial Intelligence Research, Korea Advanced Institute of Science and Technology 373-1, Kusong-Dong, Yusung-Gu, Taejon 305-701, South Korea

  • Venue:
  • Computer Communications
  • Year:
  • 1998

Quantified Score

Hi-index 0.24

Visualization

Abstract

In this paper, we discuss the multicast connection in the self-routing multistage interconnection network (MIN) for constructing the internal architecture of asynchronous transfer mode (ATM) switches. Many applications of ATM switches require multicast connections in addition to conventional point-to-point connections. Multicast connection, in which the same message is delivered from a source to an arbitrary number of destinations, is fundamental in supporting collective connection primitives including cable TV, teleconferencing, and video-on-demand services. This paper presents a novel approach to supporting multicast connection, on the basis of the recursive scheme that recycles a multicast packet one or more times through the network to reach desired destinations. We also propose cost-effective multicast algorithms providing deadlock-freedom in MIN-based ATM switches. The proposed algorithms require a small and fixed number of recycling passes and a reasonable number of links used. The proposed algorithms can be easily applied to buffered MIN-based ATM switches.