中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.027 seconds)

    PUSH-BASED SHORT-CUT REQUESTS WITHIN A DIRECTED ACYCLIC GRAPH
    1.
    发明申请
    PUSH-BASED SHORT-CUT REQUESTS WITHIN A DIRECTED ACYCLIC GRAPH 审中-公开
    基于按键的短切割请求在方向图中

    公开(公告)号：WO2014070855A1

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

    申请号：PCT/US2013/067446

    申请日：2013-10-30

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： VASSEUR, Jean-philippe ,  HUI, Jonathan W.

    IPC: H04L12/725 ,  H04L12/717

    CPC classification number: H04L45/121 ,  H04L45/14 ,  H04L45/302 ,  H04L45/42 ,  H04L45/48

    Abstract: In one embodiment, a root of a directed acyclic graph (DAG) may determine transmission of critical traffic from a first device to a second device in a computer network using the DAG, and may also determine a maximum tolerable delay of the critical traffic. As such, the root may compute, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay. The root may then inform the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic.

    Abstract translation: 在一个实施例中，有向非循环图（DAG）的根可以使用DAG来确定计算机网络中的第一设备到第二设备的关键业务的传输，并且还可以确定关键业务的最大容许延迟。 因此，根可以基于计算机网络的已知拓扑来计算从第一设备到第二设备的约束最短路径优先（CSPF）点到点（P2P）路径以满足最大可容忍延迟。 然后，根可以将第一设备通知到第二设备的P2P路径，以使第一设备将P2P路径用于关键业务。

    ROUTING USING CACHED SOURCE ROUTES FROM MESSAGE HEADERS
    2.
    发明申请
    ROUTING USING CACHED SOURCE ROUTES FROM MESSAGE HEADERS 审中-公开
    使用来自消息头的缓存源路由进行路由

    公开(公告)号：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: 在一个实施例中，计算机网络的中间节点可以接收用于目的地的消息。 消息可以包括指示源路由的报头。 中间节点可以基于源路由确定与下一跳相关联的目的地的路由条目并缓存路由条目。 中间节点可以进一步接收针对不指示下一跳的目的地的第二消息，并且根据缓存的路由条目发送第二消息。

    MIMO COMMUNICATION CHANNEL IDENTIFICATION IN A POWER LINE COMMUNICATION NETWORK
    5.
    发明公开
    MIMO COMMUNICATION CHANNEL IDENTIFICATION IN A POWER LINE COMMUNICATION NETWORK 审中-公开
    EINEM STROMLEITUNGSKOMMUNIKATIONSSYSTEM中的MIMO-KOMMUNIKATIONSKANALIDENTIFIZIERUNG

    公开(公告)号：EP3138207A1

    公开(公告)日：2017-03-08

    申请号：EP15723362.8

    申请日：2015-04-28

    Applicant: Cisco Technology, Inc.

    Inventor： HUI, Jonathan W. ,  HONG, Wei ,  VASSEUR, Jean-philippe

    IPC: H04B3/32 ,  H04B3/54 ,  H04B3/487

    CPC classification number: H04B3/32 ,  H04B3/487 ,  H04B3/54 ,  H04B17/309 ,  H04B2203/5425 ,  H04B2203/5466

    Abstract: In one embodiment, a device in a network receives a message from a neighboring device that identifies the electrical phase on which the message was sent. Crosstalk is identified between the device and the neighboring device by determining that the message was received on a different electrical phase than the phase on which the message was sent. One or more distinct communication channels between the device and the neighboring device are identified based on the identified crosstalk with each communication channel including or more electrical phases.

    Abstract translation: 在一个实施例中，网络中的设备从相邻设备接收标识消息被发送的电相位的消息。 通过确定在与发送消息的阶段不同的电相位上接收到消息，在设备和相邻设备之间识别串扰。 基于与每个通信信道包括或多个电相位的所识别的串扰来识别设备和相邻设备之间的一个或多个不同的通信信道。

    REDUCED TOPOLOGY ROUTING IN SHARED MEDIA COMMUNICATION NETWORKS
    7.
    发明授权
    REDUCED TOPOLOGY ROUTING IN SHARED MEDIA COMMUNICATION NETWORKS 有权
    具有减少的拓扑中路由具有共享媒体通信网络

    公开(公告)号：EP2737670B1

    公开(公告)日：2016-04-06

    申请号：EP12750503.0

    申请日：2012-07-27

    Applicant: Cisco Technology, Inc.

    Inventor： VASSEUR, Jean-Philippe ,  HUI, Jonathan W.

    IPC: H04W40/22 ,  H04W40/30

    CPC classification number: H04W40/22 ,  H04L45/123 ,  H04L45/48 ,  H04W40/30 ,  Y02D70/142 ,  Y02D70/144 ,  Y02D70/22 ,  Y02D70/39

    Abstract: 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.

    PUSH-BASED SHORT-CUT REQUESTS WITHIN A DIRECTED ACYCLIC GRAPH
    8.
    发明公开
    PUSH-BASED SHORT-CUT REQUESTS WITHIN A DIRECTED ACYCLIC GRAPH 有权
    亚利桑那州的基尼系列ABKÜRZUNGSANFRAGEN，AZYKLISCHEN GRAPH

    公开(公告)号：EP2915296A1

    公开(公告)日：2015-09-09

    申请号：EP13789933.2

    申请日：2013-10-30

    Applicant: Cisco Technology, Inc.

    Inventor： VASSEUR, Jean-philippe ,  HUI, Jonathan W.

    IPC: H04L12/725 ,  H04L12/717

    CPC classification number: H04L45/121 ,  H04L45/14 ,  H04L45/302 ,  H04L45/42 ,  H04L45/48

    Abstract: In one embodiment, a root of a directed acyclic graph (DAG) may determine transmission of critical traffic from a first device to a second device in a computer network using the DAG, and may also determine a maximum tolerable delay of the critical traffic. As such, the root may compute, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay. The root may then inform the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic.

    Abstract translation: 在一个实施例中，有向非循环图（DAG）的根可以使用DAG来确定计算机网络中的第一设备到第二设备的关键业务的传输，并且还可以确定关键业务的最大容许延迟。 因此，根可以基于计算机网络的已知拓扑计算从第一设备到第二设备的约束最短路径优先（CSPF）点到点（P2P）路径以满足最大可容忍延迟。 然后，根可以将第一设备通知到第二设备的P2P路径，以使第一设备将P2P路径用于关键业务。

Patent Agency Ranking