首页> 外国专利> Multicast connection scheduling in time:space:time switching fabrics

Multicast connection scheduling in time:space:time switching fabrics

机译:time:space:time交换结构中的组播连接调度

摘要

Multicast call blocking is reduced in TST switch fabrics with the aid of an m-entry data structure. Each entry corresponds to one of m timeslots, and has 2n sub-entries corresponding to n input ports and n output ports. An N-cast call X:(y→z1, z2 . . . zN) is representable by associating a selected entry's yth input sub-entry with z1, z2, . . . zN of the selected entry's output sub-entries. Upon receipt of a call, the data structure entries are sequentially examined to detect the first entry for which a yth input sub-entry is unused and z1, z2, . . . zN output sub-entries are unused. If such an entry is detected, the call is scheduled for transmission in the corresponding timeslot. If there is no such entry and if N=1 the call cannot be scheduled; but, if N1 the call is divided into two or more calls and an attempt is made to schedule them as above.
机译:借助m条目数据结构,在TST交换结构中减少了多播呼叫阻塞。每个条目对应于m个时隙之一,并且具有对应于n个输入端口和n个输出端口的2n个子条目。通过将选定条目的y关联,可以表示N-cast调用X:(y→z 1 ,z 2 .... z N )。第输入子项,其中z 1 ,z 2 ,。 。 。所选条目的输出子条目的z N 。收到呼叫后,将顺序检查数据结构条目以检测未使用y th 输入子条目以及z 1 ,z 的第一条目。 2 、。 。 。 z N 个输出子条目未使用。如果检测到这样的条目,则将呼叫安排在相应的时隙中传输。如果没有这样的条目,并且如果N = 1,则无法安排呼叫。但是,如果N> 1,则将呼叫分为两个或多个呼叫,并尝试如上所述进行调度。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号