• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.253-256
• /
• 2000

In general, Automated Storage/Retrieval Systems (AS/RS ) have racks of equal sized cells to utilize the concept of unit-load. Most of the techniques for the performance estimation of a unit-load AS/RS are a static model or computer simulation. Especially, their models were developed under assumption that the Storage/Retrieval (S/R) machine performs only single command (SC) or dual command (DC). In reality, defending on the operating policy and the status of the system at a particular time, the S/B machine performs a SC or a DC, or becomes .: idle. In order to resolve these weak points, we propose a stochastic model for the performance estimation of unit-load AS/RS by using a single-server queueing model. Expected numbers of waiting storage and retrieval commands are found

• 한국디지털정책학회:학술대회논문집
• /
• 2006.06a
• /
• pp.311-318
• /
• 2006

In this study, It is suggested how to utilize hardware capacity sizing system for WEB, WAS, OLTP server's CPU, memory, and disk capacity by its user reasonably. To achieve goal of this study, we presented specific approaches in aspect of institutional viewpoint. The result of this study can be reflected gradually in the guideline of informatization related budgeting by MPB(Ministry of Planning and Budget) and e-government supporting program.

• International Journal of Contents
• /
• v.8 no.3
• /
• pp.79-82
• /
• 2012

In digital contents distribution environments, a user authentication is an important security primitive to allow only authenticated user to use right services by checking the validity of membership. For example, in Internet Protocol Television (IPTV) environments, it is required to provide an access control according to the policy of content provider. Remote user authentication and key agreement scheme is used to validate the contents accessibility of a user. We propose a novel user authentication scheme using smart cards providing a secure access to multimedia contents service. Each user is authenticated using a subset of attributes which are issued in the registration phase without revealing individual's identity. Our scheme provides the anonymous authentication and the various permissions according to the combination of attributes which are assigned to each user. In spite of more functionality, the result of performance analysis shows that the computation and communication cost is very low. Using this scheme, the security of contents distribution environments in the client-server model can be significantly improved.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.89-92
• /
• 1996

It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in B-ISDN. We consider a hierarchical two level network architecture for VOD service. The first level consists of connected Local Video Servers(LVSs) in which a limited number of high vision programs are stored. The second level has one Central Video Server(CVS) containing all the programs served in the network. The purpose of this paper is to analyze the network traffic and to propose the storage policy for LVSs. For this purpose, we present an analysis of program storage amount in each LVS, transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.351-373
• /
• 2020

There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method.

• Journal of The Korean Association of Information Education
• /
• v.7 no.3
• /
• pp.353-361
• /
• 2003

All elementary, middle, and high schools have many Personal Computers(PC) by educational information policy, and their computers have been applied to the school education. However, it is difficult to manage the PCs, and it cost to maintain the PCs and PCs must be upgaded and replaced each four years. In order to solve these problem, I propose the method of using the terminal server. This method can make the software and PC hardware maintain easily, and reduce the maintenance fee, need not upgrade and replace the new PCs.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1155-1160
• /
• 2003

This paper applies RBAC policy for solving on the security problems when it will be operated several business on the distributed environments and designed Extended RBAC (ERBAC) model that it is possible to manage security systems on the distributed environments. The designed ERBAC model is based on RBAC96 model due to Sandu et al and added role delegations. Therefor, the designed ERBAC model have the advantage of the following . it can be processed of business without interrupts and implemented server system without modifying its source code, high migration, easy and simple of secure managing.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.4
• /
• pp.67-73
• /
• 2010

A Wireless Sensor Network(WSN) is a promising infrastructure for the future U-healthcare system. In a WSN for the U-healthcare system, both biometric data and location data are transferred hierarchically from lots of mobile patients to the base station server and some countermeasures are made in real time if necessary. In this process, we encounter the load-balancing problem when many patients gather in a specific area. We also encounter the data duplication problem when each patient moves into an area monitored by several supervisors. The second problem is closely related to the first one. In this paper, we propose a mobile patient monitoring system with priority-based policy in load-balancing to solve the previous two problems and perform a DEVS Java-based system simulation to verify the system efficiency.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.111-121
• /
• 2002

In this paper, we analyze an M$^{x}$ /G/1 with three types of vacation periods including setup time. Three types of vacations are : N-policy, single vacation, and multiple vacation. We consider compound poisson arrival process and general service time, where the server starts his service when a setup is completed. We find the PGF of the number of customers in system and LST of waiting time, with welch we obtain their means. A decomposition property for the system sloe and waiting time is described also.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.643-645
• /
• 2001

인터넷이라는 환경이 우리의 생활의 일부로 자리잡으면서, 급속히 늘어난 사용자들의 요구는 그 만큼 네트워크의 현저한 부하증가를 일으키고 네트워크의 성능저하를 유발하며 속도 면에서도 빠른 응답을 원하는 사용자들의 욕구를 충족시키지 못하게 된다. 이에 대한 하나의 대응책이, 프락시 서버를 사용함으로써 네트워크 대역폭을 효과적으로 절약하고 서버 측의 부하를 감소시키며 사용자의 요청에 대한 빠른 응답이 가능하게 하는 것이다. 그러나 프락시 서버는 제한된 캐시용량 때문에 새 개체를 위한 공간확보를 위해 기존 개체를 제거해야 하는데, 캐시의 성능을 최대화하도록 하는 효율적인 캐시대체 정책이 필요하다. 기존의 대체정책이 캐시성능판단의 두 기준인 히트율(Hit Rate)과 바이트히트율(Byte Hit Rate)을 만족시키지 못하던지 흑은 불필요한 개체에 공간을 낭비하는 등 최대한치 공간활용을 못하는 단점을 가지고 있다. 본 논문에서는 캐시를 상위층과 하위충의 2단계로 나누어 운용하면서, 상위층은 분할된 여러개의 파티션으로 관리하여 히트율과 바이트율을 높게 유지하고 하위층은 상위의 각각의 파티션들에 추가적으로 필요한 캐시공간을 제공함으로서 동적인 파티션공간분할 효과를 제공하는 프락시 서버의 캐시구조와 캐시대체정책을 제안한다.