Resource Allocation Method of Service Chaining for Guaranteeing Minimum Bandwidth and High Resource Utilization

Hirofumi YAMAZAKI; Konomi MOCHIZUKI; Shunsuke HOMMA; Koji SUGISONO; Masaaki OMOTANI

doi:10.1587/transcom.2015EBP3551

Resource Allocation Method of Service Chaining for Guaranteeing Minimum Bandwidth and High Resource Utilization

Hirofumi YAMAZAKI, Konomi MOCHIZUKI, Shunsuke HOMMA, Koji SUGISONO, Masaaki OMOTANI

Full Text Views

0

Share
Cite this

Summary :

Service chaining (SC) is a method for realizing a service by transferring flows among several service functions (SFs) that process packets. A route among SFs is called a service path (SP). Service chaining is being developed to reduce costs, increase flexibility, and shorten time-to-market. SC technologies are expected to be applied to carrier networks so that large communication carriers benefit from them. We assume that SPs process the traffic of services that treat all users in the same way such as an Internet access service for home users. An SP processes flows from several users. We do not assume that each SP is assigned to a user. Because a carrier network accommodates many users, each service will be heavily utilized. Therefore, it is assumed that the amount of traffic of a service is larger than the resource of an SF apparatus. Several SPs are required to process the traffic. SPs are supposed to meet two requirements. One is guaranteeing minimum bandwidth. The other is reducing the number of SF apparatuses, i.e., high resource utilization. Resource utilization depends on the combination of the resource quantities of SF apparatuses. Network operators have to determine the bandwidth of each SP within the range from the minimum bandwidth to the resource quantities of SF apparatuses to maximize resource utilization. Methods for determining the bandwidth of each SP have not been proposed for meeting the two requirements. Therefore, we propose a resource allocation method for this purpose. The proposed method determines the bandwidth of each SP on the basis of the combination of the resource quantities of SF apparatuses for guaranteeing the minimum bandwidth and maximizing resource utilization and allocates necessary resources to each SP. We also evaluate the proposed method and confirm that it can guarantee the minimum bandwidth of SPs and achieve high resource utilization regardless of the combination of the resource quantities of SF apparatuses. Although SF apparatuses are generally produced without considering the combinations of resource quantities of SF apparatuses in SPs, the proposed method can provide more options for selecting SF apparatuses.

Publication: IEICE TRANSACTIONS on Communications Vol.E100-B No.1 pp.98-109

Publication Date: 2017/01/01

Publicized: 2016/07/19

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2015EBP3551

Type of Manuscript: PAPER

Category: Network

Authors

Hirofumi YAMAZAKI
  NTT Corporation
Konomi MOCHIZUKI
  NTT Corporation
Shunsuke HOMMA
  NTT Corporation
Koji SUGISONO
  NTT Corporation
Masaaki OMOTANI
  NTT Corporation

Keyword

service chaining, resource allocation, bandwidth guarantee, resource utilization

Cite this

Copy

Hirofumi YAMAZAKI, Konomi MOCHIZUKI, Shunsuke HOMMA, Koji SUGISONO, Masaaki OMOTANI, "Resource Allocation Method of Service Chaining for Guaranteeing Minimum Bandwidth and High Resource Utilization" in IEICE TRANSACTIONS on Communications, vol. E100-B, no. 1, pp. 98-109, January 2017, doi: 10.1587/transcom.2015EBP3551.
Abstract: Service chaining (SC) is a method for realizing a service by transferring flows among several service functions (SFs) that process packets. A route among SFs is called a service path (SP). Service chaining is being developed to reduce costs, increase flexibility, and shorten time-to-market. SC technologies are expected to be applied to carrier networks so that large communication carriers benefit from them. We assume that SPs process the traffic of services that treat all users in the same way such as an Internet access service for home users. An SP processes flows from several users. We do not assume that each SP is assigned to a user. Because a carrier network accommodates many users, each service will be heavily utilized. Therefore, it is assumed that the amount of traffic of a service is larger than the resource of an SF apparatus. Several SPs are required to process the traffic. SPs are supposed to meet two requirements. One is guaranteeing minimum bandwidth. The other is reducing the number of SF apparatuses, i.e., high resource utilization. Resource utilization depends on the combination of the resource quantities of SF apparatuses. Network operators have to determine the bandwidth of each SP within the range from the minimum bandwidth to the resource quantities of SF apparatuses to maximize resource utilization. Methods for determining the bandwidth of each SP have not been proposed for meeting the two requirements. Therefore, we propose a resource allocation method for this purpose. The proposed method determines the bandwidth of each SP on the basis of the combination of the resource quantities of SF apparatuses for guaranteeing the minimum bandwidth and maximizing resource utilization and allocates necessary resources to each SP. We also evaluate the proposed method and confirm that it can guarantee the minimum bandwidth of SPs and achieve high resource utilization regardless of the combination of the resource quantities of SF apparatuses. Although SF apparatuses are generally produced without considering the combinations of resource quantities of SF apparatuses in SPs, the proposed method can provide more options for selecting SF apparatuses.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.2015EBP3551/_p

