613 results about "Route" patented technology

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.

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.

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.

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.

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 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.

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.

The present technology intelligently selects routes to be distributed to edge network device from SD-WAN controllers. Rather than indiscriminately distributing routes, the present technology utilizes logic to account for route viability conditions to determine whether a route between a first edge network device and a second edge network device is likely to be usable between the edge network devices.

The invention relates to the technical field of communication, and discloses a route synchronization method, device, system and equipment among multiple SDN clusters and a medium, and the method comprises the steps: obtaining neighbor configuration information issued by a central controller based on a target BGP service; establishing a neighbor relationship between the target BGP service and other BGP services according to the neighbor configuration information; obtaining first node address information of a target SDN cluster collected by the target SDN controller based on the target BGP service, and generating first routing information; and sending the first routing information to other BGP services which establish the neighbor relationship. According to the invention, the BGP service and the SDN controller are utilized to realize the coordination of the control planes, the BGP service and the SDN controller form a double-layer control plane, and the double-layer control plane is utilized to issue the routing forwarding strategy, so that flooding on the data plane is effectively avoided, and the routing synchronization efficiency is improved.

The invention discloses a route determination method, system and device and a storage medium. The method comprises the steps of obtaining route notification data and a candidate route set; constructing a knowledge graph based on the route notification data, and calculating a reputation value of each autonomous domain node based on the knowledge graph; and based on the reputation value of each autonomous domain node, screening out a credible route set from the candidate route set, performing reputation weighted scoring on paths in the credible route set, and selecting the path with the highest score as the optimal route. Semantic organization is carried out on the autonomous domain, the routing prefix and the strategy relation through the knowledge graph, the data availability and analysis efficiency are improved, dynamic evaluation of the autonomous domain reputation is achieved in combination with neighbor recommendation, and the accuracy of credibility judgment is improved; a reputation evaluation result is directly applied to path selection, untrusted nodes and paths are effectively filtered, potential attack risks are reduced, and the overall security and stability of a routing system are improved.

The present invention provides network access to network nodes (e.g., Zigbee nodes) without route discovery by combined reading of neighbor tables and source routing. By repeatedly reading neighbor tables of all nodes in the network, powered nodes can be found. Neighbor tables of neighbors listed in the neighbor table of the first node are read by providing a source route which may be obtained by tracking from which node the neighbor table was read. Route selection may be controlled based on a route quality (e.g., path cost). The result of this process is a list of source routes to all nodes. It is then possible to communicate with all nodes in the network using source routing (e.g., to read the light state).

The invention provides an unmanned aerial vehicle network routing method based on candidate route pre-calculation and dynamic preferential selection, which comprises the following steps that: a network layer executes topology perception and route pre-calculation to generate a candidate route set; the link layer implements a real-time signal-to-noise ratio monitoring mechanism to generate link quality evaluation parameters; based on a dynamic preferential decision model, selecting an optimal next hop node from the candidate routing set; and the data stream is forwarded to the selected optimal next hop node through cross-layer collaboration. According to the method, a cross-layer cooperation mechanism is added in a table-driven routing protocol, a traditional routing decision is divided into network layer pre-calculation and link layer dynamic optimization selection, a candidate routing set is constructed in a network layer, and the link layer selects an optimal next hop by sensing channel quality parameters, so that dynamic optimization and interference avoidance of a routing path are realized; and the packet delivery rate and throughput performance of the unmanned aerial vehicle network are effectively improved.

An optimal route can be determined for delivering an item through a logistics system where vehicles have multiple stops when traveling along routes. The optimal route is determined using a hybrid system employing a classical computing device and a quantum annealer. The classical device reduces the search space that allows the quantum annealer to determine a more optimal solution. In an aspect, a routing graph comprising nodes and edges is populated from routes of vehicles, where the nodes identify locations and the edges represent routing data. At least a portion of the nodes and edges is removed to form a refined routing graph. For an origin-destination input, the refined routing graph can be filtered according to a first set of routing constraints to form a reduced route search space. A quantum annealer is invoked according to an objective and a different second set of routing constraints.

