专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07778204B2 Automatic maintenance of a distributed source tree (DST) network 有权
标题翻译：自动维护分布式源树（DST）网络
公开(公告)号：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操作。在中继模式操作中，终端节点经由中间节点将分组隧道传送到另一终端节点。在交换模式操作中，选择中间节点将分组从一个终端节点转发到另一个终端节点。

2. 发明授权

US07787399B2 Automatically configuring mesh groups in data networks 有权
标题翻译：在数据网络中自动配置网格组
公开(公告)号：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建立消息用于确定节点的端口的传输模式，并且随后根据需要更新生成树和传输模式。

3. 发明申请

US20100020726A1 AUTOMATICALLY CONFIGURING MESH GROUPS IN DATA NETWORKS 有权
标题翻译：在数据网络中自动配置MESH组
公开(公告)号：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建立消息用于确定节点的端口的传输模式，并且随后根据需要更新生成树和传输模式。

4. 发明申请

US20100020719A1 AUTOMATIC MAINTENANCE OF A DISTRIBUTED SOURCE TREE (DST) NETWORK 有权
标题翻译：分布式资源树（DST）网络的自动维护
公开(公告)号：US20100020719A1
公开(公告)日：2010-01-28
申请号：US12179872
申请日：2008-07-25
申请人： Thomas P. Chu , Ramesh Nagarajan , Yung-Terng Wang
发明人： Thomas P. Chu , Ramesh Nagarajan , Yung-Terng Wang
IPC分类号： H04L12/24
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操作。在中继模式操作中，终端节点经由中间节点将分组隧道传送到另一终端节点。在交换模式操作中，选择中间节点将分组从一个终端节点转发到另一个终端节点。

5. 发明授权

US07406082B2 Sequence number schemes for acceptance/rejection of duplicated packets in a packet-based data network 有权
标题翻译：用于在基于分组的数据网络中接受/拒绝重复分组的序列号方案
公开(公告)号：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.
摘要翻译：在基于分组的数据网络中，分组被复制，并且将序列号插入到每个重复分组中，其中重复分组沿着从源节点到网络中的目的地节点的两个不同路径传输。根据实现，源节点将不同类型的序列号插入到重复分组中，并且目的节点相应地处理这些序列号，以确定是接受还是拒绝每个接收到的分组。在某些实现中，分配给每个分组的序列比特数小于由目的地节点解释的分组的有效序列号的大小。

6. 发明授权

US5983278A Low-loss, fair bandwidth allocation flow control in a packet switch 失效
标题翻译：分组交换机中的低损耗，公平带宽分配流量控制
公开(公告)号：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分布，而没有分组丢失。

7. 发明授权

US06683852B2 Call admission control methods and apparatus for improving route selection in packet networks 有权
标题翻译：用于改善分组网络中路由选择的呼叫接纳控制方法和装置
公开(公告)号：US06683852B2
公开(公告)日：2004-01-27
申请号：US10264415
申请日：2002-10-04
申请人： Ramesh Nagarajan , Yung-Terng Wang
发明人： Ramesh Nagarajan , Yung-Terng Wang
IPC分类号： H04J1225
CPC分类号： H04L47/822 , H04L12/5602 , H04L45/10 , H04L45/123 , H04L45/302 , H04L47/15 , H04L47/70 , H04L47/783 , H04L47/805 , H04L2012/5632 , H04L2012/5638
摘要： A packet switch is configured for determining an equivalent bandwidth for use in GCAC. The equivalent bandwidth definition of the invention is derived by multiplying some known connection parameter such as, for example, a selected bandwidth value by a multiplier preferably computed and stored in look-up tables according to the invention. The appropriate multiplier for a given connection request associated with a call may then be found by accessing sets of the look-up tables based on one or more connection and/or network parameters. For each link in a path considered during GCAC, the product of the multiplication of the selected bandwidth value and the multiplier is then compared to the available bandwidth, AvCR, of the path links to determine if the path satisfies the connection request.
摘要翻译：分组交换机配置为确定在GCAC中使用的等效带宽。本发明的等效带宽定义是通过将一些已知的连接参数（例如，所选带宽值）乘以优选地计算并存储在根据本发明的查找表中的乘法器得到的。然后可以通过基于一个或多个连接和/或网络参数访问查找表的集合来找到与呼叫相关联的给定连接请求的适当乘数。对于在GCAC期间考虑的路径中的每个链路，然后将所选带宽值与乘数相乘的乘积与路径链路的可用带宽AvCR进行比较，以确定路径是否满足连接请求。

8. 发明授权

