• Journal of the Korean Statistical Society
• /
• 제30권4호
• /
• pp.661-666
• /
• 2001

In this paper we consider an M/G/1 queue where the server of the system has a vacation time and the service policy is limited-1. In this system, upon termination of a vacation the server returns to the queue and serves at most one message in the queue before taking another vacation. We consider two models. In the first, if the sever finds the queue empty at the end of a cacation, then the sever immediately takes another vacation. In the second model, if no message have arrived during a vacation, the sever waits for the first arrival to serve. The analysis of this system is particularly useful for a priority class polling system. We derive Laplace-Stieltjes transforms of the waiting time for both models, and compare their mean waiting times.

• 한국정보처리학회논문지
• /
• 제6권10호
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• 실천공학교육논문지
• /
• 제16권2호
• /
• pp.185-193
• /
• 2024

스마트폰의 발달로 인해 사람들은 언제 어디서나 인터넷을 통해 다양한 정보를 접할 수 있게 되었다. 차량 내에서도 인터넷을 이용할 수 있는 시대가 도래했고, 사용자는 웹과 앱을 통해 매일 정보를 얻고 있다. 하지만 데이터 처리량이 증가함에 따라 프로그램의 응답 속도가 느려지는 경우가 발생하고, 사용자는 기다리라는 메시지를 받게 된다. 사용자의 대기는 불편한 경험이지만, 데이터 처리에 필요한 시간이 있기 때문에 사용자 대기를 최소화하는 것이 최선의 방법이다. 그러나 서비스 처리 시간이 예상치를 넘어가면 사용자는 더욱 심한 지루함과 고통을 겪게 된다. 그래서 사용자의 대기 지루함을 완화하기 위한 다양한 방법과 연구가 진행되고 있다. 사용자의 대기 지루함을 완화하기 위해 가장 흔히 사용되는 방법은 로딩이다. 이 연구에서는 최신의 로딩 기법인 Skeleton 로딩이 사용자 대기 경험에 어떤 효과를 가져오는지, 다른 로딩 기법과 비교하여 UI 측면에서 얼마나 매력적인 디자인 기법인지를 조사하였다. 실험 결과, Skeleton 로딩은 사용자 대기 경험을 개선하고, UI 디자인 측면에서도 매력적인 결과를 보여주었다.

• 산업경영시스템학회지
• /
• 제24권66호
• /
• pp.11-18
• /
• 2001

In this paper, we analyze an M/G/1 two-phase gated service model with threshold. We consider compound Poison arrival Process and general service time, where the server fives two different modes of services in order, batch and individual services. Server starts his service when the number of arrived customers reaches the predetermined threshold . We find the PGF of the number of customers in system and LST of waiting time, with which we obtain the means of them.

• 한국전자거래학회지
• /
• 제4권1호
• /
• pp.87-101
• /
• 1999

To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the control devices located in common manufacturing zone and operated by connecting them. In this paper, functional standard of the network layers are set as physical and data link layer of IEEE 802.2, 802.4, and VMD application layer and ISO-CIM reference model. Then, they are divided as minimized architecture, designed as group objects which perform group management and service objects which organizes and operates the group. For the stability in this network, this paper measures the variation of data packet length and node number and analyzes the variated value of the waiting time for the network operation. For the method of the analysis, non-exhausted service method are selected, and the arrival rates of the each data packet to the nodes that are assumed to form a Poission distribution. Then, queue model is set as M/G/1, and the analysis equation for waiting time is found. For the evalution of the performance, the length of the data packet varies from 10 bytes to 100 bytes in the operation of the group management network, the variation of the wating time is less than 10 msec. Since the waiting time in this case is less than 10 msec, response time is fast enough. Furthermore, to evaluate the real time processing of the group management network, it shows if the number of nodes is less than 40, and the average arrival time is less than 40 packet/sec, it can perform stable operation even taking the overhead such as software delay time, indicated packet service, and transmissin safety margin.

• 한국정보통신학회논문지
• /
• 제13권3호
• /
• pp.458-468
• /
• 2009

NVOD의 초기 대기시간을 없애는 방법으로 패칭이라는 방법이 있었다. 그 방법은 시간 분할의 NVOD 서비스에만 적용이 가능하였다. 그러나 데이터 분할의 NVOD 방식이 시간 분할의 NVOD 보다 대기 시간이 작거나 서버의 대역폭을 적게 사용하는 것으로 알려져 있어서, 패칭을 데이터 분할의 NVOD에 적용하면 보다 효율적인 서비스가 가능할 것이라 예상된다. 그러나 그러한 시도는 아직 없었다. 본 논문에서는 데이터 분할 NVOD에 패칭을 결합하여 시간분할 보다 더 적은 대역폭을 사용하면서 초기 대기시간을 없게 하여 참 VOD 서비스가 가능한 새로운 VOD 스케쥴링 알고리즘을 제안한다. 제안된 방식은 또한 패칭에 의 한 클라이언트의 버퍼링에 필요한 스토리지 부담 요소를 NVOD 스케줄링의 데이터 분할 정책에 흡수해 클라이언트 자원의 추가 부담 없이 참 VOD 서비스가 가능하도록 해 클라이언트의 자원 제약이 있는 경우에도 적용 가능하다.

