• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.469-474
• /
• 2004

As traffic on the web increases, users are faced with increasing delays. A key performance measure for the web is the speed with which object is served to users. Web caching is the one of the key method that improve performance of Web base system. Also, many studies for efficient management of storing scope on cache are performed actively. An important issue in web caching is how to improve a efficiency of a caching system. For this, efficient web cache management is required. A solution for this is to set up the caching strategy that consider a heterogeneity of Web object. In this paper, We propose a new web caching technique for a performance improvement of a multimedia object process. The proposed method is based on a heterogeneity of Web object, and it increases performance of a caching system by increasing the caching efficiency of a multimedia object. In the experiment, We verified performance improvement of proposed web caching system through performance analysis of a proposed system.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.735-737
• /
• 1998

이 논문은 WWW와 데이터베이스의 시스템 통합에 있어서 독립서버로 운영될 때 CGI응용 프로그램의 과부하를 줄이는 복제 서버 시스템 모델[1]에서 데이터베이스 시스템에 매번 연결 및 종료 시 발생되는 접속 시간의 증가를 감소시킬 수 있는 cache기법의 도입과 함께 WWW 서버의 시스템 큐 (queue)의 길이로 시스템 작업량을 측정하여 가장 작업량이 적은 서버를 선택하는 조장자 (coordinator)에 cache정보를 기록하는 기능을 추가하여 보다 원활한 WWW작업 분배를 기대할 수 있고 안전성이 향상된 모델을 제시한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.4
• /
• pp.559-572
• /
• 2020

As internet technology advances, users can share content online, and many sharing services exist. According to a recently published digital forensic study, when playing an online streaming service, you can restore the played video by reconstructing the Chrome cache file left on local device such as a PC. This can be seen as evidence that the user watched illegal video content. From a different point of view, copyright infringement occurs when a malicious user restores video stream and share it to another site. In this paper, we selected 23 online streaming services that are widely used both at home and abroad. After streaming videos, we tested whether we can recover original video using cache files stored on the PC or not. As a result, the paper found that in most sites we can restore the original video by reconstructing cache files. Furthermore, this study also discussed methodologies for preventing copyright infringement in online streaming service.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2137-2142
• /
• 2003

One of the important performance metrics of the World Wide Web is how fast and precise a request from users will be serviced successfully. Shared Web Caching (SWC) is one of the techniques to improve the performance of the network system. In Shared Web Caching Systems, the key issue is on deciding when and where an item is cached, and also how to transfer the correct and reliable information to the users quickly. Such SWC distributes the items to the proxies which have sufficient capacity such as the processing time and the cache sizes. In this study, the Hot Spot Prediction Algorithm (HSPA) has been suggested to improve the consistent hashing algorithm in the point of the load balancing, hit rate with a shorter response time. This method predicts the popular hot spots using a prediction model. The hot spots have been patched to the proper proxies according to the load-balancing algorithm. Also a simulator is developed to utilize the suggested algorithm using PERL language. The computer simulation result proves the performance of the suggested algorithm. The suggested algorithm is tested using the consistent hashing in the point of the load balancing and the hit rate.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.32-38
• /
• 2015

In this paper, we propose a smallcell local caching algorithm under user's context in smallcell environment. The proposed system reduces traffic to core network and the network cost, but increases it's performance. The proposed algorithm precache suitable files using smallcell's regional characteristics and target's personality. It can adjusts a storage allocation to make effective usage of our limited cache storage capacity. In order to evaluate the performance of the proposed cache algorithm, we define the cache efficiency, the decrement of core network traffic. The simulation results show that the proposed algorithm can improve performance by about 200% compared to existing web cache scheme.

• Journal of Convergence Society for SMB
• /
• v.4 no.1
• /
• pp.47-53
• /
• 2014

DNS spoofing, the DNS server with the address of a specific web server intercepts them in the process of translating the attacker wants to forge a Web server that is a way to access. ARP spoofing ARP request and response messages for the protocol without authentication vorticity incorrect information as to the ARP Cache Table to store the MAC addresses of their vulnerability using the MAC address of the other computer as if it were a lie technique. These DNS / ARP spoofing attacks in detail to find out about how it looks at ways to prevent. Think about the future research directions.

• Proceedings of the CALSEC Conference
• /
• 2001.08a
• /
• pp.631-635
• /
• 2001

The Synchronized Multimedia Integration Language (SMIL) is a declarative markup language based on the eXtensible Markup Language (XML) to define a set of markup tags for synchronizing the timing and positioning relationships between multimedia objects. SMIL makes authoring of TV-like multimedia presentations on the Web easier for applications such as electronic commerce. We present the design and implementation of a JAVA-based SMIL player, which processes different types of media objects using multiple threads. Moreover, its cache engine detects the media type and allocates the proper cache memory for the corresponding media object.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1115-1123
• /
• 2000

Most of the existing web caches are used in huge organizations. But many internet users belong to small organizations such as a venture company or a PC room. Users are in general in multiple window environments, and use several programs concurrently with rapid preference change within a relatively short period of time. We develop a network-path based algorithm. It organizes a cache according to the network paths of the requested URLs and builds a network cache farm where caches are logically connected with each other and each cache has its own preference over certain network paths. The algorithm has been implemented and tested in a real site. The performance results show that the new algorithm outperforms the existing algorithms in the hit ratio and response time dramatically with low cost.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1754-1764
• /
• 2004

Lately mobile handheld devices such as Personal Digital Assistant (PDA) and cellular phones are getting more popular for personal web surfing. However, today most mobile handheld devices have relatively poor web browsing capability due to their low performance so their users have to suffer longer communication latency than those of desktop Personal Computers (PCs). In this paper, we propose an effective pre-refresh mechanism for embedded web browser of mobile handheld devices to reduce this problem. The proposed mechanism uses the idle time to pre-refresh the expired web objects in an embedded web browser's cache memory. It increases the utilization of Central Processing Unit (CPU) power and network bandwidth during the idle time and consequently reduces the client's latency and web browsing cost. An experiment was done using a simulator designed by us to evaluate the efficacy of the proposed mechanism. The experiment result demonstrates that it has a good performance to make web surfing faster.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.87-94
• /
• 2003

As the number of the Internet users increases explosively, a solution for this problem is web caching. So, many techniques on improving cache server performance have been suggested. In this paper, we analyze the cause of the bottleneck in cache servers, and propose an arbitral thread and delayed caching mechanism as a solution. We use an arbitral thread in order to provide a quick service to user requests through eliminating the ready multi-thread search problem in case of disk writing operation. We also use delayed caching in order to provide stable system operation through avoiding overloaded disk operation and queue threshold. Proposed cache server is implemented through modification on SQUlD cache server, and we compare its performance with the original SQUID cache server.