154 results about "Network overhead" patented technology

A system for adaptively caching network communication protocols provides improved efficiency and performance through a multi-level cache architecture. The system monitors performance metrics and synchronizes cache contents across distributed nodes using a hierarchical structure. Protocol cache requirements are predicted based on usage patterns, enabling proactive cache management. The system compresses cached protocols using existing codebooks to optimize storage and transmission efficiency. Integration with event-driven data communication systems enables seamless protocol selection and translation. The caching system works in conjunction with transaction managers and protocol predictors to enhance network communication performance. The system maintains cache coherency across local, regional, and global cache levels while minimizing network overhead and optimizing protocol availability. By predicting and pre-caching likely needed protocols, the system reduces protocol negotiation latency and improves overall network communication efficiency.

The invention relates to the technical field of cloud computing resource management, and discloses a storage and computing resource dynamic recombination management method, system, device and medium, which comprises the following steps: constructing a hierarchical management architecture comprising a local control center and a global network control center, constructing a uniform resource topology view of the whole network through a heartbeat mechanism and metadata reporting, automatic registration and state monitoring of calculation and storage resources are realized; multi-target task scheduling is carried out by adopting an improved genetic algorithm fused with a greedy strategy, and on the premise of meeting service quality constraints, localization processing of calculation tasks is preferentially realized to reduce network overhead; an elastic telescoping mechanism based on an ARIMA-LSTM mixed time sequence prediction model is introduced, and through deep learning of historical load data, a load peak value is pre-judged in advance and the scale of a resource pool is dynamically adjusted. According to the method, the global utilization rate of heterogeneous resources is effectively improved, and lossless rapid expansion and dynamic recombination of storage and calculation resources are realized.

The invention discloses an anti-cavity underwater acoustic sensor network non-uniform clustering routing protocol based on particle swarm optimization, and relates to underwater communication. Through integrating hole node evaluation into a fitness function of a particle swarm optimization algorithm, collaborative optimization of cluster head selection and hole avoidance is realized according to node residual energy, node depth and node degree information, so that connectivity and stability of a network are improved. Meanwhile, an inter-cluster cooperative data transmission mechanism is provided, and through a cluster head-gateway load balancing strategy, premature failure caused by frequent relay tasks of individual cluster heads is reduced, so that the network load balance is improved, and the life cycle is prolonged. Besides, on the basis of a classic Dijkstra algorithm, an edge weighting function is constructed in combination with hop count, node residual energy and inter-node distance, and a cluster head traversal termination principle is introduced to optimize path search efficiency and reduce network overhead, so that reliability, energy efficiency and overall communication performance of the underwater acoustic sensor network are remarkably improved.

The invention provides an edge computing network-oriented energy efficiency service deployment and delivery method and system, and relates to the technical field of edge computing, and the method comprises the steps: extracting multi-dimensional service features, carrying out the coding fusion of the extracted multi-dimensional service features, and generating a global context feature representation; in combination with a system load dynamic prediction result, adaptively adjusting an upper layer decision time scale based on the global context feature representation; under the adjusted upper-layer time scale, executing a service deployment decision and a base station dormancy / activation switching decision; under the fine-grained lower-layer time scale, executing a service delivery decision and a resource allocation decision based on the real-time service request; and coordinating the decision process through a double-time-scale hierarchical learning framework. According to the method provided by the invention, the long-term network overhead can be effectively reduced, the dynamic service request can be effectively responded, the processing capability of the time coupling relationship between deployment and delivery weeks is improved, and the system cost is reduced.

