Multipath Routing Algorithm Applied to Cloud Data Center Services

Hiroshi MATSUURA  

IEICE TRANSACTIONS on Communications   Vol.E95-B   No.8   pp.2558-2567
Publication Date: 2012/08/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.2558
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on Networking Technologies for Cloud Services)
multipath,  traffic dispersion,  k shortest paths,  cloud data center,  

Full Text: PDF>>
Buy this Article

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.