Copy

@ARTICLE{e100-b_1_98,
author={Hirofumi YAMAZAKI, Konomi MOCHIZUKI, Shunsuke HOMMA, Koji SUGISONO, Masaaki OMOTANI, },
journal={IEICE TRANSACTIONS on Communications},
title={Resource Allocation Method of Service Chaining for Guaranteeing Minimum Bandwidth and High Resource Utilization},
year={2017},
volume={E100-B},
number={1},
pages={98-109},
abstract={Service chaining (SC) is a method for realizing a service by transferring flows among several service functions (SFs) that process packets. A route among SFs is called a service path (SP). Service chaining is being developed to reduce costs, increase flexibility, and shorten time-to-market. SC technologies are expected to be applied to carrier networks so that large communication carriers benefit from them. We assume that SPs process the traffic of services that treat all users in the same way such as an Internet access service for home users. An SP processes flows from several users. We do not assume that each SP is assigned to a user. Because a carrier network accommodates many users, each service will be heavily utilized. Therefore, it is assumed that the amount of traffic of a service is larger than the resource of an SF apparatus. Several SPs are required to process the traffic. SPs are supposed to meet two requirements. One is guaranteeing minimum bandwidth. The other is reducing the number of SF apparatuses, i.e., high resource utilization. Resource utilization depends on the combination of the resource quantities of SF apparatuses. Network operators have to determine the bandwidth of each SP within the range from the minimum bandwidth to the resource quantities of SF apparatuses to maximize resource utilization. Methods for determining the bandwidth of each SP have not been proposed for meeting the two requirements. Therefore, we propose a resource allocation method for this purpose. The proposed method determines the bandwidth of each SP on the basis of the combination of the resource quantities of SF apparatuses for guaranteeing the minimum bandwidth and maximizing resource utilization and allocates necessary resources to each SP. We also evaluate the proposed method and confirm that it can guarantee the minimum bandwidth of SPs and achieve high resource utilization regardless of the combination of the resource quantities of SF apparatuses. Although SF apparatuses are generally produced without considering the combinations of resource quantities of SF apparatuses in SPs, the proposed method can provide more options for selecting SF apparatuses.},
keywords={},
doi={10.1587/transcom.2015EBP3551},
ISSN={1745-1345},
month={January},}

Copy

TY - JOUR
TI - Resource Allocation Method of Service Chaining for Guaranteeing Minimum Bandwidth and High Resource Utilization
T2 - IEICE TRANSACTIONS on Communications
SP - 98
EP - 109
AU - Hirofumi YAMAZAKI
AU - Konomi MOCHIZUKI
AU - Shunsuke HOMMA
AU - Koji SUGISONO
AU - Masaaki OMOTANI
PY - 2017
DO - 10.1587/transcom.2015EBP3551
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E100-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2017
AB - Service chaining (SC) is a method for realizing a service by transferring flows among several service functions (SFs) that process packets. A route among SFs is called a service path (SP). Service chaining is being developed to reduce costs, increase flexibility, and shorten time-to-market. SC technologies are expected to be applied to carrier networks so that large communication carriers benefit from them. We assume that SPs process the traffic of services that treat all users in the same way such as an Internet access service for home users. An SP processes flows from several users. We do not assume that each SP is assigned to a user. Because a carrier network accommodates many users, each service will be heavily utilized. Therefore, it is assumed that the amount of traffic of a service is larger than the resource of an SF apparatus. Several SPs are required to process the traffic. SPs are supposed to meet two requirements. One is guaranteeing minimum bandwidth. The other is reducing the number of SF apparatuses, i.e., high resource utilization. Resource utilization depends on the combination of the resource quantities of SF apparatuses. Network operators have to determine the bandwidth of each SP within the range from the minimum bandwidth to the resource quantities of SF apparatuses to maximize resource utilization. Methods for determining the bandwidth of each SP have not been proposed for meeting the two requirements. Therefore, we propose a resource allocation method for this purpose. The proposed method determines the bandwidth of each SP on the basis of the combination of the resource quantities of SF apparatuses for guaranteeing the minimum bandwidth and maximizing resource utilization and allocates necessary resources to each SP. We also evaluate the proposed method and confirm that it can guarantee the minimum bandwidth of SPs and achieve high resource utilization regardless of the combination of the resource quantities of SF apparatuses. Although SF apparatuses are generally produced without considering the combinations of resource quantities of SF apparatuses in SPs, the proposed method can provide more options for selecting SF apparatuses.
ER -