The invention discloses a dynamic self-adaptive edge-cloud cooperative computing segmentation point and compression strategy adjustment method. The core of the method is to deploy a dynamic decision engine on edge equipment. The engine senses a network state (such as bandwidth and delay) and a task priority specified by an application in real time, and according to a preset decision logic (such as a look-up table or a lightweight prediction model), a deep learning model which supports multiple segmentation points and is equipped with a variable bit rate hierarchical quantization feature compression model for each segmentation point is used for performing a multi-segmentation-point hierarchical quantization feature compression model on the basis of the multi-segmentation-point hierarchical quantization feature compression model, so that the multi-segmentation-point hierarchical quantization feature compression model is obtained. And dynamically selecting an optimal model segmentation point and feature compression level combination. The combination is transmitted to the cloud, and the cloud loads the corresponding back-end model to complete calculation. Through the dynamic adjustment mechanism, the real-time optimal balance among the reasoning delay, the task precision and the network overhead is realized, and the performance stability, the resource utilization rate and the adaptability of the system in a variable environment are remarkably improved.

The invention discloses a data encoding and decoding method and device for power regulation and control application service information interaction, and belongs to the technical field of power system regulation and control, and the method comprises the steps: obtaining structured data from a power regulation and control system through a client, the structured data comprising power system operation parameters; calling a coding interface through a client, coding the structured data into a binary data stream according to a predefined message description language specification, and transmitting the binary data stream to a server through a power communication network through the client; receiving the binary data stream through a server, and calling a decoding interface to decode the binary data stream into structured data; the decoded structured data is transmitted to a power regulation and control application service module for use through the server side; according to the method, the network overhead in the interaction process of the power regulation and control system is greatly optimized, and the overall performance and safety of the system are improved.

A method, system, device, and medium for delay-tolerant network caching based on the minimax ant colony algorithm are disclosed. The method includes: first, classifying information; when a new message arrives, if the cache is not full, the new message is allowed into the cache; otherwise, the total pheromone concentration of the new message determines whether to allow it into the cache. Regardless of whether the new message is allowed into the cache, the pheromone concentration of similar messages in the cache is updated, and the updated pheromone concentration of similar messages is compared with a given pheromone concentration range. If the pheromone concentration does not exceed the range, caching ends; if it exceeds the range, the upper or lower limit of the given pheromone concentration range is used. The system, device, and medium are used to implement a delay-tolerant network caching method based on the minimax ant colony algorithm. This invention introduces the concept of pheromone concentration to determine whether the total pheromone concentration of a new message entering the cache is minimum, thus deciding whether to discard the new message. This has the characteristics of improving the message arrival rate in delay-tolerant networks and reducing network overhead.

The utility model belongs to the technical field of pipeline installation, and particularly relates to a heat supply network overhead pipeline support which comprises a supporting assembly capable of enabling the support to stably erect a pipeline at the required height, and a fixing assembly capable of enabling the support to be in contact with or separated from the pipeline conveniently is arranged on the supporting assembly. A buffering assembly capable of providing certain buffering for the impacted pipeline is arranged in the fixing assembly. Through the arrangement of the pressing frame and the two brackets, after the pressing frame and the brackets are connected through external bolts, the pressing frame and the brackets can jointly and stably support and limit a pipeline, and when the pipeline needs to be maintained and the like, only the pressing frame and the brackets need to be separated, so that the pressing frame and the brackets are separated from each other. The positions of the two brackets on the buckling seat can be quickly changed through the adjusting piece, so that the pipeline is not shielded any more, and maintenance and other work can be smoothly carried out.

The application discloses a configuration updating method of a wireless self-organizing network, and relates to the technical field of wireless self-organizing networks, and comprises the following steps: S1, the wireless self-organizing network receives an external configuration command, and divides nodes into master nodes and slave nodes; S2, the master node updates first configuration information data according to the external configuration command, and sends the first configuration information data to the slave nodes; S3, the slave nodes update second configuration information data; S4, after the master node confirms that all the slave nodes have updated the second configuration information data, the value of a first update flag in the first configuration information data is updated, and the first configuration information data is sent to the slave nodes; S5, after the slave nodes update the value of a second update flag in the second configuration information data, the configuration of the slave nodes is updated; and S6, after the master node confirms that all the slave nodes have updated the configuration, the configuration of the master node is updated. In this way, unnecessary network overhead is reduced, and the efficiency and performance of configuration information data transmission are improved.

