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

1. 发明申请

WO2013006689A1 TRANSMISSION PRIORITY PATHS IN MESH NETWORKS 审中-公开
标题翻译：传输网络中的优先级
公开(公告)号：WO2013006689A1
公开(公告)日：2013-01-10
申请号：PCT/US2012/045531
申请日：2012-07-05
申请人： CISCO TECHNOLOGY, INC. , SHAFFER, Shmuel , VASSEUR, Jean-Philippe , SHETTY, Sandeep, Jay
发明人： SHAFFER, Shmuel , VASSEUR, Jean-Philippe , SHETTY, Sandeep, Jay
IPC分类号： H04L12/56
CPC分类号： H04L47/2433 , H04L47/10 , H04L47/17 , H04L47/245 , H04L47/724 , H04L47/805 , H04L47/826
摘要： In one embodiment, a node may determine a trigger for establishing transmission priority on a path through a shared-media communication network for priority traffic to a particular node. As such, the node may generate a path clear message (PCM) that would instruct one or more receiving nodes along the path to suspend transmission for traffic other than the priority traffic for a specified duration, and also to transmit a local non-repeated distributed message to one or more neighbor nodes of each respective receiving node, the local non-repeated distributed message to instruct the neighbor nodes to suspend transmission for the specified duration. After transmitting the PCM along the path to the particular node to establish the transmission priority for the priority traffic along the path through the shared- media network, the priority traffic may be transmitted to the particular node along the path during the transmission priority.
摘要翻译：在一个实施例中，节点可以确定用于在通过共享媒体通信网络的路径上建立传输优先级的触发，以用于到特定节点的优先流量。因此，节点可以生成路径清除消息（PCM），其将指示沿着该路径的一个或多个接收节点在指定的持续时间内暂停除优先级业务之外的业务的传输，并且还发送本地非重复分布式消息到每个相应接收节点的一个或多个邻居节点，该本地非重复分布式消息指示相邻节点在指定持续时间内暂停传输。在将PCM沿着路径发送到特定节点以建立沿着通过共享媒体网络的路径的优先业务的传输优先级时，优先业务可以在传输优先级期间沿着该路径发送到特定节点。

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. 发明申请

WO2012083134A1 DYNAMIC REROUTE SCHEDULING IN A DIRECTED ACYCLIC GRAPH (DAG) 审中-公开
标题翻译：方向图（DAG）中的动态REROUTE调度
公开(公告)号：WO2012083134A1
公开(公告)日：2012-06-21
申请号：PCT/US2011/065414
申请日：2011-12-16
申请人： CISCO TECHNOLOGY, INC. , SHAFFER, Shmuel , VASSEUR, Jean-philippe , SHETTY, Sandeep, Jay
发明人： SHAFFER, Shmuel , VASSEUR, Jean-philippe , SHETTY, Sandeep, Jay
IPC分类号： H04L12/56
CPC分类号： H04L45/023
摘要： In one embodiment, a particular node joins a directed acyclic graph (DAG) in a computer network at a parent node, and determines its grade based on a topology of the DAG, the grade lower than the parent node and higher than any child nodes of the particular node. In response to detecting a trigger for a routing change in the DAG, the particular node delays the routing change based on the grade such that the delay is longer than a first associated delay of any of the child nodes and shorter than a second associated delay of the parent node. Upon expiration of the delay, the particular node may determine if the trigger for the routing change is still valid, and if valid, performs the routing change.
摘要翻译：在一个实施例中，特定节点在父节点处连接计算机网络中的有向非循环图（DAG），并且基于DAG的拓扑来确定其等级，等级低于父节点并且高于父节点的任何子节点特定节点。响应于检测到DAG中的路由改变的触发，特定节点基于等级来延迟路由改变，使得延迟长于任何子节点的第一相关延迟，并且短于第二相关延迟父节点。在延迟到期时，特定节点可以确定路由改变的触发是否仍然有效，并且如果有效，则执行路由改变。

5. 发明申请

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从第二节点转发到第一节点。

6. 发明申请

