909 results about "Route" patented technology

The invention provides a private domain traffic peak identification and route scheduling method and system based on time sequence prediction, and relates to the technical field of private domain traffic management, and the method comprises the steps: predicting traffic data and confidence through a multi-dimensional heterogeneous graph network and a causal reasoning mechanism, and generating a dynamic threshold based on empirical mode decomposition and a generalized extreme value distribution model, and predicting a peak value by combining a fuzzy inference device. And then, constructing a distributed collaborative early warning mechanism, and generating graded early warning signals and early warning grades according to the multi-dimensional early warning indexes and node consensus. And finally, constructing a multi-target routing optimization model, performing routing resource grouping based on the link reliability score, searching candidate paths by using multi-agent reinforcement learning, determining a distribution proportion according to early warning information and a peak prediction result, optimizing a path selection strategy in a peak time period, and scheduling private domain traffic to a selected path. According to the method, the private domain flow peak value can be effectively identified, the service quality is guaranteed through dynamic routing scheduling, and the user experience is improved.

A method, a device, and a non-transitory storage medium are described in which a network slice selection service is provided. The service may include using route selection policies that includes radio frequency criteria for selection of a network slice. The service may include establishing an application session based on the route selection policies. The service may further include determining that a radio frequency of the network slice cannot be sustained. The service may include executing an application session release procedure and an application session establishment procedure. The procedures may include using cause data and context data pertaining to the initial application session to re-establish the application session via a different network slice and a different radio frequency based on the route selection policies.

There is provided a user equipment apparatus registered with a first wireless communication network, the first wireless communication network identified by a first network identity. The user equipment apparatus comprises a receiver and a processor. The receiver is arranged to receive a route selection policy rule, the route selection policy rule including: an application descriptor, and a route selection descriptor, the route selection descriptor comprising a network identity. The processor is arranged to detect application traffic that matches the application descriptor and determine the network identity of the route selection descriptor matches an identity of the first wireless communication network. The processor is further arranged to apply the route selection descriptor to the detected application traffic upon determining the network identity of the route selection descriptor matches the identity of the first wireless communication network.

The invention provides a dynamic routing optimization method and system based on an ad hoc network. The method comprises the following steps: constructing a state space of the ad hoc network in routing switching through performance characteristics of each routing node in the ad hoc network and interaction density characteristics in neighbor node information; the method comprises the following steps: acquiring response time delay information of a route switching request in a route switching process in an ad hoc network, determining path stability of each route node in the ad hoc network in the route switching process through the response time delay information, and further determining a route working condition index of the ad hoc network in a current network according to all the path stability; when the routing working condition index is lower than a preset working condition threshold value, real-time updating of a routing table in the ad hoc network is triggered, and then incremental updating is carried out on the routing table in the ad hoc network based on the reward function in the state space. Based on the above scheme, topology dynamic sensing and intelligent routing optimization in the ad hoc network can be realized, so that the routing switching stability in the ad hoc network can be improved.

There is provided a network node in a first wireless communication network. The network node comprises a receiver, a processor and a transmitter. The receiver is arranged to receive, from an application function in a second wireless communication network, application guidance on route selection policy rule determination. The processor is arranged to construct a route selection policy rule using the application guidance, the route selection policy rule including: an application descriptor, and a route selection descriptor comprising a network identity, wherein the network identity identifies the second wireless communication network, and the route selection policy rule defines a route for application traffic when a user equipment apparatus is registered in the second wireless communication network. The transmitter is arranged to transmit the route selection policy rule to the user equipment apparatus.

