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

1. 发明申请

WO2006127799A3 SYSTEM AND METHODS FOR PROVIDING A NETWORK PATH VERIFICATION PROTOCOL 审中-公开
公开(公告)号：WO2006127799A3
公开(公告)日：2006-11-30
申请号：PCT/US2006/020066
申请日：2006-05-23
申请人： CISCO TECHNOLOGY, INC. , GUICHARD, James N. , VASSEUR, Jean-Philippe , NADEAU, Thomas D. , WARD, David D. , PREVIDI, Stefano
发明人： GUICHARD, James N. , VASSEUR, Jean-Philippe , NADEAU, Thomas D. , WARD, David D. , PREVIDI, Stefano
IPC分类号： G06F11/00
摘要： A path verification protocol (PVP) which enumerates a series of messages sent to a set of nodes, or routers, along a network path identifies connectivity and transmission characteristic attributes by defining, implementing, and analyzing path verification messages (PVMs) in a VPN environment. Configurations herein provide a mechanism for determination of paths and/or routes that satisfy a QoS or other delivery speed/bandwidth guarantee. Such a mechanism may therefore be employed to perform routing decisions for QoS based traffic. Further, such a mechanism is employable to verify QoS levels and related attributes related to contractual terms between service providers and customers.

2. 发明申请

WO2006060491A2 SYSTEM AND METHODS FOR DETECTING NETWORK FAILURE 审中-公开
标题翻译：用于检测网络故障的系统和方法
公开(公告)号：WO2006060491A2
公开(公告)日：2006-06-08
申请号：PCT/US2005/043337
申请日：2005-11-30
申请人： CISCO TECHNOLOGY, INC. , GUICHARD, James, N. , VASSEUR, Jean-Philippe , FILSFILS, Clarence, A., M. , WARD, David, D. , PREVIDI, Stefano , NADEAU, Thomas, D.
发明人： GUICHARD, James, N. , VASSEUR, Jean-Philippe , FILSFILS, Clarence, A., M. , WARD, David, D. , PREVIDI, Stefano , NADEAU, Thomas, D.
IPC分类号： H04J1/16
CPC分类号： H04L45/22 , H04L41/0677 , H04L43/50 , H04L45/02 , H04L45/28
摘要： A path verification protocol (PVP) which enumerates a series of messages sent to a set of nodes, or routers, along a suspected path identifies forwarding plane problems for effecting changes at the control plane level. The messages include a command requesting interrogation of a further remote node for obtaining information about the path between the node receiving the PVP message and the further remote node. The node receiving the PVP message replies with a command response indicative of the outcome of attempts to reach the further remote node. The series of messages collectively covers a set of important routing points along a path from the originator to the recipient. The aggregate command responses to the series of PVP messages is analyzed to identify not only whether the entire path is operational, but also the location and nature of the problem.
摘要翻译：列出沿着可疑路径发送到一组节点或路由器的一系列消息的路径验证协议（PVP）识别用于在控制平面级别实现改变的转发平面问题。消息包括请求询问另一个远程节点以获取关于接收PVP消息的节点与另外的远程节点之间的路径的信息的命令。接收PVP消息的节点用指示响应到达远程节点的结果的命令响应来回复。一系列消息共同地涵盖沿着始发者到接收者的路径的一组重要的路由点。对一系列PVP消息的聚合命令响应进行分析，不仅可以识别整个路径是否可操作，还可以确定问题的位置和性质。

3. 发明申请

