The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] k shortest paths(1hit)

1-1hit
  • Multipath Routing Algorithm Applied to Cloud Data Center Services

    Hiroshi MATSUURA  

     
    PAPER

      Vol:
    E95-B No:8
      Page(s):
    2558-2567

    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.