公开(公告)号：US20140321363A1

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

申请号：US14324850

申请日：2014-07-07

Applicant: Cisco Technology, Inc.

Inventor： Jonathan W. Hui ,  Alec Woo ,  David E. Culler

IPC: H04W40/14 ,  H04L12/705 ,  H04L12/727

CPC classification number: H04W40/04 ,  H04L45/121 ,  H04L45/122 ,  H04L45/18 ,  H04L45/26 ,  H04L45/34 ,  H04W24/08 ,  H04W40/00 ,  H04W40/125 ,  H04W40/14 ,  H04W40/22 ,  Y02D70/00 ,  Y02D70/142 ,  Y02D70/144 ,  Y02D70/34 ,  Y02D70/39

Abstract: A system and method adds and manages entries on a list of entries of routing information to allow the top entry to be used for routing to a destination corresponding to the list. Costs of a wireless link may be a function of the success rate experienced on that wireless link.

Abstract translation: 系统和方法添加和管理路由信息条目列表中的条目，以允许顶部条目用于路由到与列表相对应的目的地。 无线链路的成本可能是该无线链路上经历的成功率的函数。

公开(公告)号：US20140269413A1

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

申请号：US13837642

申请日：2013-03-15

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Jonathan W. Hui ,  Jean-Philippe Vasseur ,  Wei Hong

IPC: H04L12/705 ,  H04L12/751

CPC classification number: H04L45/18 ,  H04L45/02 ,  H04L45/48

Abstract: In one embodiment, a node in a shared-media communication network may determine a first directed acyclic graph (DAG) topology, wherein the first DAG topology has a particular direction. The node may determine a second DAG topology in the shared-media communication network based on the first DAG topology. The second DAG topology may share the particular direction of the first DAG topology, to prevent loops between the first and the second DAG topologies.

Abstract translation: 在一个实施例中，共享媒体通信网络中的节点可以确定第一有向无环图（DAG）拓扑，其中第一DAG拓扑具有特定的方向。 节点可以基于第一DAG拓扑来确定共享 - 媒体通信网络中的第二DAG拓扑。 第二个DAG拓扑可以共享第一个DAG拓扑的特定方向，以防止第一个和第二个DAG拓扑之间的环路。

公开(公告)号：US20140219114A1

公开(公告)日：2014-08-07

申请号：US13926672

申请日：2013-06-25

Applicant: Cisco Technology, Inc.

Inventor： Jean-Philippe Vasseur ,  Sukrit Dasgupta ,  Jonathan W. Hui ,  Grégory Mermoud

IPC: H04L12/26

CPC classification number: H04L43/10

Abstract: In one embodiment, a targeted node in a computer network receives a probe generation request (PGR), and in response, generates a link-local multicast PGR (PGR-Local) carrying instructions for generating probes based on the PGR. The targeted node then transmits the PGR-Local to neighbors of the targeted node to cause one or more of the neighbors to generate and transmit probes to a collection device in the computer network according to the PGR-Local instructions. In another embodiment, a particular node in a computer network receives a link-local multicast probe generation request (PGR-Local) from a targeted node in the computer network, the targeted node having received the PGR-Local from a remote device, and determines how to generate probes based on instructions carried within the PGR-Local before sending one or more probes to a collection device in the computer network according to the PGR-Local instructions.

Abstract translation: 在一个实施例中，计算机网络中的目标节点接收探测生成请求（PGR），并且作为响应，生成携带用于基于PGR生成探测的指令的链路本地多播PGR（PGR-Local）。 目标节点然后将PGR-Local发送到目标节点的邻居，以使得一个或多个邻居根据PGR-Local指令在计算机网络中生成探测到发送设备。 在另一个实施例中，计算机网络中的特定节点从计算机网络中的目标节点接收链路本地多播探测生成请求（PGR-Local），目标节点已经从远程设备接收到PGR-Local，并且确定 根据PGR-Local指令，在将一个或多个探针发送到计算机网络中的收集设备之前，如何根据PGR-Local中携带的指令生成探测。

公开(公告)号：US20140126426A1

公开(公告)日：2014-05-08

申请号：US13668894

申请日：2012-11-05

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Jean-Philippe Vasseur ,  Sukrit Dasgupta ,  Jonathan W. Hui

IPC: H04L12/44

CPC classification number: H04L45/48 ,  H04L45/02

Abstract: In one embodiment, a capable node in a computer network may host a path computation element, receive one or more neighborhood discovery messages including neighborhood information from a plurality of nodes in the computer network, and compute a minimum spanning tree (MinTree) for the computer network based on the neighborhood information. The MinTree may divide the plurality of nodes in the computer network into a first subset of routing nodes and a second subset of host nodes. The first subset of routing nodes may form one or more interconnected paths of routing nodes within the MinTree, and each host node within the second subset of host nodes may be located within one hop of at least one routing node. The capable node may then communicate a MinTree message to the plurality of nodes in the computer network to build the MinTree by enabling routing on each routing node.

