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

1. 发明申请

WO2012122225A3 PHASE-BASED OPERATION OF DEVICES ON A POLYPHASE ELECTRIC DISTRIBUTION SYSTEM 审中-公开
标题翻译：多相电力分配系统设备的基于相位的操作
公开(公告)号：WO2012122225A3
公开(公告)日：2012-12-20
申请号：PCT/US2012027994
申请日：2012-03-07
申请人： CISCO TECH INC , SHAFFER SHMUEL , VASSEUR JEAN-PHILIPPE , SHETTY SANDEEP JAY
发明人： SHAFFER SHMUEL , VASSEUR JEAN-PHILIPPE , SHETTY SANDEEP JAY
IPC分类号： G01D4/00 , H02J3/14 , H02J3/26
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) (900) 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. If too much power is being drawn from a particular phase, a demand- response request (DR 1000) may be sent on the phase - specific DAG.
摘要翻译：在一个实施例中，计算机网络中的设备监视设备处的电源的交流（AC）波形，其中电源是多相电源系统的一部分。一旦设备确定设备处的多相电源系统的特定阶段，则设备加入特定相位的有向非循环图（DAG）（900）。在另一个实施例中，设备检测AC波形的零交叉时间，然后可以基于相对于频率内的相应位置的过零点的时间来确定设备处的多相电源系统的特定相位跳台超级计算机网络。如果从特定阶段获取太多的权力，则可以在相位特定的DAG上发送请求响应请求（DR 1000）。

2. 发明申请

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波形的零交叉时间，然后可以基于相对于频率内的相应位置的过零点的时间来确定设备处的多相电源系统的特定相位跳台超级计算机网络。

3. 发明申请

WO2012083125A1 INCREASED COMMUNICATION OPPORTUNITIES WITH LOW-CONTACT NODES IN A COMPUTER NETWORK 审中-公开
标题翻译：在计算机网络中增加低接触点通信机会
公开(公告)号：WO2012083125A1
公开(公告)日：2012-06-21
申请号：PCT/US2011/065393
申请日：2011-12-16
申请人： CISCO TECHNOLOGY, INC. , VASSEUR, Jean-philippe , SHAFFER, Shmuel , SHETTY, Sandeep, Jay
发明人： VASSEUR, Jean-philippe , SHAFFER, Shmuel , SHETTY, Sandeep, Jay
IPC分类号： H04L12/18 , H04W84/18
CPC分类号： H04L12/1863 , H04L12/185 , H04L67/145
摘要： In one embodiment, a particular node (e.g., root node) in a directed acyclic graph (DAG) in a computer network may identify a low-contact (e.g., wireless) node in the DAG that is at risk of having an invalid path when attempts are made to reach the low-contact node. In response, the particular node may identify neighbors of the low-contact node, and may establish a multicast tree from the particular node to the low-contact node through a plurality of the neighbors to reach the low-contact node. When sending traffic to the low-contact node, the particular node sends the traffic on the multicast tree, wherein each of the plurality of neighbors attempts to forward the traffic to the low-contact node. In another embodiment, the low- contact node itself indicates its status to the particular/root node, along with its list of neighbors in order to receive the multicast traffic.
摘要翻译：在一个实施例中，计算机网络中的有向非循环图（DAG）中的特定节点（例如，根节点）可以标识DAG中具有无效路径风险的低接触（例如，无线）节点，当尝试到达低接触节点。作为响应，特定节点可以识别低联系节点的邻居，并且可以通过多个邻居来建立从特定节点到低联系节点的多播树，以到达低接触节点。当向低联系节点发送流量时，特定节点在多播树上发送流量，其中多个邻居中的每一个尝试将流量转发到低联系节点。在另一个实施例中，低接触节点本身指示其对特定/根节点的状态及其邻居列表以便接收多播业务。

4. 发明申请

WO2006127799A2 SYSTEM AND METHODS FOR PROVIDING A NETWORK PATH VERIFICATION PROTOCOL 审中-公开
标题翻译：用于提供网络路径验证协议的系统和方法
公开(公告)号：WO2006127799A2
公开(公告)日：2006-11-30
申请号：PCT/US2006020066
申请日：2006-05-23
申请人： CISCO TECH 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分类号： H04L12/28
CPC分类号： H04L45/308 , H04L43/0811 , H04L43/12 , H04L45/04 , H04L45/302 , H04L45/70 , H04L47/24 , H04L63/029
摘要： 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.
摘要翻译：路由验证协议（PVP），其列举沿着网络路径发送到一组节点或路由器的一系列消息，通过在VPN环境中定义，实现和分析路径验证消息（PVM）来识别连接性和传输特性属性。这里的配置提供了用于确定满足QoS或其他传送速度/带宽保证的路径和/或路由的机制。因此，可以采用这样的机制来执行基于QoS的业务的路由决策。此外，这种机制可用于验证与服务提供商和客户之间的合同条款相关的QoS等级和相关属性。

5. 发明申请

