公开(公告)号：WO2015034638A1

公开(公告)日：2015-03-12

申请号：PCT/US2014/050910

申请日：2014-08-13

Applicant: CISCO TECHNOLOGY, INC.

Inventor： WETTERWALD, Patrick ,  VASSEUR, Jean-Philipppe ,  THUBERT, Pascal

IPC: H04W4/00

CPC classification number: H04L5/0037 ,  H04L12/46 ,  H04L12/56 ,  H04W4/38 ,  Y02D70/144

Abstract: In one embodiment, sensor data is transported in a network to a rendezvous point network node, which consolidates the information into a consolidated result which is communicated to the destination. Such consolidation by a network node reduces the number of paths required in the network between the sensors and the destination. One embodiment includes acquiring, by each of a plurality of originating nodes in a wireless deterministic network, external data related to a same physical event; communicating through the network said external data from each of the plurality of originating nodes to a rendezvous point network node (RP) within the network; processing, by the RP, said external data from each of the plurality of originating nodes to produce a consolidated result; and communicating the consolidated result to a destination node of the network. In one embodiment, the network is a low power lossy network (LLN).

Abstract translation: 在一个实施例中，传感器数据在网络中传送到会合点网络节点，其将信息合并到通信到目的地的综合结果中。 网络节点的这种整合减少了传感器和目的地之间网络中所需的路径数量。 一个实施例包括由无线确定性网络中的多个始发节点中的每一个获取与相同物理事件相关的外部数据; 通过所述网络将来自所述多个始发节点中的每一个的所述外部数据传送到所述网络内的会合点网络节点（RP）; 通过RP处理来自多个始发节点中的每一个的外部数据来产生合并结果; 并将合并结果传送到网络的目的地节点。 在一个实施例中，网络是低功率有损网络（LLN）。

公开(公告)号：WO2015013000A1

公开(公告)日：2015-01-29

申请号：PCT/US2014/044451

申请日：2014-06-26

Applicant: CISCO TECHNOLOGY, INC.

Inventor： WETTERWALD, Patrick ,  VASSEUR, Jean, Philippe ,  THUBERT, Pascal

IPC: H04L12/721 ,  H04L12/717

CPC classification number: H04L5/0055 ,  H04L45/34 ,  H04L45/42

Abstract: In one embodiment, a first node in a wireless deterministic network communicates to a second node configuration information identifying a destination facing path portion of a particular one way path traversing from a source node to a destination node within the wireless deterministic network. The destination facing portion includes a path traversing from the second node over one or more additional nodes to the destination node over which to forward packets received over a first portion of the particular one way path from the source node to the second node. The configuration information includes a particular time slot for the second node to receive packets being sent over the particular one way path. In one embodiment, the first node receives from the second node an acknowledgement message in the particular time slot that the destination facing portion of the particular one way path was configured and activated.

Abstract translation: 在一个实施例中，无线确定性网络中的第一节点与第二节点配置信息通信，所述配置信息标识从无源确定性网络中的源节点到目的地节点的特定单向路径的目的地面向路径部分。 目的地面对部分包括从第二节点穿过一个或多个附加节点到目的地节点的路径，通过该目的节点将从特定单向路径的第一部分接收的分组从源节点转发到第二节点。 配置信息包括用于第二节点接收通过特定单向路径发送的分组的特定时隙。 在一个实施例中，第一节点从第二节点接收特定时隙中的确定消息，特定单向路径的目的地面向部分被配置和激活。

公开(公告)号：WO2014209539A1

公开(公告)日：2014-12-31

申请号：PCT/US2014/040152

申请日：2014-05-30

Applicant: CISCO TECHNOLOGY, INC.

Inventor： THUBERT, Pascal ,  VASSEUR, Jean-philippe ,  WETTERWALD, Patrick

IPC: H04B7/26

CPC classification number: H04J3/22 ,  H04B7/2643 ,  H04L5/0037 ,  H04W52/0216 ,  Y02D70/00 ,  Y02D70/1262 ,  Y02D70/144 ,  Y02D70/22 ,  Y02D70/449