• 산경연구논집
• /
• 제10권7호
• /
• pp.71-82
• /
• 2019

Purpose - This study aims to identify the priorities of medical service quality improvement by customer satisfaction characteristics and potential customer satisfaction improvement (PCSI) index based on the dualistic quality classification of Kano Model (1984) for Comprehensive Health Screeening Center in General Hospitals and Centers only for Comprehensive Health Screening and suggest a direction for future improvement. Research design, data, and methodology - Through advanced research on health screening medical service quality, this study set four service quality factors, including tangible, human, process and supportive factors, and 39 measurement items. Based on these items, the study used 117 questions, which consist of dualistic quality factors, customer satisfaction coefficients, positive and negative questions for PCSI index and questions for current satisfaction. 300 effective samples were collected for adults in their 20s who experienced health screening service in Seoul, Gyeonggi-do and Incheon within the past two years. Collected data were input in the quality evaluation duality table to categorize quality factors and calculate customer satisfaction coefficients by Timko(1993). The study also analyzed PCSI index in comparison with current satisfaction and identified priorities in quality improvement. Results - It was found that the most urgent factors to improve the quality in both groups were adequate waiting hours and emergency response for complications, which are process factors classified as unitary quality. It is urgently needed to improve the quality as the PCSI index was high in supportive factors (complaint response team) as attractive quality in Comprehensive Health Screening Center in General Hospitals and in process factors (prevention of infection) as unitary quality in Centers only for Comprehensive Health Screening. As the PCSI index was low in space use as a tangible factor, it was found that the current level can be maintained instead of improvement. Conclusions - To improve the health screening medical service quality, it is required to focus on process factors (adequate waiting hours, emergency response for complications, prevention of infection) and supportive factors (complaint response team) among service qualities perceived by users. It is proposed to ensure continuous efforts to manage and reinforce priorities as a direction for future improvement in health screening service.

• 한국인터넷방송통신학회논문지
• /
• 제15권2호
• /
• pp.77-85
• /
• 2015

본 논문은 LTE-Advanced 환경에서의 eMBMS(evolved Multimedia Broadcast/Multicast Services) 기법을 위한 채널변경 대기시간 최소화 방안과 그 성능을 평가해 보고자 한다. 기존의 IGMP(Internet Group Management Protocol)을 이용한 MBMS 구성은 BM-SC(Broadcast Multicast Service Center)에서 eNB(evolevd Node B)까지는 멀티캐스트로, eNB에서 UE(User Equipment)까지는 브로드캐스트로 데이터를 전송한다. 때문에 채널 변경 시 IGMP Join Report를 BM-SC까지 전송해야 하며, 이후 eNB로부터 콘텐츠가 재송신되길 기다려야 한다. 이를 위해 가입자 채널 우선순위기법을 이용하여, UE가 즐겨 찾는 채널을 미리 브로드캐스트 함으로써 채널변경에 따른 대기시간을 최소화시킬 수 있다.

• 한국조리학회지
• /
• 제12권4호
• /
• pp.63-79
• /
• 2006

This study was conducted to investigate the effect of restaurant environment upon customers' satisfaction and crowdedness awareness from July 4 to 30. Total 800 sets of questionnaire were distributed among major foodservice corporations including 16 restaurants from McDonald, Burger King, Popeyes, KFC, Ritz Carlton, Intercontinental, The Westin Chosun, Hilton, Merriot, Outback Steak House, Bennigans, VIPS, Pizza Hut, Pul-hyanggi(Scent of grass), Nolboo Co., and Our Story. They received 50 sets each to hand out to their customers. Out of total 800 sets of questionnaires, 592 sets (74.25%) were retrieved and underwent the Multiple Regression Analysis. We found the following results from the study. First, among each variable of restaurant environment that had a significant effect on crowdedness, "fast service" and "responsiveness to customer complaints" scored a regression coefficient value 0.381 and 0.325 respectively. Second, among each restaurant environment factor that had a significant effect on crowdedness, "quality of facilities" scored the highest regression coefficient value 0.423 with a standard error score 0.1074, followed by "condition of waiting", "overall ambience" and "service quality" in ascending order. Third, in the analysis of the effect of each environmental factor upon the satisfaction rate, "condition of waiting" showed the highest regression coefficient value 0.3821 with a standard error score 0.4565, followed by "cleanliness", "service quality" and "convenience', in ascending order.

• 경영과학
• /
• 제28권3호
• /
• pp.15-29
• /
• 2011

In this paper, we consider a system working at both primary service and secondary service. A server can switch between the primary service and the secondary service or it can be assigned to secondary service as a dedicated server. A service policy is characterized by the number of servers dedicated to the secondary service and a rule for switching the remaining servers between two services. The primary service system is modelled as a Markovian queueing system and the throughput is a function of the number of servers, buffer capacity, and service policy. And the secondary service system has a service level requirement strategically determined to perform the service assigned. There is a revenue obtained from throughput and costs due to servers and buffers. We study the problem of simultaneously determining the optimal total number of servers, buffers, and service policy to maximize profit of the system subject to both an expected customer waiting time constraint of the primary service and a service level constraint of the secondary service and develop an algorithm which can be successfully applied with the small number of computations.