Abstract translation: 在一个实施例中，计算机网络中的能力节点可以承载路径计算元件，从计算机网络中的多个节点接收包括邻域信息的一个或多个邻域发现消息，并计算计算机的最小生成树（MinTree） 基于邻居信息的网络。 MinTree可以将计算机网络中的多个节点划分为路由节点的第一子集和主节点的第二子集。 路由节点的第一子集可以在MinTree内形成路由节点的一个或多个互连路径，并且主节点的第二子集内的每个主机节点可以位于至少一个路由节点的一跳内。 有能力的节点可以然后通过在每个路由节点上启用路由来将MinTree消息传送到计算机网络中的多个节点以构建MinTree。

公开(公告)号：US20140108643A1

公开(公告)日：2014-04-17

申请号：US13653037

申请日：2012-10-16

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Jonathan W. Hui ,  Wei Hong ,  Jean-Philippe Vasseur

IPC: G06F15/173

CPC classification number: H04L45/48 ,  H04L45/123

Abstract: In one embodiment, a nodal device receives information from each of its neighboring nodes in a network. The information identifies a link quality between the nodal device and each of its neighboring nodes. The link quality information is stored in one or more bloom filters in the nodal device such that a table having a compressed format is provided in the bloom filter. The table includes probabilistic identifiers to identify link quality between the nodal device and each of its neighboring nodes.

Abstract translation: 在一个实施例中，节点设备从网络中的每个相邻节点接收信息。 该信息标识节点设备与其每个相邻节点之间的链路质量。 链路质量信息存储在节点设备中的一个或多个布隆过滤器中，使得在布隆过滤器中提供具有压缩格式的表。 该表包括用于识别节点设备与其每个相邻节点之间的链路质量的概率标识符。

公开(公告)号：US20140105015A1

公开(公告)日：2014-04-17

申请号：US13653084

申请日：2012-10-16

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Jonathan W. Hui ,  Wei Hong ,  Jeongyeup Paek ,  Jean-Philippe Vasseur

IPC: H04L12/24

CPC classification number: H04L47/22 ,  H04L45/02 ,  H04L45/48 ,  H04W74/08

Abstract: In one embodiment, data packet messages are received in a Field Area Router (FAR) sent from one or more sources toward one or more destination devices in a Low-Power Lossy Network (LLN). An LLN routing topology for the data packet messages is interpolated in the FAR. An expected time for the data packet messages to reach a destination device in the LLN is determined based upon the routing topology interpolation. Traffic shaping is applied by thse FAR for the data packet messages based upon the determined expected time for the data packet messages to reach destination devices in the LLN.

Abstract translation: 在一个实施例中，数据分组消息在从一个或多个源向Low-Power Lossy Network（LLN）中的一个或多个目标设备发送的场区域路由器（FAR）中被接收。 在FAR中内插数据包消息的LLN路由拓扑。 基于路由拓扑插值确定数据分组消息到达LLN中的目的地设备的期望时间。 基于确定的数据分组消息到达LLN中的目的设备的预期时间，对于数据分组消息，这些FAR应用流量整形。

公开(公告)号：US20140022906A1

公开(公告)日：2014-01-23

申请号：US14032884

申请日：2013-09-20

Applicant: Cisco Technology, Inc.

Inventor： Jean-Philippe Vasseur ,  Jonathan W. Hui

IPC: H04L12/24

CPC classification number: H04L41/12 ,  H04L45/48 ,  H04L47/12

Abstract: In one embodiment, a device, such as a network management server, determines a traffic matrix of a mesh network, where the traffic matrix indicates an amount of traffic per type of traffic transitioning between the mesh network and a global computer network via one or more current root devices. One or more optimized root devices may then be selected for corresponding directed acyclic graphs (DAGs) based on the amount of traffic and type of traffic. As such, a DAG formation request may be transmitted to the selected root devices, carrying a characteristic for a corresponding DAG to form by the respective selected root devices that indicates which one or more types of traffic correspond to the corresponding DAG.

Abstract translation: 在一个实施例中，诸如网络管理服务器的设备确定网状网络的业务矩阵，其中业务矩阵指示每种类型的业务量在网状网络和全球计算机网络之间经由一个或多个 当前根设备。 然后可以基于业务量和业务类型来选择一个或多个优化的根设备用于相应的有向非循环图（DAG）。 因此，DAG形成请求可以被发送到所选择的根设备，其携带由相应的所选根设备形成的相应DAG的特性，其指示哪一种或多种类型的业务对应于相应的DAG。