Path hunt for efficient broadcast and multicast connections in multi-stage switching fabrics

Abstract From the Canadian patent

To efficiently implement the algorithm for branching each broadcast call as close to the output of a multi-stage switching fabric (100) as possible the path, hunt (FIG. 12) for a call path is performed by examining the actual contents of control memories (305, 1701) that control the switching stages of the switching system, in order to determine whether --and if so where-- the desired call path may, be branched from an existing call path inside of the switching system. For efficiency and speed, the examination is performed by monitoring control memory contents being read out for the purpose of controlling the switching stages and contents of, control memories of multiple stages are …