62 results about "Convergence (routing)" patented technology

The invention discloses a multi-source heterogeneous event data real-time processing method and system, and relates to the technical field of data processing. Aiming at the problems of efficient convergence, intelligent cleaning and real-time accurate distribution of multi-source heterogeneous data, the adopted scheme comprises the following steps of: automatically matching an analysis protocol of a heterogeneous data source through a multi-source adapter dynamic loading technology, and selecting a corresponding conversion script to convert analyzed data into a uniform format and store the analyzed data so as to realize convergence of multi-source heterogeneous event data; making a lightweight intelligent cleaning strategy, performing primary filtering on the converged event data through a rule engine of a primary filtering layer, and performing semantic correction on the filtered event data through a lightweight AI model of a semantic correction layer; and for the event data after semantic correction, extracting a structured semantic tag, carrying out multi-dimensional matching on the structured semantic tag and a city right and liability list, realizing intelligent event distribution in combination with a dynamic routing and distribution mechanism, and optimizing the right and liability list based on a processing result. According to the invention, the event convergence and distribution efficiency can be improved.

The invention provides an NoC low-delay data transmission method based on a dynamic routing algorithm, relates to the technical field of data transmission, and aims to solve the technical problems that an existing NoC routing algorithm cannot adapt to a link dynamic load, is lack of congestion trend prejudgment, is slow in path search convergence and is insufficient in QoS differential scheduling. The method comprises the following steps: constructing a dynamic sensing module containing a double-branch LSTM time sequence prediction model, collecting states such as link bandwidth and queue length in real time, and predicting a congestion trend in 50-100ms in the future; constructing a multi-objective evaluation function taking delay as a core, and dynamically adjusting the weight according to the QoS level; solving an optimal path by adopting an improved ant colony algorithm which introduces a congestion penalty and pruning strategy; during transmission, dynamic reselection is triggered through a pre-calculation + fast matching mechanism; and iteratively optimizing the prediction model based on incremental learning. According to the method, congestion is avoided in advance, the path search efficiency and the transmission reliability are improved, the delay is remarkably reduced compared with a traditional algorithm, and the method is adaptive to delay sensitive scenes such as a high-performance processor and an AI chip.

The invention belongs to the field of security protection, and particularly relates to a cross-border traffic pool dynamic elastic scheduling system and method, and the method comprises the steps: collecting the real-time quality and traffic parameters of a multi-operator link, and generating a scheduling detection sequence in combination with historical data and the hidden intention of a service appeal text, generating state data through fusion calculation and sending the state data to a cross-border traffic pool dynamic scheduling platform; the flow pool dynamic scheduling model is used for decoupling a time sequence delay coupling relation between parameters, flow consumption fluctuation caused by cross-domain routing convergence is predicted, a feature vector containing a flow excess risk probability and link quality fluctuation is extracted, a target scheduling instruction is generated in response to a cross-domain linkage scheduling condition, and a flow distribution proportion is adjusted or a path is switched. According to the invention, elastic resource allocation and excess risk early warning are realized, and the utilization rate of cross-border traffic resources is improved.

The invention relates to the technical field of information security, in particular to a level protection risk identification model adaptive training method. Comprising the following steps: acquiring a network element topology matrix, a log set, a compliance label set, a network element communication baseline sequence, a cross-domain routing permission matrix, a vulnerability vector and a reference array; extracting an interaction matrix, an evolution matrix and a state matrix; inputting the state matrix into an initial atlas analysis engine for propagation calculation, outputting a prediction matrix, performing deviation calculation, and generating a compensation feedback matrix; extracting a convergence index of the compensation feedback matrix, and outputting a convergence signal; and when the convergence signal does not meet the condition, performing correction calculation on the initial atlas analysis engine according to the compensation feedback matrix, performing updating, and returning to execute propagation calculation. According to the method, stable self-adaptive optimization and convergence of the risk identification model are realized in a complex network environment in which the architecture is dynamically evolved and strict access constraints exist.

