REMOTE PROBING FOR REMOTE QUALITY OF SERVICE MONITORING
    161.
    发明申请
    REMOTE PROBING FOR REMOTE QUALITY OF SERVICE MONITORING 有权
    远程检测远程服务质量监控

    公开(公告)号:US20140219114A1

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

    申请号:US13926672

    申请日:2013-06-25

    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中携带的指令生成探测。

    MIXED CENTRALIZED/DISTRIBUTED ALGORITHM FOR RISK MITIGATION IN SPARSELY CONNECTED NETWORKS
    162.
    发明申请
    MIXED CENTRALIZED/DISTRIBUTED ALGORITHM FOR RISK MITIGATION IN SPARSELY CONNECTED NETWORKS 有权
    用于紧密连接网络风险缓解的混合集中/分布式算法

    公开(公告)号:US20140219103A1

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

    申请号:US13953040

    申请日:2013-07-29

    CPC classification number: H04L47/122 H04L45/125 H04L45/127

    Abstract: In one embodiment, techniques are shown and described relating to a mixed centralized/distributed algorithm for risk mitigation in sparsely connected networks. In particular, in one embodiment, a management node determines one or more weak point nodes in a shared-media communication network, where a weak point node is a node traversed by a relatively high amount of traffic as compared to other nodes in the network. In response to determining that a portion of the traffic can be routed over an alternate acceptable node, the management node instructs the portion of traffic to reroute over the alternate acceptable node.

    Abstract translation: 在一个实施例中,显示和描述与稀疏连接网络中的风险缓解的混合集中/分布式算法有关的技术。 特别地,在一个实施例中,管理节点确定共享 - 媒体通信网络中的一个或多个弱点节点,其中弱点节点是与网络中的其他节点相比较的由相对较高数量的业务量穿过的节点。 响应于确定业务的一部分可以在备用可接受节点上路由,管理节点指示业务部分重新路由替代可接受节点。

    MINTREE-BASED ROUTING IN HIGHLY CONSTRAINED NETWORKS
    163.
    发明申请
    MINTREE-BASED ROUTING IN HIGHLY CONSTRAINED NETWORKS 有权
    基于MINDEE的路由在高度受约束的网络中

    公开(公告)号:US20140126426A1

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

    申请号:US13668894

    申请日:2012-11-05

    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。

    REDUCED AUTHENTICATION TIMES IN CONSTRAINED COMPUTER NETWORKS
    164.
    发明申请
    REDUCED AUTHENTICATION TIMES IN CONSTRAINED COMPUTER NETWORKS 有权
    约束计算机网络中的减少认证时间

    公开(公告)号:US20140095864A1

    公开(公告)日:2014-04-03

    申请号:US13631106

    申请日:2012-09-28

    Abstract: In one embodiment, a capable node in a low power and lossy network (LLN) may monitor the authentication time for one or more nodes in the LLN. The capable node may dynamically correlate the authentication time with the location of the one or more nodes in the LLN in order to identify one or more authentication-delayed nodes. The node may then select, based on the location of the one or more authentication-delayed nodes, one or more key-delegation nodes to receive one or more network keys so that the key-delegation nodes may perform localized authentication of one or more of the authentication-delayed nodes. The capable node may then distribute the one or more network keys to the one or more key-delegation nodes.

    Abstract translation: 在一个实施例中,低功率和有损网络(LLN)中的能力节点可以监视LLN中的一个或多个节点的认证时间。 能力节点可以将认证时间与LLN中的一个或多个节点的位置动态相关,以便识别一个或多个认证延迟节点。 然后,节点可以基于一个或多个认证延迟的节点的位置来选择一个或多个密钥委派节点来接收一个或多个网络密钥,使得密钥委派节点可以执行一个或多个 认证延迟节点。 有能力的节点可以然后将一个或多个网络密钥分配给一个或多个密钥委派节点。

Patent Agency Ranking