This invention relates to a method and system for multi-source information knowledge fusion and intelligent retrieval. The method includes: acquiring multi-source heterogeneous data and performing unified knowledge modeling on the multi-source heterogeneous data to obtain a unified knowledge framework. Based on the unified knowledge framework, a large language model is invoked to perform structured preprocessing on the multi-source heterogeneous data to generate structured knowledge triples. The structured knowledge triples are then structured using attribute graphs, and the associated data of each entity is vectorized and stored using an embedding model to obtain a fused knowledge body. User query requests are received and responded to by performing deep analysis on the user input data to obtain the user's query intent and query elements. A condition graph is constructed based on the user's query intent and query elements, and the condition graph is mapped to a knowledge network for entity localization and condition graph matching to generate structured retrieval results. This reduces network overhead and scheduling latency, and improves retrieval response speed and accuracy.

A cross-chain architecture design and performance analysis method for large-scale Internet of Things based on IOTA blockchain, a multi-field, large-scale distributed Internet of Things, trusted, multi-chain, intelligent and efficient blockchain architecture is designed based on IOTA, which realizes low-cost trusted interconnection of blockchains in different fields and establishes a safe shared ecological model. The delay of one-hop transmission is derived using stochastic calculus theory. From the aspects of consensus time, throughput, security and cross-chain interaction efficiency, the performance of the new architecture is analyzed, providing a theoretical basis for the landing of blockchain. At the same time, in order to speed up information dissemination and reduce network overhead, a directional propagation method is proposed to replace the rumor algorithm of IOTA, reducing network overhead.

This invention relates to the field of databases, and in particular to a backup method and apparatus based on a distributed graph database. It mainly includes: generating a corresponding transaction accessible table according to a backup command, and broadcasting the transaction accessible table to all graph nodes that need to be backed up; each graph node generating a top-level backup task based on the transaction accessible table, and then deriving backup tasks for each level from the top-level backup task; each graph node asynchronously executing the bottom-level backup task, obtaining user data for backup through the bottom-level backup task, and backing up the user data on its own graph node. This invention can improve the rational utilization of computer resources, achieve the effect of fully parallel backup, and greatly improve the efficiency and performance of backup. It also reduces network overhead during recovery, significantly improving recovery efficiency.

The application provides a resource scheduling method and system, a computing device and a storage medium, wherein the method comprises the following steps: a first server determines a first network channel connected with a second server based on service allocation information and resource allocation information, wherein the first network channel comprises a reserved network channel; the first server controls the second server and a third server to receive and process the first service and the second service according to the service allocation information and the resource allocation information; in the case that the third server completes the second service and the second server does not complete the first service, the first server allocates the remaining computing resources of the third server to the second server through the reserved network channel; the dynamic allocation of the computing resources is realized, the network overhead and the processing time of the target service are saved, and the system maintenance difficulty is reduced without changing the network topology structure.

A hierarchical proxy deployment method includes: performing information collection and information interaction in a hierarchical proxy deployment architecture to obtain bandwidths and latencies of all inter-node communication links; and selecting an optimal proxy deployment solution from all feasible proxy deployment solutions based on the bandwidths and latencies of all the inter-node communication links. According to the method, a hierarchical proxy deployment architecture is used. An optimal proxy deployment solution is formed by selecting the optimal location and the optimal number of proxies for deployment to meet the transmission performance requirement of network applications in 5G / B5G networks. Therefore, transmission performance requirements are satisfied by a proxy deployment with a minimized number of proxies, thereby reducing network overheads and resource waste.