The invention belongs to the technical field of artificial intelligence middleware and cloud computing task arrangement, and discloses an agent arrangement system and method based on a graph structure and a response type programming technology. Comprising a graph structure construction and compiling unit, a node operation unit, a routing and confluence control unit, a graph signal and event management unit and a response type operation and execution regulation and control unit, and an execution path has integrity and verifiability before deployment through analysis of a service graph, topology verification and confluence supplementation of parallel branches; the nodes trigger execution according to graph signals and write products into a result data area or a shared data area, and the routing and confluence control determines a convergence mode of signal transmission and parallel branches according to a connection predicate and a confluence rule. The event management unit generates a structured event for a node operation state, and the operation regulation and control unit schedules through a leading edge queue and in-transit counting and feeds back a back pressure signal to the upstream when a load changes, so that stable propulsion of a graph structure is realized.

The invention discloses a server load balancing method based on distributed computing. The method comprises the following steps: collecting instantaneous or short-window statistical data of a server at each entrance load balancer to generate a state vector, and dividing service categories; constructing an objective function containing congestion cost, migration cost and risk sensitive cost under an improved distributed average field game model based on the state vector; establishing average field distribution and determining a feasible route set under the constraints of capacity, quota and affinity; each entrance adopts mirror image outer ladder double-step updating based on the optimal response; time attenuation and maximum value protection are introduced in the updating process, temperature decline disturbance and a cold start discharge mechanism are combined, and finally convergence is judged according to the change rate and the default rate, and routing distribution is output. According to the invention, an improved distributed average field game model is introduced, so that efficient and stable load balancing of a service-level-oriented protocol in a large-scale cluster is realized.

The invention relates to the technical field of node state monitoring, and discloses a node state monitoring management method, device, equipment and medium, and the method comprises the steps: an online node accesses a main network, periodically obtains state information, and sends the state information to convergence equipment; the on-line node detects and is connected with the auxiliary network to obtain off-line node information and sends the off-line node information to the convergence device; the aggregation device selects a routing node according to the offline node information and the online node state information and issues a routing instruction; the routing node sends main network connection information to the offline node to assist access; and the convergence device forwards the state information to the processing center. According to the invention, the online node detects the offline node and the routing node assists in access, so that the node state can be mastered in real time and the offline node can be quickly recovered, an efficient and unified monitoring system is constructed, and the reliability of large-scale node management is improved.

The application belongs to the technical field of computer network and artificial intelligence, and specifically provides a dynamic network adaptive routing method based on a graph neural network and a group relative strategy, which realizes adaptive perception of network topologies of different scales and types through a graph neural network encoder, eliminates the dependence on a value network through a group relative strategy optimization algorithm, thereby reducing the model complexity, and realizes cross-topology generalization, energy perception and load balancing on the basis of adaptive network dynamic change and effective avoidance of harmful nodes; compared with traditional shortest path routing, Q-Routing and PPO-MLP baseline methods, the application has significant advantages in key indicators such as average end-to-end delay, average queuing delay and data packet delivery rate, and has faster training convergence speed and higher cumulative reward promotion; in conclusion, the application has excellent routing performance and anti-destroying ability, and is especially suitable for routing scenes in a high dynamic and multi-fault environment.

The application provides an automatic verification platform implementation method based on an SRIO GEN4 protocol, which generates a matched verification environment according to a customer verification object characteristic parameter script; if the DUT function is a Switch mode, the function convergence is completed according to the design requirement; if the configuration is a Bridge mode, the expected incentive protocol is completed according to the design requirement; if the configuration is an Endpoint mode, the environment is automatically generated. The application has the beneficial effects that the automatic verification platform implementation method based on the SRIO GEN4 protocol can complete the MPW verification by the BFM controller part, and can guarantee the protocol consistency. The time cost of the user maintenance of the automatic verification platform depends on the user routing design complexity, the bridge mode reference model complexity and the implementation mode.

The invention provides an Internet of Things monitoring data processing method and system. According to the method, routing table update and link state change are sensed in real time in the topology change process, dynamic synchronization of a sampling task and the real network running state is achieved, high-priority sampling in the link convergence period and the routing oscillation period is avoided through a sampling avoiding strategy, packet loss, delay and disorder caused by network jitter are reduced, and the network reliability is improved. Besides, the continuity of the sampling data in the business time sequence is ensured through timestamp correction, so that the data from different acquisition nodes are kept in strict time consistency during combination, and finally, a high-precision sampling data set which can be directly used for accounting, clearing and risk control is generated.

