会员体验
专利管家（专利管理）
工作空间（专利管理）
风险监控（情报监控）
数据分析（专利分析）
侵权分析（诉讼无效）
联系我们
交流群
官方交流：
QQ群： 891211   
微信请扫码    >>>
现在联系顾问~
下载
著录项
PDF全文
热词
    • 35. 发明公开
      EP1009131A1 Method and system for optimizing the end to end path selection in very large packet switching networks 审中-公开
    • Method and system for optimizing the end to end path selection in very large packet switching networks
    • 方法和系统，用于在非常大的分组交换网络优化端至端的路径选择
    • EP1009131A1
    • 2000-06-14
    • EP98480090.4
    • 1998-12-11
    • INTERNATIONAL BUSINESS MACHINES CORPORATION
    • Brun, Gérard , Chobert, Jean-Paul , Boudeile, Guy , Fichou, Aline , Galand, Claude
    • H04L12/56
    • H04L45/04 , H04L45/46 , H04L2012/562 , H04L2012/5621 , H04L2012/5687
    • The present invention relates to a method and system for optimizing the end to end path selection in very large packet switching networks.The network is divided in a backbone subnetwork and a plurality of access subnetworks. These subnetworks have a certain hierarchy, but direct links between access subnetworks are allowed. To fulfil the path request between nodes not pertaining to the same subnetwork, the path selection is performed in the backbone subnetwork by concatenating the backbone subnetwork topology with the access subnetwork topologies where the source or destination nodes are located. Only the required subset within access subnetwork topologies is transferred and cached into the backbone subnetwork topology. The main advantages are that :

      The path is computed in one step only
      There is no retry because there is no summarization.
      The computation is faster because applied on a subset of the overall topology (the backbone subnetwork plus at most two access subnetworks).
    • 本发明涉及一种用于在非常大的分组交换网络networks.The优化端至端路径选择被分成骨架子网与接入子网的多个方法和系统。 这些子网有一定的层次，但接入子网之间的直接联系是允许的。 为了满足不属于相同的子网络节点之间的请求路径，路径选择是在主链中的子网络通过连接与所述接入子网拓扑，其中源节点或目的地节点位于骨干子网拓扑进行。 只有接入子网的拓扑结构中所需要的子集，转移和高速缓存到骨干子网的拓扑结构。 的主要优点是：路径计算在一个步骤中仅没有重试因为没有总结。 计算速度更快，因为对整体拓扑结构（主干子网加最多两个接入子网）的一个子集应用。
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Global Dossier Espacenet 法律信息 同族专利 专利引用
    • 36. 发明公开
      EP1009130A1 Distributed directory services for locating network resources in a very large packet switching network 审中-公开
    • Distributed directory services for locating network resources in a very large packet switching network
    • 在一个非常大的分组交换网络中定位网络资源的分布式目录服务
    • EP1009130A1
    • 2000-06-14
    • EP98480089.6
    • 1998-12-11
    • INTERNATIONAL BUSINESS MACHINES CORPORATION
    • Brun, Gérard , Chobert, Jean-Paul , Boudeile, Guy , Fichou, Aline , Galand, Claude
    • H04L12/56
    • H04L45/04 , H04L45/46 , H04L2012/562 , H04L2012/5621 , H04L2012/5687
    • The present invention relates to a method and system of locating a network resource in a packet switching network divided in a backbone subnetwork connected to one or a plurality of access subnetworks. The access subnetworks comprise one or a plurality of access border nodes directly connected to the backbone subnetwork. The backbone subnetwork comprises one or a plurality of backbone border nodes directly connected to the access subnetworks. Border nodes of different subnetworks are connected by border links.
      The method in access border nodes involves the steps of :

      receiving a query message comprising a resource name, the resource name including a prefix;
      comparing the resource name prefix with the prefixes stored in an access border node directory database, said access border node directory database comprising prefixes of the resources local to the access border node subnetwork;
      determining whether the resource name relates to a resource which is local to the access border node subnetwork or not;
      forwarding said query message to an adjacent backbone border node when the resource name relates to a resource which is not local to the access border node subnetwork.

      The method in backbone border nodes involves the steps of :

      receiving a query message comprising a resource name, the resource name including a prefix;
      comparing the resource name prefix with the prefixes stored in one or a plurality of backbone border node directory databases. Each backbone border node directory database corresponds to an access subnetwork managed by the backbone border node;
      determining whether the resource name relates to a resource which belongs to an access subnetwork that the backbone border node manages or not;
      forwarding the query message to an adjacent access border node when the resource name relates to a resource which belongs to an access border node subnetwork managed by the backbone border.

      Each access subnetwork has its own spanning tree and distributed topology, and interactions between access networks are limited to a minimum. The size of distributed topologies is kept small and the control traffic is mostly limited to subnetworks.
    • 本发明涉及定位在分组交换网络划分成连接到一个或接入子网的多个骨干子网的网络资源的方法和系统。 访问子网包括一个或接入边界的多个节点直接连接到主干网子网。 骨干子网包含一个或骨干边境的多个节点直接连接到接入子网。 不同子网的边界节点通过边界左连接。 在接入节点边界的方法，包括以下步骤：接收查询消息包括资源名称，资源名称包括前缀; 比较资源名称前缀与存储在访问边界节点目录数据库的前缀，所述接入边界节点目录数据库，包括资源的前缀本地接入节点边界子网; 确定性矿山资源是否名涉及资源全部是本地的接入节点子网边界或没有; 说在邻近骨架边界节点转发查询消息当资源名称涉及资源全部是不是本地的接入边界节点子网。 在骨干节点边框的方法包括以下步骤：接收查询消息包括资源名称，资源名称包括前缀; 比较资源名称前缀存储在一个前缀或骨干边界节点目录数据库的多元性。 每个骨干边界节点目录数据库对应于由骨干边界节点管理接入子网; 确定性矿山资源是否名涉及属于接入子网做的骨干边界节点管理或不是资源; 在相邻接入边界节点转发查询消息当资源名称涉及属于能够访问由骨干边境管理边界节点子网的资源。 每个接入子网都有自己的生成树拓扑结构和分布，以及接入网络之间的交互限制到最小。 分布式拓扑的尺寸保持较小和控制业务大多​​局限于子网。
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Global Dossier Espacenet 法律信息 同族专利 专利引用
    • 37. 发明公开
      EP0681381A1 Method and apparatus for modifying frame check sequences in intermediate high speed network nodes 失效
    • Method and apparatus for modifying frame check sequences in intermediate high speed network nodes
    • 方法和装置的高速网络的中间节点的帧控制字的修改。
    • EP0681381A1
    • 1995-11-08
    • EP94480036.6
    • 1994-05-06
    • International Business Machines Corporation
    • Galand, Claude , Spagnol, Victor , Saint-Georges, Eric
    • H04L1/00 , H03M13/00 , H04L7/04 , H04L12/56
    • H03M13/093 , H04L1/0083 , H04L7/048 , H04L12/56 , 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）。 本发明是用于高速网络，其中所述传送延迟需要将网络地连同在中间网络节点的计算资源在计算机周期和内存大小方面进行优化是有用的。 本发明besteht在计算使用该消息中的修改的字段，并在修改后的字段和消息的结束的端部之间的位距离之间的差的FCS之间的差; 在数据流并且提供到优化处理的短消息区分“短消息”的计算besteht，对于较大的消息的处理是基于该第一优化处理。 修改后的FCS包括操作对多项式的系数属于伽罗瓦的场和谁程度仅限于相应的CRC码的生成多项式的一个计算。 因此，计算包括在大小限制表查找操作。 在可能的实施方式之间的选择（全软件，全硬件和混合的硬件和软件具有用于Remult操作者的使用负载2）将取决于种类网络（帧中继或其它网络）的和中间的容量 网络节点。
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Global Dossier Espacenet 法律信息 同族专利 专利引用
每页展示10个专利
每页展示10个专利
每页展示20个专利
每页展示50个专利
每页展示100个专利

IPRDB

最新中国发明专利 最新美国发明专利 技术领域 专利库 专利分类库 国际专利分类库

热门服务

会员版试用 API 数据接口 找代理 知嘟嘟专利交易 排行榜 大学排行榜 专利百科

关于我们

平台介绍 战略合作 网站地图

友情链接

知嘟嘟专利交易 国家知识产权局 中国商标网

联系方式


©2019-2023 上海吉码数字技术有限公司 版权所有，并保留所有权利 沪ICP备20016256号-6 沪公网安备31011702005475号