公开(公告)号：US07406082B2

公开(公告)日：2008-07-29

申请号：US10261090

申请日：2002-09-30

申请人： Ramesh Nagarajan ,  Vinay D. Purohit ,  Muhammad A. Qureshi ,  Yung-Terng Wang

发明人： Ramesh Nagarajan ,  Vinay D. Purohit ,  Muhammad A. Qureshi ,  Yung-Terng Wang

IPC分类号： H04L12/28

CPC分类号： H04L47/34 ,  H04L45/00 ,  H04L45/24 ,  H04L47/10 ,  H04L47/27

摘要： In a packet-based data network, packets are duplicated and a sequence number is inserted into each duplicate packet, where the duplicate packets are transmitted along two different paths from a source node to a destination node in the network. Depending on the implementation, the source node inserts different types of sequence numbers into the duplicate packets, and the destination node processes those sequence numbers accordingly to determine whether to accept or reject each received packet. In certain implementations, the number of sequence bits allocated to each packet is smaller than the size of the effective sequence number for the packet as interpreted by the destination node.

摘要翻译： 在基于分组的数据网络中，分组被复制，并且将序列号插入到每个重复分组中，其中重复分组沿着从源节点到网络中的目的地节点的两个不同路径传输。 根据实现，源节点将不同类型的序列号插入到重复分组中，并且目的节点相应地处理这些序列号，以确定是接受还是拒绝每个接收到的分组。 在某些实现中，分配给每个分组的序列比特数小于由目的地节点解释的分组的有效序列号的大小。

公开(公告)号：US08867333B2

公开(公告)日：2014-10-21

申请号：US10673055

申请日：2003-09-26

申请人： Bharat T. Doshi ,  Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

发明人： Bharat T. Doshi ,  Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

IPC分类号： G06F11/00 ,  H04L1/00 ,  H04L12/26 ,  H04L12/24

CPC分类号： H04L41/0896 ,  H04L41/0213 ,  H04L41/0668

摘要： A method for determining a restoration path for a new service in a mesh network involves selecting between candidate restoration paths corresponding to a primary path for the new service based on the shared-risk link groups (SRLGs) associated with links in the primary path. The method includes, for each of a plurality of candidate restoration paths associated with the primary path, (1) determining whether the primary path requires any additional restoration bandwidth to be reserved on any link of the restoration path based on whether, for each link of the restoration path, the primary path is SRLG-disjoint from each other primary path that is protected by that link, (2) generating a path cost for the restoration path, where the path cost is a function of whether any additional restoration bandwidth is required; and (3) selecting the restoration path for the new service based on the path cost.

摘要翻译： 用于确定网状网络中的新服务的恢复路径的方法包括基于与主路径中的链路相关联的共享风险链路组（SRLG）来选择与新服务的主路径相对应的候选恢复路径。 该方法包括对于与主路径相关联的多个候选恢复路径中的每一个，（1）确定主路径是否需要在恢复路径的任何链路上保留任何额外的恢复带宽，基于对于每个链路是否 恢复路径，主路径与被该链路保护的彼此主路径之间的SRLG不相交，（2）生成恢复路径的路径开销，其中路径开销是否需要任何额外的恢复带宽的函数 ; （3）根据路径成本选择新业务的恢复路径。

公开(公告)号：US07689693B2

公开(公告)日：2010-03-30

申请号：US10673383

申请日：2003-09-26

申请人： Bharat T. Doshi ,  Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

发明人： Bharat T. Doshi ,  Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

IPC分类号： G06F15/173 ,  G06F15/16 ,  G06F11/00

CPC分类号： H04J14/0284 ,  H04J14/0227 ,  H04J14/0241 ,  H04J14/0294 ,  H04J14/0295 ,  H04L45/12 ,  H04L45/124 ,  H04L45/22 ,  H04L45/28 ,  H04L45/50 ,  H04L45/62

摘要： A method for determining primary and restoration paths for a new service in a mesh network involves (1) for each of a plurality of candidate primary/restoration path pairs for the new service, generating a path cost for each candidate pair, where the path cost for each restoration path is a function of the sum of the cost of links within the restoration path, and (2) selecting the primary and restoration paths for the new service from the plurality of candidate path pairs based on the path cost. If no sharing is possible, for low utilization links, the cost of links is a function of the administrative weight of the link, whereas for high utilization links, the link cost is a function of the inverse of the available capacity on the link. If sharing is possible, the cost is a function of the inverse of a sharing degree for the link.

摘要翻译： 用于确定网状网络中的新服务的主路径和恢复路径的方法涉及（1）针对新服务的多个候选主/恢复路径对中的每一个，生成每个候选对的路径开销，其中路径成本 对于每个恢复路径是恢复路径内的链路成本之和的函数，以及（2）基于路径开销从多个候选路径对中选择新服务的主路径和恢复路径。 如果没有可能的共享，对于低利用率链路，链路的成本是链路的管理权重的函数，而对于高利用率链路，链路成本是链路上可用容量的倒数的函数。 如果共享是可能的，则成本是链路共享度的倒数的函数。

