Link capacity design for shared protection with limited traffic information
Link capacity for primary and backup paths in a telecommunication carrier network can be computed if the authors are able to use end‐to‐end traffic volume information between source and destination nodes in a network. However, this information is not easily obtained because traffic measurement puts...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-03-01
|
Series: | IET Networks |
Subjects: | |
Online Access: | https://doi.org/10.1049/iet-net.2012.0016 |
id |
doaj-aa41161e1e1e4757961f2a36ff793b40 |
---|---|
record_format |
Article |
spelling |
doaj-aa41161e1e1e4757961f2a36ff793b402021-09-08T18:13:10ZengWileyIET Networks2047-49542047-49622013-03-012131010.1049/iet-net.2012.0016Link capacity design for shared protection with limited traffic informationRyutaro Matsumura0Haruhisa Hasegawa1NTT Network Technology LaboratoriesNTT Corporation9‐11, Midori‐Cho 3‐Chome Musashino‐ShiTokyo180‐8585JapanNTT Network Technology LaboratoriesNTT Corporation9‐11, Midori‐Cho 3‐Chome Musashino‐ShiTokyo180‐8585JapanLink capacity for primary and backup paths in a telecommunication carrier network can be computed if the authors are able to use end‐to‐end traffic volume information between source and destination nodes in a network. However, this information is not easily obtained because traffic measurement puts a heavy load on network equipment, and measuring devices are not installed on all the links in the network. Network carriers must estimate the link capacity under limited traffic information. The authors explain a link capacity design problem for shared protection to work within this limitation. Shared protection is effective for economical network design; however, it requires time‐consuming computation. Therefore the authors propose a faster formulation for shared protection that takes the form of a maximum flow problem. The authors evaluated our formulation in terms of the solution's error and showed the advantage of using shared protection.https://doi.org/10.1049/iet-net.2012.0016shared protectionlimited traffic informationtelecommunication carrier networkend to end traffic volume informationsource nodesdestination nodes |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Ryutaro Matsumura Haruhisa Hasegawa |
spellingShingle |
Ryutaro Matsumura Haruhisa Hasegawa Link capacity design for shared protection with limited traffic information IET Networks shared protection limited traffic information telecommunication carrier network end to end traffic volume information source nodes destination nodes |
author_facet |
Ryutaro Matsumura Haruhisa Hasegawa |
author_sort |
Ryutaro Matsumura |
title |
Link capacity design for shared protection with limited traffic information |
title_short |
Link capacity design for shared protection with limited traffic information |
title_full |
Link capacity design for shared protection with limited traffic information |
title_fullStr |
Link capacity design for shared protection with limited traffic information |
title_full_unstemmed |
Link capacity design for shared protection with limited traffic information |
title_sort |
link capacity design for shared protection with limited traffic information |
publisher |
Wiley |
series |
IET Networks |
issn |
2047-4954 2047-4962 |
publishDate |
2013-03-01 |
description |
Link capacity for primary and backup paths in a telecommunication carrier network can be computed if the authors are able to use end‐to‐end traffic volume information between source and destination nodes in a network. However, this information is not easily obtained because traffic measurement puts a heavy load on network equipment, and measuring devices are not installed on all the links in the network. Network carriers must estimate the link capacity under limited traffic information. The authors explain a link capacity design problem for shared protection to work within this limitation. Shared protection is effective for economical network design; however, it requires time‐consuming computation. Therefore the authors propose a faster formulation for shared protection that takes the form of a maximum flow problem. The authors evaluated our formulation in terms of the solution's error and showed the advantage of using shared protection. |
topic |
shared protection limited traffic information telecommunication carrier network end to end traffic volume information source nodes destination nodes |
url |
https://doi.org/10.1049/iet-net.2012.0016 |
work_keys_str_mv |
AT ryutaromatsumura linkcapacitydesignforsharedprotectionwithlimitedtrafficinformation AT haruhisahasegawa linkcapacitydesignforsharedprotectionwithlimitedtrafficinformation |
_version_ |
1717761967765061632 |