The application discloses a listening method and device, a terminal and a network device; the method comprises the following steps: a network device configures a first timer, the first timer is used for starting after a terminal listens to a first wake-up signal; after listening to the first wake-up signal, the terminal starts the first timer; before the first timer expires, the terminal listens to a first paging downlink control information or a second wake-up signal. Since the first wake-up signal is used for triggering the terminal to start the first timer, the second wake-up signal is used for triggering the terminal to start a second timer, and the timing duration of the second timer is used for representing the duration of the terminal listening to a second paging downlink control information, therefore, after receiving the first wake-up signal, the first timer is used for realizing the listening to the first paging downlink control information or the second wake-up signal, so that the robustness and stability of system communication are ensured while the network overhead and terminal power consumption are saved.

The invention provides a data processing method and device. The method is realized by an attack monitoring module, an encryption module and an attack detection module of a security agent. For example, the attack monitoring module can trigger the encryption module to request the first target to encrypt the shared data in the network when monitoring that the first target is attacked by the network, so that the first target obtains security protection, and data leakage is avoided; when the data of the first target is still attacked continuously after being encrypted, the attack detection module is triggered, so that the attack detection module can determine that the attack type is the first network attack of the specified type and determine a corresponding solution, and accurate detection and disposal of the specified attack type are realized. Moreover, except for the attack monitoring module, the encryption module and the attack detection module, the attack monitoring module, the encryption module and the attack detection module are activated and run based on certain conditions instead of running continuously, so that the network overhead is reduced.

The application relates to a method and system for implementing a path pattern expression in a distributed graph database, wherein the method comprises: executing a summary application operator, wherein the summary application operator comprises a path pattern subplan and a path pattern expression subplan; that is, by using the path pattern subplan, first path data tables and second path data tables satisfying a path pattern are respectively acquired from the distributed graph database in a breadth-first traversal manner; and then by using the path pattern expression subplan, the first path data tables and the second path data tables are combined to obtain new data tables. By the application, the problem that network overhead is large in the implementation of a path pattern expression in a distributed graph database is solved, and data of a path pattern expression is acquired in a breadth-first manner, so that the data query performance is greatly improved in a graph database of a distributed architecture.

The application discloses an information security data storage system and relates to the technical field of data storage.The application solves the technical problem of avoiding the problem of resource waste or performance bottleneck caused by one-size-fits-all storage by intelligently selecting local storage or distributed storage mode according to the type, capacity size and delay requirement of data.The application dynamically selects local or distributed storage based on data capacity and delay requirement, stores small-capacity and low-delay data locally to reduce network overhead, stores large-capacity and high-delay data in a distributed manner to improve scalability, improves resource utilization, automatically deletes temporary data, combines high-frequency / low-frequency data differentiation processing, takes into account data security and space optimization, dynamically adapts different capacity data through a dynamic sharding strategy, ensures balanced distribution of data through consistent hashing and virtual nodes, and realizes dynamic load adjustment through cold / hot data layering and node performance grading, thereby improving access speed and system stability.

The present invention proposes a lightweight data security transmission method and system for wireless sensor networks. The method includes the following steps: upon network access, a central node distributes a pre-shared key, initialization vector, node sequence number, and packet sequence number to wireless sensor network nodes, and sets a corresponding key update interval and key retention time based on network scale and node performance; after network node deployment, the network nodes directly synchronize with the central node to calculate the initialization seed required for the key sequence generation algorithm; the sender and receiver implement full-duplex secure encrypted communication based on the synchronized session key; and the sender or receiver updates the session key after a preset key update interval to ensure key freshness. While ensuring secure data transmission, the present invention effectively reduces network overhead by reducing the number of interactions. It also requires low computing power and storage space on network nodes, achieving the advantages of both security and lightweightness.

The invention relates to the field of business process management, and provides a process engine asynchronous task processing method, system and device and a medium, and the method comprises the steps: a process engine packages a current to-be-processed external task into a task message, and issues the task message to a message queue; the message queue pushes the task message to the distributed workers; and under the condition that the distributed worker successfully executes the task corresponding to the task message, sending an external task completion request to the process engine, and triggering the process engine to continuously execute the step of packaging the current external task to be processed into the task message by the process engine until the task is finished. According to the method, the decoupling characteristic of the message queue is utilized to reduce the coupling degree of the process engine and the external service, the message queue actively pushes the task message to the distributed worker to reduce the network overhead, and in addition, the distributed worker sends the completion request to the process engine to push the process to continue after the task is successfully executed. And flow blocking caused by service timeout is avoided.

