On Multitransmission Networks,

Abstract

The paper considers the problem of designing networks whose function is the simulataneous transmission of k independent signals over k vertex-disjoint paths (k-transmission). All paths are assumed to consist of two edges and to traverse an intermediate vertex (bus). Necessary and sufficient conditions are obtained for realizability of a k-transmission, which are then used for establishing a lower bound to the number of transmission edges for given numbers of stations and busses. The sufficient condition is also used for the design of optimal and suboptimal k-transmissions. Finally the problem of the realization of multitransmissions is considered under the hypothesis of edge failures: conditions, bounds and design methods are described for the special case of single edge failure. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1971
Accession Number
AD0725023

Entities

People

  • Franco P. Preparata

Organizations

  • University of Illinois Urbana–Champaign

Tags

Readers

  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Graph Algorithms and Convex Optimization.