WO2005060463A3 SOFT PREEMPTION FEEDBACK 审中-公开
标题翻译：软件反馈
公开(公告)号：WO2005060463A3
公开(公告)日：2006-10-05
申请号：PCT/US2004037728
申请日：2004-11-10
申请人： CISCO TECH INC , VASSEUR JEAN PHILIPPE , UPPILI RAMESH , ITURRALDE CAROL , SIVABALAN MUTHURAJAH
发明人： VASSEUR JEAN PHILIPPE , UPPILI RAMESH , ITURRALDE CAROL , SIVABALAN MUTHURAJAH
IPC分类号： H04L12/26 , H04L12/56 , H04L29/06
CPC分类号： H04L45/00 , H04L29/06 , H04L45/50 , H04L47/10 , H04L47/2433 , H04L47/245 , H04L47/70 , H04L47/74 , H04L47/765 , H04L47/805 , H04L47/824 , H04L47/825 , H04L47/826 , H04L69/28
摘要： Systems and methods for preemption of Traffic Engineering LSPs such that preemption decisions are made in a coordinated fashion along the path of a new LSP and computation of a new path for a preempted LSP can take advantage of knowledge of newly unavailable links. The efficiency of the preemption mechanism is greatly increased and the undesirable effects of heterogeneous preemption decisions are limited. The amount of signaling may also be significantly reduced. In one implementation, these advantages are achieved by exploiting an upstream preemption feedback mechanism that uses an incremental timer to delay preemption decisions until feedback is available.
摘要翻译：流量工程LSP抢占的系统和方法，使得沿着新LSP的路径以协调的方式进行抢占决策，并为抢占的LSP计算新的路径，可以利用新的不可用链路的知识。抢占机制的效率大大提高，异质抢占决策的不良影响有限。信号量也可以显着降低。在一个实现中，这些优点通过利用上游抢占反馈机制来实现，该机制使用增量定时器来延迟抢占决定，直到反馈可用。

6. 发明申请

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或每个前缀可达性的基础上进行路由可达性聚合。

7. 发明申请

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.
摘要翻译：公开了一种在数据通信网络中转发数据的方法，其中包括多个节点和链路之间的链路，每个链路具有相关联的使用成本和负载能力。转发节点向目的地节点标识包括一个或多个链路的最低成本路由。如果识别出多个最低成本路由，则转发节点根据该路由的相对负载能力分配用于沿每个最低成本路由转发的数据。

8. 发明申请

WO2013016630A1 REDUCED TOPOLOGY ROUTING IN SHARED MEDIA COMMUNICATION NETWORKS 审中-公开
标题翻译：在共享媒体通信网络中减少拓扑路由
公开(公告)号：WO2013016630A1
公开(公告)日：2013-01-31
申请号：PCT/US2012/048530
申请日：2012-07-27
申请人： CISCO TECHNOLOGY, INC. , VASSEUR, Jean-philippe , HUI, Jonathan, W.
发明人： VASSEUR, Jean-philippe , HUI, Jonathan, W.
IPC分类号： H04L12/56
CPC分类号： H04W40/22 , H04L45/123 , H04L45/48 , H04W40/30 , Y02D70/142 , Y02D70/144 , Y02D70/22 , Y02D70/39
摘要： In one embodiment, a particular node in a shared communication network determines a current path cost in a routing topology from itself to a root node via a current parent node. The particular node also determines a respective path cost from each reachable potential parent node of the particular node to the root node via each potential parent and a respective link metric to each potential parent node. A set of acceptable parent nodes are determined from the potential parent nodes that have a respective path cost that is less than the current path cost plus an acceptable cost increase, and also have a respective link metric that is within an acceptable range. By determining a respective number of child nodes for each acceptable parent node, the particular node may then select a new parent node based on giving preference to those having a greater respective number of child nodes.
摘要翻译：在一个实施例中，共享通信网络中的特定节点通过当前父节点来确定从自身到根节点的路由拓扑中的当前路径开销。特定节点还通过每个潜在父节点以及针对每个潜在父节点的相应链路度量来确定从特定节点的每个可达到的潜在父节点到根节点的相应路径开销。从具有小于当前路径成本加上可接受的成本增加的相应路径成本的潜在父节点确定一组可接受的父节点，并且还具有处于可接受范围内的相应链路度量。通过为每个可接受的父节点确定相应数目的子节点，则特定节点可以基于给予具有更大相应数量的子节点的那些优先选择新的父节点。

9. 发明申请

WO2012083130A1 REPEATER NODES IN SHARED MEDIA NETWORKS 审中-公开
标题翻译：共享媒体网络中的重复播放
公开(公告)号：WO2012083130A1
公开(公告)日：2012-06-21
申请号：PCT/US2011/065407
申请日：2011-12-16
申请人： CISCO TECHNOLOGY, INC. , SHETTY, Sandeep, Jay , SHAFFER, Shmuel , VASSEUR, Jean-philippe
发明人： SHETTY, Sandeep, Jay , SHAFFER, Shmuel , VASSEUR, Jean-philippe
IPC分类号： H04L1/18
CPC分类号： H04L1/1867 , H04L2001/0097
摘要： In one embodiment, a repeater node in a shared media network may intercept a shared media transmission from a first node to a second node. Once a shared media transmission is intercepted, the repeater node may determine whether the second node returns an acknowledgement (ACK) to the first node. If the second node does not return an ACK to the first node, the repeater node repeats the shared media transmission to the second node. Also, according to one or more additional embodiments of the disclosure, when receiving an ACK at the repeater node from the second node in response to the repeated shared media transmission, the repeater node may also forward the ACK from the second node to the first node.
摘要翻译：在一个实施例中，共享媒体网络中的中继器节点可以拦截从第一节点到第二节点的共享媒体传输。一旦共享媒体传输被拦截，则中继器节点可以确定第二节点是否向第一节点返回确认（ACK）。如果第二节点不向第一节点返回ACK，则中继器节点重复向第二节点的共享媒体传输。此外，根据本公开的一个或多个附加实施例，当响应于重复的共享媒体传输从第二节点在中继器节点处接收到ACK时，中继器节点还可以将ACK从第二节点转发到第一节点。

10. 发明申请

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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式