Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

74 results about "Convergence (routing)" patented technology

Convergence is the state of a set of routers that have the same topological information about the internetwork in which they operate. For a set of routers to have converged, they must have collected all available topology information from each other via the implemented routing protocol, the information they gathered must not contradict any other router's topology information in the set, and it must reflect the real state of the network. In other words: In a converged network all routers "agree" on what the network topology looks like.

Method and system for fast computation of routes under multiple network states with communication continuation

A system and method for network routing is provided where significant (those that impact optimal network routes) state changes of network components are considered. A set of optimal communication paths are generated for a number of actual and potential component failure scenarios. An optimal communication path is generated for each failure scenario. In addition, a method that enables continued communication using intermediate routing points and routing update propagation during periods of network non-convergence or congestion is disclosed.
Owner:OPCOAST

Method to reduce routing convergence at the edge

In a network comprising a provider edge router coupled to each of a mated pair of core routers in a core network, a system and methodology for rerouting upstream traffic destined for the provider edge router in the event of a link failure between one of the core routers and the provider edge router. By detecting a link failure between a first of the mated pair of core routers and the provider edge router, and directing the upstream traffic destined for the provider edge router to a second of the mated pair of core routers, internal gateway protocol (IGP) reconvergence events are not triggered.
Owner:AT&T INTPROP I L P

Load balancing method and device for multiple transmission lines

The invention discloses a load balancing method and device for multiple transmission lines. The method comprises the following steps: receiving an initial application message sent to a second networkconnected with an access station by a first network connected with a convergence station; if it is determined that the first routing device has the main device attribute, obtaining path scheduling information of the initial application message according to a preset load balancing scheduling strategy, the first line information and at least one part of second line information of at least one secondtransmission line, thereby determining a forwarding path for forwarding the initial application message; If it is determined that the first routing device has the standby device attribute, packagingthe initial application message in a first preset packaging mode to obtain a to-be-forwarded application message, and forwarding the to-be-forwarded application message to a selected second routing device having the main device attribute, so that the selected second routing device determines a forwarding path for forwarding the initial application message. According to the method, the load balancing problem of a plurality of transmission lines of routing equipment of convergence sites deployed at different places is solved.
Owner:RUIJIE NETWORKS CO LTD

Rapid routing convergence method and device

InactiveCN108270677AReduce the amount of routing calculationsSave routing calculation timeData switching networksShortest-path treeCpu load
The embodiment of the invention discloses a rapid routing convergence method and device. The method comprises the steps of S1, obtaining a class to which a change situation of a network topology belongs according to the shortest path tree (SPT) of a network, a link status database (LSDB) and neighbor node information contained in an LSP when any routing node in the network receives the link statuspacket (LSP); and S2, performing a corresponding updating policy according to the type of the change situation. According to the embodiment of the invention, the change situation of the network topology is classified, so for each class of topology change, a suitable algorithm is selectively used to update a route, and the unnecessary route computation quantity is reduced. Compared with the priorart, the embodiment of the invention has the advantages that the route computation time is reduced and the CPU load is reduced.
Owner:CHINA MOBILE GROUP ZHEJIANG +1

Seamless credible cross-domain routing system of heterogeneous convergence network and control method of seamless credible cross-domain routing system

The invention belongs to the technical field of cross-domain routing, and discloses a seamless credible cross-domain routing system of a heterogeneous convergence network and a control method thereof. The control method of the seamless credible cross-domain routing system of the heterogeneous convergence network comprises the following steps: evaluating the trust value of a network node through a trust calculation method and an incentive mechanism, and exciting the honesty behavior of the network node; issuing a intelligent contract for cross-domain routing, and determining a network state update process; designing an AR-DRL algorithm, wherein the algorithm is based on a block chain and a DDPG algorithm to obtain an optimal routing strategy, and seamless cross-domain routing is realized. According to the invention, automatic cross-domain routing is realized through an intelligent contract and a machine learning algorithm; the credibility of routing nodes is improved through an incentive mechanism and a consensus mechanism; according to the network state information provided by the operator in the registration process, the authenticity of the network state information in the routing process is evaluated remotely, counterfeiting and serial attack of the network operator can be resisted, and the authenticity and reliability of the routing information are ensured.
Owner:XIDIAN UNIV

Dynamic self-adaptive route path planning method based on two-layer topology routing algorithm

