公开(公告)号：US5712854A

公开(公告)日：1998-01-27

申请号：US565105

申请日：1995-11-30

申请人： Marc Dieudonne ,  Patrick Frene ,  Pierre Parmentier

发明人： Marc Dieudonne ,  Patrick Frene ,  Pierre Parmentier

IPC分类号： H04Q3/00 ,  H04L12/56

CPC分类号： H04L45/24 ,  H04L45/10

摘要： In a method of routing cells in an asynchronous time-division multiplex switching network interconnecting input switches and output switches via switches, each input switch can be connected to each output switch via at least two paths. The transmission of a sequence of cells of a given call between one input switch, called the call input switch, and one output switch, called the call output switch, comprises the following steps: determining the set of N possible paths between the call input switch and the call output switch, setting up N sub-connections corresponding to the N possible paths, in the call input switch, systematically and equitably distributing the cells of the sequence to the N sub-connections, and in the call output switch, assembling the cells of the sequence to reconstitute the sequence.

摘要翻译： 在通过交换机互连输入开关和输出开关的异步时分复用交换网络中路由单元的方法中，每个输入开关可以经由至少两条路径连接到每个输出开关。 称为呼叫输入开关的一个输入开关（称为呼叫输入开关）和一个输出开关（称为呼叫输出开关）之间的给定呼叫序列的传输包括以下步骤：确定呼叫输入开关之间的N个可能路径的集合 和呼叫输出开关，在呼叫输入开关中设置对应于N个可能路径的N个子连接，系统地和公平地将序列的小区分配给N个子连接，并且在呼叫输出开关中，组装 序列的细胞重建序列。

公开(公告)号：US06570882B1

公开(公告)日：2003-05-27

申请号：US09373239

申请日：1999-08-12

申请人： Patrick Frene

发明人： Patrick Frene

IPC分类号： H04L1256

CPC分类号： H04L47/562 ,  H04L47/50

摘要： A method for managing a queue of cells received from a plurality of sources, wherein the last cell received is stored at a receive address in a buffer, and a time stamp is established for the last cell received that represents the theoretical time it is to leave the queue. The receive address is inserted into a programmer at a location identified by the time stamp of the last cell received, and an occupancy bit associated with the time stamp is set to an active state. The first cell(s) to leave the queue from the first active occupancy bit following that of the cell that has just left the queue is determined, with the occupancy bits being classified in increasing order of the associated time stamps, and the occupancy bit of the first cell is set to an inactive state when it leaves the queue.

摘要翻译： 一种用于管理从多个源接收的小区的队列的方法，其中，接收到的最后一个小区被存储在缓冲器中的接收地址处，并且为接收的最后一个小区建立代表其要离开的理论时间的时间戳 队列。 接收地址被插入到由所接收的最后一个信元的时间标记识别的位置处的编程器中，并且与时间戳相关联的占用位被设置为活动状态。 确定从第一活动占用位离开刚刚离开队列的小区的第一活动占用位的第一小区，占用比​​特按相关联的时间戳的增加顺序分类，占用比特 第一个单元格离开队列时设置为非活动状态。

公开(公告)号：US5654956A

公开(公告)日：1997-08-05

申请号：US495260

申请日：1995-06-27

申请人： Patrick Frene ,  Pierre Parmentier ,  Marc Dieudonne ,  Rene Coutin

发明人： Patrick Frene ,  Pierre Parmentier ,  Marc Dieudonne ,  Rene Coutin

IPC分类号： H04L12/54 ,  H04L12/70 ,  H04L12/933 ,  H04Q3/68 ,  H04L12/02

CPC分类号： H04L12/5601 ,  H04L49/106 ,  H04L49/1553 ,  H04L49/1576 ,  H04Q3/68 ,  H04L2012/561

摘要： The invention relates to a switching network enabling a plurality of bothway I/O links to be interconnected. In one embodiment of the invention, the network includes at least two nodes, each node possessing not more than k incident I/O points, k.gtoreq.2, n sets of k extended I/O points, n.gtoreq.2, and extension/concentration devices enabling each of the k incident I/O points to be connected to one of the extended I/O points of each of the n sets. Each bothway I/O link is capable of being connected to one of the incident I/O points of one of the nodes, and each node is associated with a bothway switching matrix having k I/O ports. The nodes are interconnected in pairs by first and second one-way switching matrices each having k input ports and k output ports.

摘要翻译： 本发明涉及能够互连多个两路I / O链路的交换网络。 在本发明的一个实施例中，网络包括至少两个节点，每个节点具有不超过k个入口I / O点，k> / = 2，n个k个扩展I / O点集合，n≥2， 以及使每个k个事件I / O点能够连接到n个集合中的每一个的扩展I / O点之一的扩展/集中装置。 每个双向I / O链路能够连接到其中一个节点的一个事件I / O点，并且每个节点与具有k个I / O端口的双向交换矩阵相关联。 节点通过具有k个输入端口和k个输出端口的第一和第二单向切换矩阵成对互连。