WO2012177723A1 REDIRECTING TRAFFIC VIA TUNNELS TO DISCOVERED DATA AGGREGATORS 审中-公开
标题翻译：通过隧道重新发现交通发现数据聚合器
公开(公告)号：WO2012177723A1
公开(公告)日：2012-12-27
申请号：PCT/US2012/043286
申请日：2012-06-20
申请人： CISCO TECHNOLOGY, INC. , VASSEUR, Jean-philippe , SHAFFER, Shmuel , SHETTY, Sandeep, Jay
发明人： VASSEUR, Jean-philippe , SHAFFER, Shmuel , SHETTY, Sandeep, Jay
IPC分类号： H04W40/22 , H04W40/26 , H04W40/24
CPC分类号： H04L45/42 , H04L45/22 , H04W40/22 , H04W40/246 , H04W40/26
摘要： In one embodiment, a data aggregator discovery (DAD) message may be distributed by an associated data aggregator, the DAD message identifying the initiating data aggregator, and comprising a recorded route taken from the data aggregator to a receiving particular node as well as a total path cost for the particular node to reach a root node of the DAG through the recorded route and via the data aggregator. The receiving particular node determines a path cost increase (PCI) associated with use of the data aggregator based on the total path cost as compared to a DAG-based path cost for the particular node to reach the root node via the DAG. If the PCI is below a configured threshold, the particular node may redirect traffic to the data aggregator as source-routed traffic according to the recorded route. The traffic may then be aggregated by the data aggregator, accordingly.
摘要翻译：在一个实施例中，数据聚合器发现（DAD）消息可以由相关联的数据聚合器分发，DAD消息标识发起数据聚合器，并且包括从数据聚合器到接收特定节点的记录路由以及总数特定节点通过记录的路由并经由数据聚合器到达DAG的根节点的路径开销。与特定节点通过DAG到达根节点的基于DAG的路径开销相比，接收特定节点基于总路径成本来确定与数据聚合器的使用相关联的路径成本增加（PCI）。如果PCI低于配置的阈值，则特定节点可以根据记录的路由将流量重定向为数据聚合器作为源路由业务。因此，流量可以由数据聚合器进行聚合。

7. 发明申请

WO2012177718A1 DATA ROUTING FOR POWER OUTAGE MANAGEMENT 审中-公开
标题翻译：电源管理的数据路由
公开(公告)号：WO2012177718A1
公开(公告)日：2012-12-27
申请号：PCT/US2012/043280
申请日：2012-06-20
申请人： CISCO TECHNOLOGY, INC. , SHAFFER, Shmuel , SHETTY, Sandeep, Jay , VASSEUR, Jean-Philippe
发明人： SHAFFER, Shmuel , SHETTY, Sandeep, Jay , VASSEUR, Jean-Philippe
IPC分类号： H04L12/56
CPC分类号： H04L45/02 , H04L43/0811 , H04L45/28 , Y04S40/168
摘要： In one embodiment, a particular node in a computer network, that is, one receiving electrical power from a grid source, may determine routing metrics to a plurality of neighbor nodes of the particular node in the computer network. In addition, the node also determines power grid connectivity of the plurality of neighbor nodes. Traffic may be routed from the particular node to one or more select neighbor nodes having preferred routing metrics, until a power outage condition at the particular node is detected, at which time the traffic (e.g., last gasp messages) may be routed from the particular node to one or more select neighbor nodes having diverse power grid connectivity from the particular node. In this manner, traffic may be routed via a device that is not also experiencing the power outage condition.
摘要翻译：在一个实施例中，计算机网络中的特定节点，即从网格源接收电力的一个节点可以确定到计算机网络中的特定节点的多个邻居节点的路由度量。另外，节点还确定多个相邻节点的电网连接。业务可以从特定节点路由到具有优选路由度量的一个或多个选择邻居节点，直到检测到特定节点处的停电状况，在该时间，业务（例如，最后一个喘气消息）可以从特定节点路由节点到具有来自特定节点的不同电力网连接的一个或多个选择的邻居节点。以这种方式，可以经由未经历停电状态的设备路由业务。

8. 发明申请

WO2012122223A1 REMOTE STITCHED DIRECTED ACYCLIC GRAPHS 审中-公开
标题翻译：远程涂层指导的ACYCLIC GRAPHS
公开(公告)号：WO2012122223A1
公开(公告)日：2012-09-13
申请号：PCT/US2012/027989
申请日：2012-03-07
申请人： CISCO TECHNOLOGY, INC. , VASSEUR, Jean-Philippe , SHAFFER, Shmuel , SHETTY, Sandeep, Jay
发明人： VASSEUR, Jean-Philippe , SHAFFER, Shmuel , SHETTY, Sandeep, Jay
IPC分类号： H04L12/24 , H04L12/56 , H04W40/12 , H04W84/18
CPC分类号： H04W40/22 , H04L43/0823 , H04L43/16 , H04L45/24 , H04L45/48 , H04L67/12 , Y04S40/168
摘要： In one embodiment, in response to a trigger condition being detected at a particular location in a primary directed acyclic graph (DAG) in a computer network, a particular node in the primary DAG at the particular location may be determined to act as a remote stitched (RS)- DAG root for an RS-DAG at the particular location. The determined RS-DAG root may then be instructed to initiate the RS-DAG, the instructing indicating one or more properties for the RS-DAG that are based on the trigger condition and that are different from properties of the primary DAG. In another embodiment, a particular node receives instructions to initiate an RS- DAG as its RS-DAG root, initiates the RS-DAG, and relays messages of the RS-DAG with a primary root of the primary DAG.
摘要翻译：在一个实施例中，响应于在计算机网络中的主要有向非循环图（DAG）中的特定位置处检测到触发条件，特定位置处的主DAG中的特定节点可以被确定为用作远程缝合（RS） - DAG根在特定位置的RS-DAG。然后可以指示确定的RS-DAG根以启动RS-DAG，指示基于触发条件指示RS-DAG的一个或多个属性，并且不同于主DAG的属性。在另一个实施例中，特定节点接收指令以发起RS-DAG作为其RS-DAG根，发起RS-DAG，并用主DAG的主根中继RS-DAG的消息。

