会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 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 AlfonsiClaude GalandGerald LebizayOlivier Maurel
    • Jean-Pierre AlfonsiClaude GalandGerald LebizayOlivier Maurel
    • H04L12/56
    • 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)中,并且每当将节点添加到网络或从网络中删除时更新。 路由算法可以利用特定的网络拓扑来大幅降低路径计算的复杂度。 对于给定的连接,只有有限数量的节点是合格的,并且通过算法在最优路由搜索中被考虑。 本发明的目的是将网络分为骨干和本地节点,以加速路径选择。
    • 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 GalandJean BidardJean-Paul ChobertGerard BrunOlivier MaurelYves Ouvry
    • Claude GalandJean BidardJean-Paul ChobertGerard BrunOlivier MaurelYves Ouvry
    • H04L12/70H04L12/935H04L12/937H04L12/939H04Q11/04H04J31/08
    • H04L49/557H04L49/253H04L49/309H04Q11/0478H04L2012/562H04L2012/5623H04L2012/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。
    • 9. 发明授权
    • Statistical method of data compression and decompression
    • 统计数据压缩和解压缩方法
    • US06529512B1
    • 2003-03-04
    • US09031755
    • 1998-02-27
    • Claude GalandGerald LebizayJean-Francois Le PennecMaurice Duault
    • Claude GalandGerald LebizayJean-Francois Le PennecMaurice Duault
    • H04Q1100
    • H04Q11/0414H04Q2213/13034H04Q2213/13056H04Q2213/13174H04Q2213/13204H04Q2213/13216H04Q2213/1329H04Q2213/13292H04Q2213/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”个修改的数据字节连接起来构建压缩帧,并向每个所述组添加指示所述数据字节是否被修改的标识符, 而不是在通过所述传输网络发送所述压缩帧之前。 通过确定指示字节的组成的标识符值来解压缩帧; 从字节中删除标识符; 将字节加载到缓冲器中并将字节传送到目的地交换电话设备。