The invention provides a dynamic self-adaptive route path planning method based on a two-layer topology routing algorithm. The method comprises: S1, building a traffic network; S2, grouping the vehicle node and the lamp pole node; S3, calculating a routing path between the vehicle node and the lamp pole node; S4, evaluating the performance of each route path between the vehicle node and the lamp pole node; S5, calculating the effective link and the availability weight of the routing path of the ground intelligent lamp pole network; S6, calculating the total cost of data transmission of the terrestrial intelligent lamp pole network, and establishing data transmission by the route path with the minimum total cost and the best availability weight value; S7, screening the vehicle node and thelight pole node the meet the service requirements to participate in data transmission, and obtaining the topological routing path of the traffic network. The invention discloses a dynamic self-adaptive route path planning method based on a two-layer topology route algorithm, which can improve the work utilization efficiency of a traffic network, solve the information congestion, enhance the convergence, reduce the route overhead and improve the service satisfaction.
Owner:SHANGHAI JIAO TONG UNIV

L3VPN routing iteration outlet method

ActiveCN105721305AConvergence Time ControlData switching networksRouting tableControl data
The invention discloses an L3VPN routing iteration outlet method. The method is characterized in that an FIB of a forwarding plane can be layered and separated into a VC layer and an LSP layer respectively for iteration processing, and each layer is used to determine whether a next hop IP of current unicast routing and a direct-connected routing are in a same network segment; when the answer is yes, the forwarding information package processing can be carried out directly; otherwise, the next hop IP is used to execute a PEER command for the iteration, till the next hop IP and the direct-connected routing are in the same network segment, and then the forwarding information package processing can be carried out for the later searching of the routing tables and the searching of the PW or LSP labels. According to the invention, by layering and separating the FIB table of the forwarding plane, the routing, the PW, and the TUNNEL can be separated, and then when the main control data is changed, the independent data updating of the forwarding plane can be carried out, and the updating of a plurality of table item contents of the forwarding plane is not required during the updating of one data, and then the control of the business convergence time can be facilitated, when the network faults of the forwarding plane occurs.
Owner:FENGHUO COMM SCI & TECH CO LTD

Method for realizing shortest path of double layers based on cluster computing unit

The invention provides a method for realizing the shortest path of double layers based on a cluster computing unit. The method comprises the following steps: adding node identification information responsible for each cluster computing unit layer in a flooding information packet of the cluster computing unit layer according to a routing protocol expanding the cluster computing unit layer so as to improve the permeability of layer topology of the cluster computing unit layer, calculating the shortest path reaching a target cluster computing unit from a source cluster computing unit, and directly transmitting a path selection request to the target cluster computing unit along the shortest path to avoid blooding of the path selection requests, thereby greatly reducing the problem of network overloading caused by information blooding. Meanwhile, the adopted method of double layer shortest path can greatly save path selecting resources, reduce convergence time of path selection in large scale, and reduce the complexity of path selection. According to the method, the problem of excessive blooding information caused by mass path selection requests, and problems of time convergence difficulty and computing resource waste in path selection in multiple domains can be solved.
Owner:BEIJING UNIV OF POSTS & TELECOMM

QG-OLSR routing method based on quantum genetic strategy

The invention provides a QG-OLSR routing method based on a quantum genetic strategy. A mobile ad hoc network has the characteristics of mobility, self-organization, multi-hop, distributed control and the like, so that a routing algorithm thereof must quickly adapt to frequent changes of a network topology structure and must continuously keep routing information with high instantaneity, high accuracy and little redundant information for each node, and the network resources can be saved to the uttermost. Compared with the existing quantum genetic algorithm, the method improves the quantum genetic algorithm, and optimizes the selection of an MPR node at first in combination with the characteristics of an OLSR routing protocol, thereby overcoming the shortcomings of the traditional method during the selection of an MPR set and proving the convergence and the global optimal solution of the algorithm. As been checked and proved, by adoption of the method, the redundant information in the network can be effectively reduced, and the data transmission efficiency in network topology is improved.
Owner:TIANJIN UNIVERSITY OF TECHNOLOGY

Space-based networking routing method and equipment based on centralized and distributed combination

The invention discloses a space-based networking routing method and equipment based on centralized and distributed combination. The method comprises the following steps that: a ground controller generates whole network topology prediction information in a period according to network information of a space-based network; the topology prediction information is analyzed by each space-based network node, and a link state notification containing full-period topology prediction information is generated; each space-based network node divides time periods according to the topology prediction information, so that the network topology in each time period is kept unchanged; each space-based network node selects a link state announcement of a time period to form a prediction topology, and a routing table is calculated; and each space-based network node detects the own link state in real time, compares the link state with the predicted topology, and triggers routing update under the condition that information is different. According to the space-based networking routing method disclosed by the invention, the prediction topology in each time period is kept unchanged, the network topology information can be quickly acquired at the starting moment of each time period, the routing convergence is effectively accelerated, the abnormal condition of the network can be sensed in real time, and the routing table item can be updated in time.
Owner:CHINA ACADEMY OF ELECTRONICS & INFORMATION TECH OF CETC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products