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

    IPC分类号: H04L12/407

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

    公开(公告)号:US06400681B1

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

    申请号:US08834679

    申请日:1997-04-01

    IPC分类号: H04L1256

    摘要: 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 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

    IPC分类号: H04L12/56

    摘要: 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 optimizing the connection set up time in high
speed communication networks for recovering from network failure
    5.
    发明授权
    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

    摘要: 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 apparatus to speed up the path selection in a packet
switching network
    6.
    发明授权
    Method and apparatus to speed up the path selection in a packet switching network 失效
    在分组交换网络中加快路径选择的方法和装置

    公开(公告)号:US5491690A

    公开(公告)日:1996-02-13

    申请号:US279373

    申请日:1994-07-22

    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 non disruptively assigning link bandwidth to a user in a high speed digital network
    7.
    发明授权
    Method and system for non disruptively assigning link bandwidth to a user in a high speed digital network 失效
    用于在高速数字网络中不间断地向用户分配链路带宽的方法和系统

    公开(公告)号:US06262974B1

    公开(公告)日:2001-07-17

    申请号:US09213506

    申请日:1998-12-17

    IPC分类号: H04L1226

    摘要: A method based on predefined connection priorities for assigning link bandwidth to a requesting user in a high speed digital network interconnecting network users through a path including network nodes connected through high speed links. According to this method, a predefined reservable link bandwidth is split into so-called nominal bandwidth portions and common bandwidth portions, both assignable to the same connections on a priority basis. Each of the common bandwidth priorities is individually related to a nominal bandwidth priority through a predefined relationship, making the common bandwidth priorities always lower than any nominal priority. In this way the requested link connection bandwidth, whatever be its nominal priority, is made preemptable primarily on all common bandwidth, thus avoiding the disruption of any network connection which is already established.

    摘要翻译: 一种基于预定义的连接优先级的方法,用于将高速数字网络中的请求用户分配链路带宽,通过包括通过高速链路连接的网络节点的路径互连网络用户。根据该方法,预定义的可预留链路带宽被分为 称为标称带宽部分和公共带宽部分,可以优先分配给相同的连接。 每个公共带宽优先级通过预定义的关系单独地与标称带宽优先级相关,使得共同带宽优先级始终低于任何标称优先级。 以这种方式,无论作为其标称优先级,所请求的链路连接带宽主要在所有公共带宽上可抢占,从而避免已经建立的任何网络连接的中断。

    End-to-end delay estimation in high speed communication networks
    8.
    发明授权
    End-to-end delay estimation in high speed communication networks 失效
    高速通信网络中的端到端延迟估计

    公开(公告)号:US06226266B1

    公开(公告)日:2001-05-01

    申请号:US08946237

    申请日:1997-10-07

    IPC分类号: H04L1256

    摘要: An apparatus and method that determines the end-to-end transit delay at each node of a path, in accordance with the selected probability value indicative of the probability to experience a delay at each node that is smaller than the computed transit delay. Then the computed transit delays per nodes are combined to obtain the end-to-end delay of the path, the combination being either an arithmetic operation or a convolution operation. A method to approximate the convolution operation is also disclosed.

    摘要翻译: 根据所选择的概率值,其指示在每个节点处经历比所计算的过渡延迟小的延迟的概率,确定路径的每个节点处的端到端传输延迟的装置和方法。 然后将每个节点的计算的传输延迟组合以获得路径的端到端延迟,该组合是算术运算或卷积运算。 还公开了近似卷积运算的方法。

    Method and system for non-disruptively assigning link bandwidth to a
user in a high speed digital network
    9.
    发明授权
    Method and system for non-disruptively assigning link bandwidth to a user in a high speed digital network 失效
    用于在高速数字网络中不间断地将链路带宽分配给用户的方法和系统

    公开(公告)号:US5881050A

    公开(公告)日:1999-03-09

    申请号:US785944

    申请日:1997-01-22

    摘要: A method based on predefined connection priorities for assigning link bandwidth to a requesting user in a high speed digital network interconnecting network users through a path including network nodes connected through high speed links. According to this method, a predefined reservable link bandwidth is split into so-called nominal bandwidth portions and common bandwidth portions, both assignable to the same connections on a priority basis. Each of the common bandwidth priorities is individually related to a nominal bandwidth priority through a predefined relationship, making the common bandwidth priorities always lower than any nominal priority. In this way the requested link connection bandwidth, whatever be its nominal priority, is made preemptable primarily on all common bandwidth, thus avoiding the disruption of any network connection which is already established.

    摘要翻译: 一种基于预定义的连接优先级的方法,用于将高速数字网络中的请求用户分配链路带宽,通过包括通过高速链路连接的网络节点的路径互连网络用户。 根据该方法,将预定义的可预留链路带宽分为所谓的标称带宽部分和公共带宽部分,两者都可优先分配给相同的连接。 每个公共带宽优先级通过预定义的关系单独地与标称带宽优先级相关,使得共同带宽优先级始终低于任何标称优先级。 以这种方式,无论作为其标称优先级,所请求的链路连接带宽主要在所有公共带宽上可抢占,从而避免已经建立的任何网络连接的中断。