A scheme to maintenance the maximum link load based on load ranking

摘要

This paper proposes a scheme to reduce the number of advertisements when a link load is changed in a network by which the maximum link load is required for some operation. Each node advertises every link information of its corresponded link in the network. In the proposed scheme, only the link information that the values of their link loads are the top ranks is kept at each node, while the information of every link is kept in a conventional scheme. Only the link information that is necessary for the maximum link load determination is advertised. It is different from the conventional scheme that the link information has to be advertised every time that the link load is updated. Numerical results via simulation show that the proposed scheme reduces 92% of the number of advertisements compared with the conventional scheme. The optimum number of maximum ranks is four in our examined network.