WO2006083872A2 SYSTEM AND METHODS FOR NETWORK PATH DETECTION 审中-公开
标题翻译：用于网络路径检测的系统和方法
公开(公告)号：WO2006083872A2
公开(公告)日：2006-08-10
申请号：PCT/US2006/003407
申请日：2006-01-31
申请人： CISCO TECHNOLOGY, INC. , PREVIDI, Stefano , GUICHARD, James N. , VASSEUR, Jean-Philippe , WARD, David D.
发明人： PREVIDI, Stefano , GUICHARD, James N. , VASSEUR, Jean-Philippe , WARD, David D.
IPC分类号： H04L12/56 , H04L12/28
CPC分类号： H04L45/026 , H04L43/0811 , H04L45/26 , H04L45/28 , H04L63/0272
摘要： Customer edge (CE) to CE device verification checks initiate routes from available CEs as a set of path verification messages, destined for remote CE routes serving a remote VPN. An extended community attribute, included among the attributes of the path verification message, stores the identity of the originating CE router. The path verification message propagates across the network, and transports the identity of the originating CE router because the originator identity is not overwritten by successive routing. Upon receipt by the remote CE, the originator is determinable from the extended community attribute. A further reachability field is also included in the extended community attribute and indicates whether per CE or per prefix is appropriate for the particular route in question. In this manner, CE-CE connectivity checks identify CEs which are reachable from other CEs. Accordingly, such a mechanism allows for route reachability aggregation on a per-CE or per prefix reachability basis.
摘要翻译：客户端（CE）到CE设备验证检查从可用的CE启动路由作为一组路径验证消息，目的地是服务于远程VPN的远程CE路由。包含在路径验证消息的属性之间的扩展团体属性存储始发CE路由器的身份。路径验证消息通过网络传播，并传输始发CE路由器的身份，因为始发方身份不会被连续路由覆盖。远程CE收到后，发起者可以从扩展团体属性中确定。扩展社区属性中还包括另外的可访问性字段，并指示每个CE或每个前缀是否适合所讨论的特定路由。以这种方式，CE-CE连接检查可以识别可从其他CE接入的CE。因此，这种机制允许在每个CE或每个前缀可达性的基础上进行路由可达性聚合。

4. 发明申请

WO2006102398A3 SYSTEM AND METHODS FOR IDENTIFYING NETWORK PATH PERFORMANCE 审中-公开
公开(公告)号：WO2006102398A3
公开(公告)日：2006-09-28
申请号：PCT/US2006/010379
申请日：2006-03-22
申请人： CISCO TECHNOLOGY, INC. , GUICHARD, James, N. , VASSEUR, Jean-Philippe , NADEAU, Thomas, D. , WARD, David, D.
发明人： GUICHARD, James, N. , VASSEUR, Jean-Philippe , NADEAU, Thomas, D. , WARD, David, D.
IPC分类号： H04L12/28
摘要： A system and method for aggregating performance characteristics for core network paths allows computation of message traffic performance over each of the available candidate paths through the core for identifying an optimal core network path. Particular network traffic, or messages, include attributes indicative of performance, such as transport time, delay, jitter, and drop percentage, over individual hops along the candidate path. A diagnostic processor parses these messages to identify the attributes corresponding to performance, and analyzes the resulting parsed routing information to compute an expected performance, such as available bandwidth (e.g. transport rate) over the path. Messages including such attributes may include link state attribute (LSA) messages, diagnostic probe messages specifically targeted to enumerate such attributes, or other network suitable network traffic. In a particular configuration, the messages may be Path Verification Protocol (PVP) messages.

5. 发明申请

WO2006096560A3 SYSTEM AND METHODS FOR NETWORK REACHABILITY DETECTION 审中-公开
公开(公告)号：WO2006096560A3
公开(公告)日：2006-09-14
申请号：PCT/US2006/007722
申请日：2006-03-03
申请人： CISCO TECHNOLOGY, INC. , NADEAU, Thomas D. , SAYEED, Mohammed Azhar , PIECUCH, Michael T. , GUICHARD, James N. , VASSEUR, Jean-Philippe
发明人： NADEAU, Thomas D. , SAYEED, Mohammed Azhar , PIECUCH, Michael T. , GUICHARD, James N. , VASSEUR, Jean-Philippe
IPC分类号： H04L12/28
摘要： A mechanism for ASBRs to identify the originating node, or router, in an LSP conversant autonomous system (AS), such as an MPLS VPN environment, maintains the identity of the originating node and successive nodes in subsequent autonomous systems along the path to the node to be pinged. The identity of the transporting nodes is stored in a stack or other object associated with the ping request (ping), such that the pinged node may employ the stored identity as a set of return path routing information. Successive ASBRs store their identity on the stack, in an ordered manner, along the path to the destination. Upon reaching the destination (ping) node, the destination node employs the identity of the first node on the stack to send the acknowledgment, or ping response.

6. 发明申请

