• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.2
• /
• pp.29-39
• /
• 2018

In this paper, we discuss a discrete-time queueing system with dyadic server control policy that combines workload control and multiple vacations. Customers arrive at the system with Bernoulli arrival process. If there is no customer to serve in the system, an idle single server spends a vacation of discrete random variable V and returns. The server repeats the vacation until the total service time of waiting customers exceeds the predetermined workload threshold D. In this paper, we derived the steady-state workload distribution of a discrete-time queueing system which is operating under a more realistic and flexible server control policy. Mean workload is also derived as a performance measure. The results are basis for the analysis of system performance measures such as queue lengths, waiting time, and sojourn time.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.9-13
• /
• 2007

This paper proposes a policy on efficient load balancing that can reduce the network game server load burdened by surging number of users. The study adopted a contents-based clustering technique. Recently, skyrocketing number of clients in on-line games causes overloads on specific game servers, and the consequent server-instability brings the worst situation: a server failure. To cope with this problem, one can install more high-powered servers or be equipped with back-up servers, which is often inefficient in terms of cost performance. To solve this problem, the present study examined the technology enhancing the performance and efficiency of game servers by reducing the loads of specific game servers. In doing this, this study used the clustering technology to compose game servers classified by their contents and carried out appropriate load balancing to numerous clients with load balancers in each region.

• 한국디지털정책학회:학술대회논문집
• /
• 2004.11a
• /
• pp.211-219
• /
• 2004

Due to rapid increases in Internet users, it becomes essential to provide well-established web services and monitor web server's load for the sake of reliable web server management. The existing web server load monitoring has been based on such cable methods as RPC, RMI, CORBA and etc. But it has the limitation in bringing information both anywhere and anytime over the Internet. This thesis is aimed to realize real-time wireless web server monitoring system based on Wireless Application Protocol (WAP). As any user can log on wirelessly to the Internet at any time through wireless terminals like PDA, the realization will make possible instant and real-time web server monitoring.

• Journal of Digital Convergence
• /
• v.7 no.3
• /
• pp.25-33
• /
• 2009

Historically, performance prediction and sizing of server systems have been the key purchasing argument for customer. To accurate server's sizing and performance prediction, it is necessary to correctness guideline for sizing and performance prediction. But existing guidelines have many errors. So, we examine the benchmarks of performance organization such as SPEC and TPC. And then we consider to TPC-C and TPC-E benchmarks for OLTP server's sizing and performance prediction that is a basic concept of guidelines. Eventually, we propose improvement of errors in guidelines.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.288-299
• /
• 2012

To ensure data confidentiality and fine-grained access control in business environment, system model using KP-ABE(Key Policy-Attribute Based Encryption) and PRE(Proxy Re-Encryption) has been proposed recently. However, in previous study, data confidentiality has been effected by decryption right concentrated on cloud server. Also, Yu's work does not consider a access privilege management, so existing work become dangerous to collusion attack between malicious user and cloud server. To resolve this problem, we propose secure system model against collusion attack through dividing data file into header which is sent to privilege manager group and body which is sent to cloud server and prevent modification attack for proxy re-encryption key using d Secret Sharing, We construct protocol model in medical environment.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.36-48
• /
• 1991

In this study, an efficient algorithm is developed to compute steady state probabilities for the following M$_{x}$G/1 server vacation system under control-operating poligy: At the end of a busy period, the server takes a sequence of vacations, each for a random amount of time. At the end of each vacation, he inspects the length of the queue. If the queue length at this time is equal to or greater than a prespecified threshold value r, he begins to serve the queue until it is empty.y.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.556-568
• /
• 2003

This paper presents and analyzes the performance of a weighted-window based cache replacement policy for the efficient media caching in streaming media cache servers. The proposed policy makes, for each cached object, use of the reference count, reference time, amount of media delivered to clients and, in particular, the periodic patterns of user requests. Also, by giving weights to the recently referenced media contents, the replacement policy adequately and swiftly reflects the ever-changing characteristics of users preferences. The simulation studies show that the performance of the proposed policy has improved over the conventional policies such as LRU, LFU and SEG - in terms of hit ratio, byte hit ratio, delayed start and cache input.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.97-100
• /
• 2000

As network resources have become faster and demands for multimedia service through network have increased, the demand for Media server system has increased. These kinds of media server solve their bottle neck problem of internal storage device by using parallel system which takes advantage of fast network resource. Many vendors have suggested each of their media server system to solve these problem radically, but most of them require major modification of infra component and additional drawback has added. For example, storage mechanism for specific media requires new file system which is totally different from traditional one, and algorithm for enhancing performance may not suit for traditional operating system environment. In this paper, we designed a parallel media server based on web interface of traditional system and implemented a program for media server. Implemented server system performs parallel processing through web interface without any modification of traditional system, and controls which is related to merging load by distributed data is charged only to client and control server and consequently load of storage server can be minimized. And also, data transfer protocol for streaming media includes Retransfer algorithm and client Admission control policy relevant to performance of whole system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.501-504
• /
• 2012

Personal Information Protection Law and Information Communication Network Law is administered from March, 2012 and August, 2012. It is very important to protect and manage the key well so that the third party doesn't know the key. Thus, at present, there increases an importance of Key Management Server. Key Management Server is an appliance type of hardware equipment which can securely store and manage encryption and decryption key. In this paper, we will survey on foreign key management server products and discuss about the necessities of legislation of related law and establishment of policy.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.05a
• /
• pp.61-66
• /
• 2002

We consider a generalized N-policy for an M/M/1 queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. We obtain the limiting distribution of the number of customers in the system. After assigning various operating costs to the system, we show that there exists a unique fast service rate minimizing the long-run average cost per unit time.