• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.247-250
• /
• 2001

멀티미디어 서버 시스템은 고용량이어야 하며 지속적으로 늘어나는 사용자수 뿐만 아니라 추가되는 새로운 저장 공간에 대한 우수한 확장성을 제공하여야 하는 것이 필수 불가결이다. 그러나 현재의 범용 서버 시스템은 이러한 요구사항을 충분히 반영하지 못할 뿐만 아니라 늘어나는 사용자 부하와 시스템 요구에 대한 고려, 그리고 미디어 데이터에 대한 반영이 이루어지지 못하여 점차 증가되는 사용자의 고화질 미디어 서비스 요구 사항을 충족시키지 못하고 있다. 본 논문에서는 구현된 시스템의 서비스 방식과 확장성 있는 구조가 고 대역폭 고화질 On-Demand 서버로서 효율적인 대안임을 보이며 또한 QoS 요구 보장과 효율적인 시스템 Management 정책을 제시하여 범용 서버를 멀티미디어 저장 및 Streaming 서버에 적합한 환경의 클러스터로 구성하는 방법을 제시한다.

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

This paper propose the DoubleQ web server that classifies incoming requests according to whether the requested document is cached or not. Requests that demand a cached document is put into the Service Queue while other requests are added to the Defer Queue. The DoubleQ web server services requests that are in the Service Queue before it services requests in the Defer Queue. This strategy is used to reduce disk accesses that have been the predominant overhead of traditional web servers. Experimental results using synthetic data show that improvements in the average user response time and the throughput of the web server may be achieved.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.597-601
• /
• 2003

무선랜 환경에서 무선랜 단말이 AP(Access Point)사이를 로밍(Roaming)할 때 무선랜단말의 안전한 핸드오프를 위한 프로토콜로서 IAPP(InterAccess Point Protocol)가 있고 관련된 IEEE표준으로 802.11f가 있다. 무선랜단말의 안전한 핸드오프를 위해서는 IAPP를 통하여 기존에 접속되었던 AP에서 새로운 AP에게 무선랜단말의 인증 또는 과금관련 정보를 안전하게 전달하는 것이 필요하다. IEEE 802.11f에서는 무선랜단말의 핸드오프를 지원하는 액세스포인트를 인증하고 AP사이의 안전한 통신을 위한 정보를 제공하는 IAPP서버로 라디우스(RADIUS) 서버를 권고한다. 본 논문에서는 라디우스 서버의 한계를 극복하고 보다 확장성과 신뢰성이 뛰어난 서버를 위해 Diameter를 사용한 IAPP 서버의 구조와 동작에 대해서 설 명 한다.

• Journal of Korea Game Society
• /
• v.15 no.2
• /
• pp.83-94
• /
• 2015

Methodology of server development is so important for the development of online game because the client where the users play the online game depends on the server. In this research, we have studied data linkage methods of the online game server which permits the server to save and retrieve the user data on the database. The data linkage method of the server is critical to make the users continue their games anywhere online. In this paper, several data linkage methods have been proposed and classified with their definitions. The proposed methods have been evaluated with the experimental data. It will contribute for the developer of online game server to choose a good data linkage method for the features of the game.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.1097-1104
• /
• 2002

Recently, with a drop in memory chip price and rapid development of mass storage memory chip technology, research on client-server Database Management Systems has gained wide attention. This Paper discusses the recovery technique in a page-server OODBMS environment. Although most researchers have studied client-server systems, the recovery technique has been a poor researches. In this paper, client transfers only the completed log records to the server and resolves the problems in the current recovery techniques. In addition, the server manages only the execution of completed log records suggesting a simple recover algorithm, Client uses system concurrency, fully, by acting to abort actions and it suggests a page unit recovery technique to reduce time that is required in the whole database.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.304-311
• /
• 2005

OCSP has specific characters which can suspend, close, and correct in real time. But, as more clients use the OCSP server verification, more updated information is needed, which can lead to jamming in the OCSP server. To apply this technique of Distributed OCSP server so as to reduce the certificate verification OCSP from jamming. Also, the Distributed OCSP server will solve the problems of the intensive central structure. Simulation results show that the average reply time of certificate verification request and server load are reduced in the case using distributed OCSP. In addition to this advantage, resource distribution and fault tolerance are acquired because of multiple OCSP.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.229-235
• /
• 2001

With the explosive popularity of the World Wide Web, the low penonnance of network often leads web clients to wait a long time for web server's response. To resolve this problem, web caching (proxy) has been considered as the most efficient technique for web server to handle this problem. The placement of web proxy is critical to the overall penonnance, and Li et al. showed the optimal placement of proxies for a web server in the internet with the linear and tree topology when the number of proxies, ]M, is given [4, 5]. They focused on minimizing the over all access time. However, it is also considerable for target web server to minimize the total number of proxies while each proxy server guarantees not to exceed certain res(Xlnse time for each request from its clients. In this paper, we consider the problem of finding the optimal number and placement of web proxies with the lin~ar and tree topology under the given threshold cost for delay time.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.73-88
• /
• 2006

With the development of Next Generation convergence Network, the current Internet needs a new network architecture and new session establishment methods, which can support various applications requiring differentiated traffic processing and high quality of service instead of the conventional best-effort service. It is expected that, in next generation network based on All-IP. SIP will play an important role in the session establishment between the end to end user terminals. In this paper, we propose a new network architecture that can provide quality of service based on SIP using the QoS enabled SIP servers and policy servers, and we also propose a new session establishment method that apply the user's demands participating the session establishment when setting up the session using the SIP. Through simulations under various environments, we show the parameter ranges in terms of server capacity and the number of users in access networks to achieve reasonable delay bounds.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.9
• /
• pp.918-926
• /
• 2010

A widget is a small application running by the users' favorite services, so they are provided with web contents without explicitly visiting the web site. Although widgets can be easily implemented with Open APIs, only a few web sites provide them because of refactoring the structures of web resource to supply Open APIs to the widget developers. This paper presents an Open API Proxy Server System for widget services. The system consists of two components: an Open API Source Code Generator and an Open API Proxy Server. The Open API Source Code Generator provides a Graphical User Interface (GUI) for users to generate the Open APIs of user's choice and sends the Open API source code generation request to the Open API Proxy Server. The Open API Proxy Server using the HTML Table Processing Library receives the HTML web page from web site and extracts useful information from the target HTML table. The proxy server converts the extracted data into the corresponding XML document which becomes available through the Open API. We verify the operation of the proposed system through experiments with the HTML tables in the example web sites.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.10a
• /
• pp.623-635
• /
• 1998

이 논문에서 우리는 분산 실시간 소프트웨어 설계방법인 CODARTS/DA(Concurrent Design Approach for Real-Time Systems/Distributed Application)를 위한 타스크 행위 명세방법을 제안한다. 각 타스크는 CODARTS/DA 모듈들, 즉, 다수 클라이언트/서버 모듈(Multiple Client/Sever Module), 단일 클라이언트/서버 모듈(Single Client/Server Module), 그룹 통신모듈(Group Comm. Module), 우선 순위 모듈등과 통신을 수행하는데, 분산환경의 동기, 비동기 문제들을 제안한 방법으로 설계 명세할 수 있다. 또한 제안된 명세방법은 C언어와 비슷한 문법구조를 제공하므로 쉽게 문서들이 구조적 프로그램으로 변환될 수있다.