WO2005119971A2 METHOD AND APPARATUS FOR FORWARDING DATA IN A DATA COMMUNICATIONS NETWORK 审中-公开
标题翻译：用于在数据通信网络中转发数据的方法和装置
公开(公告)号：WO2005119971A2
公开(公告)日：2005-12-15
申请号：PCT/US2005/017463
申请日：2005-05-18
申请人： CISCO TECHNOLOGY, INC. , PREVIDI, Stefano Benedetto , FILSFILS, Clarence , VASSEUR, Jean-Philippe
发明人： PREVIDI, Stefano Benedetto , FILSFILS, Clarence , VASSEUR, Jean-Philippe
IPC分类号： H04L12/28
CPC分类号： H04L45/24 , H04L45/02 , H04L45/123 , H04L45/125 , H04L45/48 , H04L47/10 , H04L47/125
摘要： A method is disclosed of forwarding data in a data communications network comprising a plurality of nodes and links therebetween, each link having an associated usage cost and a load capacity. A forwarding node identifies a lowest cost route, comprising one or more links, to a destination node. If a plurality of lowest cost routes is identified, then the forwarding node allocates data for forwarding along each of the lowest cost routes dependent on a relative load capacity of that route.
摘要翻译：公开了一种在数据通信网络中转发数据的方法，其中包括多个节点和链路之间的链路，每个链路具有相关联的使用成本和负载能力。转发节点向目的地节点标识包括一个或多个链路的最低成本路由。如果识别出多个最低成本路由，则转发节点根据该路由的相对负载能力分配用于沿每个最低成本路由转发的数据。

7. 发明申请

WO2007002495A2 METHOD AND APPARATUS FOR PROVIDING FASTER CONVERGENCE FOR REDUNDANT SITES 审中-公开
标题翻译：为冗余站点提供更快速融合的方法和装置
公开(公告)号：WO2007002495A2
公开(公告)日：2007-01-04
申请号：PCT/US2006/024632
申请日：2006-06-23
申请人： CISCO TECHNOLOGY, INC. , FILSFILS, Clarence A., M. , GUICHARD, James, N. , RASZUK, Robert , VASSEUR, Jean-Philippe , MICHIELSEN, Kris , DE VRIENDT, Peter
发明人： FILSFILS, Clarence A., M. , GUICHARD, James, N. , RASZUK, Robert , VASSEUR, Jean-Philippe , MICHIELSEN, Kris , DE VRIENDT, Peter
IPC分类号： G06F11/00
CPC分类号： H04L12/66 , H04L41/0668 , H04L45/02 , H04L45/023 , H04L45/04 , H04L45/22 , H04L45/24 , H04L45/28 , H04L45/36 , H04L45/58
摘要： A method, apparatus and computer program product for providing convergence for dual-homed site in a network is presented. An occurrence of a failure between a first Provider Edge (PE) device and a first Customer Edge (CE) device in communication with a dual-homed site is detected. A determination is made whether an alternate route exists for the dual-homed site in a routing table associated with the first PE device. When an alternate route exists then a routing entry associated with the first CE device in a routing table of said first PE device is kept from being deleted for a predetermined amount of time, the routing table is modified to reference the alternate route, the routing entry is rewritten to perform a POP and lookup in a VRF table of the first PE device, and the routing entry is deleted after the predetermined amount of time has elapsed.
摘要翻译：提出了一种用于为网络中双归属站点提供融合的方法，装置和计算机程序产品。检测到与双归位置通信的第一提供商边缘（PE）设备和第一客户边缘（CE）设备之间的故障的发生。确定在与第一PE设备相关联的路由表中是否存在用于双归位置的备用路由。当存在备用路由时，在所述第一PE设备的路由表中与所述第一CE设备相关联的路由条目不被删除预定的时间量，所述路由表被修改以引用所述备用路由，所述路由条目被重写以在第一PE设备的VRF表中执行POP和查找，并且在经过预定时间量之后删除路由条目。

8. 发明申请

