Patent classifications
H04L45/12
Systems and methods for extending application-aware routing to improve site encryption throughput performance
In one embodiment, a method includes establishing, by an identity agent installed on a device, a connection to a browser installed on the device and generating, by the identity agent, first device information, a public key, and a private key. The method also includes communicating, by the identity agent, the first device information and the public key to an authentication service and receiving, by the identity agent, a unique identifier from the authentication service. The method further includes generating, by the identity agent, a first signature of the first device information and communicating, by the identity agent, the first signature, the first device information, and the unique identifier to the browser.
Route selection in a wireless communication system
A method (100) of route selection in a wireless communication system and a control system (40) is provided. The method includes selecting a route between a first node (1) and a second node (2) and comprises: —evaluating (110) a plurality of possible routes (R1, R2, R3, R4), at least one route (R2, R3, R4) including a third node (3, 4) between the first and the second node; and —selecting (160) the route that has the lowest latency among the possible routes. Especially the method (100) includes: —selecting (120) parameter settings for each link of the possible routes, said selecting (120) comprising; —selecting (130) the length of the cyclic prefix, —evaluating (140) combinations of the selected cyclic prefix and different settings of the at least one further parameter of the physical layer; —selecting (150) the parameter settings that has lowest estimated latency and fulfils at least one communication quality criterion.
Load-balancing establishment of connections among groups of connector servers
Techniques are described herein that are capable of load-balancing establishment of connections among groups of connector servers in a public computer network by performing operations that include receiving a connection request from a connector client in a private computer network, requesting establishment of a connection between the connector client and one of the connector servers in the public computer network. A number of connections between the private computer network and each group is determined. An identified group is selected from the groups based at least in part on a number of connections between the private computer network and the identified group being less than or equal to a number of connections between the private computer network and each other group. The connection request is provided toward the identified group, which enables establishment of the connection between the connector client and a connector server in the identified group.
Geographic routing mesh network
The disclosure relates to method and system for geographic routing mesh network. The method may include determining, by a first node, a first list of nodes proximal to the first node in a mesh network. The method further includes sending, by the first node to each node on the first list of nodes, the first list of nodes proximal to the first node. The method(s) further includes receiving, by the first node in response to sending the first list of nodes, one or more second list of nodes from one or more nodes of the first list of nodes, each of the one or more second list of nodes being proximal to one of the one or more nodes of the first list of nodes and updating, by the first node in response to receiving one or more second list of nodes proximal to the one more nodes of the first list of nodes, one or more nodes of the first list of nodes.
MULTI-TIERED CLOS NETWORK FABRIC REVERSE PATH FORWARDING DEVICE SELECTION
A method for reverse path forwarding (RPF) selection by a network device connected to a network includes receiving an advertisement message from each of a plurality of neighbor devices within the network, parsing the advertisement message to determine a color identification (ID) of each of the neighbor devices, and selecting, from among the neighbor devices, a RPF device based on the color ID of each of the neighbor devices.
Scalable and programmable mechanism for targeted in-situ OAM implementation in segment routing networks
The present technology provides a system and method for implementing targeted collection of in-situ Operation, Administration and Maintenance data from select nodes in a Segment Routing Domain. The selection is programmable and is implemented by setting an iOAM bit in the function arguments field of a Segment Identifier. In this way only the nodes associated with local Segment Identifiers (Function field of a Segment Identifier) with an iOAM argument bit are directed to generate iOAM data. The iOAM data generated by target nodes may be stored in TLV field of the segment routing header. The Segment Routing packet is then decapsulated at a Segment Routing egress node and the Header information with the collected iOAM data is sent to a controller entity for further processing, analysis and/or monitoring.
CONTROL APPARATUS, CONTROL METHOD AND PROGRAM
A control device includes an information acquisition unit that receives a source address of a packet from a node that receives the packet transmitted from a user terminal, and acquires position information about the user terminal on a basis of the source address, a determination unit that determines a hub to which the user terminal should connect, on a basis of the position information, and a control execution unit that launches an application in the hub and changes a routing such that packets transmitted from the user terminal are transmitted to the application.
INTELLIGENT ROUTE SELECTION FOR LOW LATENCY SERVICES
A solution for route selection includes receiving, by a network repository, from a first network function (NF), a query related to a target NF; querying, by the network repository, a route selection node for a shortest path to the target NF; receiving, by the network repository, from the route selection node, an indication of the shortest path to the target NF; and based on at least receiving the indication of the shortest path to the target NF, transmitting, by the network repository, to the first NF, a route to the target NF. In some examples, the shortest path has at least one of: a minimum number of hops, a minimum latency, a minimum jitter, and a minimum weighted transport score. In some examples, the route selection node is co-located with the network repository, which may be a network repository function (NRF).
Creating a packet with a loopback label stack to detect network link/node failures
Systems and methods for creating loopback packets for transmission through a section of a network for the purpose of testing the operability of links and nodes in this section of the network are provided. A method, according to one implementation, includes a step of obtaining information, by a Network Element (NE), about the topology of the network related to at least the nodes in direct communication with a peer node. The method also includes a step of generating one or more loopback packets, where each loopback packet includes at least a header having a path list including one or more nodes of the plurality of nodes in the network. Each path list defines an order of nodes through which the respective loopback packet is to be transmitted.
EFFICIENT RUNTIME EVALUATION REPRESENTATION, EXTERNAL CONSTRUCT LATE-BINDING, AND UPDATING MECHANISMS FOR ROUTING POLICIES
Novel mechanisms for compiling routing policies and evaluating network routes, including: (a) an efficient mechanism for representing routing policies to facilitate the runtime evaluation of network routes; (b) a mechanism for late-binding vectors pertaining to external constructs used or recited within the routing policies; and (c) a mechanism for updating routing policy state pertinent to network route evaluation. Existing methods for evaluating network routes on a network device, such as the use of route maps, tend to introduce complexity and extend route evaluation runtime when performing, for example, certain operations to one or more route attributes for any given network route being evaluated. Through implementation of disclosed mechanisms, however, route evaluation runtimes may be reduced, thereby minimizing, if not eliminating, any route evaluation congestion.