A simultaneous placement and routing based method and apparatus for incremental design optimization, and a computer device. The method includes according to a net-list file and a core constraint file acquired after logic synthesis, sequentially placing modules, each including units, on an initial coarse grid and simultaneously performing routing of each module and a placed module; performing iterative verification on placement and routing of the modules, and adjusting an illegal module and simultaneously adjusting routing of the illegal module according to a verification result, until requirements of the core constraint file are met; refining the grid, dividing each module into a plurality of sub-modules, and performing simultaneous placement and routing on the sub-modules in a refined grid; performing iterative verification and simultaneously adjusting placement and routing of illegal sub-modules; and repeating the above steps, until the iterative verification meets the requirements of the core constraint file and timing convergence.

The application relates to the technical field of chip design, and particularly discloses a routing method and system based on timing criticality, which abstracts physical layout into a node network, constructs a weighted cost function of total wiring length and critical path length, adopts a minimum spanning tree algorithm to iteratively expand a path and record a parasitic parameter, calculates a merging cost value based on the product of the length of a coincident path and the timing criticality of a node, generates a virtual node by merging a node pair with the maximum benefit, and cyclically optimizes until a convergence condition is met, so that the dual objectives of wiring resource optimization and timing critical path delay reduction are achieved. The method is based on a more accurate time delay model, defines a target function which comprehensively considers the overall routing cost and the routing cost of a timing critical load node, makes timing analysis more accurate, reduces the signal delay and the size of a clock cycle of a load node according to the criticality of the load node, and effectively increases the running speed of a chip.

This invention provides a method for rapid perception of the topology status of a satellite constellation network. It deploys a multi-dimensional physical layer monitoring module, a dynamic adaptive BFD detection mechanism, the OSPF routing protocol, and a shared data exchange area between the BFD driver and the OSPF process on each satellite node. This invention utilizes physical layer signal status monitoring technology and the rapid link status detection capability of the BFD protocol to monitor the connectivity of inter-satellite links in real time. Upon detecting a fault, it immediately notifies relevant nodes via control messages. Simultaneously, it links the BFD detection results with the OSPF routing protocol, triggering immediate route recalculation, thereby shortening route convergence time. This invention constructs a cross-layer closed-loop linkage system, dynamically adjusting protocol layer detection parameters through physical layer perception data, and combining hardware acceleration to optimize the entire fault detection process. This not only accelerates fault detection and recovery but also improves the resource utilization efficiency and overall transmission efficiency of the inter-satellite network, ensuring high network reliability and stability.

This application relates to the field of integrated circuits and discloses a method for evaluating the routing success rate of interconnect switch blocks (RSBs) in the placement and routing process of a field-programmable gate array (FPGA). This method analyzes the driver and drain nodes of the RSBs, and, combined with the placement results, counts the drain nodes that need to be connected, finds feasible routing paths, and calculates the routing success rate of the RSBs. This application also discloses a placement optimization method based on this evaluation result. By calculating the routing success rate of each RSB, the area containing RSBs below a threshold is re-placed until the routing success rate meets the requirements. This application can accurately quantify and evaluate the resource usage and routing success rate of RSBs. By evaluating the routing success rate on an RSB-by-RSB basis before routing to guide placement adjustments, it reduces the difficulty of internal routing within RSBs, reduces congestion, accelerates routing convergence, and improves FPGA design efficiency and reliability.

The systems and procedures described herein are intended for a network with a receiver network device and a source network device. The source network device can be configured to advertise a route that includes an attribute and at least one network address representative of the source network device. The attribute can include an identifier of the source network device and at least one network address with a prefix associated with hosts of the source network device. The receiver network device can determine convergence for routing packets from the receiver network device based, in part, on a finding that the identifier matches at least the prefix of the route advertised by the source network device.Convergence determinations can be performed faster if they are carried out using only the one route update whose identifier matches at least the prefix, allowing the receiver network device to detect and use only one route update.

