中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.02 seconds)

    Path selection and programming of multiple label switched paths on selected paths of multiple computed paths
    1.
    发明授权
    Path selection and programming of multiple label switched paths on selected paths of multiple computed paths 有权

    公开(公告)号：US10298488B1

    公开(公告)日：2019-05-21

    申请号：US15282974

    申请日：2016-09-30

    Applicant: Juniper Networks, Inc.

    Inventor： David C. Wood ,  Jonathan C. Barth

    IPC: H04L12/703 ,  H04L12/751 ,  H04L12/723 ,  H04L12/773

    Abstract: In some examples, a network device is configured to obtain a set of N paths between a pair of nodes of a network topology model for a network of routers interconnected by a plurality of links in a network topology, where N>2, and configured to, for each label switched path from a plurality of label switched paths to be routed to the network topology: in response to identifying, from the set of N paths, a path for the label switched path that has capacity for a required bandwidth of the label switched path, deduct the required bandwidth of the label switched path from one or more links of the path of the network topology model to modify the network topology model and output data to the network for programming the label switched path in the network on the path; and in response to failing to identify a path for the label switched path from the set of N paths, add the label switched path to a set of failed label switched paths.

    Batched path computation in resource-constrained networks
    3.
    发明授权
    Batched path computation in resource-constrained networks 有权

    公开(公告)号：US10547537B1

    公开(公告)日：2020-01-28

    申请号：US15785220

    申请日：2017-10-16

    Applicant: Juniper Networks, Inc.

    Inventor： David C. Wood

    IPC: H04L12/729 ,  H04L12/723

    Abstract: In some examples, a controller for a network includes a path computation module that determines, for a plurality of LSPs or other flows having a common source, shortest paths of the network from the common source to respective destinations of the plurality of LSPs based at least on a minimum bandwidth. The path computation module further determines, after determining the shortest paths, a shortest path for the LSP of the plurality of LSPs as the shortest path of the shortest paths of the network from the common source to a destination for the LSP. A path provisioning module of the controller, after the path computation module determines the shortest path for the LSP and in response to the path computation modules routing the LSP to the shortest path for the LSP on a network model of the network, installs the LSP to the network as routed to the shortest path.

    Multiple paths computation for label switched paths
    4.
    发明授权
    Multiple paths computation for label switched paths 有权

    公开(公告)号：US10148564B2

    公开(公告)日：2018-12-04

    申请号：US15282942

    申请日：2016-09-30

    Applicant: Juniper Networks, Inc.

    Inventor： David C. Wood ,  Jonathan C. Barth

    IPC: H04L12/723 ,  H04L12/751 ,  H04L12/773 ,  H04L12/721 ,  H04L12/717 ,  H04L12/707 ,  H04L12/911

    Abstract: In general, techniques are described for identifying a result set of multiple paths through a network for one or more label switched paths between a source node and a destination node. In some examples, the identified paths are computed to be broadly separate to avoid overlapping network elements. A device that routes the label switched paths to the network may select from the result set of multiple paths to route each of the label switched paths. In response to detecting a failure of a network element along the routed path for a label switched path, the device may select a new path from the result set that includes already-identified paths.

    Heuristic multiple paths computation for label switched paths
    5.
    发明授权
    Heuristic multiple paths computation for label switched paths 有权

    公开(公告)号：US10148551B1

    公开(公告)日：2018-12-04

    申请号：US15282996

    申请日：2016-09-30

    Applicant: Juniper Networks, Inc.

    Inventor： David C. Wood ,  Jonathan C. Barth

    IPC: H04L12/721 ,  H04L12/24 ,  H04L12/723 ,  H04L12/803 ,  H04L12/851

    Abstract: In some examples, a path computation device is configured to compute, for a network of routers interconnected by a plurality of links in a network topology and based on a network topology model for the network topology, a first path that is a shortest path of the network topology model between a pair of nodes of the network topology model that represent a pair of the routers; increase, based on the first path, respective metrics for one or more links in the network topology model by respective finite values to obtain a modified network topology model; compute a second path that is a shortest path of the modified network topology model between the pair of nodes; and output data for at least one path of the first path and the second path to the network for programming a label switched path in the network on the at least one path.

    POINT-TO-MULTIPOINT PATH COMPUTATION FOR WIDE AREA NETWORK OPTIMIZATION
    6.
    发明申请
    POINT-TO-MULTIPOINT PATH COMPUTATION FOR WIDE AREA NETWORK OPTIMIZATION 审中-公开

    公开(公告)号：US20170317780A1

    公开(公告)日：2017-11-02

    申请号：US15650712

    申请日：2017-07-14

    Applicant: Juniper Networks, Inc.

    Inventor： David C. Wood ,  Ping Wang

    IPC: H04J14/02 ,  H04L12/24 ,  H04B10/27

    CPC classification number: H04J14/0286 ,  H04B10/27 ,  H04J14/0267 ,  H04J2203/0055 ,  H04J2203/0098 ,  H04L41/0896 ,  H04L41/12 ,  H04L41/14

    Abstract: In some examples, a controller for a network includes a path computation module configured for execution by one or more processors to obtain configuration information for at least one point-to-multipoint label switched path (P2MP LSP); obtain, from the network via at least one protocol, network topology information defining a network topology for the network; determine, based on the network topology, a first solution comprising first respective paths through the network for the at least one P2MP LSP; determine, after generating a modified network topology based on the network topology, a second solution comprising second respective paths through the network for the at least one P2MP LSP. The controller also includes a path provisioning module configured for execution by the one or more processors to configure the network with the solution of the first solution and the second solution having the lowest total cost.

    NETWORK TOPOLOGY OPTIMIZATION WITH FEASIBLE OPTICAL PATHS
    8.
    发明申请
    NETWORK TOPOLOGY OPTIMIZATION WITH FEASIBLE OPTICAL PATHS 有权
    网络拓扑优化与可行光学PATHS

    公开(公告)号：US20160191194A1

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

    申请号：US14788602

    申请日：2015-06-30

    Applicant: Juniper Networks, Inc.

    Inventor： David C. Wood ,  Massimiliano Salsi ,  Steven B. Alleston

    IPC: H04J14/02 ,  H04B10/27

    CPC classification number: H04J14/0286 ,  H04B10/27 ,  H04J14/0267 ,  H04J2203/0055 ,  H04J2203/0098 ,  H04L41/0896 ,  H04L41/12 ,  H04L41/14

    Abstract: In general, techniques are described for dynamically determining a logical network topology for more efficiently transporting network traffic over a physical topology based on end-to-end network traffic demands and optical transport network (OTN) characteristics of the network. The techniques may be applicable to meeting network traffic demands placed upon a multi-layer network having a base transport layer and a logical or overlay Internet Protocol (IP) layer routed on the transport layer.

    Abstract translation: 一般来说，描述了基于网络的端到端网络业务需求和光传送网络（OTN）特性来动态地确定逻辑网络拓扑以更有效地传输物理拓扑上的网络业务的技术。 这些技术可以适用于满足具有在传输层上路由的基本传输层和逻辑或覆盖因特网协议（IP）层的多层网络的网络流量需求。

Patent Agency Ranking