The invention provides a large-scale constellation network semi-physical simulation test system and method, the system comprises a constellation simulator, a satellite-borne router, ground detection equipment and a protocol conversion network bridge, a Mininet simulation platform is deployed, and dynamic topology adjustment, an OSPF dynamic routing protocol and a multi-scene test function are supported; a user can observe network topology change, route updating time and key performance indexes in real time. A semi-physical simulation architecture is realized through unified IP subnet interconnection and the same routing protocol, a space-time synchronization engine ensures that virtual and real node routing tables take effect at an appointed moment, and in combination with a protocol consistency sandbox, hidden faults caused by inconsistent behaviors of hardware and software protocol stacks are solved, and the service life of the virtual and real node routing tables is prolonged. A plurality of real nodes are accessed in a large-scale network environment, and end-to-end data transmission test, security policy verification and protocol compatibility analysis are carried out; the invention provides an efficient, flexible and reliable solution for the design, verification and optimization of the satellite network, and has a wide application prospect.

The invention provides a service channel ring cutting segmentation same route analysis method and device, equipment and a medium. The service channel ring cutting segmentation same route analysis method comprises the steps of obtaining a service whole route corresponding to a service channel; determining a route segmentation point according to the service whole-course route; according to the route segmentation points, carrying out route segmentation on the whole-process route of the service to obtain a plurality of discrete route segments; according to the network element to which the route segmentation point in each discrete route segment belongs, carrying out ring cutting segmentation collection to obtain a plurality of discrete route groups; segmenting each discrete routing group and deleting the same network element to obtain a plurality of segmented ring segmentation groups, each segmented ring segmentation group comprising one or more discrete routing segments, and source end ports and host end ports belonging to the same discrete routing segment belonging to different network elements; and performing service same-route analysis according to the plurality of ring cutting segment groups to obtain a service same-route analysis result. Therefore, potential safety hazards of the same route are found efficiently and quickly, the potential safety hazard position of the same route is positioned, and the analysis efficiency of the same route is effectively improved.

Disclosed are a service demand-driven routing scheduling and dynamic selection method and system for active distribution network. The method includes: evaluating a physical importance index and an information importance index of each service traffic according to a physical influence and an information demand of each issued service traffic, comprehensively taking into account the physical importance index and the information importance index to obtain a comprehensive importance index, and ranking the comprehensive importance index to obtain a ranked service traffic set; quantizing the real-time performance and the reliability of a route link and generating a route distance matrix; inputting the ranked service traffic set and the route distance matrix into a route scheduling optimization model, and generating a route scheduling scheme of the overall service traffic based on a principle of service traffic importance and route path performance matching.

Each of virtualized base stations is configured by connecting respective units of CU, DU, and RUs. An ACC is installed at least a part of computers that virtualize the respective units. The respective units notify the RAN controller of ACC information of computers and traffic information. The RAN controller comprises a route calculation unit 101 that calculates an optimal route based on the ACC information and traffic information of the respective units, and a route notification unit 102 that notifies the respective units of information on the optimal route, and the respective units switch the route between the respective units based on the notified route information.

The invention relates to a Java background service deployment method and system based on double-node dynamic routing, and the method comprises the steps: obtaining the health state of each node based on TCP port activity detection and / or UDP heartbeat packet detection; judging the nodes of which the detection failure times exceed the preset times as fault nodes, and setting the fault nodes to be in an offline state; determining a traffic allocation weight according to the real-time working state of the node; performing routing distribution on the client request based on the traffic distribution weight; route distribution is dynamically adjusted based on the traffic allocation weight, the resource utilization rate of the nodes is improved, and the situation that the load of a single node is too heavy is avoided; when a fault node occurs, the other node is automatically switched to respond to the request, so that the fault switching time is shortened; and the data consistency between the double nodes is adjusted based on the Redis cluster and the MySql cluster. Based on cooperation of the steps, the problems of failure switching delay, low resource utilization and low data consistency in a traditional scheme are solved.

