TY - GEN
T1 - On network traffic concentration and updating interval for proactive recovery method against large-scale network failures
AU - Horie, Takuro
AU - Hasegawa, Go
AU - Kamei, Satoshi
AU - Murata, Masayuki
PY - 2009/12/1
Y1 - 2009/12/1
N2 - Proactive recovery methods from network failures, based on multiple routing configurations, are effective for quick failure recovery, as compared with reactive recovery methods. However, there are two major problems, especially when we consider recovering from large-scale network failures: updating interval for recalculation of routing configurations against network growth, and network traffic concentration on specific nodes and links after recovering failures. In this paper, we first propose a light-weight and distributed algorithm for updating routing configurations when new nodes and links join the network, which does not need overall recalculation. We then evaluate the proactive recovery method for large-scale network failures, with proposed algorithm from the viewpoint of above two problems. Through numerical evaluation results, we find that to maintain the recovery performance, we should recalculate the routing configurations when the network grows by roughly 5-10%. We also present that the degree of network traffic concentration decreases when we employ a hop-by-hop selection mechanism of routing configuration.
AB - Proactive recovery methods from network failures, based on multiple routing configurations, are effective for quick failure recovery, as compared with reactive recovery methods. However, there are two major problems, especially when we consider recovering from large-scale network failures: updating interval for recalculation of routing configurations against network growth, and network traffic concentration on specific nodes and links after recovering failures. In this paper, we first propose a light-weight and distributed algorithm for updating routing configurations when new nodes and links join the network, which does not need overall recalculation. We then evaluate the proactive recovery method for large-scale network failures, with proposed algorithm from the viewpoint of above two problems. Through numerical evaluation results, we find that to maintain the recovery performance, we should recalculate the routing configurations when the network grows by roughly 5-10%. We also present that the degree of network traffic concentration decreases when we employ a hop-by-hop selection mechanism of routing configuration.
KW - Large-scale network failures
KW - Network growth
KW - Proactive failure recovery
KW - Routing
UR - http://www.scopus.com/inward/record.url?scp=77953793666&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77953793666&partnerID=8YFLogxK
U2 - 10.1109/ATNAC.2009.5464910
DO - 10.1109/ATNAC.2009.5464910
M3 - Conference contribution
AN - SCOPUS:77953793666
SN - 9781424473229
T3 - 2009 Australasian Telecommunication Networks and Applications Conference, ATNAC 2009 - Proceedings
BT - 2009 Australasian Telecommunication Networks and Applications Conference, ATNAC 2009 - Proceedings
T2 - 2009 Australasian Telecommunication Networks and Applications Conference, ATNAC 2009
Y2 - 10 November 2009 through 11 November 2009
ER -