会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Link delay determination using virtual concatenation
    • 使用虚拟级联的链路延迟确定
    • US08289859B2
    • 2012-10-16
    • US10853422
    • 2004-05-25
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • G08C15/00H04J3/06
    • H04L43/0858H04J2203/0094
    • Link delay is determined in a network comprising a plurality of nodes by identifying pairs of nodes associated with a given link, and, for each of the identified pairs, setting up a virtually-concatenated group (VCG) between the nodes of that pair. The VCGs are utilized to make delay measurements, and the delay measurements are processed to determine delay of the given link. In an illustrative embodiment, the VCGs comprise two-member VCGs with the members being routed on opposite sides of a logical ring. For a given one of these two-member VCGs, a differential delay measurement is made at a particular one of the associated nodes by comparing frame indicator fields for concurrently arriving frames. A system of equations is generated based on the differential delay measurements made utilizing the VCGs, and the system of equations is solved to obtain information utilizable to determine delay of the given link.
    • 通过识别与给定链路相关联的节点对,在包括多个节点的网络中确定链路延迟,并且对于每个所识别的对,在该对的节点之间建立虚连接的组(VCG)。 VCG用于进行延迟测量,并且处理延迟测量以确定给定链路的延迟。 在说明性实施例中,VCG包括两个成员的VCG,其中该成员被路由在逻辑环的相对侧上。 对于这两个成员VCG中的给定的一个,通过比较并发到达的帧的帧指示符字段,在相关节点的特定一个处进行差分延迟测量。 基于使用VCG进行的差分延迟测量产生方程组,求解方程组以获得可用于确定给定链路延迟的信息。
    • 6. 发明授权
    • Route precomputation method and apparatus for bandwidth guaranteed traffic
    • 路由预先计算方法和带宽保证流量的设备
    • US07813270B2
    • 2010-10-12
    • US10438431
    • 2003-05-15
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • H04J1/16
    • H04L45/00H04L45/42
    • A maximum-flow based route precomputation algorithm includes at least a route generation phase and a route selection phase, and determines one or more routes between at least a given pair of nodes in a network. In the route generation phase, a maximum-flow algorithm is applied to a first set of information characterizing links between the given pair of nodes in the network. The output of the maximum-flow algorithm is utilizable to generate a second set of information characterizing corresponding admissible flows. In the route selection phase, one or more routes are determined based on the second set of information using, for example, a shortest widest path (SWP) algorithm. The route generation and route selection phases may be repeated for each of a plurality of node pairs of the network.
    • 基于最大流的路由预计算算法至少包括路由产生阶段和路由选择阶段,并确定网络中至少一给定对节点之间的一个或多个路由。 在路由产生阶段,最大流算法应用于表征网络中给定的一对节点之间的链路的第一组信息。 最大流量算法的输出可用于生成表征对应允许流的第二组信息。 在路由选择阶段,使用例如最短最宽路径(SWP)算法,基于第二组信息来确定一个或多个路由。 可以为网络的多个节点对中的每一个重复路由生成和路由选择阶段。
    • 8. 发明授权
    • Data path provisioning in a reconfigurable data network
    • 可重配置数据网络中的数据路径配置
    • US07426186B2
    • 2008-09-16
    • US10345612
    • 2003-01-16
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • G01R31/08
    • H04L45/04H04L45/124
    • A method for data path provisioning in a reconfigurable data network is disclosed. A data path between a source IP router and a destination IP router is determined taking into account the IP-subnets of the network interfaces of the IP routers included in the path. In one embodiment, the requirement that two IP routers can send packets via their connected interface if and only if the two interfaces are on the same subnet (i.e., the subnet constraint) is completely honored during the data path determination. In another embodiment, the data path is determined while allowing some number of violations of the subnet constraint. A transform network graph is computed and is used to determine the data path taking into account the IP-subnets.
    • 公开了一种用于在可重配置数据网络中的数据路径供应的方法。 源IP路由器和目的地IP路由器之间的数据路径被考虑到路径中包括的IP路由器的网络接口的IP子网被确定。 在一个实施例中,当且仅当两个接口在同一子网(即,子网约束)上时,两个IP路由器可以经由其连接的接口发送分组的要求在数据路径确定期间被完全兑现。 在另一个实施例中,确定数据路径,同时允许一些数量的违反子网约束。 计算变换网络图,并用于确定考虑到IP子网的数据路径。
    • 9. 发明授权
    • Fast restoration for virtually-concatenated data traffic
    • 快速恢复虚拟连接的数据流量
    • US07411900B2
    • 2008-08-12
    • US10446220
    • 2003-05-28
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • G01R31/08
    • H04J3/1611H04J2203/006H04J2203/0094Y10S370/907
    • Techniques are disclosed for restoration of virtually-concatenated data traffic in a data transmission network. A virtually-concatenated group is formed comprising: (i) a plurality of primary members each associated with a corresponding data stream, and (ii) at least one backup member. Each of the plurality of primary members and the backup member of the virtually-concatenated group may be assigned a corresponding one of a plurality of data transmission routes between first and second nodes of the network. Responsive to a failure of a given one of the plurality of primary members, the backup member is utilized for restoring at least a portion of the data traffic of the given member. The invention also provides a modified link capacity adjustment scheme (LCAS) protocol which substantially reduces the time required to report changes in member status information from a sink node to a source node, thereby substantially reducing the amount of time required to perform a restoration operation.
    • 公开了用于在数据传输网络中恢复虚连接的数据业务的技术。 形成了一个虚拟连接的组,包括:(i)多个主要成员,每个主要成员与相应的数据流相关联,和(ii)至少一个备份成员。 可以为虚拟级联组的多个主要成员和备份成员中的每一个分配网络的第一和第二节点之间的多个数据传输路由中的相应一个。 响应于多个主要成员中给定的一个成员的故障,备用成员被用于恢复给定成员的数据业务的至少一部分。 本发明还提供了修改的链路容量调整方案(LCAS)协议,其大大减少了从汇聚节点向源节点报告成员状态信息的变化所需的时间,从而显着减少了执行恢复操作所需的时间量。
    • 10. 发明申请
    • Link delay determination using virtual concatenation
    • 使用虚拟级联的链路延迟确定
    • US20050265251A1
    • 2005-12-01
    • US10853422
    • 2004-05-25
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • Swarup AcharyaBhawna GuptaPankaj RisboodAnurag Srivastava
    • H04L12/26H04L12/28
    • H04L43/0858H04J2203/0094
    • Link delay is determined in a network comprising a plurality of nodes by identifying pairs of nodes associated with a given link, and, for each of the identified pairs, setting up a virtually-concatenated group (VCG) between the nodes of that pair. The VCGs are utilized to make delay measurements, and the delay measurements are processed to determine delay of the given link. In an illustrative embodiment, the VCGs comprise two-member VCGs with the members being routed on opposite sides of a logical ring. For a given one of these two-member VCGs, a differential delay measurement is made at a particular one of the associated nodes by comparing frame indicator fields for concurrently arriving frames. A system of equations is generated based on the differential delay measurements made utilizing the VCGs, and the system of equations is solved to obtain information utilizable to determine delay of the given link.
    • 通过识别与给定链路相关联的节点对,在包括多个节点的网络中确定链路延迟,并且对于每个所识别的对,在该对的节点之间建立虚连接的组(VCG)。 VCG用于进行延迟测量,并且处理延迟测量以确定给定链路的延迟。 在说明性实施例中,VCG包括两个成员的VCG,其中该成员被路由在逻辑环的相对侧上。 对于这两个成员VCG中的给定的一个,通过比较并发到达的帧的帧指示符字段,在相关节点的特定一个处进行差分延迟测量。 基于使用VCG进行的差分延迟测量产生方程组,求解方程组以获得可用于确定给定链路延迟的信息。