• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.610-612
• /
• 2002

본 논문에서는 HTTP/1.1을 효율적으로 지원하는 부하 분산 정책을 제안하고자 한다. 이 정책은 사용자의 첫 번째 요청이 전달되면 그 요청의 내장 객체 정보와 현재 살아 있는 HTTP 연결의 에이징(aging)을 고려하여 서버를 선택하는 알고리즘이다. 그리고 디스패처의 잘못된 분산 결정으로 인해 시스템의 성능에 누적되는 악영향을 최소화하기 위한 기법도 제시한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.113-115
• /
• 2000

주문형 비디오 서버와 같은 작업을 하는 멀티미디어 서버에서 검색 요청에 대한 보다 효율적인 서비스는 데이터 배치 기법에 의해 많은 영향을 받는다. 특히 사용자들에게 가장 인기있는 몇몇 비디오 데이터들은 많은 사용자들에 의해 동시에 요청되기도 하지만 짧은 시간 간격을 두고 연속적으로 요청되기도 하므로 인기있는 비디오 데이터일수록 데이터의 서로 다른 많은 부분이 동시에 검색될 수 있도록 효율적으로 배치시키는 것이 필요하다. 본 논문에서는 비디오 데이터의 인기도 즉 요청 정도에 따라 스트라이핑 폭을 동적으로 결정하는 배치 정책을 제안하고 실험읕 통해 기존의 정책과 비교한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.538-540
• /
• 2001

클러스터 시스템의 각 노드에 존재하는 메모리들을 효율적으로 관리하기 위하여 네트워크 메모리의 개념이 등장하였으며 빈번하게 디스크를 접근하는 응용분야에서 속도 향상을 위해 사용될 수 있다. 이는 전통적인 메모리 계층(hierarchy) 구조인 메모리와 디스크 사이에 네트워크 메모리를 추가함으로써 얻어진다. 본 논문에서는 웹 서버 클러스터를 대상으로 문서의 접근 유형에 대한 사전의 정보를 요구하지 않고 실제적으로 구현 가능하며 다양한 웹 문서 접근 확률 분포 값에 대하여 항상 우수한 사용자 응답시간을 가지는 메모리 관리 기법을 제안하고 시뮬레이션을 통해 제안된 방식의 우수성을 검증하였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.6-9
• /
• 2002

다수의 사용자 요구에 의한 비디오 타이틀을 실시간으로 제공해야 하는 VOD 서비스는 서버/클라이언트 양쪽에서 서로의 상태를 제어하여 비디오 프레임을 송수신하는 메카니즘이 필요하다. 본 논문에서는 VOD 서비스 구현의 일환으로 네트워크의 변화에 따라 동적으로 변하는 클라이언트의 버퍼 상태를 감시하여 서버에 제어신호를 발하고, 이에 따라 MPEG의 역 하이브리드 부호화로 프레임을 드로핑 전송하는 정책을 제시하여 최소한의 프레임 분실 및 파기를 방지하고자 한다.

• The KIPS Transactions:PartC
• /
• v.19C no.2
• /
• pp.135-144
• /
• 2012

All the servers in a traditional server cluster environment are kept On. If the request load reaches to the maximum, we exploit its maximum possible performance, otherwise, we exploit only some portion of maximum possible performance so that the efficiency of server power consumption becomes low. We can improve the efficiency of power consumption by controlling power mode of servers according to load situation, that is, by making On only minimum number of servers needed to handle current load while making Off the remaining servers. In the existing power mode control method, they used a static policy to decide server power mode at a fixed time interval so that it cannot adapt well to the dynamically changing load situation. In order to improve the existing method, we propose a dynamic server power control algorithm. In the proposed method, we keep the history of server power consumption and, based on it, predict whether power consumption increases in the near future. Based on this prediction, we dynamically change the time interval to decide server power mode. We performed experiments with a cluster of 30 PCs. Experimental results show that our proposed method keeps the same performance while reducing 29% of power consumption compared to the existing method. In addition, our proposed method allows to increase the average CPU utilization by 66%.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.287-292
• /
• 2001

Multimedia service systems should have efficient capacity to serve the growing clients and new data. In the general streaming services, users can endure the small amount of time delay at the beginning of service. But they want to have good quality of service. A streaming server tries to transfer video files to clients from a repository of files in real time. The server must guarantee concurrent and uninterrupted delivery of each video stream requested from clients. To achieve its purpose, many stream servers adopt multi-processors, sufficient memory, and RAID or SAN in their systems. In this paper, we propose a Linux-based parallel media streaming server. It is superior to the other systems in the storing structure, fault-tolerance, and service capacity. Since this system supports the web interlace, users can operate easily through the www. This system uses unique striping policy to distribute multimedia files into the parallel storage nodes. If a service request occurs, each storage node transmits striped files concurrently to the client. Its performance is better than the single media streaming service because of the parallel architecture.

• 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 Digital Convergence
• /
• v.14 no.11
• /
• pp.283-288
• /
• 2016

This research is to study IoT based implementation of system and network for medical information processing. This paper's configuration environment consists of sensor node, gateway and server node as a basic IoT architecture. Medical terminal as a sensor node asks connect request to his server, and the server accepts the request if the medical device is already registered. Wearable medical device sends its collected sensing data to server, and server processes the received data for data visualization or saves them for usage in the future. This paper describes overall processes and their algorithms and suggests their software processing architecture.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.305-315
• /
• 2007

Broadband Convergence Network (BcN) is the network which unifies telephone network, the Internet and broadcasting networks. Threats to each network can bring serious problems in BcN environment since the whole network can be damaged by various types of attack. The purpose of this study is to suggest the prototype of intrusion-tolerant network design of BcN to guarantee the continuous operation of BcN services against malicious attacks. First, BcN service components, selected by analysis of service time and coverage importance, are classified into three groups by their type: server type, gateway type and hybrid type. Second, the necessity of applying intrusion tolerance on BcN services is deduced by possible attack scenarios on BcN. Finally, we suggest the intrusion-tolerant network design suitable to BcN, using hardware redundancy and secure policies. Also, we present that the suggested network design can increase the intrusion tolerance of BcN.

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