Abstract: Techniques are presented herein for use in a Time Division Multiple Access (TDMA) communication system in which devices send transmissions to each other in time slots during a time frame. A plurality of time slots is allocated for a first device to send traffic to a second device. The first device includes in a transmission during at least one of the plurality of time slots an indicator configured to indicate whether a next time slot in the plurality of time slots is used for traffic from the first device to the second device. Thus, the actual usage of a next time slot in a sequence of a plurality of time slots may be dynamically determined by the transmitting device so that the receiving device(s) need not be in the idle listening mode for the next time slot, thereby saving power.

Abstract translation: 技术在本文中被提供用于时分多址（TDMA）通信系统，其中设备在时间帧期间在时隙中彼此发送传输。 为第一设备分配多个时隙以向第二设备发送业务。 第一设备在多个时隙中的至少一个时隙期间包括在传输中，指示符被配置为指示多个时隙中的下一个时隙是否用于从第一设备到第二设备的业务。 因此，多个时隙的序列中的下一个时隙的实际使用可以由发送设备动态地确定，使得接收设备不需要在下一个时隙处于空闲监听模式，从而 节电。

公开(公告)号：WO2014164059A1

公开(公告)日：2014-10-09

申请号：PCT/US2014/020262

申请日：2014-03-04

Applicant: CISCO TECHNOLOGY, INC.

Inventor： THUBERT, Pascal ,  WETTERWALD, Patrick ,  DIDIER, Paul

IPC: H04L12/833

CPC classification number: H04L47/27 ,  H04L45/24 ,  H04L47/2458 ,  H04L47/28 ,  H04W74/04

Abstract: In one embodiment, an intermediate node in a contention-based shared-media computer network determines a scheduled window within which a packet (with an assigned priority) should be transmitted by the intermediate node. In particular, the intermediate node may specifically determine whether an actual transmission time is prior to, during, or after the window, and sets a priority of the packet as either i) a reduced priority when the actual transmission time is prior to the window, ii) the assigned priority when the actual transmission time is during the window, or iii) an augmented priority when the actual transmission time is after the window. As such, the intermediate node may then transmit the packet from the intermediate node with the set priority at the actual transmission time.

Abstract translation: 在一个实施例中，基于竞争的共享 - 媒体计算机网络中的中间节点确定中间节点应该传送分组（具有分配的优先级）的调度窗口。 特别地，中间节点可以具体确定实际传输时间是否在窗口之前，之中或之后，并且当实际传输时间在窗口之前时，将分组的优先级设置为i）降低的优先级， ii）实际传输时间在窗口期间的分配优先权，或iii）当实际传输时间在窗口之后时的增强优先级。 因此，中间节点然后可以在实际传输时间以设定的优先级从中间节点发送分组。

公开(公告)号：WO2014043549A1

公开(公告)日：2014-03-20

申请号：PCT/US2013/059777

申请日：2013-09-13

Applicant: CISCO TECHNOLOGY, INC.

Inventor： THUBERT, Pascal ,  BELLAGAMBA, Patrice ,  ANTEUNIS, Dirk

IPC: H04L12/711 ,  H04L12/703 ,  H04L12/705 ,  H04L12/723 ,  H04L12/715

CPC classification number: H04L45/18 ,  H04L12/4637 ,  H04L45/22 ,  H04L45/28 ,  H04L45/50 ,  H04L45/507 ,  H04L45/64 ,  H04L2012/421

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, at least one of the first, second, or third network nodes are implemented as a ring-based network having a prescribed ring topology; and establishing loop- free label switched paths for reaching the destination network node via the routing arcs of the loop-free routing topology, the label switched paths independent and distinct from any attribute of the prescribed ring topology.

Abstract translation: 在一个实施例中，一种方法包括在计算网络中创建包括用于到达目的地网络节点的多个路由弧的无环路由拓扑，每个路由弧包括作为路由电弧的第一端的第一网络节点， 第二网络节点作为路由电弧的第二端，以及至少第三网络节点，被配置为经由路由选择电弧的第一或第二端中的任一个路由沿路由选择电弧的任何网络业务，至少 第一，第二或第三网络节点之一被实现为具有规定的环形拓扑的基于环的网络; 并建立无循环的标签交换路径，通过无环路由拓扑的路由弧到达目的网络节点，标签交换路径与规定的环形拓扑的任何属性独立且不同。

