利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

108 条记录 (耗时 0.03 秒)

    Method and apparatus to speed up the path selection in a packet switching network
    1.
    发明授权
    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）中，并且每当将节点添加到网络或从网络中删除时更新。 路由算法可以利用特定的网络拓扑来大幅降低路径计算的复杂度。 对于给定的连接，只有有限数量的节点是合格的，并且通过算法在最优路由搜索中被考虑。 本发明的目的是将网络分为骨干和本地节点，以加速路径选择。

    Method and system for optimizing the connection set up time in high speed communication networks for recovering from network failure
    2.
    发明授权
    Method and system for optimizing the connection set up time in high speed communication networks for recovering from network failure 失效
    在高速通信网络中优化连接建立时间以从网络故障中恢复的方法和系统

    公开(公告)号：US6038212A

    公开(公告)日：2000-03-14

    申请号：US946243

    申请日：1997-10-07

    申请人： Claude Galand ,  Jean Bidard ,  Jean-Paul Chobert ,  Gerard Brun ,  Olivier Maurel ,  Yves Ouvry

    发明人： Claude Galand ,  Jean Bidard ,  Jean-Paul Chobert ,  Gerard Brun ,  Olivier Maurel ,  Yves Ouvry

    IPC分类号： H04L12/70 ,  H04L12/935 ,  H04L12/937 ,  H04L12/939 ,  H04Q11/04 ,  H04J31/08

    CPC分类号： H04L49/557 ,  H04L49/253 ,  H04L49/309 ,  H04Q11/0478 ,  H04L2012/562 ,  H04L2012/5623 ,  H04L2012/5627

    摘要： This method enables optimizing the time required for reestablishing connections between end users attached to a data communication network, which connections were disrupted due to a network failure. The network includes access nodes and transit nodes interconnected with network links/trunks (with no specific distinction being herein required between both designations of a communication line). The end users are attached to the network through access nodes and each said access node permanently stores an image of the current network trunk including the number N.sub.i of connections currently supported by said network trunk. Upon detection of a trunk failure, each access node supporting connections affected by said failure, is made aware of the total number (N.sub.i) of connections in each priority group affected by the failure, together with a network dependent parameter (TP) representing the elementary processing time required to reroute a single network connection. Then each access node may independently, start a first reconnection set-up procedure at a time Ri randomly selected between zero and (N.sub.i -n.sub.i) *TP, where n.sub.i is the number of connections supported by the access node in each priority group, and then space the required subsequent reconnections set-ups by a time equal to (T.sub.i -R.sub.i)/n.sub.i, with T.sub.i =N.sub.i *TP.

    摘要翻译： 该方法能够优化重新建立连接到数据通信网络的终端用户之间的连接所需的时间，哪些连接由于网络故障而中断。 网络包括与网络链路/中继线互连的接入节点和传输节点（在通信线路的两个指定之间，这里不需要具体区分）。 最终用户通过接入节点连接到网络，并且每个所述接入节点永久地存储包括当前由所述网络中继线支持的连接的数目Ni的当前网络中继的图像。 在检测到中继线故障时，支持受所述故障影响的连接的每个接入节点被识别出由故障影响的每个优先级组中的连接的总数（Ni），以及表示基站的网络相关参数（TP） 重新路由单个网络连接所需的处理时间。 然后，每个接入节点可以独立地在零和（Ni-ni）* TP之间随机选择的时间Ri开始第一重新连接建立过程，其中，ni是每个优先级组中的接入节点支持的连接数，以及 然后将所需的后续重新连接设置空间等于（Ti-Ri）/ ni，Ti = Ni * TP。

    Method and system for a local and fast non-disruptive path switching in high speed packet switching networks
    3.
    发明授权
    Method and system for a local and fast non-disruptive path switching in high speed packet switching networks 有权
    用于高速分组交换网络中本地和快速无中断路径切换的方法和系统

    公开(公告)号：US07593321B2

    公开(公告)日：2009-09-22

    申请号：US10634060

    申请日：2003-08-04

    申请人： Claude Galand ,  Olivier Bertin ,  Olivier Maurel ,  Laurent Nicolas ,  Aline Fichou

    发明人： Claude Galand ,  Olivier Bertin ,  Olivier Maurel ,  Laurent Nicolas ,  Aline Fichou

    IPC分类号： H04L12/407

    CPC分类号： H04L45/28 ,  H04L1/22 ,  H04L45/00 ,  H04L45/22

    摘要： A method for operating a node in a computer network is disclosed, where the network is made up of nodes connected by links. The method has the steps: determining an alternate path for one or more links; reserving resources for the alternate path; and rerouting traffic on the alternate path in case of a link failure. The alternate path may be periodically updated. A plurality of alternate paths may be maintained. The alternate paths may not have any links in common. User traffic may be rerouted substantially simultaneously to each link of the alternate path in the event of failure of a primary path.

    摘要翻译： 公开了一种用于操作计算机网络中的节点的方法，其中网络由通过链路连接的节点组成。 该方法具有以下步骤：确定一个或多个链路的备用路径; 为备用路径预留资源; 并在链路故障的情况下重新路由备用路径上的流量。 备用路径可以定期更新。 可以维持多个备选路径。 备用路径可能没有任何共同的链接。 在主路径发生故障的情况下，用户流量可能会基本同时重新路由到备用路径的每个链路。

    Transmission system of telephony circuits over a packet switching network
    5.
    发明授权
    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个压缩语音电路的数据包，并将该数据包提供给终端交换节点以传输到目的地交换电话设备。

    Method and system for minimizing the connection set up time in high speed packet switching networks
    7.
    发明授权
    Method and system for minimizing the connection set up time in high speed packet switching networks 失效
    在高速分组交换网络中最小化连接建立时间的方法和系统

    公开(公告)号：US06400681B1

    公开(公告)日：2002-06-04

    申请号：US08834679

    申请日：1997-04-01

    申请人： Olivier Bertin ,  Gerard Brun ,  Claude Galand ,  Olivier Maurel ,  Laurent Nicolas

    发明人： Olivier Bertin ,  Gerard Brun ,  Claude Galand ,  Olivier Maurel ,  Laurent Nicolas

    IPC分类号： H04L1256

    CPC分类号： H04L49/253 ,  H04L49/205 ,  H04L49/206 ,  H04L49/256 ,  H04L49/3081 ,  H04L49/50 ,  H04L2012/5619

    摘要： The present invention is directed to a high speed packet switching network and, in particular to a method and system for minimizing the time to establish a connection between an origin and a destination node. A path calculated at the time the connection is requested is recorded in a Routing Database and updated each time a modification occurs in the network. Furthermore, alternate paths for supporting non-disruptive path switch on failure or preemption, and new paths towards potential destination nodes can be calculated and stored when the connection set up process is idle. These last operations are executed in background with a low processing priority and in absence of connection request.

    摘要翻译： 本发明涉及一种高速分组交换网络，特别涉及用于最小化建立起始节点和目的地节点之间的连接的时间的方法和系统。 在请求连接时计算的路径被记录在路由数据库中，并且每次在网络中发生修改时更新。 此外，当连接建立进程空闲时，可以计算并存储用于支持故障或抢占时的非破坏性路径切换的备用路径和朝向潜在目的地节点的新路径。 这些最后的操作在后台执行，处理优先级低，没有连接请求。

    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”个修改的数据字节连接起来构建压缩帧，并向每个所述组添加指示所述数据字节是否被修改的标识符， 而不是在通过所述传输网络发送所述压缩帧之前。 通过确定指示字节的组成的标识符值来解压缩帧; 从字节中删除标识符; 将字节加载到缓冲器中并将字节传送到目的地交换电话设备。