Simple method with link cost setting for simulating traffic congestion in disaster-affected networks

被引:0
作者
Hashimoto M. [1 ]
Koyama S. [2 ]
Utsumi T. [1 ]
Sakano T. [3 ]
机构
[1] Graduate School of Engineering Science, Akita University, 1-1, Tegatagakuen-machi, Akita
[2] Graduate School of Engineering and Resource Science, Akita University, 1-1, Tegatagakuen-machi, Akita
[3] Advanced Telecommunications Research Institute International, 2-2-2, Hikaridai, Seika-cho, Soraku-gun, Kyoto
关键词
Congestion; Disaster network; Japan photonic network model; Link cost; Routing; Shortest path;
D O I
10.1541/ieejeiss.137.445
中图分类号
学科分类号
摘要
We propose a method that addresses the shortest path problem in estimating network traffic distribution when a network infrastructure is damaged at the time of disaster. It uses link costs that are different from those used prior to the disaster. There are three assumptions: (1) traffic whose source and destination points lie outside the disaster-affected area do not use damaged networks, (2) Traffic that traverses the border of the disaster-affected area uses at most one link, (3) traffic that is related to the disaster-affected area does not exit disaster area. We use different link costs from those used prior to the disaster time, and the shortest paths under the link costs that satisfy conditions (1), (2), and (3) above. In this paper, we introduce a method for setting link costs and adapt it to yield a real networking model. We set traffic patterns and a disaster-affected area and carry out simulations. The simulation results confirm that it is possible to simulate the changes in volume and the distribution of traffic owing on each link. © 2017 The Institute of Electrical Engineers of Japan.
引用
收藏
页码:445 / 451
页数:6
相关论文
共 9 条
[1]  
Kobayashi M., Experience of infrastructure damage caused by the great East Japan earthquake and countermeasures against future disasters, IEEE Communications Magazine, 52, 3, pp. 23-29, (2014)
[2]  
Sakano T., Et al., A rapidly restorable phone service to counter catastrophic loss of telecommunications facilities, IEEE R10-HTC2013, pp. 200-205, (2013)
[3]  
Belding-Royer E., Das S., Ad hoc on-demand distance vector (aodv) routing, IETF RFC 3561, (2003)
[4]  
Koyama S., Hashimoto M., Multi-topology-based simple simulation for large area damaged network, IEEE R10-HTC2013, (2013)
[5]  
Ahuja R., Magnanti T., Orlin J., Network Flows, (1993)
[6]  
Sakano T., Et al., A study on a Photonic Network Model Based on the regional characteristic of Japan, pp. 1-6, (2013)
[7]  
Moy J., OSPF version 2, (1999)
[8]  
Rekhter Y., A border gateway protocol, IETF RFC, 4271, (2005)
[9]  
10th International Workshop on Seismic Microzoning and Risk Reduction, (2013)