WO2012122225A2 PHASE-BASED OPERATION OF DEVICES ON A POLYPHASE ELECTRIC DISTRIBUTION SYSTEM 审中-公开
标题翻译：多相电力分配系统设备的基于相位的操作
公开(公告)号：WO2012122225A2
公开(公告)日：2012-09-13
申请号：PCT/US2012/027994
申请日：2012-03-07
申请人： CISCO TECHNOLOGY, INC. , SHAFFER, Shmuel , VASSEUR, Jean-Philippe , SHETTY, Sandeep, Jay
发明人： SHAFFER, Shmuel , VASSEUR, Jean-Philippe , SHETTY, Sandeep, Jay
IPC分类号： G06F1/26 , G06F11/30
CPC分类号： G06F1/26 , G01R29/16 , G01R29/18 , H02J3/14 , H02J3/26 , Y02B70/3225 , Y02E40/50 , Y04S20/222
摘要： In one embodiment, a device in a computer network monitors an alternating-current (AC) waveform of an electrical power source at the device, where the power source is part of a polyphase power source system. Once the device determines a particular phase of the polyphase power source system at the device, then the device joins a directed acyclic graph (DAG) specific to the particular phase. In another embodiment, a device detects a time of a zero crossing of the AC waveform, and may then determine a particular phase of the polyphase power source system at the device based on the time of the zero crossing relative to a corresponding location within a frequency hopping superframe of the computer network.
摘要翻译：在一个实施例中，计算机网络中的设备监视设备处的电源的交流（AC）波形，其中电源是多相电源系统的一部分。一旦器件确定器件上的多相电源系统的特定相位，器件将连接特定相位的有向非循环图（DAG）。在另一个实施例中，设备检测AC波形的零交叉时间，然后可以基于相对于频率内的相应位置的过零点的时间来确定设备处的多相电源系统的特定相位跳台超级计算机网络。

9. 发明申请

WO2012064795A3 DYNAMIC ADDRESS ASSIGNMENT FOR ADDRESS AGGREGATION IN LOW POWER AND LOSSY NETWORKS 审中-公开
公开(公告)号：WO2012064795A3
公开(公告)日：2012-05-18
申请号：PCT/US2011/059855
申请日：2011-11-09
申请人： CISCO TECHNOLOGY, INC. , SHAFFER, Shmuel , THUBERT, Pascal , WETTERWALD, Patrick , VASSEUR, Jean-Philippe
发明人： SHAFFER, Shmuel , THUBERT, Pascal , WETTERWALD, Patrick , VASSEUR, Jean-Philippe
IPC分类号： H04L12/56 , H04W8/26 , H04L29/12 , H04W40/24
摘要： A node in a Low power and Lossy Network (LLN) is managed by monitoring a routing configuration on a node in a LLN. A triggering parameter that is used to invoke an address change on a child node is tracked and a threshold against which to compare the triggering parameter is accessed. The triggering parameter is compared to the threshold. Based on results of comparing the triggering parameter to the threshold, it is determined that an address change at the child node is appropriate. An address change of a child node appearing in the routing configuration is invoked based on the determination that an address change is appropriate.

10. 发明申请

WO2011115679A1 DYNAMIC DIRECTED ACYCLIC GRAPH (DAG) TOPOLOGY REPORTING 审中-公开
标题翻译：动态方向指南图（DAG）拓扑报告
公开(公告)号：WO2011115679A1
公开(公告)日：2011-09-22
申请号：PCT/US2011/000489
申请日：2011-03-17
申请人： CISCO TECHNOLOGY, INC. , AGARWAL, Navneet , VASSEUR, Jean-Philippe , ACHAR, Vivek, N.
发明人： AGARWAL, Navneet , VASSEUR, Jean-Philippe , ACHAR, Vivek, N.
IPC分类号： H04L12/28
CPC分类号： H04L41/12 , H04L45/02 , H04L45/26 , H04L45/48
摘要： In one embodiment, a root device of a directed acyclic graph (DAG) may determine/detect a trigger to learn a network topology of the DAG. In response, the root device may transmit a DAG discovery request down the DAG with a route record request that requests that each device within the DAG add its device identification (ID) to a reverse route record stack for each route of a DAG discovery reply propagated up the DAG toward the root device. Upon receiving one or more DAG discovery replies, the root device may compile the recorded routes from the reverse route record stacks into a DAG network topology. Also, in one embodiment, the root device may determine "short-cuts" based on a traffic matrix generated in response to network statistics optionally included within the responses from the devices within the DAG.
摘要翻译：在一个实施例中，有向非循环图（DAG）的根设备可以确定/检测触发以学习DAG的网络拓扑。作为响应，根设备可以使用路由记录请求向DAG发送DAG发现请求，该路由记录请求请求DAG中的每个设备将其设备标识（ID）添加到反向路由记录堆栈中，用于传播的DAG发现应答的每个路由将DAG朝向根设备。在接收到一个或多个DAG发现答复时，根设备可以将记录的路由从反向路由记录堆栈编译成DAG网络拓扑。此外，在一个实施例中，根设备可以基于响应于可选地包括在来自DAG内的设备的响应内的网络统计信息生成的业务矩阵来确定“快捷方式”。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式