• Journal of Digital Convergence
• /
• v.8 no.4
• /
• pp.205-213
• /
• 2010

In this days, information resources are very important in the organization. So, Many public institutions as well as private companies eager to IRM(information resource management). Especially, one of core elements in this IRM is server's performance. Determinating server's performance is a big issue of an acquired organization. In this paper, we examine the key performance issue of server purchase and then we proposed the three measurement method of sever's performance that is considered environment of public sector.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.6
• /
• pp.1-12
• /
• 2016

In this paper, we consider a general discrete-time queueing system with D-BMAP(discrete-time batch Markovian arrival process) and D-policy. An idle single server becomes busy when the total service times of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state workload distribution is derived in the form of generating function. Mean workload is derived as a performance measure. Simulation is also performed for the purpose of verification and a simple numerical example is shown.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.1
• /
• pp.53-63
• /
• 2018

In this paper, we analyze the waiting time of a queueing system with D-BMAP (discrete-time batch Markovian arrival process) and D-policy. Customer group or packets arrives at the system according to discrete-time Markovian arrival process, and an idle single server becomes busy when the total service time of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state waiting time distribution is derived in the form of a generating function. Mean waiting time is derived as a performance measure. Simulation is also performed for the purpose of verification and validation. Two simple numerical examples are shown.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.11a
• /
• pp.72-81
• /
• 2002

Management for security product and application is becoming more difficult because they became more specialized. Most of research is focused on combining policies for information security management policy, security standard, and security tools. However, there are no researches for total solution for both application and security policy. Thereby, the purpose of this research is to propose a remote integrated management system based on linux. The system could efficiently manage data update for application and policy update for a server supporting the distinct configuration of each server. By using the remote integrated management system, system manager with poor secure knowledge also could easily manage their system securely.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.11a
• /
• pp.72-81
• /
• 2002

Management for security product and application is becoming more difficult because they became more specialized. Most of research is focused on combining policies for information security management policy, security standard, and security tools. However, there are no researches for total solution for both application and security policy. Thereby, the purpose of this research is to propose a remote integrated management system based on linux. The system could efficiently manage data update for application and policy update for a server supporting the distinct configuration of each server. By using the remote integrated management system, system manager with poor secure knowledge also could easily manage their system securely.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.1
• /
• pp.77-84
• /
• 2002

An cluster system used consist of large number of running servers, one has the problem that does the low availability occured by the high chance of the server failures and it is difficult to provide occuring software aging. In this paper, running cluster web servers consists of n primary servers and k backup servers, based on the operational parameters such as number of running primary servers, number of backup severs, rejuvenation period, rejuvenation time, failure rate of sewers, repair rate of servers, unstable rate of servers. We calculate to evaluate the rejuvenation policy such steady-state probabilities, downtime, availability, and downtime cost. We validate the solutions of mathematical model by experiments based on various operation parameters and find that the software rejuvenation method can be adopted as prventive fault tolerant technique for stability of system. The failure rate and unstable rate of the servers are essential factors for decision making of the rejuvenation policies.

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

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1755-1758
• /
• 2003

본 논문에서는 리눅스 상에 효율적인 보안 정책 관리를 위한 보안 정책 서버를 분석하고, 보안 정책 변경을 위한 인터페이스를 설계하였다. 리눅스는 소스가 공개된 운영체제이기 때문에, 보안상의 취약점을 이용하여 수많은 공격을 당하게 된다. 이러한 보안상의 문제를 해결하기 위하여 본 논문에서는 효율적인 정책 서버를 분석하여 리눅스에 적용함으로써, 리눅스가 가지는 보안상의 취약점을 해결하고자 하였다. 또한 관리자가 쉽게 정책을 적용할 수 있도록 보안 정책 적용을 위한 인터페이스를 설계하였다. 설계된 보안 정책 서버를 통하여 기존 리눅스 커널의 수정을 최소화하면서, 다른 접근제어 모델을 사용한 때에는 관련 모듈만 교체만 하면 되기 때문에 이미 설정된 보안 정책을 손쉽게 변화 할 수 있다

• Journal of the Korea Computer Industry Society
• /
• v.3 no.2
• /
• pp.227-234
• /
• 2002

An cluster web server system, one has the problem that does the low availability occured by the high chance of the server failures and it is not easy to provide high performance and availability occuring software aging. In this paper, running cluster web sewers consists of n primary servers and k backup servers, propose software rejuvenation model on performance and switchover time. Based on the various system operational parameters, we calculate to evaluate the rejuvenation policy such steady-state probabilities, availability, and downtime cost. And we validate the solutions of mathematical model by experiments based on various operation parameters and fud that the software rejuvenation method can be adopted as prventive fault tolerant technique for stability of system.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.25-33
• /
• 2002

The efficiency of the data share service of P2P method is decided by the maintaining guard method of a sharing list, This paper suggests the data sharing system of the P2P base that it should retain a shared data list at a client, The Server at a proposed system guards inclusively client. divided into several groups and at each individual group, a client appointed the TopHost uses the method guarding a free share list of a applicating group, The TopHost designs to execute it relating with server in case of the mergence and the division of a group as well as a maintaining management of a data share list, The efficiency of the suggested system regard the maintaining guard of groups formed of a client of the appropriate level of a kernel and exams examination to measure it through a really executed data share service.