9. 发明申请

WO2012064794A1 A SYSTEM AND METHOD FOR ROUTING CRITICAL COMMUNICATIONS 审中-公开
标题翻译：一种用于路由通信的系统和方法
公开(公告)号：WO2012064794A1
公开(公告)日：2012-05-18
申请号：PCT/US2011/059853
申请日：2011-11-09
申请人： CISCO TECHNOLOGY, INC. , VASSEUR, Jean-Philippe , SHETTY, Sandeep, Jay , SHAFFER, Shmuel
发明人： VASSEUR, Jean-Philippe , SHETTY, Sandeep, Jay , SHAFFER, Shmuel
IPC分类号： H04W40/02 , H04W4/22 , H04L12/56
CPC分类号： H04W76/007 , H04L29/06 , H04L45/00 , H04L45/24 , H04W4/38 , H04W40/22 , H04W40/28 , H04W76/50 , H04W84/18 , Y02D70/142 , Y02D70/144 , Y02D70/22
摘要： According to one or more implementations of the disclosure, packets may be transmitted in a low power and lossy network (LLN) by receiving, on a first node, a message from a sending node, and by activating a critical message configuration to be applied in routing the message. A message identifier (e.g., signature) for the message may also be received or gleaned. The message identifier can be compared at the first node to a list of stored message identifiers, created based on routing history, to determine if the message has already been received. As such, if the message has not been received at the first node previously, a first parent and a second parent for the message are identified and the message, along with the critical message indication, can be transmitted to the first parent and the second parent, thereby achieving redundancy in the routing of the message.
摘要翻译：根据本公开的一个或多个实现方式，可以在低功率和有损网络（LLN）中发送分组，所述分组可以在第一节点上从发送节点接收消息，并通过激活要应用的关键消息配置路由消息。消息的消息标识符（例如，签名）也可以被接收或收集。可以将消息标识符在第一节点处与基于路由历史创建的存储消息标识符列表进行比较，以确定消息是否已经被接收。因此，如果先前还没有在第一个节点处接收到消息，则识别该消息的第一个父节点和第二个父节点，并且该消息连同关键消息指示可以被发送到第一父节点和第二父节点从而在消息的路由中实现冗余。

10. 发明申请

WO2012177705A1 REDUCING THE IMPACT OF HIDDEN NODES IN MESH NETWORKS 审中-公开
标题翻译：减少隐蔽点在网状网络中的影响
公开(公告)号：WO2012177705A1
公开(公告)日：2012-12-27
申请号：PCT/US2012/043264
申请日：2012-06-20
申请人： CISCO TECHNOLOGY, INC. , SHAFFER, Shmuel , OKWUDIAFOR, Charles , SHETTY, Sandeep, Jay
发明人： SHAFFER, Shmuel , OKWUDIAFOR, Charles , SHETTY, Sandeep, Jay
IPC分类号： H04W40/16 , H04W40/22 , H04L12/56
CPC分类号： H04W40/16 , H04L45/121 , H04L45/124 , H04L45/42 , H04W40/22 , Y02D70/142 , Y02D70/144 , Y02D70/22 , Y02D70/34 , Y02D70/39
摘要： In one embodiment, hidden neighbor relationships are identified based on received neighbor information from a plurality of nodes in a communication network. Based on determining a number of hidden neighbors for a particular node at various node parameters, a cost function associated with the particular node may be determined and utilized. In another embodiment, a number of hidden nodes of the particular node is determined across a range of transmission powers, and a delay associated with the particular node reaching a root node in the network across the range of transmission powers is also determined based on the neighbor nodes reachable at respective transmission powers. A tradeoff is determined across the range of transmission powers between the number of hidden nodes and the delay, and then the transmission power of the particular node can be set based on an acceptable determined tradeoff.
摘要翻译：在一个实施例中，基于来自通信网络中的多个节点的接收的邻居信息来识别隐藏的邻居关系。基于在各种节点参数确定特定节点的隐藏邻居的数量，可以确定和利用与特定节点相关联的成本函数。在另一个实施例中，跨越发射功率的范围确定特定节点的多个隐藏节点，并且还基于邻居确定与特定节点相关联的延迟跨越发射功率的范围到达网络中的根节点的延迟节点在各自的发射功率下可达到。在隐藏节点数和延迟之间的传输功率范围内确定权衡，然后可以基于可接受的确定的折衷来设置特定节点的传输功率。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式