• 한국IT서비스학회지
• /
• 제13권3호
• /
• pp.201-219
• /
• 2014

This paper considers service deployment and priority optimization for multiple service-oriented applications sharing reusable services, which are deployed as multiple instances in the cloud. In order to handle variations in the workloads of the multiple applications, service instances of the individual reusable services are dynamically provisioned in the cloud. Also service priorities for each application in a particular reusable service are dynamically adjusted. In this paper, we propose an analytic performance model, based on a queueing network model, to predict the expected sojourn times of multiple service-oriented applications, given the number of service instances and priority disciplines in individual reusable services. We also propose a simple heuristic algorithm to search an optimal number of service instances in the cloud and service priority disciplines for each application in individual reusable services. A numerical example is also presented to demonstrate the applicability of the proposed performance model and algorithm to the proposed optimal decision problem.

• 산업경영시스템학회지
• /
• 제40권3호
• /
• pp.66-75
• /
• 2017

Priority disciplines are an important scheme for service systems to differentiate their services for different classes of customers. (N, n)-preemptive priority disciplines enable system engineers to fine-tune the performances of different classes of customers arriving to the system. Due to this virtue of controllability, (N, n)-preemptive priority queueing models can be applied to various types of systems in which the service performances of different classes of customers need to be adjusted for a complex objective. In this paper, we extend the existing (N, n)-preemptive resume and (N, n)-preemptive repeat-identical priority queueing models to the (N, n)-preemptive repeat-different priority queueing model. We derive the queue-length distributions in the M/G/1 queueing model with two classes of customers, under the (N, n)-preemptive repeat-different priority discipline. In order to derive the queue-length distributions, we employ an analysis of the effective service time of a low-priority customer, a delay cycle analysis, and a joint transformation method. We then derive the first and second moments of the queue lengths of high- and low-priority customers. We also present a numerical example for the first and second moments of the queue length of high- and low-priority customers. Through doing this, we show that, under the (N, n)-preemptive repeat-different priority discipline, the first and second moments of customers with high priority are bounded by some upper bounds, regardless of the service characteristics of customers with low priority. This property may help system engineers design such service systems that guarantee the mean and variance of delay for primary users under a certain bounds, when preempted services have to be restarted with another service time resampled from the same service time distribution.

• 한국경영과학회지
• /
• 제33권2호
• /
• pp.115-135
• /
• 2008

An interesting problem in capacitated supply chains is how to guarantee customer service levels with limited resources. One of the common approaches to solve the problem is differentiating service depending on customer classes. High-priority customers receive a better service at the cost of low-priority customers' service level. One of common criteria to determine a customer's priority in practice is whether he has made a reservation before arrival or not. Customers with a reservation usually receive service based on the time the reservation was made. We examine the effect this advance information of customer arrival has on customer service levels. We show the trade-offs between the leadtime and other system characteristics such as the proportion of high-priority customers. when the service level is high. We also suggest how to differentiate service using the asymptotic ratio of the service levels for both types of customers.

• 산업경영시스템학회지
• /
• 제43권4호
• /
• pp.1-14
• /
• 2020

Recently, M/G/1 priority queues with a finite buffer for high-priority customers and an infinite buffer for low-priority customers have applied to the analysis of communication systems with two heterogeneous traffics : delay-sensitive traffic and loss-sensitive traffic. However, these studies are limited to M/G/1 priority queues with finite and infinite buffers under a work-conserving priority discipline such as the nonpreemptive or preemptive resume priority discipline. In many situations, if a service is preempted, then the preempted service should be completely repeated when the server is available for it. This study extends the previous studies to M/G/1 priority queues with finite and infinite buffers under the preemptive repeat-different and preemptive repeat-identical priority disciplines. We derive the loss probability of high-priority customers and the waiting time distributions of high- and low-priority customers. In order to do this, we utilize the delay cycle analysis of finite-buffer M/G/1/K queues, which has been recently developed for the analysis of M/G/1 priority queues with finite and infinite buffers, and combine it with the analysis of the service time structure of a low-priority customer for the preemptive-repeat and preemptive-identical priority disciplines. We also present numerical examples to explore the impact of the size of the finite buffer and the arrival rates and service distributions of both classes on the system performance for various preemptive priority disciplines.

• Journal of applied mathematics & informatics
• /
• 제31권1_2호
• /
• pp.147-154
• /
• 2013

We analyze queueing model with priority scheduling by supplementary variable method. Customers are classified into two types (type-1 and type-2 ) according to their characteristics. Customers of each type arrive by independent Poisson processes, and all customers regardless of type have same general service time. The service order of each type is determined by the queue length of type-1 buffer. If the queue length of type-1 customer exceeds a threshold L, the service priority is given to the type-1 customer. Otherwise, the service priority is given to type-2 customer. Method of supplementary variable by remaining service time gives us information for queue length of two buffers. That is, we derive the differential difference equations for our queueing system. We obtain joint probability generating function for two queue lengths and the remaining service time. Also, the mean queue length of each buffer is derived.

• 한국통신학회논문지
• /
• 제30권2B호
• /
• pp.11-20
• /
• 2005

