首页> 外国专利> interconnection networks nxn formed by delta networks and method for the establishment of permutations entry - exit

interconnection networks nxn formed by delta networks and method for the establishment of permutations entry - exit

机译:由三角网络形成的互连网络nxn和建立排列入口-出口的方法

摘要

This invention discloses a new class of NxN multistage interconnection networks which is called class of Parallel Delta Networks (PDN). For such a class of networks the non-blocking conditions are given, i.e. those conditions which guarantee the capability of establishing any connection request between an inlet link and an outlet link, both supposed free whichever the state of the network may be. In particular, by means of the graph colouring technique it has been proved that the minimum number of Delta subnetworks necessary to provide the non-blocking property in a PDN is n &boxdr& S/2 &boxdl& -1, where S and n are the number of stages in a NxN Delta network and the number of inlet and outlet links of a single switching element, which Delta network consists of, respectively, and &boxdr& x &boxdl& indicates the littlest whole number greater than x. For the establishment of the inlet-outlet connection request, a routing method has been defined. Such a method operates for switching elements of any size and in case of the set-up of a single connection request this method assures a complexity of the order of 2ROOT N. In case of a whole set of inlet-outlet point-to-point connection requests (inlet-outlet permutation), this method has a polynomial complexity of the order N3/2. As the complexity relevant to the establishment of a single connection request is extremely low, this method is particularly suitable to an application in an environment in which the connection requests are asynchronous, i.e. a telecommunication environment. Therefore, this network can be used as connection network within an automatic exchange. It is also disclosed a variant of this method applicable in case the size of the single switching element is 2qx2q, where q is a whole number. Such a variant has a complexity of the order of N.log2N and is suitable to a synchronous environment, in which the set of connection requests constitutes an inlet-outlet permutation.
机译:本发明公开了一种新的NxN多级互连网络,称为并行三角网(PDN)。对于这样的网络类别,给出了非阻塞条件,即那些保证在入口链路和出口链路之间建立任何连接请求的能力的条件,无论网络状态如何,都假定该条件是免费的。特别是,通过图形着色技术,已证明在PDN中提供非阻塞属性所需的Delta子网的最小数量为n <&boxdr&S / 2&boxdl&-1>,其中S和n是NxN Delta网络中的级数以及Delta网络分别由单个开关元件组成的入口和出口链路的数量,&boxdr&x&boxdl&表示大于x的最小整数。为了建立进出口连接请求,已经定义了路由方法。这种方法适用于任何尺寸的开关元件,并且在建立单个连接请求的情况下,该方法可确保2ROOT N量级的复杂性。在整套入口点对点的情况下连接请求(入口/出口排列),此方法的多项式复杂度为N <3/2>。由于与建立单个连接请求有关的复杂度极低,因此该方法特别适用于连接请求是异步的环境(即电信环境)中的应用。因此,该网络可用作自动交换机内的连接网络。还公开了该方法的一种变型,该变型适用于单个开关元件的尺寸为2 qx2 q的情况,其中q是整数。这种变体具有N.log2N数量级的复杂度,并且适用于同步环境,在该环境中,连接请求集构成了入口/出口排列。

著录项

  • 公开/公告号IT1219458B

    专利类型

  • 公开/公告日1990-05-18

    原文格式PDF

  • 申请/专利权人 FONDAZIONE UGO BORDONI;

    申请/专利号IT19880047648

  • 发明设计人 BERNABEI FRANCESCO;LISTANTI MARCO;

    申请日1988-02-18

  • 分类号H03H;

  • 国家 IT

  • 入库时间 2022-08-22 06:17:13

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号