• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.555-562
• /
• 2002

Increasing of electronic commerce users and high-capacity multimedia data is the main causes of increasing of load and network traffic in electronic commerce system. Increasing of load and network traffic brings the delay of service about client's request. And it's becoming factor that decreases customer satisfaction and corporation's competitive ability. So it is needed to research that consider efficient management and response time of electronic commerce system. In this paper, we designed electronic commerce system based on local server with web cashing function in order to solve load problem of electronic commerce system. And we proposed web cashing algorithm for local web server and analyzed performance by an experiment.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.45-52
• /
• 2015

We propose a hybrid prefix caching scheme to enable high speed IP address lookup. All prefixes loaded in a prefix cache should not be overlapped in address range for correct IP lookup. So, every non-leaf prefix needs to be expanded not so as to be overlapped. The shorter expanded prefix is more preferable because it can cover wider address range just as an single entry in a prefix cache. We exploits advantages of two dynamic prefix expansion techniques, bounded prefix expansion technique and bitmap-based prefix expansion technique. The proposed scheme uses dual bound values whereas just one bound value is used in bounded prefix expansion. Our elaborated technique make the dual bound values be associated with several subtries flexibly using bitmap information, rather than with fixed subtries. We evaluate the performance of the proposed scheme in terms of the average length of the expanded prefixes and cache miss ratio. The experiment results show the proposed scheme has lower cache miss ratio than other previous schemes including both bounded prefix expansion and bitmap-based expansion irrespective of the cache size.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.686-688
• /
• 2003

워크플로우 시스템의 핵심을 이루고 있는 엔진의 효율성을 극대화 시키기 위하여, 워크플로우 시스템 엔진 안에서 운용되는 데이터의 관리는 매우 중요하다. 본 논문에서는 워크를로우 시스템에서 운용되는 각 시스템 데이터의 특징을 고찰 한 후, 일반적으로 사용하는 데이터 베이스 시스템 호출을 통해 데이터를 관리하는 방법을 보완 할 수 있는 방법을 제시한다. 그 방법으로 각 시스템 데이터가 가지고 있는 특성에 맞추어 기존의 데이터 베이스 호출을 통한 방법에 메모리에 데이터를 로드시켜 공용적으로 사용하는 방법을 더해 시스템 데이터를 관리하는 방법을 기술한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.75-82
• /
• 2008

Mobile IP was proposed to overcome identity problem of original IP address system caused by mobility of wireless mobile host. To complete its network handoff procedure, it must receive a mobile advertisement broadcasted by mobile agent. Generally, in a mobile IP system, mean time delay, 500ms, in a network handoff procedure is a critical problem of wireless service such as Voip, multimedia streaming. A caching agent caches a latest mobile advertisement, and replays it by receiving solicitation message from a mobile node finishing link layer detection. But, during the procedure of mobile registration, many packets from service provider to the mobile host would be lost and handoff time delay would be increased. In this thesis, we propose an unproved caching agent technique which can forward data packets while handoff procedure, and CoA pool for fast mobile IP registration.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.103-106
• /
• 2004

A wireless Internet proxy server cluster has to Distillation and Caching functions in order that a user on wireless internet can use existing wired internet service. Distillation function works to distill HTML documents and included images according to the defined preference by a user. When a user requests repeatedly, Caching function decreases response time by reusing original and distilled images or HTML documents. In this paper, we proposed enhanced distillation and caching functions. We performed experiments using 16 PCs and experimental results show the effectiveness of the proposed system compared to the existing system.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.74-79
• /
• 2011

The goal of this research is to reduce dynamic and static power consumption for a low power cache system. The proposed cache can achieve a low power consumption by using a drowsy and a way prediction mechanism. For reducing the static power, the drowsy technique is used at 4-way set associative cache. And for reducing the dynamic energy, one among four ways is selectively accessed on the basis of information in the Way-Line Prediction Unit (WLPU). This prediction mechanism does not introduce any additional delay though prediction misses are occurred. The WLPU can effectively reduce the performance overhead of the conventional drowsy caching by waking only a drowsy cache line and one way in advance. Our results show that the proposed cache can reduce the power consumption by about 40% compared with the 4-way drowsy cache.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.371-375
• /
• 2005

Giving service in the web environment, which is the service, service, connected to the database server and receiving data from query causes a problem. It declines the efficiency of down loading and offering server service. Through obtaining data from database cashing or database clustering have used in the researches these days.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.191-194
• /
• 2006

정보 공유를 위한 거대한 정보 시스템인 월드 와이드 웹의 폭발적인 증가는 기존 네트워크의 트래픽을 유발시키고 서버의 부하를 가져오는 가장 큰 원이니 되고 있다. 많은 요청으로 인하여 원활한 서비스를 제공하기 어렵고, 또한 만족할만한 응답시간을 보장받지 못하고 있다. 이러한 병목현상의 해결방안으로 주목받고 있는 것이 웹 캐시이다. 본 논문에서는 웹 캐싱기법의 기본적인 기술 측면과 다양한 캐싱기법들을 분석해 보고, 보다 효율적인 캐시 시스템을 구현하기 위한 캐시 시스템을 제안한다. 동일한 네티워크 내에서 일정 수준 이상의 접속 회수를 보여주는 웹 객체를 우선적으로 선반입 하는 사용자 액세스 패턴을 이용한 캐시 시스템을 구현하여 본다. 또한 동일한 네트워크 내에서 일반적인 캐싱 알고리즘을 채용한 캐시와 실험 결과를 비교하여 평가한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.21-28
• /
• 2008

In this paper, we proposed an algorithm that reduces call setup time between the IP PBXs installed in the main office and several branch offices. In the IP PBXs installed in branch offices, we prepare some internal memory spaces, and they keep the frequently used extension numbers and the corresponding IP PBX's addresses. In order to call an extension number registered to the other remote IP PBX from an extension number registered to the local IP PBX, the local PBX searches for the destined extension from its internal memory first. If the extension is found, then the local PBX uses its corresponding IP PBX address stored along with the extension, instead of making a query to the main office's IP PBX. By this technique, we could shorten the average call setup time and verified it by an experiment.

• Journal of Broadcast Engineering
• /
• v.23 no.4
• /
• pp.549-558
• /
• 2018

We designed and implemented streaming server based on MEPG DASH, which is able to provide high quality video with low-latency live streaming service like 360 VR video on the existing cable network via low-spec media service devices such as IPTV and OTT(Over the Top) SettopBox. We also designed and applied management process which is cable of supporting services by cashing streaming video file(MPD, Segment Files) to reduce the server response delay time. Further more, we confimred that it is also able to provide high quality of tiled video streaming with over 50,000kbps bitrate and 8K@60P through the experiment.