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.