IEICE TRANSACTIONS on Communications
Efficiently Constructing Candidate Set of Network Topologies
Summary :
Network topology significantly affects network cost, path length, link load distribution, and reliability, so we need to consider multiple criteria with different units simultaneously when designing a network's topology. The analytic hierarchy process (AHP) is a technique of balancing multiple criteria in order to reach a rational decision. Using AHP, we can reflect the relative importance of each criterion on the evaluation result; therefore, we have applied it to network topology evaluation in past research. When evaluating network topologies using AHP, we need to construct the set of topology candidates prior to the evaluation. However, the time required to construct this set greatly increases as the network size grows. In this paper, we propose applying a binary partition approach for constructing a topology candidate set with dramatically reduced calculation time. To reduce the calculation time, we introduce an upper limit for the total link length. Although the results of AHP are affected by introducing the upper limit of the total link length, we show that desirable topologies are still selected in AHP.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E96-B No.1 pp.163-172
- Publication Date
- 2013/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E96.B.163
- Type of Manuscript
- PAPER
- Category
- Network Management/Operation
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Noriaki KAMIYAMA, "Efficiently Constructing Candidate Set of Network Topologies" in IEICE TRANSACTIONS on Communications,
vol. E96-B, no. 1, pp. 163-172, January 2013, doi: 10.1587/transcom.E96.B.163.
Abstract: Network topology significantly affects network cost, path length, link load distribution, and reliability, so we need to consider multiple criteria with different units simultaneously when designing a network's topology. The analytic hierarchy process (AHP) is a technique of balancing multiple criteria in order to reach a rational decision. Using AHP, we can reflect the relative importance of each criterion on the evaluation result; therefore, we have applied it to network topology evaluation in past research. When evaluating network topologies using AHP, we need to construct the set of topology candidates prior to the evaluation. However, the time required to construct this set greatly increases as the network size grows. In this paper, we propose applying a binary partition approach for constructing a topology candidate set with dramatically reduced calculation time. To reduce the calculation time, we introduce an upper limit for the total link length. Although the results of AHP are affected by introducing the upper limit of the total link length, we show that desirable topologies are still selected in AHP.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.163/_p
Copy
@ARTICLE{e96-b_1_163,
author={Noriaki KAMIYAMA, },
journal={IEICE TRANSACTIONS on Communications},
title={Efficiently Constructing Candidate Set of Network Topologies},
year={2013},
volume={E96-B},
number={1},
pages={163-172},
abstract={Network topology significantly affects network cost, path length, link load distribution, and reliability, so we need to consider multiple criteria with different units simultaneously when designing a network's topology. The analytic hierarchy process (AHP) is a technique of balancing multiple criteria in order to reach a rational decision. Using AHP, we can reflect the relative importance of each criterion on the evaluation result; therefore, we have applied it to network topology evaluation in past research. When evaluating network topologies using AHP, we need to construct the set of topology candidates prior to the evaluation. However, the time required to construct this set greatly increases as the network size grows. In this paper, we propose applying a binary partition approach for constructing a topology candidate set with dramatically reduced calculation time. To reduce the calculation time, we introduce an upper limit for the total link length. Although the results of AHP are affected by introducing the upper limit of the total link length, we show that desirable topologies are still selected in AHP.},
keywords={},
doi={10.1587/transcom.E96.B.163},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Efficiently Constructing Candidate Set of Network Topologies
T2 - IEICE TRANSACTIONS on Communications
SP - 163
EP - 172
AU - Noriaki KAMIYAMA
PY - 2013
DO - 10.1587/transcom.E96.B.163
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2013
AB - Network topology significantly affects network cost, path length, link load distribution, and reliability, so we need to consider multiple criteria with different units simultaneously when designing a network's topology. The analytic hierarchy process (AHP) is a technique of balancing multiple criteria in order to reach a rational decision. Using AHP, we can reflect the relative importance of each criterion on the evaluation result; therefore, we have applied it to network topology evaluation in past research. When evaluating network topologies using AHP, we need to construct the set of topology candidates prior to the evaluation. However, the time required to construct this set greatly increases as the network size grows. In this paper, we propose applying a binary partition approach for constructing a topology candidate set with dramatically reduced calculation time. To reduce the calculation time, we introduce an upper limit for the total link length. Although the results of AHP are affected by introducing the upper limit of the total link length, we show that desirable topologies are still selected in AHP.
ER -
English