Strict priority scheduling scheme is a good candidate for the implementation of service differentiation in an Internet because of simplicity in implementation and the capability to guarantee the delay requirement of the highest class of traffic. However, it is also blown that strict priority starves the lower-class traffic at the cost of prioritizing the higher-class traffic. The purpose of this work is to propose an analytic method which can estimate the average delay performance of Diffserv service architecture and shows that strict priority scheme does not sacrifice the lower class traffic over a diverse condition of the load. From the numerical experiments for three-class Diffserv network we validate our argument that strict priority scheme may be applied to a service differentiation scheme for the future Internet.

• 전기전자학회논문지
• /
• 제7권2호
• /
• pp.181-187
• /
• 2003

초고속 패킷 스위칭 네트워크에서 QoS 보장을 위한 여러 가지 방안 중 우선순위에 의한 패킷처리 방식이 선호되고 있다. 초고속 패킷 스위치에서 우선순위에 따르는 효율적인 패킷 처리는 서비스 성능 향상의 관건이다. 따라서 초고속 네트워크 내의 핵심인 패킷 스위치에서의 효율적인 우선순위 서비스 알고리즘의 개발은 중요하다. 본 논문에서는 효율적인 패킷 스위치 성능 향상 방안으로 큐에 대기하는 패킷의 개수에 따라 서비스시간을 가변적으로 할당할 수 있는 W-iSLIP 스케줄링 알고리즘을 제안하고, 시뮬레이션하여 기존의 알고리즘과 비교 분석하였다. 우선순위에 따른 서비스와 전체 지연시간을 분석한 결과, 전체 지연시간에 있어서는 2.6%, 우선순위 서비스에 있어서는 34.6%의 성능향상이 있는 것으로 분석되었다.

• 한국지리정보학회지
• /
• 제11권2호
• /
• pp.132-147
• /
• 2008

유비쿼터스 서비스(u-서비스) 우선순위 평가에 대한 선행연구는 공급자에 주안점을 두고 있어 결과의 타당성에서 한계를 노출하고 있다. 특히 지금까지 중앙부처 및 지방자치단체에서 제시하고 있는 대부분의 유비쿼터스 추진사업은 u-서비스 사업 우선순위가 정책담당자의 경험이나 직관, 또는 소수전문가들의 경험적 지식 등에 의존하여 선정되고 있다. 이러한 한계를 극복하기위해 u-서비스 공급자 측면과 수요자 측면의 요구를 모두 충족할 수 있는 u-서비스 우선순위 평가모형을 개발하고자 본 연구가 수행되었다. u-서비스 우선순위 모형개발을 위해 선행 연구를 토대로 수요자와 공급자의 서비스 결정요인을 탐색적으로 도출하고, 전문가와의 브레인스토밍을 통해 u-서비스 결정의 확정적 요인을 추출하였다. 도출된 요인들을 계층분석(AHP)모형으로 설정하고 전문가 설문조사를 통해 요인별 가중치와 우선순위를 도출하여 u-지역정보화에서 제시한 대구지역의 특화서비스를 평가하였다. 평가 결과 대구지역은 지역물류지원서비스, 시각장애인 길안내 서비스, u-텔레매틱스 서비스가 상위권을 차지한 반면, u-지역정보화에서 제시한 안전방재지원서비스와 산업특화거리 등의 서비스는 중위권을 차지하고 있어 공급자 위주의 u-서비스 선정결과와는 차별성을 보였다.

• 대한안전경영과학회지
• /
• 제18권4호
• /
• pp.195-209
• /
• 2016

This research determined priority of quality improvement of public institution's education service by using ASC for importance and applying Topsis, a multi-standard decision-making method simplifying various attributes and scales of evaluation items and deciding the comparative priority for satisfaction and discussed the differences so as to measure the quality of public institution's educational service and examine the priority of education service' quality improvement. This research classified the characteristics of quality improvement. As a result, it's significant to suggest positive direction and method to improve satisfaction and education service's quality from an angle of demander by analyzing educational satisfaction of education service quality of public education institution and effects on the following improvement.

• 정보처리학회논문지C
• /
• 제16C권2호
• /
• pp.217-222
• /
• 2009

본 논문은 EPON (Ethernet Passive Optical Network)에서 IPTV (Internet Protocol Television) 서비스의 멀티캐스트 QoS (Quality of Service)를 제공하기 위해서 ONU (Optical Network Unit) 수 기반 우선순위 스케줄링 기법을 제안한다. 멀티캐스트 효율은 얼마나 많은 패킷들로 복사되어 전송하는가에 의해서 결정되기 때문에 멀티캐스트 QoS는 패킷 수신기의 수의 영향을 받는다. 따라서 제안하는 기법은 많은 사용자가 이용하는 IPTV 멀티캐스트 서비스에 높은 우선순위를 부여하기 위해서 멀티캐스트 트래픽을 받는 ONU 수를 기반으로 우선순위를 부여하고 높은 우선순위의 멀티캐스트 패킷을 우선적으로 전송한다. 그리하여 제안하는 기법은 인기 있는 IPTV 서비스들에게 망이 혼잡한 경우에도 좋은 QoS (적은 패킷 손실과 작은 대기 지연)와 안정적인 서비스를 제공한다.