US06240066B1 Dynamic bandwidth and buffer management algorithm for multi-service ATM switches 失效
标题翻译：多业务ATM交换机的动态带宽和缓冲管理算法
公开(公告)号：US06240066B1
公开(公告)日：2001-05-29
申请号：US09017586
申请日：1998-02-03
申请人： Ramesh Nagarajan , Yung-Terng Wang
发明人： Ramesh Nagarajan , Yung-Terng Wang
IPC分类号： H04L1256
CPC分类号： H04Q11/0478 , H04L2012/5651 , H04L2012/5679 , H04L2012/5681
摘要： Buffer and bandwidth resources in an ATM switch having a multi-class queue capable of servicing one or more ATM service classes are dynamically allocated at each call setup and release request. Buffer and bandwidth are dynamically partitioned in a manner that satisfies varied criteria including: tight allocation of buffer and bandwidth resources for each class, in desired proportions relative to the total respective available resources to meet the same QoS criteria within an ATM class, to implement the resource allocation described herein in a computationally simple and fast manner, to support multiple and varied QoS criterias, such as delay and loss, and thus be independent of the QoS criteria, to operate independently of the choice of the CAC/QoS computation engine, such that, given a set of connections and a desired QoS criteria the proposed resource allocation mechanisms are able to accommodate any desired method of computing the required bandwidth and buffer, and to provide a means for tuning the frequency of changes in the buffer or bandwidth allocation depending on which resource may be expensive to re-allocate.
摘要翻译：具有能够服务于一个或多个ATM服务类的多类队列的ATM交换机中的缓冲区和带宽资源在每个呼叫建立和释放请求时被动态分配。缓冲区和带宽以满足不同标准的方式进行动态分区，包括：针对每个类的缓冲区和带宽资源的紧密分配，以相对于总共相应的可用资源的所需比例满足ATM类中的相同QoS标准，以实现资源分配以计算简单和快速的方式描述，以支持多个和不同的QoS标准，例如延迟和丢失，并且因此独立于QoS准则，以独立于CAC / QoS计算引擎的选择来运行，例如给定一组连接和期望的QoS准则，所提出的资源分配机制能够适应任何所需的计算所需带宽和缓冲器的方法，并且提供一种用于调整缓冲器中的变化或带宽分配的频率的方法哪些资源可能会重新分配成本高昂。

9. 发明授权

US06212582B1 Method for multi-priority, multicast flow control in a packet switch 失效
标题翻译：分组交换机中的多优先级组播流控制方法
公开(公告)号：US06212582B1
公开(公告)日：2001-04-03
申请号：US08999311
申请日：1997-12-29
申请人： Song Chong , Ramesh Nagarajan , Yung-Terng Wang
发明人： Song Chong , Ramesh Nagarajan , Yung-Terng Wang
IPC分类号： H04Q1104
CPC分类号： H04L49/102 , H04L12/5602 , H04L49/30 , H04L2012/5635 , H04L2012/5651 , H04L2012/5682
摘要： A method for controlling data packet traffic flow over a bus interconnecting two or more nodes in a data communication system, each node having a unique address associated therewith and having a respective buffer memory for temporarily holding incoming data communicated thereto, each node further being capable of multicast sending of data packets over the bus to one or more nodes having respective addresses logically associated a unique address, the method comprising: checking current available buffer memory occupancy upon receipt of a data packet, the node being capable of outputting for transmission on the bus a first flow control indicator message when the data temporarily stored in the buffer memory is above a first buffer occupancy threshold associated with data of a first priority type, and a second flow control indicator message when the data temporarily stored in the buffer memory is above a second buffer occupancy threshold, the second buffer occupancy threshold being greater than the first occupancy threshold; implementing logical flow control to prevent transmission of data packet traffic of the first priority from one or more sending nodes to two or more receive nodes logically associated with the outputting node at the priority in response to receipt of the first flow control indicator message; and, implementing physical logical flow control to prevent transmission of data packet at any data traffic priority in response to receipt of the second flow control indicator message.
摘要翻译：一种用于通过互连数据通信系统中的两个或更多个节点的总线来控制数据分组业务流的方法，每个节点具有与之相关联的唯一地址，并且具有用于临时保存与其通信的输入数据的相应缓冲存储器，每个节点还能够通过总线将数据分组多播发送到具有逻辑关联的唯一地址的具有相应地址的一个或多个节点，所述方法包括：在接收到数据分组时检查当前可用的缓冲存储器占用，所述节点能够输出以在总线上传输当临时存储在缓冲存储器中的数据高于与第一优先级类型的数据相关联的第一缓冲器占用阈值时的第一流控制指示符消息，以及当临时存储在缓冲存储器中的数据高于第一流控制指示符消息时第二缓冲器占用阈值，第二缓冲器占用阈值更大比第一占用阈值高; 实现逻辑流控制，以响应于接收到第一流控制指示符消息，以优先级来防止从优先级逻辑地与一输出节点相关联的两个或更多个接收节点从一个或多个发送节点传送第一优先级的数据分组业务; 并且响应于接收到第二流控制指示符消息，实现物理逻辑流控制以防止数据分组在任何数据流量优先级的传输。

10. 发明授权

US08867333B2 Restoration path calculation considering shared-risk link groups in mesh networks 有权
标题翻译：考虑网状网络中共享风险链路组的恢复路径计算
公开(公告)号：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）根据路径成本选择新业务的恢复路径。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式