The invention provides a distributed data transmission optimization method, device and equipment, and belongs to the technical field of wireless communication, and the method comprises the steps: carrying out the strategy optimization of each node of a Mesh network based on a near-end strategy optimization algorithm, and obtaining an optimization strategy result, the optimization strategy result comprises a route selection optimization strategy and a node dormancy and wake-up optimization strategy of the Mesh network; performing fragmentation and routing planning on the to-be-transmitted data according to an optimization strategy result to obtain fragmentation information and a routing path; performing data transmission on the to-be-transmitted data according to the fragment information and the routing path; and in the data transmission process, optimizing the routing path based on a preset routing optimization strategy until the data transmission is finished. According to the method, intelligent decisions of routing selection, node dormancy and wakeup can be realized, the fragment size and the transmission path are dynamically adjusted, uniform distribution and efficient scheduling of data fragments in the network are ensured, single-point overload is avoided, and the data storage and transmission efficiency of the whole network is improved.

Systems and methods are provided for rapid user equipment route selection policy rule processing. A method includes determining an applicable routing policy based on user equipment route selection policy (URSP) rules for an established protocol data unit (PDU) session and storing PDU session information with the established uplink PDU session in a cache. The method further includes examining subsequent uplink packets for PDU session information and checking the cache for an established PDU session with matching uplink PDU session information. The method additionally includes routing the subsequent uplink packets to the established PDU session having the matching PDU session information, causing the subsequent uplink packet to be processed in accordance with the applicable routing policy as previously determined based on the URSP rules.

The present disclosure relates to a 5G or 6G communication system for supporting higher data transmission rates, and pertains to an operation method of a user equipment (UE). The operation method comprises the steps of transmitting a registration request message including a traffic category support indication to an access and mobility management function (AMF) via an access node, receiving, from the AMF via the access node, a UE configuration update message including UE route selection policy (URSP) rules determined on the basis of the traffic category support indication and first traffic category mapping information, and determining a protocol data unit (PDU) session for application traffic on the basis of the URSP rules and pre-stored second traffic category mapping information.

The invention provides a hierarchical deep reinforcement learning routing protocol method based on a multi-link ad hoc network, relates to the technical field of communication routing, and solves the problem that the calculation efficiency in the current multi-link ad hoc network is degraded. The method comprises the following steps: firstly, constructing and dynamically updating a global network view for all nodes in a network, and further constructing a route selection model which is divided into a high-level controller and a low-level controller; a high-level controller plans a route from a global perspective and balances a global load, and a low-level controller selects a target node according to a planning result of the high-level controller and distributes an optimal communication link for the target node in combination with link state information; training and optimization of the network of each controller are carried out independently, external rewards are introduced to a high-level controller, and internal rewards are introduced to a low-level controller; the external reward is used for optimizing the overall performance of the high-level controller; the internal reward is used as an index value of the low-level controller for feeding back the link state in real time, and collaborative optimization of the high-level controller and the low-level controller is achieved.

A request is received from a first function, identifying a list of allowed traffic to a user plane connection, the request indicating to identify a device that routes traffic via the user plane connection that is not included in the list of allowed traffic. A request to a second function to be notified when the device establishes a user plane connection to network resources defined in a route selection policy rule. A third function is determined with which the device has established a user plane connection. A request is sent to the third function to report, for the device, traffic sent via the user plane connection that is not included in the list of allowed traffic. A report is received from the third function indicating, for the device, the traffic sent via the user plane connection that is not included in the list of allowed traffic.

Techniques for symmetric routing in a software-defined wide area network (SDWAN) are disclosed herein. In some aspects, the techniques described herein relate to a method including: determining a first device group, wherein the first device group includes a first router associated with a branch tag and a second router associated with a hub tag; determining a second device group, wherein the second device group includes a third router associated with and a fourth router associated with the hub tag; transmitting a first route advertisement associated with a first route from the first router to the second router to the first router; transmitting a second route advertisement associated with a second route from the first router to the third router to the first router; and preventing transmission of a third route advertisement associated with a third route from the first router to the fourth router to the first router.