Implementations claimed and described herein provide systems and methods for map routing matching system, wherein the one or more machine-learning models scores link candidates of location data points to determine a most probable route. In one implementation, use a machine-learning model to calculate a probability score for a plurality of link candidates. The machine-learning model scores each link candidates based on weighting set by training data, wherein the weighting associated with at least one of travel time, match distance, heading difference, speed conformity, road curvature, road classification, or travel distance versus time delay. A plurality of total probability scores derived from one or more combinations of probability scores for respective link candidates is calculated, wherein one link candidate is selected for each location data point.

The embodiment of the invention provides a route announcement and message forwarding method, a storage medium and an electronic device. The route announcement and message forwarding method comprises the following steps: receiving route information from first ridge node equipment in a first group through second ridge node equipment; and the second ridge node equipment carries out route notification on the second leaf node equipment in the second group according to the route information. The problems that the deployment cost of the dragonfly + network is high and the dragonfly + network does not have an automatic forwarding mechanism in the prior art are solved, and the effects of reducing the deployment cost of the dragonfly + network and realizing the automatic forwarding mechanism are achieved.

Routing of packets in a partitioned subnet is realized in a data center (DC) by using a first type of address prefix (e.g., / 24 prefixes) to advertise respective hosts to its peers (i.e., external traffic). For routing traffic within the DC (i.e., internal traffic), a second type of address prefix (e.g., / 32 prefixes) that is longer than the first type. Switches / routers within the DC perform liveness probes detecting which hosts are connected thereto and updating a table (e.g., an ARP / ND table) to include the connected hosts (e.g., removing hosts that fail to respond). For changes to the table, a gate protocol (e.g., BGP or IGP) is triggered such that the switch / router advertises within the DC fabric the second type of address prefix for the host routes of the connected host. The switch / router also configures Liveness sessions for the connected hosts.

The technologies described herein are generally directed toward establishing a domain of authority for routing table updates from a routing device. According to an embodiment, a system can comprise a processor and a memory that can enable operations facilitating performance of operations including identifying a route update that comprises information about a network. According to the embodiment, the operations can further include communicating, via the network, the route update to a second routing device for propagation of the route update to routing devices in a first authority domain with the first routing device.

The invention discloses an unmanned aerial vehicle network multipath selection and network coding redundancy transmission method. The method comprises the following steps that each unmanned aerial vehicle carries out node state perception and link prediction; the source node initiates a multi-path routing discovery process based on the extended AOMDV routing protocol, performs path quality measurement, and selects a plurality of paths with the highest path quality as active transmission paths; the source node divides an original data block to be sent into a plurality of original data packets and encodes the original data packets respectively; performing optimal distribution based on a water injection algorithm; data forwarding and decoding receiving are carried out according to an optimal distribution result; and continuously detecting that the link communication actively triggers the maintenance process before the link is actually broken. According to the method, high-reliability, low-delay and energy-balanced data transmission is realized in a highly dynamic unmanned aerial vehicle network through a rigorous evaluation and optimization system, and the overall survival time of the network is effectively prolonged; and predictive route maintenance and fast route switching are carried out through the extended routing table.

Systems and methods for the storing and distribution of routes with different length prefixes between different tables in network devices utilizing lookup strengths associated with prefix lengths are disclosed. The results from performing lookups in these tables may have associated lookup strengths based on the prefix length of the associated routes, and the evaluation of which route to utilize for packet processing can be determined utilizing these associated lookup strengths. In this manner, a desired route for such packet processing may be determined regardless of the table where a route resides.

This invention relates to a routing method and system for low-Earth orbit satellite constellation networks. This method enhances the congestion awareness of satellite nodes to improve the routing selection and traffic distribution effect. Based on real-time link status information, routes are updated promptly to better respond to changes in satellite network topology and network traffic, resulting in a higher packet delivery success rate. It improves congestion awareness to obtain link load information within a two-hop range and enhances network load balancing by providing a wider range of routing options, enabling satellite nodes to make routing and forwarding decisions with a broader routing perspective.