Multipath Routing Algorithm Applied to Cloud Data Center Services
Summary :
Cloud data center services, such as video on demand (VoD) and sensor data monitoring, have become popular. The quality of service (QoS) between a client and a cloud data center should be assured by satisfying each service's required bandwidth and delay. Multipath traffic engineering is effective for dispersing traffic flows on a network; therefore, an improved k-shortest paths first (k-SPF) algorithm is applied to these cloud data center services to satisfy their required QoS. k-SPF can create a set of multipaths between a cloud data center and all edge routers, to which client nodes are connected, within one algorithm process. Thus, k-SPF can produce k shortest simple paths between a cloud data center and every access router faster than with conventional Yen's algorithm. By using a parameter in the algorithm, k-SPF can also impartially use links on a network and shorten the average hop-count and number of necessary MPLS labels for multiple paths that comprise a multipath.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E95-B No.8 pp.2558-2567
- Publication Date
- 2012/08/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E95.B.2558
- Type of Manuscript
- Special Section PAPER (Special Section on Networking Technologies for Cloud Services)
- Category
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
Hiroshi MATSUURA, "Multipath Routing Algorithm Applied to Cloud Data Center Services" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 8, pp. 2558-2567, August 2012, doi: 10.1587/transcom.E95.B.2558.
Abstract: Cloud data center services, such as video on demand (VoD) and sensor data monitoring, have become popular. The quality of service (QoS) between a client and a cloud data center should be assured by satisfying each service's required bandwidth and delay. Multipath traffic engineering is effective for dispersing traffic flows on a network; therefore, an improved k-shortest paths first (k-SPF) algorithm is applied to these cloud data center services to satisfy their required QoS. k-SPF can create a set of multipaths between a cloud data center and all edge routers, to which client nodes are connected, within one algorithm process. Thus, k-SPF can produce k shortest simple paths between a cloud data center and every access router faster than with conventional Yen's algorithm. By using a parameter in the algorithm, k-SPF can also impartially use links on a network and shorten the average hop-count and number of necessary MPLS labels for multiple paths that comprise a multipath.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.2558/_p
Copy
@ARTICLE{e95-b_8_2558,
author={Hiroshi MATSUURA, },
journal={IEICE TRANSACTIONS on Communications},
title={Multipath Routing Algorithm Applied to Cloud Data Center Services},
year={2012},
volume={E95-B},
number={8},
pages={2558-2567},
abstract={Cloud data center services, such as video on demand (VoD) and sensor data monitoring, have become popular. The quality of service (QoS) between a client and a cloud data center should be assured by satisfying each service's required bandwidth and delay. Multipath traffic engineering is effective for dispersing traffic flows on a network; therefore, an improved k-shortest paths first (k-SPF) algorithm is applied to these cloud data center services to satisfy their required QoS. k-SPF can create a set of multipaths between a cloud data center and all edge routers, to which client nodes are connected, within one algorithm process. Thus, k-SPF can produce k shortest simple paths between a cloud data center and every access router faster than with conventional Yen's algorithm. By using a parameter in the algorithm, k-SPF can also impartially use links on a network and shorten the average hop-count and number of necessary MPLS labels for multiple paths that comprise a multipath.},
keywords={},
doi={10.1587/transcom.E95.B.2558},
ISSN={1745-1345},
month={August},}
Copy
TY - JOUR
TI - Multipath Routing Algorithm Applied to Cloud Data Center Services
T2 - IEICE TRANSACTIONS on Communications
SP - 2558
EP - 2567
AU - Hiroshi MATSUURA
PY - 2012
DO - 10.1587/transcom.E95.B.2558
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2012
AB - Cloud data center services, such as video on demand (VoD) and sensor data monitoring, have become popular. The quality of service (QoS) between a client and a cloud data center should be assured by satisfying each service's required bandwidth and delay. Multipath traffic engineering is effective for dispersing traffic flows on a network; therefore, an improved k-shortest paths first (k-SPF) algorithm is applied to these cloud data center services to satisfy their required QoS. k-SPF can create a set of multipaths between a cloud data center and all edge routers, to which client nodes are connected, within one algorithm process. Thus, k-SPF can produce k shortest simple paths between a cloud data center and every access router faster than with conventional Yen's algorithm. By using a parameter in the algorithm, k-SPF can also impartially use links on a network and shorten the average hop-count and number of necessary MPLS labels for multiple paths that comprise a multipath.
ER -
English
