利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

108 条记录 (耗时 0.043 秒)

    Programmable high performance data communication adapter for high speed packet transmission networks
    5.
    发明授权
    Programmable high performance data communication adapter for high speed packet transmission networks 失效
    可编程高性能数据通信适配器，用于高速分组传输网络

    公开(公告)号：US5528587A

    公开(公告)日：1996-06-18

    申请号：US252299

    申请日：1994-06-01

    申请人： Claude Galand ,  Gerald Lebizay ,  Daniel Mauduit ,  Jean-marie Munier ,  Andre Pauporte ,  Eric Saint-Georges ,  Victor Spagnol

    发明人： Claude Galand ,  Gerald Lebizay ,  Daniel Mauduit ,  Jean-marie Munier ,  Andre Pauporte ,  Eric Saint-Georges ,  Victor Spagnol

    IPC分类号： H04L29/06 ,  H04J3/02 ,  H04L12/56

    CPC分类号： H04L29/06

    摘要： A high performance data packet buffering method and a programmable data communication adapter for high speed packet transmission networks are disclosed. The line adapter includes programmable processing means, for receiving and transmitting data packets of fixed or variable length. This system is characterized in that it comprisesmeans for buffering (132) said data packets,means for identifying said buffering means and said data packets in said buffering means,means for queueing (FIG. 15) in storing means (131) said identifying means in a single instruction,means for dequeueing (FIG. 16) from said storing (131) means said identifying means in another single instruction,means for releasing said buffering means,Each instruction comprises up to three operations executed in parallel by said processing means:an arithmetical and logical (ALU) operation on said identifying means,memory operation on said storing means, anda sequence operation.

    摘要翻译： 公开了一种用于高速分组传输网络的高性能数据分组缓冲方法和可编程数据通信适配器。 线路适配器包括可编程处理装置，用于接收和发送具有固定或可变长度的数据分组。 该系统的特征在于它包括用于缓冲（132）所述数据分组的装置，用于识别所述缓冲装置中的所述缓冲装置和所述数据分组的装置，用于在存储装置（131）中排队（图15）的装置，所述识别装置 在单个指令中，用于从所述存储器（131）取出的装置（图16）意味着在另一单个指令中的所述识别装置，用于释放所述缓冲装置的装置。每个指令包括由所述处理装置并行执行的多达三个操作： 对所述识别装置进行算术和逻辑（ALU）操作，对所述存储装置进行存储操作和顺序操作。

    Method and an apparatus to modify CRC in intermediate high speed network nodes
    7.
    发明授权
    Method and an apparatus to modify CRC in intermediate high speed network nodes 失效
    中间高速网络节点修改CRC的方法和装置

    公开(公告)号：US5689518A

    公开(公告)日：1997-11-18

    申请号：US431918

    申请日：1995-04-28

    申请人： Claude Galand ,  Eric Saint-Georges ,  Victor Spagnol

    发明人： Claude Galand ,  Eric Saint-Georges ,  Victor Spagnol

    IPC分类号： G06F11/10 ,  H03M13/00 ,  H03M13/09 ,  H04L1/00 ,  H04L7/04 ,  H04L12/56

    CPC分类号： H03M13/093 ,  H04L1/0083 ,  H04L12/56 ,  H04L7/048 ,  H04L2012/5673 ,  H04L2012/5674

    摘要： A method and an apparatus to calculate in an intermediate node of a communication network, the new Frame Check Sequence (FCS) appended to a data bits message which has been modified in said intermediate network node. The invention is useful for high speed networks where the transit delay needs to be optimized in the network along with the computing resources in the intermediate network nodes in terms of computer cycles and memory size. The invention consists in calculating the difference between the FCS using the difference between the modified fields in the message and the distance in bits between the end of the modified field and the end of the message; the calculation consists in differentiating `short messages` in the data flow and to provide an optimized processing for the short messages, the processing for larger messages being based on this first optimized processing. The calculation of the modified FCS comprises operations on polynomials whose coefficients belong to the Galois's Field and whose degree is limited to the one of the polynomial generator of the corresponding CRC code. The calculations include also look up operations in tables limited in size. The choice between the possible implementations (full software, full hardware and mixed hardware and software with the usage of a Remult operator for the last two) will depend on the kind of the network (Frame Relay or other network) and the capacity of the intermediate network node.

    摘要翻译： 一种在通信网络的中间节点中计算的方法和装置，附加到已经在所述中间网络节点中被修改的数据比特消息的新的帧校验序列（FCS）。 本发明对于在计算机周期和存储器大小方面需要在网络中优化传输延迟以及中间网络节点中的计算资源的高速网络是有用的。 本发明在于使用消息中的修改字段与修改字段的结尾与消息结束之间的比特距离来计算FCS之间的差异; 该计算包括区分数据流中的“短消息”，并为短消息提供优化的处理，基于该第一优化处理的较大消息的处理。 修改的FCS的计算包括对其系数属于伽罗瓦域的多项式的操作，并且其程度被限制为相应CRC码的多项式生成器中的一个。 计算还包括在大小限制的表中查找操作。 可能的实现（完整的软件，完整的硬件以及混合的硬件和软件以及最后两个使用Remult运算符）之间的选择将取决于网络的类型（帧中继或其他网络）和中间件的容量 网络节点。

    Transmission system of telephony circuits over a packet switching network
    8.
    发明授权
    Transmission system of telephony circuits over a packet switching network 失效
    通过分组交换网络的电话电路的传输系统

    公开(公告)号：US6157637A

    公开(公告)日：2000-12-05

    申请号：US10004

    申请日：1998-01-21

    申请人： Claude Galand ,  Gerald Lebizay ,  Jean Menez ,  Gerard Richter

    发明人： Claude Galand ,  Gerald Lebizay ,  Jean Menez ,  Gerard Richter

    IPC分类号： H04L12/70 ,  H04Q11/04 ,  H04L12/66 ,  H04B1/66 ,  H04J3/00

    CPC分类号： H04Q11/0478 ,  H04L2012/5663 ,  H04L2012/5671 ,  H04Q2213/13034 ,  H04Q2213/13103 ,  H04Q2213/13164 ,  H04Q2213/13166 ,  H04Q2213/13196 ,  H04Q2213/13216 ,  H04Q2213/1322 ,  H04Q2213/1329

    摘要： Process for transmitting compressed voice circuits over a packet switching network of the type comprising a plurality of switching nodes (SW-1 to SW-7) interconnected by connection lines and including at least an end switching node (SW-1) connected to a source exchange telephone device (PABX A) and another end switching node (SW-3) connected to a destination exchange telephone device (CX), and comprising the steps of receiving from the source exchange telephone device a sequence of uncompressed frames wherein each frame contains n slots containing each J bytes respectively associated to J voice circuits, compressing the data bits of each voice circuit in order to build a packet containing J compressed voice circuits, and providing this packet to the end switching node for transmission to the destination exchange telephone device.

    摘要翻译： 用于通过包括通过连接线互连并包括至少连接到源的端交换节点（SW-1）的多个交换节点（SW-1至SW-7）的类型的分组交换网络来发送压缩语音电路的过程 交换电话设备（PABX A）和连接到目的地交换电话设备（CX）的另一终端交换节点（SW-3），并且包括以下步骤：从源交换电话设备接收一系列未压缩帧，其中每个帧包含n 包含分别与J个语音电路相关联的每个J字节的时隙，压缩每个语音电路的数据位，以构建包含J个压缩语音电路的数据包，并将该数据包提供给终端交换节点以传输到目的地交换电话设备。

    Statistical method of data compression and decompression
    9.
    发明授权
    Statistical method of data compression and decompression 失效
    统计数据压缩和解压缩方法

    公开(公告)号：US06529512B1

    公开(公告)日：2003-03-04

    申请号：US09031755

    申请日：1998-02-27

    申请人： Claude Galand ,  Gerald Lebizay ,  Jean-Francois Le Pennec ,  Maurice Duault

    发明人： Claude Galand ,  Gerald Lebizay ,  Jean-Francois Le Pennec ,  Maurice Duault

    IPC分类号： H04Q1100

    CPC分类号： H04Q11/0414 ,  H04Q2213/13034 ,  H04Q2213/13056 ,  H04Q2213/13174 ,  H04Q2213/13204 ,  H04Q2213/13216 ,  H04Q2213/1329 ,  H04Q2213/13292 ,  H04Q2213/13389

    摘要： A communication system and method for compressing data in a transmission system wherein multiplexed channels are transported over a transmission network of the type comprising a plurality of switching nodes interconnected by connection lines, the exchange of data signals carried out by switching the channels in the network between two exchange telephone devices, and each of the multiplexed channels transporting data bytes representing the data signals from one source exchange telephone device to one destination exchange device during an exchange of information therebetween through the intermediary of a compression/decompression device. The method comprises the steps of comparing, for each multiplexed channel, the signal value associated to each one of a plurality of “n” consecutive data bytes to a predetermined threshold; deleting, in case said signal value for all said “n” data bytes is less than the predetermined threshold, all bits which are not necessary to represent the signal value from each of the “n” data bytes; building a compression frame by concatenating either the “n” data bytes when they are not modified or the “n” modified data bytes when bits have been deleted therefrom, and adding to each of said groups an identifier indicating whether said data bytes are modified or not before transmitting said compression frame over said transmission network. Decompressing the frame by determining the identifier value indicating the composition of the bytes; removing the identifier from the bytes; loading the bytes into a buffer and transmitting the bytes to a destination exchange telephone device.

    摘要翻译： 一种用于在传输系统中压缩数据的通信系统和方法，其中多路复用信道通过包括由连接线互连的多个交换节点的类型的传输网络传送，通过在网络中切换网络中的信道而进行的数据信号的交换 两个交换电话设备，并且每个复用信道在通过压缩/解压缩设备的中间交换信息期间将表示数据信号的数据字节从一个源交换电话设备传送到一个目的地交换设备。 该方法包括以下步骤：对于每个复用的信道，将与多个“n”个连续数据字节中的每一个相关联的信号值与预定阈值进行比较; 删除在所有所述“n”个数据字节的所述信号值小于预定阈值的情况下，从“n”个数据字节中的每个数据字节中不需要表示信号值的所有位; 通过在“n”数据字节未被修改时连接“n”个数据字节，或者当从其中删除位时，将“n”个修改的数据字节连接起来构建压缩帧，并向每个所述组添加指示所述数据字节是否被修改的标识符， 而不是在通过所述传输网络发送所述压缩帧之前。 通过确定指示字节的组成的标识符值来解压缩帧; 从字节中删除标识符; 将字节加载到缓冲器中并将字节传送到目的地交换电话设备。

    Method and apparatus to speed up the path selection in a packet switching network
    10.
    发明授权
    Method and apparatus to speed up the path selection in a packet switching network 失效
    在分组交换网络中加快路径选择的方法和装置

    公开(公告)号：US5491690A

    公开(公告)日：1996-02-13

    申请号：US279373

    申请日：1994-07-22

    申请人： Jean-Pierre Alfonsi ,  Claude Galand ,  Gerald Lebizay ,  Olivier Maurel

    发明人： Jean-Pierre Alfonsi ,  Claude Galand ,  Gerald Lebizay ,  Olivier Maurel

    IPC分类号： H04L12/56

    CPC分类号： H04L45/04

    摘要： Currently, routing algorithms compute all the available paths in the network, from a source node to a destination node before selecting the optimal route. The route computation is often time and resource consuming. Some paths are not acceptable due to the particular geographical configuration of the network. In the real world, large transport networks are not fully meshed. The present invention is based on the observation that networks are usually built around a hierarchical structure. A set of nodes, interconnected by high throughput lines, are used to build a `Backbone` (401) with a high degree of meshing to allow the redundancy and reliability required by the user. The other nodes or `local` nodes (404) are attached to one or several backbone nodes. It is the network designer responsibility, at the configuration time to define for each node what is its attribution: backbone (402) or local node (404). The list of the node attributions appears in the topology table (306) and is updated each time a node is added to or dropped from the network. The routing algorithm can take advantage of the particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are eligible and are taken in account by the algorithm in the optimal route search. The object of the invention is to split the network into backbone and local nodes to speed up the path selection.

    摘要翻译： 目前，在选择最优路由之前，路由算法计算网络中的所有可用路径，从源节点到目标节点。 路由计算通常是时间和资源消耗的。 由于网络的特定地理配置，一些路径是不可接受的。 在现实世界中，大型运输网络并没有完全啮合。 本发明基于网络通常围绕分级结构构建的观察。 通过高吞吐量线路互连的一组节点用于构建具有高度网格划分的“骨干”（401），以允许用户所需的冗余和可靠性。 其他节点或“本地”节点（404）连接到一个或多个骨干节点。 网络设计师负责，在配置时间为每个节点定义它的属性是什么：骨干（402）或本地节点（404）。 节点属性的列表出现在拓扑表（306）中，并且每当将节点添加到网络或从网络中删除时更新。 路由算法可以利用特定的网络拓扑来大幅降低路径计算的复杂度。 对于给定的连接，只有有限数量的节点是合格的，并且通过算法在最优路由搜索中被考虑。 本发明的目的是将网络分为骨干和本地节点，以加速路径选择。