利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

15 条记录 (耗时 0.023 秒)

    Method and system for optimizing connection set-up operations in a high speed digital network
    2.
    发明授权
    Method and system for optimizing connection set-up operations in a high speed digital network 有权
    用于优化高速数字网络中连接建立操作的方法和系统

    公开(公告)号：US06246669B1

    公开(公告)日：2001-06-12

    申请号：US09193301

    申请日：1998-11-17

    申请人： Denis Jean Albert Chevalier ,  Philippe Michel Bazot ,  Olivier Maurel ,  Eric Levy-Abegnoli ,  Olivier Bertin ,  Laurent Nicolas ,  Jean-Paul Chobert

    发明人： Denis Jean Albert Chevalier ,  Philippe Michel Bazot ,  Olivier Maurel ,  Eric Levy-Abegnoli ,  Olivier Bertin ,  Laurent Nicolas ,  Jean-Paul Chobert

    IPC分类号： H04L1246

    CPC分类号： H04L45/02

    摘要： In a high speed digital network including access nodes and network nodes each having topology data bases, a method for optimizing the connection set-up operations required for connecting a calling end-user attached to a local access node to a destination user attached to a remote access node, via a conventional connection set-up operation. An Access Node Connection Table (ANCT) in each access node stores a list of every remote access node for which the local access node has at least one user connection. A field in the locate reply message is defined for the destination remote Access Node Topology Database (ANTDB) and remote ANTDB information is inserted prior to sending the reply message. Locate reply message reception is monitored by the local access node, and upon reception an entry is created for the received remote ANTDB information in the local access node unless the remote access node was already identified in the local access node. An optimal path is then selected and connection set up. The ANCT is then updated accordingly.

    摘要翻译： 在包括具有拓扑数据库的接入节点和网络节点的高速数字网络中，一种用于优化连接到本地接入节点的主叫终端用户所连接的连接建立操作到连接到远端的目的用户的方法 接入节点，通过传统的连接建立操作。 每个访问节点中的接入节点连接表（ANCT）存储本地接入节点具有至少一个用户连接的每个远程接入节点的列表。 定位回复消息中的一个字段是为目标远程访问节点拓扑数据库（ANTDB）定义的，并且在发送回复消息之前插入远程ANTDB信息。 定位应答消息接收由本地接入节点监视，一旦接收到本地接入节点接收到的远端ANTDB信息，就创建一个入口，除非本地接入节点已经识别出远端接入节点。 然后选择最佳路径并建立连接。 然后相应地更新ANCT。

    Method and system for optimizing the connection set up time in high speed communication networks for recovering from network failure
    3.
    发明授权
    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 minimizing the connection set up time in high speed packet switching networks
    4.
    发明授权
    Method and system for minimizing the connection set up time in high speed packet switching networks 失效
    在高速分组交换网络中最小化连接建立时间的方法和系统

    公开(公告)号：US06934249B1

    公开(公告)日：2005-08-23

    申请号：US10158624

    申请日：2002-05-30

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

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

    IPC分类号： H04L12/56

    CPC分类号： H04L45/00 ,  H04L45/10 ,  H04L47/12 ,  H04L47/15 ,  H04L47/70 ,  H04L47/724 ,  H04L47/746 ,  H04L47/801 ,  H04L47/822 ,  H04L47/829

    摘要： 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. Due to high dynamicity of the traffic on transmission links, it is important to select a routing path according to a fully up-to-date information on all network resources. The simpler approach is to calculate a new path for each new connection request. This solution may be very time consuming because there are as many path selection operations as connection set up operations. On another hand, the calculation of paths based on an exhaustive exploration of the network topology, is a complex operation which may also take an inordinate amount of resources in large networks. Many of connections originated from a network node flow to the same destination network node. It is therefore possible to take a serious benefit in reusing the same already calculated paths for several connections towards the same node. The 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.

    摘要翻译： 本发明涉及一种高速分组交换网络，特别涉及用于最小化建立起始节点和目的地节点之间的连接的时间的方法和系统。 由于传输链路上的流量的高动态性，根据所有网络资源的完全最新信息选择​​路由路径很重要。 更简单的方法是为每个新的连接请求计算一个新路径。 该解决方案可能非常耗时，因为存在与连接建立操作相同的路径选择操作。 另一方面，基于网络拓扑的详尽探索的路径计算是一种复杂的操作，在大型网络中也可能占用过多的资源。 许多来自网络节点的连接流到同一目标网络节点。 因此，可以在对相同节点的多个连接重复使用相同的已经计算的路径方面有很大的益处。 在请求连接时计算的路径被记录在路由数据库中，并且每次在网络中发生修改时更新。 此外，当连接建立进程空闲时，可以计算并存储用于支持故障或抢占时的非破坏性路径切换的备用路径和朝向潜在目的地节点的新路径。 这些最后的操作在后台执行，处理优先级低，没有连接请求。

    Method and system for a local and fast non-disruptive path switching in high speed packet switching networks
    5.
    发明授权
    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.

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

    Method and system for minimizing the connection set up time in high speed packet switching networks
    6.
    发明授权
    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.

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

    Method and system for improving the processing time of the path selection in a high speed packet switching network
    8.
    发明授权
    Method and system for improving the processing time of the path selection in a high speed packet switching network 失效
    提高高速分组交换网路径路径选择处理时间的方法和系统

    公开(公告)号：US5600638A

    公开(公告)日：1997-02-04

    申请号：US354407

    申请日：1994-12-12

    申请人： Olivier Bertin ,  Olivier Maurel

    发明人： Olivier Bertin ,  Olivier Maurel

    IPC分类号： H04L12/56 ,  H04Q11/04

    CPC分类号： H04L45/00 ,  H04L45/122

    摘要： The routing paths between origin and destination nodes in a packet switching network are selected more efficiently by reducing the total number of links potentially visited by the routing algorithm. The path selection technique involves two phases, the first phase for principal links identification, and the second phase for selection of the best point-to-point path in the network. Principal paths are minimum hop count paths with a transmission delay less than a specified threshold. The algorithm limits the screening of the network links in the second phase to the principal links and excludes the secondary links. The exploration of a much smaller number of links has the advantage to considerably reduce the computation time required for the path selection. The fact the number of principal links is generally small compared with the total number of links potentially explored, allows to limit the additional processing time necessary in case of unsuccessful attempt.

    摘要翻译： 通过减少路由算法可能访问的链路的总数，更有效地选择分组交换网络中的源节点和目的节点之间的路由路径。 路径选择技术涉及两个阶段，主要链路识别的第一阶段和用于选择网络中最佳点对点路径的第二阶段。 主路径是传输延迟小于指定阈值的最小跳数路径。 该算法将第二阶段中的网络链路的筛选限制为主链路，并排除次要链路。 探索更少数量的链路具有显着减少路径选择所需的计算时间的优点。 与可能探索的链接总数相比，主要链接数量通常较小的事实允许限制在尝试不成功的情况下所需的额外处理时间。

    Method and apparatus for correction errors in a memory
    10.
    发明授权
    Method and apparatus for correction errors in a memory 失效
    存储器校正误差的方法和装置

    公开(公告)号：US5511078A

    公开(公告)日：1996-04-23

    申请号：US154686

    申请日：1993-11-18

    申请人： Gerard Barucchi ,  Philippe Cuny ,  Philippe Klein ,  Olivier Maurel ,  Jean-Luc Peter

    发明人： Gerard Barucchi ,  Philippe Cuny ,  Philippe Klein ,  Olivier Maurel ,  Jean-Luc Peter

    IPC分类号： G06F11/10 ,  H03M13/15

    CPC分类号： G06F11/106 ,  H03M13/151 ,  G06F11/1028

    摘要： The method and apparatus for correcting one B-bit block in error in a memory organized in words comprising N B-bit blocks consist of appending to the data bits to be written into the memory words a limited number of error correction bits computed from a depopulated parity check matrix which gives the capability of only correcting one block in error and improving the memory failure rate by cyclically reading each word, correcting a block found in error if any and writing the corrected data bits with the corresponding error correction bits in place of the read word.

    摘要翻译： 用于校正由包括N个B位块的单词组织的存储器中的一个B位块的错误校正方法和装置包括附加到要写入存储器字的数据位，从有限的数量的错误校正位 奇偶校验矩阵，其给出仅校正错误的一个块的能力，并且通过循环读取每个字来改善存储器故障率，校正错误中发现的块，如果有的话，用相应的纠错位写入校正的数据位，代替 读字