The invention discloses a time-varying routing method and system for a satellite internet, and mainly solves the problems that an existing satellite network routing method is difficult to support satellite high-quality communication, the topology is frequently changed, and the information communication load between satellites is heavy. According to the scheme, the method comprises the following steps: initializing orbit parameters of satellite nodes and an inter-satellite link set; obtaining a link on-off timetable through simulation, and sending the link on-off timetable to a satellite node by a ground station; the satellite node generates a topology prediction message according to the link on-off time table, determines the sending time of the message according to the difference value between the link change moment and the sending time of the routing control message, and floods the message in the limited area; and after receiving the message, the satellite node analyzes the link information to calculate a virtual route, arranges a route updating sequence of the satellite node, replaces the route table with the virtual route table at the link change moment, and issues the route to the basic network layer. According to the method, the transmission load of the network can be effectively reduced, the probability of outdated routing and packet loss is reduced, the method can be used for establishing the satellite internet, and the communication quality between satellites is guaranteed.

Various embodiments discussed herein relate to route optimization and query understanding for route and / or direction queries with complex user preferences. Each route candidate, for example, is treated as a richly annotated document. The routing engine, in addition to performing route optimization, acts as a retriever and ranker of route documents according to user intent. Various embodiments rank routes not just based on a simple cost model, but based on many more or alternative factors according to user preferences, user intent, and / or contextual data.

Systems and methods herein are for global bandwidth-aware adaptive routing in a network communication and include at least one switch to determine an event associated with a change in network bandwidth between a local host and a remote host, where the at least one switch is further to provide routing protocols for the network communication, and where the routing protocols is to be used to modify an adaptive routing in the at least one switch for selection from different routes for the network communication between the local host and the remote host.

This application discloses example route selection methods, network devices, and systems. One example method includes obtaining, by a first network device, a plurality of routes arriving at a same prefixOne or more routes for guiding packet forwarding are selected by the first network device based on trustworthiness of each route of the plurality of routes, where the trustworthiness of each route identifies a trustworthiness degree of the corresponding route.

A network device (ND) receives a first media access control (MAC) / Internet Protocol (IP) route for a customer ND. The ND installs the first MAC / IP route in a MAC / IP routing table and transmits the first MAC / IP route to a first subset of NDs causing the NDs to install the first route. The ND receives a second MAC / IP route for the customer ND and a sequence number indicative of an order of advertisement of the second MAC / IP route. The ND determines, based on the sequence number, that the second MAC / IP route is a best route for the customer ND. The ND installs the second MAC / IP route as the best route for the customer ND; and transmits the second MAC / IP route to a second subset of NDs including a first ND from which the first MAC / IP route originated, causing the first ND to request withdrawal of the first MAC / IP route.

A system and associated methods provide solutions for end-to-end privacy and per-hop routing and policy decision in multi-hop and Software-Defined Wide Area Networks (SD-WANs) by leveraging unique SDWAN edge identities of edge devices. The system enables end-to-end encryption between traffic source and destination sites using IPsec ESP tunnel mode, with System IPs as the outer IP addresses. The system further enables per-hop integrity protection using IPsec AH transport mode, with WAN IPs as the outer IP addresses. By having some information encrypted between a source device and a destination device and other information encapsulated between hops (e.g., between source device and an intermediate device), the system enables route and policy lookup based on destination site System-IP, along with integrity protection based on SLA-class in packet metadata for independent path selection at intermediate hops.

The invention discloses an underwater routing protocol design method based on link sensing, and belongs to the technical field of underwater wireless sensor communication networking. The invention aims to solve the problem that the link quality of the existing underwater routing protocol cannot ensure reliable transmission of data. Comprising the following steps: dividing underwater wireless sensors into clusters based on set roles in a node control data packet; each cluster comprises a master node and a corresponding slave node; each master node receives a sensing data packet of the corresponding slave node; each master node maintains attribute information of the adjacent master nodes based on the master node attribute data packets of the adjacent master nodes, and establishes a reward function for transmitting the to-be-transmitted data packets of the master nodes between the two master nodes based on the attribute information of the master nodes; and after a next-hop master node of the underwater route is determined according to the reward function value, transmitting the to-be-transmitted data packet of the current master node to the next-hop master node until data transmission from the to-be-transmitted data packets of all the master nodes to the water surface ship receiving terminal is completed. The underwater sensing data transmission device is used for transmitting underwater sensing data.

