• 한국디지털정책학회:학술대회논문집
• /
• 한국디지털정책학회 2004년도 춘계학술대회
• /
• pp.491-512
• /
• 2004

The purpose of this paper is to analyze and compare the existing digital media asset management systems and develop a prospective implementation model. As a result of conducting this research, it is recommended that the prospective system consist of archiving server, processing server, and interface program. This result suggests important starting point for development a resonable and reliable implementation model for digital media asset management system.

• 대한산업공학회지
• /
• 제28권3호
• /
• pp.319-330
• /
• 2002

We consider BMAP/G/1 queueing system with N-policy and multiple vacations. We derive the vector generating functions of the queue length in a factorized form and interpret the factorization. We also derive the mean queue length.

• 대한산업공학회지
• /
• 제14권2호
• /
• pp.1-10
• /
• 1988

We consider a vacation system in which the server takes two different types of vacations alternately. We obtain the server idle probability and derive the system size distribution and the waiting time distribution by defining supplementary variables. We show that the decomposition property works for these mixed-vacation queues. We also propose a method directly to obtain the waiting time distribution without resorting to the system equations. The T-policy is revisited and is shown that the cost is minimized when the length of vacations are the same.

• 대한산업공학회지
• /
• 제21권2호
• /
• pp.289-298
• /
• 1995

We consider a general queueing network with multi-server stations. The stations are under heavy traffics or moderate variable conditions. We develope an algorithm to determine the optimal loading policy, which minimizes the congestion in a network. Under more specified condition, majorization and arrangement orderings are established to compare, respectively, various loading and assignment policies. Implications of results are also discussed.

• 한국멀티미디어학회논문지
• /
• 제20권6호
• /
• pp.911-917
• /
• 2017

Tor proxy tool is studied which is most frequently used for ransomeware to penetrate into sensitive information. It will be researched for the malicious methods to spread virus by using Tor and considered a countermeasure to prevent them. We present exit relay methodology for Tor security policy, simulate it, and get a probability to detect the ransomeware. And we compare it with TSS technology which is able to protect the attack via virtual server on exit relay.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(3)
• /
• pp.153-156
• /
• 2002

As the use of world wide web is increasing, the number of connections to servers is increasing also. These interactions increase the load of networks and servers. therefore efficient caching strategies for web documents are needed to reduce server load and network traffics by migrating copies of server files closer to the clients that use those files. As One idea of caching policy, we propose a Weighted Disk Cache Replacement Policy(WDCRP) which analyses user's interaction to WWW and adds weight value to each web document. Especially the WDCRP takes account of the history data of cache log, the characteristics of Web requests and the importance of user interactive-actions.

• 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.

• 한국경영과학회지
• /
• 제31권1호
• /
• pp.1-13
• /
• 2006

In this paper we consider a design problem of a cyclic queueing network with two stages, each with a local buffer of limited capacity. Based on the theory of reversibility and product-form solution, we derive the throughput function of the network as a key performance measure to maximize. Two cases are considered. In case each stage consists of a single server, an optimal allocation policy of a given buffer capacity and work load between stages as well as the optimal number of customers is identified by exploiting the properties of the throughput function. In case each stage consists of multiple servers, the optimal policy developed for the single server case doesn't hold any more and an algorithm is developed to allocate with a small number of computations a given number of servers, buffer capacity as well as total work load and the total number of customers. The differences of the optimal policies between two cases and the implications of the results are also discussed. The results can be applied to support the design of certain manufacturing and computer/communication systems.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• pp.95-98
• /
• 2004

In this paper, we propose policy-based authentication framework which consists of policy server, CA and a policy language designed for ubiquitous environments. Using policies allows the security functionality to be modified without changing the implementation of the entities involved. Policy-based authentication framework needs to be very expressive but lightweight and easily extensible. We propose the feasibility of our policy language and policy-based authentication framework in ubiquitous-environment through a prototype and solve the problem that traditional framework have a simple registration and authentication to provide dynamic service.

• 대한산업공학회지
• /
• 제26권2호
• /
• pp.81-87
• /
• 2000

As for M/G/1 queueing system, we use various control policies, with which we can optimize the system. Up to now the most widely adopted policies are N-Policy, T-Policy, D-Policy, and so on. The existing researches are largely concerned to find an optimal operation condition or to optimize the system under single policy in M/G/1 system. There are, however, few literatures dealing with multiple control policies at once to enhance the flexibility of the model. In this study, we consider M/G/1 system adopting N-Policy and T-Policy simultaneously. If one of two conditions is satisfied, then, the server starts the service. We call this Min(N,T)-Policy. We find the probability distribution of the number of customers and mean waiting time in steady state and derive a cost function. Next, we seek the $N^*$, optimal threshold under various N values. Finally, we reveal the characteristics of cost function.