H04L12/735

Routing multiple data streams simultaneously in wireless networks
10892979 · 2021-01-12 · ·

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.

Route detection method in a BGP monitoring protocol session

A method includes: establishing, by a first network device, a first BMP session with a second network device, and establishing a second BMP session with a third network device; receiving a first BGP route set sent by the second network device, where the first BGP route set includes a BGP route sent by the second network device to the third network device; receiving a second BGP route set sent by the third network device, where the second BGP route set includes the BGP route received by the third network device from the second network device; and when detecting that the second BGP route set includes a first BGP route but the first BGP route set does not include the first BGP route, determining the first BGP route as an unavailable route.

Satisfying service demands in data communication networks
10841003 · 2020-11-17 · ·

Techniques for identifying service paths for satisfying a service demand in a data communication network are disclosed. Aspects include identifying a plurality of vertices in a communications route cycle, the communications route cycle alternating through the plurality of vertices and a plurality of edges in a sequence; identifying a plurality of internal paths in the communications route cycle, each of the plurality of internal paths is disjoint to the plurality of edges; identifying a first internal path and a second internal path among the plurality of internal paths as a crossing pair of internal paths; detecting a failure of at least two edges among the plurality of edges; and identifying, based on the communications route cycle and the identified crossing pair of internal paths, a service path that satisfies the service demand in response to detecting the failure of the at least two edges.

Robust data routing in wireless networks with directional transmissions
10833977 · 2020-11-10 · ·

A method and apparatus for routing the same data through independent routes between stations in a mesh network to increase the robustness of communications. The disclosed feature allows transmission of the same data stream via multiple routes from a source station (STA) to a destination station (STA). An extended routing request (RREQ) and routing reply (RREP) 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.

ENHANCED FLEXIBLE-ALGORITHM DEFINITION
20200344151 · 2020-10-29 ·

Techniques are described for advertising constraint-based path computation (e.g., flexible-algorithm) through a constrained network topology. For example, a network device comprises a memory and one or more programmable processors operably coupled to the memory, wherein the one or more programmable processors are configured to generate a packet including a segment identifier (SID) offset, wherein the SID offset is an offset value associated with the flexible-algorithm. The one or more programmable processors of the network device are also configured to send, to at least one other network device of the plurality of network devices, the SID offset to enable the at least one other network device to derive a node segment identifier for the at least one other network device to participate in the flexible-algorithm.

Method and Apparatus for Path Computation
20200304402 · 2020-09-24 ·

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.

ELECTRONIC DEVICE AND CONTROL METHOD THEREOF
20200252426 · 2020-08-06 ·

An electronic device and a control method thereof are provided. The electronic device includes an Internet protocol (IP) address corresponding to a domain name of a web page when a user command inputting the domain name is received, identifies a number of hops included in a network path connecting a server corresponding to the obtained IP address and the electronic device to each other, and determines that a man-in-the-middle attack exists in a network when a communication connection with the server is established on the basis of a smaller number of hops than the identified number of hops.

Constrained disjoint path computation

A method, an apparatus and a non-transitory computer-readable storage medium for determining multiple disjoint constrained paths in a communications network are disclosed. The method includes selecting upper bounds QoS metrics for each path in a disjoint combination of paths having two or more disjoint paths between a source node and a destination node; determining a minimum-cost disjoint path combination, and a minimum-QoS metric disjoint path combination; computing a maximum QoS metric by summing the QoS metrics of each minimum-cost path in the minimum-cost disjoint path combination, and computing a minimum QoS metric by summing the QoS metrics of each minimum-QoS metric path in the minimum-QoS metric disjoint path combination.

Method for implementing service chain, device, and system

A method of implementing a service chain in a service chain-enabled domain network includes: receiving, by an intermediate service node (SN), an extended first Border Gateway Protocol (BGP) packet from a downstream SN that is on a service chain path and immediately adjacent to the intermediate SN, the extended first BGP packet including a service chain path identifier identifying the service chain path and a first service chain path including a service chain path from an ingress SN to the intermediate SN, determining an upstream SN that is on the first service chain path and immediately adjacent to the intermediate SN, and sending an extended second BGP packet to the upstream SN, the extended second BGP packet including the service chain path identifier and a second service chain path including a service chain path from the ingress SN to the upstream SN.

Multimode Heterogeneous IOT Networks
20200145493 · 2020-05-07 ·

A novel IOT network, methods of making, structure and functions, and method of use are disclosed.