• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2682-2700
• /
• 2023

To cope with the risks of climate change and promote the realization of carbon peaking and carbon neutrality, this paper first comprehensively considers the policy background, technical trends and carbon reduction paths of energy conservation and emission reduction in data center server industry. Second, we propose a computing power carbon efficiency of data center server, and constructs the carbon emission per performance of server (CEPS) model. According to the model, this paper selects the mainstream data center servers for testing. The result shows that with the improvement of server performance, the total carbon emissions are rising. However, the speed of performance improvement is faster than that of carbon emission, hence the relative carbon emission per unit computing power shows a continuous decreasing trend. Moreover, there are some differences between different products, and it is calculated that the carbon emission per unit performance is 20-60KG when the service life of the server is five years.

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

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.217-226
• /
• 2001

In this paper, for continuous media access operations performed by Clustered Continuous Media Storage Server (CCMSS) system, we present the analytical model based on the open queueing network, which considers simultaneously two critical delay factors, the disk I/O and the internal network, in the CCMSS system. And we derive by using the analytical model the stochastic model for the total service delay time in the system. Next, we propose the integrated stochastic admission control model for the CCMSS system, which estimate the maximum number of admittable service requests at the allowable service failure rate by using the derived stochastic model and apply the derived number of requests in the admission control operation. For the performance evaluation of the proposed model, we evaluated the deadline miss rates by means of the previous stochastic model considering only the disk I/O and the propose stochastic model considering the disk I/O and the internal network, and compared the values with the results obtained from the simulation under the real cluster-based distributed media server environment. The evaluation showed that the proposed admission control policy reflects more precisely the delay factors in the CCMSS system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.25 no.1
• /
• pp.89-99
• /
• 2020

In this paper, we consider a dyadic server control policy that combines workload control and single vacation. Customer arrives at the system with Bernoulli process, waits until his or her turn, and then receives service on FCFS(First come first served) discipline. If there is no customer to serve in the system, the idle single server spends a vacation of discrete random variable V. If the total service times of the waiting customers at the end of vacation exceeds predetermined workload threshold D, the server starts service immediately, and if the total workload of the system at the end of the vacation is less than or equal to D, the server stands by until the workload exceeds threshold and becomes busy. For the discrete-time Geo/G/1 queueing system operated under this dyadic server control policy, an idle period is analyzed and the steady-state queue length distribution is derived in a form of generating function.

• Journal of applied mathematics & informatics
• /
• v.39 no.1_2
• /
• pp.173-196
• /
• 2021

This paper treats a retrial queue with phase type retrial times and a threshold type-policy, where each server is subject to breakdowns and repairs. Upon a server failure, the customer whose service gets interrupted will be handed over to another available server, if any; otherwise, the customer may opt to join the retrial orbit or depart from the system according to a Bernoulli trial. We analyze such a multi-server retrial queue using the recently introduced threshold-based retrial times for orbiting customers. Applying the matrix-analytic method, we carry out the steady-state analysis and report a few illustrative numerical examples.

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

• Journal of the Korean Statistical Society
• /
• v.28 no.4
• /
• pp.523-533
• /
• 1999

We consider the M/G/1 queueing model with D-policy. The server is turned off at the end of each busy period and is activated again only when the sum of the service times of all waiting customers exceeds a fixed value D. We obtain the distribution of unfinished work and show that the unfinished work decomposes into two random variables, one of which is the unfinished work of ordinary M/G/1 queue. We also derive the distribution of queue waiting time.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.141-149
• /
• 1999

In this paper, we consider multiple-class queueing systems in which the server starts a set-up as soon as the number of customers in the "start-up class" reaches threshold N. After the set-up the server starts his service. We obtain the Laplace-Stieltjes transform and the mean of the waiting times of each class of customers for FCFS and non-preemptive priority disciplines.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.53-55
• /
• 2000

인터넷의 급성장은 웹서버의 요청율을 급격하게 증가시키고 심각한 정체를 일으키고 있다. 이를 해결하기 위하여 클라이언트의 요청을 분산된 여러 서버들에게로 전달시키는 방법이 많이 사용되고 있다. 이 방법은 웹서버의 처리량을 향상시키고 확장성과 가용성을 제공하지만 서버들의 부하를 균등하게 하는 방법이 필요하게 된다. 이러한 부하 균등을 위해 크게 DNS(Domain Name Server)를 활용한 정책과 IP 단계에서 분배기(Dispatcher)를 사용한 정책이 제안되었다. 본 논문에서는 전자와 후자의 단점을 보완하고 성능을 향상시킨 다중 분배기를 제안하고 실험하였다.