The application belongs to the field of network engineering, artificial intelligence and network measurement, and discloses a traffic matrix estimation method combined with observation traffic and link load constraints, comprising the following steps: step 1, obtaining a traffic matrix dataset and a routing matrix dataset; step 2, obtaining a complete traffic matrix sample; step 3, performing main training on a diffusion model module, and updating a Transformer denoising network parameter by minimizing a loss function until convergence; step 4, generating a traffic matrix subjected to known traffic constraints; step 5, repeating steps 4-5 T times, and finally obtaining an output traffic matrix; and step 6, performing post-processing optimization on the traffic matrix output in step 5, and finally outputting a complete estimated traffic matrix. The application utilizes the probability generation capability of the diffusion model module, incorporates the constraint conditions such as observable traffic and link load into the reverse sampling process thereof, and cooperates with a training data preprocessing module to realize high-precision recovery of the traffic matrix.

This invention belongs to the field of communication technology, specifically disclosing a railway telephone private network migration system based on GPON+IMS convergence. By extracting call data from the V5.2 link and using dual-mode protocol conversion to achieve bidirectional conversion between V5.2 signaling and SIP signaling, existing access network devices such as OLTs and ONUs that only support the V5.2 protocol can directly connect to the SIP-based IMS core network without hardware modification, solving the problem of device protocol incompatibility. At the same time, the system determines the candidate SBC type based on the called number and selects the target SBC node based on the physical topology identifier of the calling ONU, achieving precise service routing. Finally, by performing a three-stage progressive cutover operation during the parallel period, bypass monitoring period, and handover period, the system avoids the signaling storm caused by a large number of ONUs registering with IMS simultaneously, solving the problem of service interruption required by traditional cutovers.

The application discloses a kind of high reliability and flexibility routing methods for strong confrontation self-organizing network, mainly solve the problem of low business delivery rate and slow routing convergence speed in strong confrontation scene using traditional routing algorithm.The implementation scheme is divided into topology control and routing two parts:Among them, routing includes: using the node information obtained by topology control to complete the routing discovery process, and constructing the whole network routing table;Through routing-topology joint, periodic and active two ways are used to jointly maintain the whole network routing table.Topology control includes:1) constructing the network topology structure of bidirectional link;2) maintaining one-hop routing table according to logical neighbor list;3) repeating 1)-2) until the network stops running.The application can maintain high end-to-end business delivery rate in strong confrontation scene, quickly complete the routing discovery process, improve the routing convergence speed, improve the stability and reliability of path, and can be used for mobile self-organizing network business data transmission.

The invention relates to the technical field of data processing, in particular to a high-speed mobile terminal routing addressing method and a communication device, and the method comprises the steps: collecting three-dimensional space coordinates, channel state indication information and adjacent node connection states, and constructing a network state data set with a timestamp; on the basis of node positions and connection states, a routing algorithm is combined with a topology prediction model to pre-judge a motion track, an optimal path containing a time effectiveness factor is calculated, and convergence delay is reduced through an increment updating mechanism; based on the path quality and the channel state, path stability and channel conditions are analyzed through a deep neural network, and a coding scheme is dynamically selected from a forward error correction coding library in combination with parallel simulation verification; evaluating energy efficiency of a resource allocation algorithm and a task scheduling algorithm in a digital twin simulation environment according to routing and coding requirements, and selecting a resource allocation strategy; through cross-layer optimization of an interface collaborative application path, a coding scheme and a resource strategy, a transmission index is monitored in real time and parameters are dynamically adjusted.

The invention provides a master station layer general computing resource cooperative scheduling method and system. The method comprises the following steps: constructing a resource allocation constraint model and a routing constraint allocation model according to the to-be-processed service requirements of a plurality of service master stations, the network topology relationship among the service master stations and the resource availability of each service master station; converting the resource allocation constraint model and the routing constraint allocation model into an optimization model according to a preset service constraint condition, and decomposing the optimization model into a resource allocation sub-model and a routing optimization sub-model through a decoupling strategy; and respectively solving the resource allocation sub-model and the routing optimization sub-model to generate a general computing resource collaborative scheduling scheme, and executing corresponding data transmission and resource scheduling operation according to the general computing resource collaborative scheduling scheme. Therefore, network topology constraint and dynamic computing power limitation are processed in a layered manner, convergence is accelerated, and real-time scheduling of a high-dimensional complex scene is guaranteed; the method supports dynamic topology and elastic resource allocation, and is suitable for scenes such as edge calculation and smart grid master station coordination.

