会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Method and an apparatus to modify CRC in intermediate high speed network
nodes
    • 中间高速网络节点修改CRC的方法和装置
    • US5689518A
    • 1997-11-18
    • US431918
    • 1995-04-28
    • Claude GalandEric Saint-GeorgesVictor Spagnol
    • Claude GalandEric Saint-GeorgesVictor Spagnol
    • G06F11/10H03M13/00H03M13/09H04L1/00H04L7/04H04L12/56
    • H03M13/093H04L1/0083H04L12/56H04L7/048H04L2012/5673H04L2012/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运算符)之间的选择将取决于网络的类型(帧中继或其他网络)和中间件的容量 网络节点。
    • 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”个修改的数据字节连接起来构建压缩帧,并向每个所述组添加指示所述数据字节是否被修改的标识符, 而不是在通过所述传输网络发送所述压缩帧之前。 通过确定指示字节的组成的标识符值来解压缩帧; 从字节中删除标识符; 将字节加载到缓冲器中并将字节传送到目的地交换电话设备。
    • 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 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)中,并且每当将节点添加到网络或从网络中删除时更新。 路由算法可以利用特定的网络拓扑来大幅降低路径计算的复杂度。 对于给定的连接,只有有限数量的节点是合格的,并且通过算法在最优路由搜索中被考虑。 本发明的目的是将网络分为骨干和本地节点,以加速路径选择。