Efficient architectures and algorithms for multicasting data in computer communication networks

  • Authors:
  • Nader F Mir;Kevin D Donohue;Yusuf M Matcheswala

  • Affiliations:
  • Department of Electrical Engineering, University of Kentucky, 453 Anderson Hall, Lexington, KY 40506, USA;Department of Electrical Engineering, University of Kentucky, 453 Anderson Hall, Lexington, KY 40506, USA;Department of Electrical Engineering, University of Kentucky, 453 Anderson Hall, Lexington, KY 40506, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2001

Quantified Score

Hi-index 0.24

Visualization

Abstract

This paper presents two network architectures with associated routing and multicast algorithms for improved performance under multicasting traffic conditions. A conditionally nonblocking network, referred to as a Clos network, forms the basis for the development of efficient multicast communication networks. The Clos network is first analyzed under multicast traffic conditions for blocking and multicast overflow probability. The analysis determines the overflow probability under two different multicast distribution assumptions. The first distribution assumes all packets request the same number of copies and the second distribution uses a random number of requested copies. An analysis of an extension of the presented network to multiplexed parallel planes of a network shows a significant improvement on the network performance and particularly on the carried traffic load when compared with previously published multicast architectures using different buffering strategies.