Embodiments of this application relate to a task allocation method, apparatus, device, and computer program product. The method includes acquiring the distribution of multiple data shards across a node cluster, the multiple data shards being processed by a first task of an application job. The node cluster includes multiple node groups, each of the multiple node groups including a group of nodes interconnected by a bus. The method also includes allocating the first task to multiple execution units executing the application job based on the distribution of the multiple data shards across the node cluster and the multiple node groups, wherein the multiple execution units run on the node cluster. Thus, by considering the characteristics of the bus interconnection within the node groups in conjunction with the location of the data to be processed when allocating tasks, it becomes possible to select execution units with the aim of minimizing cross-node data reads, thereby reducing network overhead and improving execution efficiency.

The invention discloses a multi-path insertion query optimization method based on Spark SQL, which belongs to the field of big data processing and distributed computing, and comprises the following steps: carrying out SQL rule matching; identifying whether the multi-path insertion structure is a Union multi-path insertion structure or not; extracting multiple paths of insertion public sub-plans; stripping the special logic of each branch inserted by multiple paths; constructing a multi-insertion command, and combining multi-path insertion calculation and write-in logic; replacing an original execution plan structure; according to the method, the shared CTE basic data only needs to be calculated once, so that a large amount of CPU (Central Processing Unit) computing resources are saved; multiple reading operations on the materialized CTE result are eliminated, and the disk I / O or network I / O overhead is greatly reduced; through merging computational logic, the total time of task scheduling and execution is reduced, the overall performance of the ETL operation is remarkably improved, and the effect is more obvious especially in a large data volume scene; the method is implemented on the level of a Spark SQL optimizer and is completely transparent to a user, and the user can automatically improve the performance without modifying the SQL writing method.

The invention discloses a high-precision synchronization method and system for a distributed power system, the method comprises a host and a plurality of sub-machines which are interconnected with the host in a point-to-point manner and are to be synchronized, the host and the sub-machines both adopt a CPU + FPGA architecture, and a high-precision synchronization mechanism is realized in the FPGA. According to the synchronization mechanism, synchronization compensation time and synchronization errors are calculated through a plurality of message sending periods, the step length of an interval is adjusted in a self-adaptive mode by comparing the synchronization errors with a reasonable range, and high-precision synchronization of the master machine and the slave machine is carried out. Under the condition that the processor is non-inductive, extremely high synchronization precision is achieved through extremely low network overhead occupation, the complexity and cost of distributed system synchronization design construction are reduced, and the method has high engineering application value.

The embodiment of the invention provides an information transmission method, a terminal, network equipment and a storage medium, and the method comprises the steps: determining a first opportunity set according to a first SSB received by the terminal; determining a reference point related to the first SSB; determining at least one second opportunity from the first opportunity set according to the reference point; and performing information transmission at the at least one second opportunity. According to the embodiment of the invention, the power consumption of the terminal can be reduced, the cruising ability of the terminal is improved, the network overhead can be reduced, and the random access success probability of the terminal is improved.

The invention relates to the technical field of communication, and discloses a multi-domain agile communication method and device, electronic equipment and a storage medium. The method comprises the following steps: periodically sending a first neighbor beacon to each neighbor node, and periodically receiving a second neighbor beacon sent by the neighbor node; wherein the first neighbor beacon comprises node information of each first node, and the first nodes at least comprise neighbor nodes; wherein the second neighbor beacon comprises node information of each second node; according to the second neighbor beacon, updating a neighbor table stored in the second neighbor beacon; and establishing a network route with each third node in sequence by using the neighbor node. Therefore, medium-independent network networking and path addressing functions under the centerless condition are realized. And the problem of low communication efficiency caused by an IP layer routing process is avoided. The service compatibility is good, the large networking scale is supported, and the low network overhead is kept.