公开(公告)号：US07451340B2

公开(公告)日：2008-11-11

申请号：US10673382

申请日：2003-09-26

申请人： Bharat T. Doshi ,  Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

发明人： Bharat T. Doshi ,  Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

IPC分类号： G06F11/00

CPC分类号： H04L45/123 ,  H04L41/0663 ,  H04L45/22 ,  H04L45/28 ,  H04L45/50

摘要： An extension to a connection setup protocol for establishment of a restoration path for a service in a mesh network involves, at a transit node along the restoration path, the steps of (1) receiving a service data structure having an identification of each link and transit node in a primary path for the service, and (2) determining whether to reserve additional protection bandwidth on an outgoing link incident to the transit node using the service data structure, wherein the outgoing link is part of the restoration path. In one or more embodiments, the service data structure includes identification of the service, identification of the outgoing link, and bandwidth of the service. In some cases, the extension involves reserving the additional protection bandwidth on the outgoing link, if the transit node determines that the protection bandwidth is required, based upon knowledge of the protection bandwidth already reserved on the outgoing link.

摘要翻译： 用于建立网状网络中的服务的恢复路径的连接建立协议的扩展涉及在沿着恢复路径的传输节点处的步骤（1）接收具有每个链路和传输的标识的服务数据结构 节点，以及（2）使用服务数据结构确定是否在事件发生的出站链路上预留额外的保护带宽，其中，出站链路是恢复路径的一部分。 在一个或多个实施例中，服务数据结构包括服务的标识，输出链路的标识和服务的带宽。 在一些情况下，如果传输节点基于已经在传出链路上保留的保护带宽的知识，则传输节点确定需要保护带宽，则扩展包括在出站链路上保留附加保护带宽。

公开(公告)号：US08296407B2

公开(公告)日：2012-10-23

申请号：US10673381

申请日：2003-09-26

申请人： Bharat T. Doshi ,  Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

发明人： Bharat T. Doshi ,  Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

IPC分类号： G06F15/177 ,  G06F15/173 ,  H04J3/22

CPC分类号： H04L41/0663 ,  H04L41/0213 ,  H04L41/5019 ,  H04L41/5087

摘要： A method for representing, in a network data structure, a minimum amount of protection bandwidth required to be reserved on each link in a mesh network, to restore service upon failure of another node or link in the network. The method includes (1) receiving a request for a new service in the network, wherein the new service is represented by a service data structure having an identification of each link and transit node in a primary path for the new service, (2) determining, using the network and service data structures, whether the new service requires additional protection bandwidth to be reserved on any link in the network, and (3) updating the network data structure if any additional protection bandwidth is determined to be needed. In one implementation the network and service data structures are vectors and the steps of determining and updating involve vector operations between these structures.

摘要翻译： 一种用于在网络数据结构中表示在网状网络中的每个链路上保留的最小保护带宽量以在网络中的另一节点或链路故障时恢复服务的方法。 该方法包括：（1）在网络中接收对新服务的请求，其中新服务由具有用于新服务的主路径中的每个链路和传输节点的标识的服务数据结构表示，（2）确定 使用网络和服务数据结构，新服务是否需要在网络中的任何链路上保留额外的保护带宽，以及（3）如果确定需要额外的保护带宽，则更新网络数据结构。 在一个实现中，网络和服务数据结构是向量，并且确定和更新的步骤涉及这些结构之间的向量操作。

公开(公告)号：US07606237B2

公开(公告)日：2009-10-20

申请号：US10639728

申请日：2003-08-12

申请人： Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

发明人： Zbigniew M. Dziong ,  Ramesh Nagarajan ,  Muhammad A. Qureshi ,  Yung-Terng Wang

IPC分类号： H04L12/28

CPC分类号： H04L41/0663 ,  H04L41/0896 ,  H04L41/5022 ,  H04L45/22 ,  H04L45/28 ,  H04L45/50 ,  H04L47/70 ,  H04L47/724 ,  H04L47/728 ,  H04L47/746 ,  H04L47/781 ,  H04L47/783 ,  H04L47/825

摘要： A shared mesh data network (SMDN) for path-based recovery at the packet level. In one implementation, a first link in the network is part of two or more different protection paths, where each protection path corresponds to a different primary path. A network manager determines how much protection bandwidth to reserve on the first link for the two or more protection paths in such a way that the protection bandwidth reserved on the first link is shared between the protection paths of the two or more primary paths. As such, the amount of protection bandwidth reserved on the first link can be less than the sum of the bandwidths of the two or more primary paths. The SMDN provides efficient sharing of protection capacity. Implementations of the SMDN are appropriate to multiprotocol label-switched (MPLS) optical networks.