The invention discloses an ad hoc network dynamic topology routing optimization method and system based on a Deepseek lightweight large model, and the method specifically comprises the steps: collecting the information of each node in an ad hoc network, and standardizing the node information into a feature vector format which can be analyzed by the Deepseek model; the standardized node feature vectors are input into a Deepseek model, and the topological structure change trend in a short time in the future is predicted; generating a routing path selection strategy based on a topology change trend predicted by the model, testing in an ad hoc network simulation platform, and adjusting feature weight distribution of the model according to a test result; and deploying the adjusted strategy to an actual network, collecting routing performance data in real time as a new sample input model, iteratively updating the model, and improving the accuracy of topology prediction and routing optimization. According to the method, a response can be quickly made to a new network topology, the convergence speed is increased, accurate routing selection can be realized, node energy consumption is reduced, and the life cycle of the ad hoc network is prolonged.

The application relates to the technical field of network simulation, in particular to a network simulation method and device, computer equipment and computer program product. The method provided by the application comprises the following steps: obtaining network topology information and service information of a network to be simulated; constructing a simulation network matched with the network to be simulated in a preset simulation environment according to the network topology information, triggering routing convergence based on a preset internal gateway protocol, and enabling the simulation network to reach a stable state; obtaining network state information of the simulation network after the simulation network reaches the stable state, and performing service path calculation and statistics in a preset numerical simulation model according to the network state information and the service information, and generating a simulation result of the network to be simulated. The method provided by the application realizes network simulation considering the limitations of simulation scale and calculation efficiency.

The invention discloses a hybrid orbit constellation dynamic routing method based on OSPF improvement, and belongs to the technical field of network routing. According to the method, a static routing table is adopted in a backbone area with a relatively fixed topological structure by utilizing the characteristic of topological change of a mixed track, an access area with relatively large topological structure change is divided into a plurality of sub-areas, static routing is adopted in the sub-areas, and dynamic routing is adopted in the sub-areas. Through the coupling design of the physical partition and the logic partition, the contradiction between the high-speed change of the satellite network topology and the routing convergence speed of the whole network is solved, the topology change is locally updated, and the global dynamic routing range is reduced by more than 70%.

The invention relates to the field of distributed system operation and maintenance, and provides a distributed log processing method and system based on intelligent routing and hierarchical convergence. The method comprises the following steps: acquiring original log data of a service system through an acquisition layer, and performing routing distribution on the original log data according to an intelligent routing strategy to obtain routing log data; transmitting the routing log data to a processing layer, and performing cleaning and convergence calculation on the routing log data through the processing layer to obtain index data; uploading the index data to a transport dimension warehouse of a display layer so as to carry out unified convergence display on the index data; and dynamically monitoring the bandwidth use condition through a display layer, and performing adaptive adjustment on a log transmission path and an index convergence granularity based on a preset bandwidth threshold strategy to complete distributed log processing. According to the invention, the bandwidth cost of log transmission is reduced, and the bandwidth transmission capability is improved.

The application discloses a method, device and medium for accelerating convergence speed of OSPF routing protocol, and belongs to the technical field of computer networks. The method comprises the following steps: constructing a backup LSDB in each OSPF router under an autonomous system. When any OSPF router detects that a link with another OSPF router is disconnected, storing the disconnected LAS in the backup LSDB of the OSPF router, and attempting to recover the connection. Then, judging whether the link disconnection time exceeds a preset threshold value: if not, checking whether the LAS in the backup LSDB is consistent with LSDB information; if yes, performing routing calculation based on the LAS in the backup LSDB, and if not, updating the OSPF router according to the LSDB information and performing calculation. If the link disconnection time exceeds the threshold value, deleting the LAS in the backup LSDB, constructing a new LAS, and transmitting the new LAS to the remaining OSPF routers in the autonomous system. The application has the technical effect of accelerating the convergence speed of the OSPF routing protocol to a certain extent.

