Title :
A scheme to maintenance the maximum link load based on load ranking
Author :
Kitsuwan, Nattapong ; Oki, Eiji
Author_Institution :
Dept. of Commun. Eng. & Inf., Univ. of Electro-Commun., Tokyo, Japan
Abstract :
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.
Keywords :
IP networks; numerical analysis; routing protocols; telecommunication links; IP network; OSPF network; advertisement number reduction; internet protocol network; load ranking; maintenance scheme; maximum link load determination; numerical simulation; open shortest path first network; Advertising; Computer simulation; IP networks; Load modeling; Network topology; Resource management; Routing;
Conference_Titel :
Access Spaces (ISAS), 2011 1st International Symposium on
Conference_Location :
Yokohama
Print_ISBN :
978-1-4577-0716-2
Electronic_ISBN :
978-1-4577-0715-5
DOI :
10.1109/ISAS.2011.5960951
