• Journal of the Korea Society for Simulation
• /
• v.20 no.3
• /
• pp.29-39
• /
• 2011

The appointment system is widely used to facilitate customer access to service in many industries including healthcare and others. Because of its importance, much research has investigated how to build an effective appointment policy under various environments. However, most research has considered a single-server service system. The objective of this work is to evaluate several appointment policies in a two-stage service system in which multiple servers are available and build separate appointments at the second-stage. In such a system, we propose and evaluate the staggering appointment policy. Simulation experiments indicate that the proposed staggering appointment policy outperforms other traditional appointment policies in terms of customer waiting time, server idle time, and the number of customers who are later to scheduled appointments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1146-1154
• /
• 2010

A virtual machine lease service in the cloud computing environment has been implemented using the open source cloud computing platform, OpenNebula. In addition, a web-based cloud user interface is developed for both convenient resource management and efficient service access. The present virtual machine allocation scheme adopted in OpenNebula has performance reduction problem because of not considering CPU allocation scheduler of the virtualization software. In order to address this problem we have considered both the priority of the idle CPU resources of the cluster and credit scheduler of Xen, which resulted in performance improvement of the OpenNebula virtual machine scheduler. The experimental results showed that the proposed allocation scheme provided more virtual machine creations and more CPU resource allocations for cloud service.

• Journal of Communications and Networks
• /
• v.2 no.1
• /
• pp.5-17
• /
• 2000

cdma2000 offers several enhancement as compared to TIA/EIA-95, although it remains fully compatible with TIA/EIA-95 systems and allows for a smooth migration from one to the other-Major new capability include:1)connectivity to GSM-MAP in addition to IP and IS-41 networks; 2) new layering with new LAC and MAC architectures for improved service multiplexing and QoS management and efficient use of radio resource ;3) new bands and band widths of operation in support of various operator need and constraints, as well as desire for a smooth and progressive migration to cdma 2000; and 4) flexible channel structure in support of multiple services with various QoS and variable transmission rates at up to 1 Mbps per channel and 2 Mbps per user. Given the phenomenal success of wireless services and desire for higher rate wireless services. improved spectrum efficiency was a major design goal in the elaboration of cdma2000. Major capacity enhancing features include; 1) turbo coding for data transmission: 2)fast forward link power control :3) forward link transmit diversity; 4) support of directive antenna transmission techniques; 5) coherent reverse link structure; and 6) enhanced access channel operation. As users increasingly rely on their cell phone at work and at home for voice and data exchange, the stand-by time and operation-time are essential parameters that can influence customer's satisfaction and service utilization. Another major goal of cdma2000 was therefore to enable manufacturers to further optimize power utilization in the terminal. Major battery life enhancing features include; 1) improved reverse link performance (i.e., reduced transmit power per information bit; 2) new common channel structure and operation ;3) quick paging channel operation; 4) reverse link gated transmission ; and 5) new MAC stated for efficient and ubiquitous idle time idle time operation. this article provides additional details on those enhancements. The intent is not to duplicate the detailed cdma2000 radio access network specification, but rather to provide some background on the new features of cdma2000 and on the qualitative improvements as compared to the TIA/EIA-95 based systems. The article is focused on the physical layer structure and associated procedures. It therefore does not cover the MAC, LAC, radio resource management [1], or any other signaling protocols in any detail. We assume some familiarity with the basic CDMA concepts used in TIA/EIA-95.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.61-69
• /
• 2015

Through Virtual Machine technology(VM), VMs can be packed into much fewer number of physical servers than that of VMs. Since even an idle physical server wastes more than 60% of max power consumption, it has been considered as one of energy saving technologies to minimize the number of physical servers by using the knapsack problem solution based on the computing resources. However, this paper shows that this tightly packed consolidation may not achieve the efficient energy saving. Instead, a service pattern-based VM consolidation algorithm is proposed. The proposed algorithm takes the service time of each VM into account, and consolidates VMs to physical servers in the way to minimize energy consumption. The comprehensive simulation results show that the proposed algorithm gains more than 30% power saving.

• The Journal of Bigdata
• /
• v.6 no.1
• /
• pp.1-12
• /
• 2021