The invention relates to convergence optimization in a network. Systems and methods herein are for a network having a recipient network device and a source network device. A source network device may be configured to advertise a route containing an attribute and at least one network address representative of the source network device. The attribute may include an identifier of the source network device, the at least one network address having a prefix associated with a host of the source network device. The receiving network device may determine convergence for routing data packets from the receiving network device based in part on a determination that the identifier matches at least the prefix of the route advertised by the source network device. When the convergence determination is performed using only one routing update having an identifier at least matching the prefix, the convergence determination may be performed more quickly, which allows the receiving network device to identify and use only one routing update.

The embodiment of the invention provides a Peer-based route atomization processing method and device and electronic equipment. In the application, when a neighbor interaction message sent by a peer is received, a mapping relationship among a next-hop IP address of a to-be-synchronized route, all next-hop interfaces from the device to the IP address and a next-hop group identifier (NGID) is established in advance, so that a matched NGID is found based on the next-hop IP address carried in each route during subsequent synchronization of the route; and only one routing table item carrying the destination IP address of the route and the searched NGID is issued, and compared with the way of issuing the routing table items one by one in the related technology, only one routing table item is issued, so that the routing synchronization efficiency is greatly improved. Moreover, the atomization operation of issuing the forwarding entries to the plurality of next-hop interfaces is realized, so that the issuing states of the plurality of next-hop interfaces are kept consistent, inconsistent next-hop combinations in the convergence process are avoided, and the traffic inclination in the convergence period is eliminated.

This invention discloses a chip backend global routing method based on state-aware reinforcement learning, comprising: establishing a standardized global routing operation environment based on information design input files of one or more benchmark design objects, and constructing neutral global baseline results; performing effect screening and regional capability verification to obtain the safety factor value set, training action space, and regional capability mapping of each benchmark design object; performing probe routing to obtain probe routing results and their structured probe indices; constructing state-aware feature vectors; performing reinforcement learning decision-making and deriving regional resource adjustment parameters to obtain formal global routing parameter decision results and regional resource adjustment parameters; calculating reward values ​​and performing update gating, equivalent deduplication, and candidate confirmation for iterative training; and outputting structured results for archiving to obtain traceable and reproducible global routing optimization results. This invention improves the stability of training convergence and the consistency of the final optimization results.

The invention relates to a system for realizing hyper-converged cross-platform gateway grid fusion management and control, which comprises an infrastructure layer, a data surface layer and a control surface layer, and is characterized in that the infrastructure layer is used as a bottom layer support, integrates cloud resources and local infrastructures, and manages various heterogeneous computing resources; the data surface layer is connected with the infrastructure layer to realize routing and filtering of traffic, routing forwarding of south-north traffic and routing forwarding of east-west traffic; and the control surface layer is connected with the data surface layer and is used for converting an expected flow control state into a specific execution strategy, detecting strategy conflicts and converting a unified strategy into a specific configuration format of each component. By adopting the system, the method and the device for realizing hyper-converged cross-platform gateway grid convergence management and control, the processor and the computer readable storage medium thereof, the operation and maintenance efficiency is optimized, the resource utilization rate is improved, multiple runtime environment convergence is supported, unified flow management and control of a convergence gateway and a service grid are supported, an intelligent strategy is generated, and the labor cost is saved.

This invention provides a protocol-independent satellite network multicast method. It employs an IGP unicast routing protocol to achieve network-wide route convergence, obtaining unicast routing tables for each satellite. The bit index forwarding table corresponding to each port is calculated using the unicast routing table, and multicast traffic forwarding is achieved based on the bit index forwarding table. This invention fills a gap in current satellite network multicast technology, alleviating bandwidth pressure on satellite networks. It avoids using traditional complex multicast protocols like PIM used on satellites, reducing bandwidth overhead and processor pressure caused by maintaining multicast groups and multicast trees. This invention does not require extending IS-IS or OSPFv3 protocol interactions with SID tags such as END.BIER; it only requires underlying support for standard IGP protocols, avoiding modifications to existing standard protocols and simplifying implementation. This invention can be applied not only to IP-based protocol stacks but also extended to non-IP protocol stacks, as long as the underlying layer supports dynamic routing protocols. This solution has the advantages of wide applicability and strong scalability.