The invention discloses a routing method of a quantum key distribution network and a related device. The method comprises the steps that the state of a first QKD network is collected, the value of a corresponding reward function is calculated, the state is input into a preset actor network, and a corresponding action is output; the reward function is a linear combination of a plurality of topological state influence parameters; training the actor network by using a training architecture of the actor-commentator network in combination with the state, the action and the reward function value until a training termination condition is reached; taking the trained actor network as a strategy network; inputting the state of the link between the nodes in the second QKD network of which the route is to be determined into the strategy network, and outputting the weight value of the link between the nodes in the second QKD network through the strategy network; and calculating the optimal route of the second QKD network according to the weight value output by the strategy network. The invention provides a strategy network which is more intelligent and stronger in robustness so as to realize a routing strategy which is higher in distribution efficiency and more balanced in load.

In response to a programmatic request, configuration information representing a multi-network-segment gateway established on behalf of a customer is stored at a networking service. In response to another programmatic request, a communication session is established between a route signaling node of the gateway and a routing information source located at a customer premise. In response to additional programmatic input, the networking service stores an indication that the gateway is to be used to transfer packets between a cloud-side virtual network and a customer-side virtual network. The routing information exchanged in the session pertains to the cloud-side and customer-side virtual network, and is used to transfer data packets between the two virtual networks.

A wireless communication method for energy-related based routing selection includes interacting, by a network node responsible for an energy related decision, with at least one network element to perform a user plane (UP) route selection based on the energy related decision and / or at least one energy related parameter. The network node may be an energy broker function (EBF), an application function (AF), a network function (NF), a charging function (CHF), a function residing on a network exposure function (NEF), a function residing on a network repository function (NRF), a function in collaboration with a CHF, or a function in collaboration with a network data analytics function (NWDAF).

The invention relates to a dynamic routing and flow balancing method and system for a regionalized network topology, and the method comprises the steps: dividing a satellite network into a plurality of partitions, and distributing a core node for traffic scheduling and routing calculation for each partition; each core satellite node responds to each traffic demand, and bandwidth and traffic distribution in each partition are adjusted through a multi-anchor-segment routing method and a preset linear programming model; and each satellite node dynamically adjusts the route of each traffic demand through a probability forwarding scheduling method based on geometric topology according to the relative position of the satellite node and the target node. According to the method, low delay, high bandwidth utilization rate, load balance and efficient fault recovery of the satellite network are realized through network partitioning, a multi-anchor-segment routing method and probability forwarding based on geometric topology.

The invention relates to multi-path routing of a switch fabric. The switching fabric uses traffic congestion information to notify it of timely use of non-minimum routing. An ingress port of a network switch collects traffic congestion information from an egress port of the network switch. The traffic congestion information includes minimum and non-minimum routing congestion metrics for the egress port. A candidate egress port is identified for forwarding the data packet to the destination node. And selecting one of the candidate exit ports according to the traffic congestion information. The selection process is biased to select some candidate egress ports rather than other ports. In particular, a candidate egress port providing non-minimum routing to a destination node and having a high minimum routing congestion metric is not sponsored by a selection process.

The invention relates to a dynamic routing method for an underwater acoustic communication network, and the method comprises the steps: each node obtains the three-dimensional coordinates of the node in real time through a positioning module, and periodically broadcasts an enhanced neighbor discovery control packet comprising the node position, the node residual energy and the available bandwidth; the physical layer of each node determines a signal-to-noise ratio, a propagation delay and a packet loss rate according to the received enhanced neighbor discovery control packet, and updates a link state table through a shared memory; the network layer of each node reads the link state, position information and node residual energy of a neighbor node from the link state table of the shared memory, and constructs a neighbor table; when the source node sends underwater acoustic communication data to the destination node based on the neighbor table and there is no available route, route discovery is triggered to obtain a target route path; and sending the underwater acoustic communication data based on the target routing path.

