Method and apparatus for path computation

    公开(公告)号:US11038792B2

    公开(公告)日:2021-06-15

    申请号:US16621135

    申请日:2017-11-02

    IPC分类号: H04L12/735 H04L12/723

    摘要: A method and apparatus for path computation includes generating, by a Path Computation Client (PCC), a path computation element communication protocol (PCEP) message, whereby the PCEP message comprises a characteristic associated with a level of protection of a Protection Label Switch path (LSP) with a Working LSP; and transmitting, by the PCC, the PCEP message to a Path Computation Element (PCE), for path computation.

    Packet forwarding method and device

    公开(公告)号:US10992574B2

    公开(公告)日:2021-04-27

    申请号:US16320895

    申请日:2017-06-20

    申请人: ZTE CORPORATION

    摘要: The present invention provides a packet forwarding method and device. The method comprises: a first node receiving a packet for forwarding, wherein a destination address of the packet is a second node; the first node identifying, from topologies generated in advance, a target topology corresponding to the packet, wherein the topologies generated in advance comprise a first topology and a second topology generated according to an MRT algorithm, and a third topology obtained according to an SPF algorithm, wherein the first topology, the second topology and the third topology are different from one another; and the first node identifying, from the target topology, a next hop node for forwarding to the second node, and forwarding the packet to the next hop node. The present invention achieves an object of combining a segmented routing network and an MRT function.

    METHOD FOR ESTABLISHING A SECURE PRIVATE INTERCONNECTION OVER A MULTIPATH NETWORK

    公开(公告)号:US20190306131A1

    公开(公告)日:2019-10-03

    申请号:US16381055

    申请日:2019-04-11

    摘要: A method for establishing a fully private, information theoretically secure interconnection between a source and a destination over a data network with at least a portion of a public infrastructure. The method comprising at the source creating n shares of a source data according to a predetermined secret sharing scheme, and encrypting the n shares using (n,k) secret sharing. Further, defining for at least one node vi a directed edge (vi1, vi2) that has a k−1 capacity. All outgoing links of vi are connected to vi2. Additionally, using a maximum flow algorithm to define the maximum number of shares outgoing from vi2, and therefore from vi, on each outgoing link. The number of shares forwarded by node vi does not exceed the number of maximum shares that were defined by the maximum flow algorithm.

    Methods, nodes and system for establishing independent network paths

    公开(公告)号:US10355976B2

    公开(公告)日:2019-07-16

    申请号:US15768804

    申请日:2015-10-26

    申请人: ABB Schweiz AG

    发明人: Per Sahlqvist

    摘要: A method in a source node establishing independent network paths including a first and second router nodes connected to the source node over a first and second mutually independent networks. The source node includes a first interface towards the first network, associated with a path identifier for a first network path; a second interface towards a second network associated with a path identifier for a second network path, and is configured to select which of the first and second router nodes should be used for sending data from the source node to the destination node via the first and second network paths, wherein the source node is configured to select different router nodes for the first and second network paths.

    RSVP make-before-break label reuse
    47.
    发明授权

    公开(公告)号:US10313234B2

    公开(公告)日:2019-06-04

    申请号:US15834722

    申请日:2017-12-07

    IPC分类号: H04L12/723 H04L12/735

    摘要: Techniques are described for reusing downstream-assigned labels when establishing a new instance of a label switched path (LSP) prior to tearing down an existing instance of the LSP using make-before-break (MBB) procedures for RSVP. The techniques enable a routing engine of any non-ingress router along a path of the new LSP instance to reuse a previously allocated label for the existing LSP instance as the downstream assigned label for the new LSP instance when the paths of the existing LSP instance and the new LSP instance overlap. In this way, the non-ingress router does not need to update a label route in its forwarding plane for the reused label. When the new LSP instance completely overlaps the existing LSP instance, an ingress router of the LSP may avoid updating an ingress route in its forwarding plane for applications that use the LSP.

    Routing multiple data streams simultaneously in wireless networks

    公开(公告)号:US10171343B2

    公开(公告)日:2019-01-01

    申请号:US15387338

    申请日:2016-12-21

    申请人: SONY CORPORATION

    摘要: A method and apparatus for routing multiple data streams simultaneously through independent routes between multiple-input-multiple-output (MIMO) stations in a mesh network. The disclosed feature allows transmission of multiple data streams via multiple routes from a source station (STA) to a destination station (STA), which are both MIMO capable, even though the relay STAs in between can be a single-input-single-output (SISO) STA. An extended routing request (RREQ) and routing reply (RREP) frames are utilized which provide a primary and secondary flag indication, which is utilized in combination with advanced programming for setting path cost metrics to assure independence of primary and secondary routes.

    Shared path recovery scheme
    50.
    发明授权

    公开(公告)号:US10116494B2

    公开(公告)日:2018-10-30

    申请号:US15144181

    申请日:2016-05-02

    摘要: A connection-oriented network has a first working path (W1) and a second working path (W2). A node (E) receives signalling to allocate resources for a part of a recovery path (R1) for the first working path (W1). The resources are shared by the recovery path (R1) for the first working path and a recovery path (R2a) for the second working path (W2). The node (E) stores an association between the shared resources and a node (A) on the first working path, identified in the signalling, which should be notified when the shared resources are used by the recovery path (R2a) for the second working path (W2). An RSVP-TE object in the signalling carries an address of the node to be notified. The node (E) sends an RSVP-TE Notify message to a node (A) on the first working path (W1) which indicates that the shared resources are in use.