User individuation priority routing algorithm based on content coverage and feedback mechanism

Abstract

The invention relates to a priority routing algorithm, comprising the following steps of: generating a network topology into a loop-free structure according to a minimum spanning tree algorithm, and setting a plurality of adjusting nodes; subscribing information by a subscriber, and setting individuation priority; transmitting the subscribed information in a network, storing one subscription routing table by each node, sorting every item of the routing table based on the priority obtained by the subscriber, receiving the subscription information, matching according to the routing table, and deciding whether the subscription information is updated to the routing table or not by virtue of a mergence coverage routing algorithm; issuing an event to an agent node by an issuer, matching with the subscription routing table, and if matching is successful, routing the event to the subscriber which is interested to the event; carrying out periodic statistics on information average of subscriber information by a boundary agent, and sending the information average to the adjusting nodes; adjusting by the adjusting nodes according to the average, flow and subscriber weight, and returning non-zero adjustment values to the boundary agent; and adjusting the priority of a local routing table by the boundary agent, and flooding the priority to a network. The priority routing algorithm disclosed by the invention has the advantages of high efficiency, fairness and low redundancy.

Description

technical field [0001] The invention relates to the network field, in particular to a user personalized priority routing algorithm based on content coverage and feedback mechanism. Background technique [0002] At present, in the network system that collects a huge amount of information, such as the "Shanghai Rail Transit Power Safety Monitoring System", the existing content-based Pub / Sub system architecture is adopted, and the information subscribed by the monitoring site will enter the network after the event is released. , which in turn is delivered to the corresponding subscribers. However, when the amount of information is too large or the network is unstable, message distribution is prone to congestion. At this time, all blocked messages will be queued on the intermediate node, trying to be sent to the next hop in the order of first come, first come, and then the message may Congestion continues at the next hop. In a worse case, the congestion may be too severe and di...

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to provide a user personalized priority routing algorithm based on content coverage and feedback mechanism, to solve the problem that the existing content coverage routing algorithm and priority routing algorithm do not support users to personalize message priority, message Transmission is subject to large bandwidth restrictions, prone to network congestion and other technical problems resulting in low user satisfaction

Images