The invention relates to the technical field of internet routing security, in particular to a routing leakage detection method, device, equipment, medium and program, and the method comprises the steps: obtaining routing table data, business relation data of an autonomous system and routing declaration data; constructing a triple set of the autonomous system according to the routing table data, and calculating the legal probability of the corresponding triple according to the observation data of each triple in the triple set; and extracting an autonomous system path in the route declaration data, detecting whether the autonomous system path is a valley path according to the business relation data, and generating a route leakage detection result according to a valley ternary combination method probability in the valley path. Therefore, the problem that a valley path-based routing leakage detection method in the related technology is difficult to meet the requirements of a complex internet environment due to high false alarm rate and static rule limitation is solved.

The present disclosure relates to a routing control method, a system, and a BGP Peer. The method of the present disclosure can be executed by a first BGP Peer, including: receiving information of adding a new VPN route sent from a second BGP Peer, wherein the information of adding the new VPN route comprises: the new VPN route and an identifier of a first VPN instance; determining whether a number of VPN routes corresponding to the identifier of the first VPN instance reaches or exceeds a limit value after adding the new VPN route; and sending first instruction information to the second BGP Peer to instruct the second BGP Peer, in a case that the number of VPN routes corresponding to the identifier of the first VPN instance reaches or exceeds the limit value, wherein the first BGP Peer is an iBGP Peer inside a first AS.

The invention relates to the technical field of network communication, in particular to a route issuing method and device and related equipment. The method is applied to network equipment, and comprises the following steps: generating original next hop information based on a standard routing protocol; on the basis of a predefined rule, the generated original next-hop information is divided into at least one equivalent next-hop group, and one equivalent next-hop group comprises at least two next-hop interfaces; and for each equivalent next hop group, generating a corresponding routing table item, and issuing the generated routing table item to a hardware forwarding table.

A router is configured to send an advertisement of selective Ethernet Virtual Private Network (VPN) (EVPN) routes based on the Route Types. The router is configured to determine a requirement for a route refresh from a Border Gateway Protocol (BGP) peer for a subset of Route Types of all of the Route Types, send a route refresh message to the BGP peer with an indication of the subset of Route Types, and receive updated routes from the BGP peer only for the subset of Route Types. The indication can be included in a reserved field and payload of the route refresh message. The route refresh message can be defined in RFC 2918.

The invention discloses an active hierarchical boundary gateway protocol routing method and system for a low-orbit giant satellite base, and the method comprises the steps: carrying out the time frame and time slot division, predicting the satellite-ground connection switching in a time frame and the throughput of each satellite, and dividing a satellite network into an entrance and exit satellite region, a backbone region and a non-backbone region; iBGP connection is carried out according to satellite partitions, and routing update is carried out under different time slots according to time slot division decisions; in a time slot in which only a hierarchical convergence mechanism is adopted, the satellites in all the partitions transmit and receive UPDATE messages in a hierarchical manner to exchange routing information so as to achieve whole-network convergence; and in a time slot in which an active routing update mechanism is adopted to assist a hierarchical convergence mechanism, the satellite actively updates routing table entries, and transmits and receives a posterior UPDATE message for verification. According to the method, a hierarchical convergence mechanism is adopted, iBGP connection between satellites can be reduced, message overhead can be reduced, the routing convergence speed can be increased, and an active routing updating mechanism is supplemented, so that the routing convergence time can be further shortened, and the satellite network stability can be improved.

A technique is described herein for reliably comparing a first route produced by a first routing system with a second route produced by a second routing system. In some implementations, the technique includes: generating an envelope that encloses second-route data associated with the second route; identifying a segment of the first route having first-route data points that lie outside the envelope; classifying a cause of a deviation associated with the segment based on segment data that describes the segment; and performing an action based on classification of the deviation. The technique is fast, resource efficient, accurate, and resilient to the fact that the first and second routing systems potentially use different rules and / or map data to produce their routes. The results of the technique can be leveraged to improve the performance of the first routing system.