公开(公告)号：WO2014022296A1

公开(公告)日：2014-02-06

申请号：PCT/US2013/052540

申请日：2013-07-29

Applicant: CISCO TECHNOLOGY, INC.

Inventor： HUI, Jonathan W. ,  VASSEUR, Jean-philippe ,  THUBERT, Pascal ,  WETTERWALD, Patrick

IPC: H04L12/721 ,  H04L12/747

CPC classification number: H04L45/34 ,  H04L45/742

Abstract: In one embodiment, an intermediate node of a computer network can receive a message intended for a destination. The message can include a header indicating a source route. The intermediate node can determine a routing entry for the destination associated with a next hop based on the source route and cache the routing entry. The intermediate node can further receive a second message intended for the destination that does not indicate the next hop, and transmit the second message according to the cached routing entry.

Abstract translation: 在一个实施例中，计算机网络的中间节点可以接收用于目的地的消息。 消息可以包括指示源路由的报头。 中间节点可以基于源路由确定与下一跳相关联的目的地的路由条目并缓存路由条目。 中间节点可以进一步接收针对不指示下一跳的目的地的第二消息，并且根据缓存的路由条目发送第二消息。

公开(公告)号：WO2013169835A1

公开(公告)日：2013-11-14

申请号：PCT/US2013/040038

申请日：2013-05-08

Applicant: CISCO TECHNOLOGY, INC.

Inventor： THUBERT, Pascal ,  BELLAGAMBA, Patrice

IPC: H04L12/705

CPC classification number: H04L45/18 ,  H04L45/02 ,  H04L45/128 ,  H04L45/22 ,  H04L45/24

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc routing any network traffic along the routing arc toward the destination device via any one of first or second ends of the corresponding routing arc, the creating including forming a buttressing arc having an originating end joined to a first of the routing arcs and a terminating end joined to a second of the routing arcs, the buttressing arc inheriting from the first routing arc a first height to the destination device, the first height of the first routing arc higher than a corresponding second height of the second routing arc; and causing the network traffic to be forwarded, to the destination device, via the buttressing arc and at least one of the first routing arc or the second routing arc.

Abstract translation: 在一个实施例中，一种方法包括在计算网络中创建包括用于到达目的地设备的多个路由弧的无环路由拓扑，每个路由选择弧路由沿着路由选择弧的任何网络业务经由任何一个 所述创建包括形成具有连接到所述路线弧中的第一路线弧的始发端的支撑弧，以及连接到所述路线弧中的第二路径弧的终止端，所述支撑弧从所述第一 所述第一路由的第一高度高于所述第二路由选择弧的对应的第二高度; 并且通过所述支撑弧和所述第一路由弧或所述第二路由弧中的至少一个将所述网络业务转发到所述目的地设备。

公开(公告)号：WO2013109855A1

公开(公告)日：2013-07-25

申请号：PCT/US2013/022102

申请日：2013-01-18

Applicant: CISCO TECHNOLOGY, INC.

Inventor： THUBERT, Pascal ,  LEVY-ABEGNOLI, Eric

IPC: H04L29/06

CPC classification number: H04L61/6059 ,  H04L61/2092 ,  H04L63/1466

Abstract: In one embodiment, a particular device (e.g., switch) receives a neighbor discovery (ND) message from a non-trusted non- switch device, the ND message having an associated address, and creates a corresponding binding entry for the address in a temporary tentative state without forwarding the ND message. In addition, the switch then generates and forwards a first duplicate address detection (DAD) message on behalf of the non-trusted non-switch device. In response to receiving a second DAD message from a non-owner device, the switch may either drop the second DAD message when a corresponding second address of the second DAD message is stored as a tentative-state entry, or else forward the second DAD message to a corresponding owner device of the second address for neighbor advertisement (NA) defense when the second address is not stored as a tentative-state entry.

Abstract translation: 在一个实施例中，特定设备（例如，交换机）从非信任非交换设备接收邻居发现（ND）消息，该ND消息具有相关联的地址，并且在临时地址中为该地址创建相应的绑定条目 暂时状态，不转发ND消息。 此外，交换机然后代表不可信的非交换设备生成并转发第一重复地址检测（DAD）消息。 响应于从非所有者设备接收到第二DAD消息，当第二DAD消息的对应的第二地址被存储为暂定状态条目时，交换机可以丢弃第二DAD消息，或者转发第二DAD消息 当第二地址不被存储为暂定状态条目时，发送到邻居广告（NA）防御的第二地址的对应所有者设备。