摘要翻译： 用于分组级别的基于路径恢复的共享网格数据网络（SMDN）。 在一个实现中，网络中的第一链路是两个或更多个不同保护路径的一部分，其中每个保护路径对应于不同的主路径。 网络管理器确定在两个或多个保护路径的第一链路上保留多少保护带宽，使得在第一链路上保留的保护带宽在两个或多个主路径的保护路径之间共享。 因此，在第一链路上保留的保护带宽的量可以小于两个或更多个主要路径的带宽的总和。 SMDN提供有效的共享保护能力。 SMDN的实现适用于多协议标签交换（MPLS）光网络。

公开(公告)号：US07778204B2

公开(公告)日：2010-08-17

申请号：US12179872

申请日：2008-07-25

申请人： Thomas P. Chu ,  Ramesh Nagarajan ,  Yung-Terng Wang

发明人： Thomas P. Chu ,  Ramesh Nagarajan ,  Yung-Terng Wang

IPC分类号： H04L12/28

CPC分类号： H04L41/12

摘要： In one embodiment, an automatically maintained, distributed source tree (DST) network has a plurality of fully connected internal nodes. One or more internal nodes may be connected to one or more external nodes. A first internal node synchronizes its link-state database with another internal node by sending and receiving respective Reduced Sequence Number Packet-Data-Units (PDUs) (RSNPs). An RSNP includes summary information for link-state packets (LSPs) (1) originated by the first internal node, (2) received by the first internal node from the other internal node, and (3) received from and/or originated by external nodes. If an internal link fails, then the corresponding end-nodes may recover and maintain automatic DST operation by entering either relay-mode or switch-mode operation. In relay-mode operation, an end-node tunnels packets to the other end-node via an intermediary node. In switch-mode operation, an intermediary node is selected to forward packets from one end-node to the other end-node.

摘要翻译： 在一个实施例中，自动维护的分布式源树（DST）网络具有多个完全连接的内部节点。 一个或多个内部节点可以连接到一个或多个外部节点。 第一内部节点通过发送和接收相应的减少序列号分组数据单元（PDU）（RSNP）来将其链路状态数据库与另一内部节点同步。 RSNP包括由第一内部节点发起的链路状态分组（LSP）（1），（2）由第一内部节点从另一个内部节点接收的摘要信息，以及（3）从外部接收和/或发起的 节点。 如果内部链路发生故障，则相应的终端节点可以通过进入中继模式或切换模式操作来恢复和维护自动DST操作。 在中继模式操作中，终端节点经由中间节点将分组隧道传送到另一终端节点。 在交换模式操作中，选择中间节点将分组从一个终端节点转发到另一个终端节点。

公开(公告)号：US5983278A

公开(公告)日：1999-11-09

申请号：US635315

申请日：1996-04-19

申请人： Song Chong ,  Mark Katz ,  David A. Morano ,  Ramesh Nagarajan ,  Walter Michael Pitio ,  Donald D. Shugard ,  Yung-Terng Wang

发明人： Song Chong ,  Mark Katz ,  David A. Morano ,  Ramesh Nagarajan ,  Walter Michael Pitio ,  Donald D. Shugard ,  Yung-Terng Wang

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

CPC分类号： H04L49/102 ,  H04L12/5602 ,  H04L2012/5635 ,  H04L2012/5651 ,  H04L2012/5682 ,  H04L49/30

摘要： In a switch fabric environment, which includes a buffer, packet data of different class-types from different sources is received, stored in the buffer, processed and outputted to its intended destination. As the buffer fills up, transmission from some of the data sources is stopped to avoid dropping of packets. To avoid packet loss, when the occupancy of the buffer reaches a first threshold value, further transmission of a first-class type of data is precluded from the particular source of that data then being received, while transmission from other sources of that same first-class type of data is not precluded from these other data sources until first-class type of data from such other sources is also received. Further, data of a second-class type is not precluded from being transmitted as long as the amount of data stored in the buffer remains below a second threshold, which is greater than the first threshold. When the occupancy of the buffer reaches that second threshold, further transmissions from the particular source of that second-class type of data then being received is also precluded. As data from other sources of that second-class type of data is received, further transmissions from those other sources are also precluded. A third-class type of data, however, is not precluded from transmission as long as the amount of data remains below a third threshold value, which is greater than the second threshold value. In order to avoid packet loss, when a packet from any source is received, it is stored regardless of whether transmission from the source of that packet has been precluded. Advantageously, a MAX/MIN distribution of the available bandwidth can be probabilistically achieved without packet loss.