The rapid growth of mobile-based online shopping and the appearance of untact business initiated by COVID-19 has led to an explosive increase in demand for logistics services such as delivery services. In order to respond to the rapidly growing demand, most logistics and distribution companies are working to improve customer service levels through the establishment of a full-filament center in the city center. However, due to social factors such as high land prices and traffic congestion, it becomes more difficult to establish the logistics facilities in the city center. In this study, it has been proposed the way to choose the candidate locations for the shared distribution centers among the space nearby the tall-gate which can be idle after the smart tolling service is widely extended. In order to evaluate the candidate locations, it has been evaluated the centralities of all candidates using social network analysis (SNA). To understand the result considering the characteristics of centrality, the network structure was regenerated based on the distance and the traveling time, respectively. It is possible to refer the result of evaluation based on the cumulative relative importance to choose the best set of candidates.

• Communications for Statistical Applications and Methods
• /
• v.25 no.4
• /
• pp.443-451
• /
• 2018

$P^M_{\lambda}$-service policy is a workload dependent hysteretic policy. The policy has two service states comprised of the ordinary stage and the fast stage. An ordinary service stage is initiated by the arrival of a customer in an idle state. When the workload of the server surpasses threshold ${\lambda}$, the ordinary service stage changes to the fast service state, and it continues until the system is empty. These service stages alternate in this manner. When the cost of changing service stages is high, the hysteretic policy is more efficient than the threshold policy, where a service stage changes immediately into the other service stage at either case of the workload's surpassing or crossing down a threshold. $P^M_{\lambda}$-service policy is a modification of $P^M_{\lambda}$-policy proposed to control finite dams, and also an extension of the well-known D-policy. The distributions of the stationary workload of $P^M_{\lambda}$-service policy and its variants are studied well. However, there is no known result on the sojourn time distribution. We prove that there is a relation between the sojourn time of a customer and the first up-crossing time of the workload process over the threshold ${\lambda}$ after the arrival of the customer. Using the relation and the duality of M/G/1 and G/M/1 queues, we obtain conditional sojourn time distributions in M/G/1 and G/M/1 queues under the policy.

• ETRI Journal
• /
• v.26 no.6
• /
• pp.665-668
• /
• 2004

The introduction of a mobile virtual network operator (MVNO) system is expected to increase consumer benefits, boost competition in the mobile market, utilize idle bandwidth, and expedite mobile-fixed line convergence and growth in the mobile Internet market. This research endeavors to study the optimal access charge for an MVNO system, which is expected to be introduced to the Korean mobile communications market. We found that the optimal access charge is higher in the interdependent model than in the independent model if demand for mobile phone service is based on a substitution relationship. We also found that the optimal access charge is higher than the marginal cost.

• Journal of Korean Society for Quality Management
• /
• v.32 no.3
• /
• pp.62-67
• /
• 2004

This paper presents and compares two block replacement policies under random use durations. The units are put in service altogether and then idle for some time. The time durations during which units are put in service are random variables. Two block replacement policies, called N-policy and T-policy, are presented. Under N-policy, units are replaced altogether after the Nth use. Under T-policy, units are replaced altogether at the end of the use after cumulative use time T elapses. The failures during use durations are replaced by new ones individually. The cost rate expressions under the policies are derived for exponential use durations. Numerical examples are presented to compare the performances of the two policies.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.4
• /
• pp.443-457
• /
• 2015

We consider the M/M/c/c queues in which the customers blocked to enter the service facility retry after a random amount of time and some of idle servers can leave the vacation. The vacation time and retrial time are assumed to be of phase type distribution. Approximation formulae for the distribution of the number of customers in service facility and the mean number of customers in orbit are presented. We provide an approximation for M/M/c/c queue with general retrial time and general vacation time by approximating the general distribution with phase type distribution. Some numerical results are presented.

• Journal of Information Technology Services
• /
• v.7 no.4
• /
• pp.209-219
• /
• 2008

Recently the number of Internet firms providing useful information like weather forecast data is growing. However most of such information is not prepared in accordance with customers' demand, resulting in relatively low customer satisfaction. To upgrade the service quality, it is recommended to devise a system for customers to get involved in the process of service production, which normally requires a huge investment on supporting computer systems like clusters. In this paper, as a way to cut down the budget for computer systems but to improve the performance, we extend the HPC cluster system to include other Internet servers working independently on the same LAN, to make use of their idle times. We also deal with some issues resulting from the extension, like the security problem and a possible deadlock caused by overload on some non-dedicated nodes. At the end, we apply the technique in the solution of some 2D grid problem.