• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2783-2804
• /
• 2021

In the network function virtualization environment, dynamic changes in network traffic will lead to the dynamic changes of service function chain resource demand, which entails timely dynamic adjustment of service function chain resource configuration. At present, most researches solve this problem through virtual network function migration and link rerouting, and there exist some problems such as long service interruption time, excessive network operation cost and high penalty. This paper proposes a dynamic adjustment method of service function chain resource configuration for the dynamic changes of network traffic. First, a dynamic adjustment request of service function chain is generated according to the prediction of network traffic. Second, a dynamic adjustment strategy of service function chain resource configuration is determined according to substrate network resources. Finally, the resource configuration of a service function chain is pre-adjusted according to the dynamic adjustment strategy. Virtual network functions combination and virtual machine reusing are fully considered in this process. The experimental results show that this method can reduce the influence of service function chain resource configuration dynamic adjustment on quality of service, reduce network operation cost and improve the revenue of service providers.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.275-282
• /
• 2010

This paper analyzes a discrete-time bulk-service queue with probabilistic bulk size, where the service process is interrupted by a Markov chain. We study the joint probability generating function of system occupancy and the state of the Markov chain. We derive several performance measures of interest, including average system occupancy and delay distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3701-3727
• /
• 2016

Recently Service Function Chaining (SFC) is promising to innovate the network service mode in modern networks. However, a feasible implementation of SFC is still difficult due to the need to achieve functional equivalence with traditional modes without sacrificing performance or increasing network complexity. In this paper, we present a configurable network service chaining (CNSC) mechanism to provide services for network traffics in a flexible and optimal way. Firstly, we formulate the problem of network service chaining and design an effective service chain construction framework based on integrating software-defined networking (SDN) with network functions virtualization (NFV). Then, we model the service path computation problem as an integer liner optimization problem and propose an algorithm named SPCM to cooperatively combine service function instances with a network utility maximum policy. In the procedure of SPCM, we achieve the service node mapping by defining a service capacity matrix for substrate nodes, and work out the optimal link mapping policies with segment routing. Finally, the simulation results indicate that the average request acceptance ratio and resources utilization ratio can reach above 85% and 75% by our SPCM algorithm, respectively. Upon the prototype system, it is demonstrated that CNSC outperforms other approaches and can provide flexible and scalable network services.

• 대한안전경영과학회지
• /
• 제11권3호
• /
• pp.139-148
• /
• 2009

In a real-life supply chain environment, demand forecasting is usually represented by probabilistic distributions due to the uncertainty inherent in customer demands. However, the customer demand used for an actual supply chain planning is a single deterministic value for each of periods. In this paper we study the choice of single demand value among of the given customer demand distribution for a period to be used in the supply chain planning. This paper considers distributed multi-echelon supply chain and the objective function of this paper is to minimize the total costs, that is the sum of holding and backorder costs over the distribution network under the service level constraint, by using demand selection scheme. Some useful findings are derived from various simulation-based experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권12호
• /
• pp.4364-4384
• /
• 2021

The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

• 대한안전경영과학회지
• /
• 제14권1호
• /
• pp.129-136
• /
• 2012

This study proposes a collaboration system framework on the web service in a supply chain to implement an efficient virtual supply chain and improve an ability to fulfill received orders over a supply chain. The system based on the framework proposed in this paper plays an important role for automatic order negotiation and placing/receiving an order noticed in web service by the main system. Furthermore, it can evaluate the fulfillment of received orders over a supply chain by using the transaction results from hierarchically related vendors and establish efficient manufacturing plans. In a word, this system is the automated system for creating manufacturing plans, placing and receiving orders. A little more important main function of this system is that it has a dynamic evaluation capability about fulfillment with received orders over a supply chain, and improves the evaluation method of fulfillment ability with received orders with related to direct dealing vendors, which is a main problem in existing system. As a result, this system is able to reduce the work load of the sales and purchasing materials, production control division, to manage accurate inventory promptly, to maintain the optimal inventory level by analyzing the information of fulfillment ability with received orders, and to enhance the level of service for customers.

• 정보과학회 논문지
• /
• 제44권7호
• /
• pp.719-725
• /
• 2017

약 네트워크의 관리 비용을 줄이고 성능을 향상시키기 위해 ETSI(European Telecommunication Standards Institute)는 클라우드 데이터 센터에서 네트워크 기능(Network Function)을 소프트웨어 형태로 구현할 수 있는 네트워크 기능 가상화(Network Function Virtualization) 개념을 도입했다. 네트워크 기능 가상화 구조 내에서 네트워크 기능을 물리적 노드(예: 범용 서버)에 네트워크 기능을 호스팅하여 실제 리소스를 공유할 수 있다. 네트워크 기능 가상화를 지원하는 네트워크 서비스 제공 업체의 경우, 효율적인 자원 할당 방법을 통해 운영비용(OPEX) 및 자본 비용(CAPEX)를 줄일 수 있다. 이에 본 논문에서는 최적화 방법을 통해 Network Service Chain Embedding 문제를 분석하고 Markov Approximation 프레임워크 기반 최적의 솔루션을 제안한다. 제안사항에 대한 시뮬레이션 결과는 평균 CPU 사용률이 73%, 링크 사용률이 최대 53% 증가함을 보여준다.

• ETRI Journal
• /
• 제41권2호
• /
• pp.207-223
• /
• 2019

Network function virtualization can significantly improve the flexibility and effectiveness of network appliances via a mapping process called service function chaining. However, the failure of any single virtualized network function causes the breakdown of the entire chain, which results in resource wastage, delays, and significant data loss. Redundancy can be used to protect network appliances; however, when failures occur, it may significantly degrade network efficiency. In addition, it is difficult to efficiently map the primary and backups to optimize the management cost and service reliability without violating the capacity, delay, and reliability constraints, which is referred to as the reliability-aware service chaining mapping problem. In this paper, a mixed integer linear programming formulation is provided to address this problem along with a novel online algorithm that adopts the joint protection redundancy model and novel backup selection scheme. The results show that the proposed algorithm can significantly improve the request acceptance ratio and reduce the consumption of physical resources compared to existing backup algorithms.

• 대한수학회보
• /
• 제46권4호
• /
• pp.673-689
• /
• 2009

We analyze $MAP_1,\;MAP_2$/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.

• 디지털산업정보학회논문지
• /
• 제13권4호
• /
• pp.99-106
• /
• 2017

With the advent of virtual money such as bit coins, interest in the block chain is increasing. Block Chain is a technology that supports Distributed Ledger and is a versatile technology applicable to various fields. Currently, the block chain is conducting research for various applications such as virtual money, trade finance, marketplace, power market, image contents service, and IoT. The technologies that make up the block chain are smart contract, digital signature/hash function and consensus algorithm. And these technologies operate on P2P networks. In this paper, we have studied e-mail system based on the ethereum which is one of the block chain based technologies. Most legacy mail systems use SMTP and the POP3/IMAP protocol to send and receive e-mail, and e-mail use S/MIME to protect the e-mail. However, S/MIME is vulnerable to DDoS attacks because it is configured centrally. And it also does not provide non-repudiation of mail reception. To overcome these weaknesses, we proposed an e-mail system model based on ethereum. The proposed model is able to cope with DDoS attack and forgery prevention by using block chain based technology, and reliable recording and management among block chain participants are provided, so that it is possible to provide a non-repudiation function of e-mail transmission and reception.