The application relates to a central node routing discovery method based on a wireless Mesh network and related equipment, and relates to the technical field of wireless networks. The method comprises the following steps: acquiring a routing discovery broadcast forwarded by a previous-hop routing node to a current-hop routing node; determining the validity of the best path of the previous hop by comparing each routing node passed through by the best path of the previous hop with the current-hop routing node; in the case that the best path of the previous hop is valid, determining the best path of the current hop according to the current-hop routing node and the best path of the previous hop, and updating the routing discovery broadcast according to the best path of the current hop; forwarding the updated routing discovery broadcast to a next-hop routing node, and taking the next-hop routing node as the current-hop routing node to continue the routing discovery until the best paths of all the routing nodes to the central node are determined. The method can reduce the network overhead of routing discovery.

The invention provides a contract file deployment method and device, equipment and a storage medium, and relates to the technical field of contract file installation. The method comprises the following steps: preprocessing a contract file to obtain metadata of the contract file; uploading the contract file and metadata thereof to a first accounting node of the current mechanism domain; creating a first storage directory according to the information of the partition to which the first bookkeeping node belongs and the metadata, and storing the contract file to the first storage directory; and the first bookkeeping node initiates a contract deployment transaction and synchronizes the contract deployment transaction to other bookkeeping nodes, so that the other bookkeeping nodes actively pull the contract file from the first bookkeeping node according to the contract deployment transaction and install the contract file. According to the method, the contract file is stored in the single bookkeeping node, so that the block chain network can manage and maintain the contract file conveniently, the network overhead and storage cost of contract file installation are reduced, and meanwhile, the installation efficiency of the contract file is also improved.

The application provides a kind of vehicle networking geographic position routing method (HIGR) based on improved firefly swarm algorithm, one aspect, the method utilizes dynamic clustering algorithm to form cluster member node-cluster head node-RSU three-layer control model, with cluster member information table instead of neighbor node table, reduce the control overhead of node broadcast;Another aspect, in the cluster head node selection stage, RSU establishes evaluation function according to the relative speed of node, boundary stability factor and node destination factor, selects the node with the maximum evaluation function value as cluster head node to reduce cluster maintenance overhead;While node runs improved firefly swarm algorithm in routing stage, reduce network delay.HIGR of the application has good performance on packet delivery rate, end-to-end delay, throughput and network overhead, can balance beacon message update frequency, control overhead, improve the performance of network.

The present invention discloses a data management method, device, computer program product and storage medium, which belong to the field of distributed storage systems and are used to slice data from two dimensions, time and space, and then store it in a distributed storage system, solving the problems of high network overhead and high access delay when accessing a distributed storage system. According to the segment characteristics of the data to be stored in the time dimension and the regional characteristics in the space dimension, multiple target time segments and multiple target space regions are determined; then, the data to be stored is sliced ​​according to the target time segments and target space regions, and then the data slices are completely stored in the corresponding nodes. Since the data "with correlation in the time and space dimensions" is centrally stored in the nodes in the form of data slices, when accessing data in the distributed storage system, the number of nodes that need to be accessed is theoretically reduced, thereby reducing network overhead and access delay.

The application belongs to the field of Internet of Things collaborative computing, and discloses an analysis method and system for accurate cooperation between Internet of Things terminals, which is suitable for Internet of Things scenes such as intelligent agriculture. The method builds an Internet of Things cluster containing high-power and low-power machines, and runs a bidirectional PIM multicast protocol between routers. The system realizes device state synchronization and assisted path pre-construction through an improved IGMP / PIM protocol. When a low-power machine initiates a task request, it can be accurately scheduled to a high-power machine according to the pre-built path. A state-triggered update mechanism is adopted, which only triggers global state revocation when all subordinate devices are busy, greatly reducing network overhead. The system realizes efficient power cooperation between devices, significantly improving task response speed and resource utilization.