公开(公告)号：WO2011115668A1

公开(公告)日：2011-09-22

申请号：PCT/US2011/000470

申请日：2011-03-15

Applicant: CISCO TECHNOLOGY, INC. ,  THUBERT, Pascal ,  WETTERWALD, Patrick ,  VASSEUR, Jean-philippe

Inventor： THUBERT, Pascal ,  WETTERWALD, Patrick ,  VASSEUR, Jean-philippe

IPC: H04L12/28

CPC classification number: H04L41/12 ,  H04L45/02 ,  H04L45/48 ,  Y04S40/164

Abstract: In one embodiment, a node "N" within a computer network utilizing directed acyclic graph (DAG) routing selects a parent node "P" within the DAG, and, where P is not a DAG root, may determine a grandparent node "GP" as a parent node to the parent node P. The node N may then also select an alternate parent node "P'" that has connectivity to GP and N. N may then inform P and P' about prefixes reachable via N, and also about P' as an alternate parent node to P to reach the prefixes reachable via N. Also, in one embodiment, P may be configured to inform GP about the prefixes reachable via N and also about P' as an alternate parent node to P to reach the prefixes reachable via N, and P' may be configured to store the prefixes reachable via N without informing other nodes about those prefixes.

Abstract translation: 在一个实施例中，利用有向非循环图（DAG）路由的计算机网络内的节点“N”选择DAG内的父节点“P”，并且其中P不是DAG根，可以确定祖父节点“GP” 作为父节点到父节点P.节点N然后还可以选择具有与GP和N的连接性的备用父节点“P”.N然后可以通知P和P'关于经由N可达的前缀，并且还关于 P'作为到P的替代父节点以到达可通过N到达的前缀。此外，在一个实施例中，P可以被配置为向GP通知关于可以经由N到达的前缀以及关于P'作为到P的替代父节点 可通过N和P'到达的前缀可被配置为存储可通过N到达的前缀，而不通知其他节点关于这些前缀。

公开(公告)号：WO2008091725A1

公开(公告)日：2008-07-31

申请号：PCT/US2008/050356

申请日：2008-01-07

Applicant: CISCO TECHNOLOGY, INC. ,  THUBERT, Pascal ,  RIBIERE, Vincent, Jean ,  WETTERWALD, Patrick ,  CASTAGNOLI, Neal, Dante

Inventor： THUBERT, Pascal ,  RIBIERE, Vincent, Jean ,  WETTERWALD, Patrick ,  CASTAGNOLI, Neal, Dante

IPC: H04J3/14

CPC classification number: H04W40/30

Abstract: In one embodiment, a method includes, in each of a plurality of mesh access points, connecting to one of a plurality of mesh controllers in a mesh network and passing connection information to the one mesh controller. The mesh access points include a wired mesh access point having a wired connection to the one mesh controller, and wireless mesh access points having a wireless connection to the one mesh controller via the wired mesh access point. The method also includes generating, in each mesh controller, a corresponding link state table based on the passed connection information from each corresponding connected mesh access point. The method also includes generating in at least one of the mesh controllers a mesh table, identifying all of the connecting links for the mesh access points connected among the mesh controllers, based on the mesh controllers sharing the respective link state tables.

Abstract translation: 在一个实施例中，一种方法包括在多个网格接入点中的每一个中，连接到网状网络中的多个网格控制器中的一个，并将连接信息传递给一个网格控制器。 网格接入点包括具有到一个网格控制器的有线连接的有线网状接入点，以及具有经由有线网状接入点到一个网状控制器的无线连接的无线网状接入点。 该方法还包括在每个网格控制器中基于来自每个相应连接的网格接入点的传递的连接信息生成相应的链路状态表。 该方法还包括在网格控制器中的至少一个网格表中，基于共享相应链接状态表的网格控制器，在网格表之间生成网格表，以识别网格控制器之间连接的网格访问点的所有连接链接。