摘要翻译： 在包括缓冲器的交换结构环境中，接收到来自不同源的不同类型的分组数据，存储在缓冲器中，并被处理并输出到其预定目的地。 当缓冲区填满时，一些数据源的传输被停止，以避免丢包。 为了避免分组丢失，当缓冲器的占用达到第一阈值时，从该数据的特定源排除第一类数据的进一步传输，然后被接收，同时从相同的第一阈值的其他源的传输， 直到来自这些其他来源的一流数据类型也被接收到，类型的数据不会从这些其他数据源中排除。 此外，只要存储在缓冲器中的数据量保持低于大于第一阈值的第二阈值，则不排除第二类类型的数据的发送。 当缓冲器的占用达到第二阈值时，也排除了从接收到的该二级类型的数据的特定源的进一步传输。 当接收到来自该二类数据类型的其他来源的数据时，也排除了来自其他来源的进一步传输。 然而，只要数据量保持低于大于第二阈值的第三阈值，则不排除第三类数据的传输。 为了避免分组丢失，当接收到来自任何源的分组时，无论从该分组的源的传输是否被排除，都被存储。 有利地，可以概率地实现可用带宽的MAX / MIN分布，而没有分组丢失。

公开(公告)号：US07787399B2

公开(公告)日：2010-08-31

申请号：US12179855

申请日：2008-07-25

申请人： Thomas P. Chu ,  Ramesh Nagarajan ,  Yung-Terng Wang

发明人： Thomas P. Chu ,  Ramesh Nagarajan ,  Yung-Terng Wang

IPC分类号： H04L12/28

CPC分类号： H04L12/462 ,  H04L45/02 ,  H04L45/122 ,  H04L45/48

摘要： In one embodiment, a method for setting up a flow-through mesh group (FTMG) for transmitting link-state packets (LSPs) in a network having a plurality of nodes interconnected by links. The FTMG is a combination of multiple spanning trees for the network through which LSPs are forwarded. FTMG set-up messages are received at ports of each node of the network from peer ports of linked nodes. FTMG set-up messages identify root nodes of the multiple spanning trees and the transmission modes of the peer ports. The FTMG set-up messages are used to determine (1) a root node for each spanning tree, (2) a root port on each node for each spanning tree, and (3) directionality of ports of the nodes. FTMG set-up messages are then used to determine the transmission mode of ports of the nodes and, subsequently, to update the spanning trees and transmission modes, as needed.

摘要翻译： 在一个实施例中，一种用于建立用于在具有通过链路互连的多个节点的网络中发送链路状态分组（LSP）的流通网状组（FTMG）的方法。 FTMG是通过LSP转发的网络的多个生成树的组合。 FTMG建立消息从链接节点的对端口接收到网络的每个节点的端口。 FTMG建立消息标识了多个生成树的根节点和对端口的传输模式。 FTMG建立消息用于确定（1）每个生成树的根节点，（2）每个生成树的每个节点上的根端口，以及（3）节点端口的方向性。 然后，FTMG建立消息用于确定节点的端口的传输模式，并且随后根据需要更新生成树和传输模式。

公开(公告)号：US20100020726A1

公开(公告)日：2010-01-28

申请号：US12179855

申请日：2008-07-25

申请人： Thomas P. Chu ,  Ramesh Nagarajan ,  Yung-Terng Wang

发明人： Thomas P. Chu ,  Ramesh Nagarajan ,  Yung-Terng Wang

IPC分类号： H04L12/28 ,  H04L12/56

CPC分类号： H04L12/462 ,  H04L45/02 ,  H04L45/122 ,  H04L45/48

摘要： In one embodiment, a method for setting up a flow-through mesh group (FTMG) for transmitting link-state packets (LSPs) in a network having a plurality of nodes interconnected by links. The FTMG is a combination of multiple spanning trees for the network through which LSPs are forwarded. FTMG set-up messages are received at ports of each node of the network from peer ports of linked nodes. FTMG set-up messages identify root nodes of the multiple spanning trees and the transmission modes of the peer ports. The FTMG set-up messages are used to determine (1) a root node for each spanning tree, (2) a root port on each node for each spanning tree, and (3) directionality of ports of the nodes. FTMG set-up messages are then used to determine the transmission mode of ports of the nodes and, subsequently, to update the spanning trees and transmission modes, as needed.

摘要翻译： 在一个实施例中，一种用于建立用于在具有通过链路互连的多个节点的网络中发送链路状态分组（LSP）的流通网状组（FTMG）的方法。 FTMG是通过LSP转发的网络的多个生成树的组合。 FTMG建立消息从链接节点的对端口接收到网络的每个节点的端口。 FTMG建立消息标识了多个生成树的根节点和对端口的传输模式。 FTMG建立消息用于确定（1）每个生成树的根节点，（2）每个生成树的每个节点上的根端口，以及（3）节点端口的方向性。 然后，FTMG建立消息用于确定节点的端口的传输模式，并且随后根据需要更新生成树和传输模式。