Abstract
In a high-speed backbone network, the failure of a network link may cause large data losses, so it is necessary to reserve spare network resources for faster recovery. The conventional protection methods to reserve backup routes do not consider the failure probability of each network link, so the same amount of network resources for the backup route are needed regardless of the failure probability of network links. This leads a decrease in the number of connections that can be accepted into the network. This paper proposes a routing and capacity allocation method that guarantees the expected value of allocated capacity. We formulate a mixed integer liner programming model for the proposed method. We conduct simulations to study the advantage of the expected capacity guaranteed routing over the conventional routing method in terms of bandwidth blocking probability. The results show that the proposed method reduces the bandwidth blocking probability to about 1/3 as compared to that of the conventional path protection method.
| Original language | English |
|---|---|
| Title of host publication | LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks |
| Publisher | IEEE Computer Society |
| Volume | 2017-June |
| ISBN (Electronic) | 9781538607282 |
| DOIs | |
| Publication status | Published - 2017 Jul 7 |
| Event | 23rd IEEE International Symposium on Local and Metropolitan Area Networks, LANMAN 2017 - Osaka, Japan Duration: 2017 Jun 12 → 2017 Jun 14 |
Other
| Other | 23rd IEEE International Symposium on Local and Metropolitan Area Networks, LANMAN 2017 |
|---|---|
| Country | Japan |
| City | Osaka |
| Period | 17/6/12 → 17/6/14 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Software
- Electrical and Electronic Engineering
- Communication
Cite this
Expected capacity guaranteed routing method based on failure probability of links. / Sekigawa, Shu; Oki, Eiji; Sato, Takehiro; Okamoto, Satoru; Yamanaka, Naoaki.
LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks. Vol. 2017-June IEEE Computer Society, 2017. 7972156.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Expected capacity guaranteed routing method based on failure probability of links
AU - Sekigawa, Shu
AU - Oki, Eiji
AU - Sato, Takehiro
AU - Okamoto, Satoru
AU - Yamanaka, Naoaki
PY - 2017/7/7
Y1 - 2017/7/7
N2 - In a high-speed backbone network, the failure of a network link may cause large data losses, so it is necessary to reserve spare network resources for faster recovery. The conventional protection methods to reserve backup routes do not consider the failure probability of each network link, so the same amount of network resources for the backup route are needed regardless of the failure probability of network links. This leads a decrease in the number of connections that can be accepted into the network. This paper proposes a routing and capacity allocation method that guarantees the expected value of allocated capacity. We formulate a mixed integer liner programming model for the proposed method. We conduct simulations to study the advantage of the expected capacity guaranteed routing over the conventional routing method in terms of bandwidth blocking probability. The results show that the proposed method reduces the bandwidth blocking probability to about 1/3 as compared to that of the conventional path protection method.
AB - In a high-speed backbone network, the failure of a network link may cause large data losses, so it is necessary to reserve spare network resources for faster recovery. The conventional protection methods to reserve backup routes do not consider the failure probability of each network link, so the same amount of network resources for the backup route are needed regardless of the failure probability of network links. This leads a decrease in the number of connections that can be accepted into the network. This paper proposes a routing and capacity allocation method that guarantees the expected value of allocated capacity. We formulate a mixed integer liner programming model for the proposed method. We conduct simulations to study the advantage of the expected capacity guaranteed routing over the conventional routing method in terms of bandwidth blocking probability. The results show that the proposed method reduces the bandwidth blocking probability to about 1/3 as compared to that of the conventional path protection method.
UR - http://www.scopus.com/inward/record.url?scp=85027278578&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85027278578&partnerID=8YFLogxK
U2 - 10.1109/LANMAN.2017.7972156
DO - 10.1109/LANMAN.2017.7972156
M3 - Conference contribution
AN - SCOPUS:85027278578
VL - 2017-June
BT - LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks
PB - IEEE Computer Society
ER -