• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.609-611
• /
• 2000

WWW의 대중화를 통한 인터넷 사용자의 증가로 발생되는 통신지연의 해결책으로 웹 캐싱 방법이 고려되어 왔다. 웹 서버의 용량초과로 서비스시스템을 확장하고자 할 때 서버 운영자의 측면에서는 사용자의 서비스 응답시간을 줄이는 것 못지 않게 서버를 확장하고 유지하는데 드는 비용을 최소화하는 것도 중요한 사항이다. 그러므로 본 논문에서는 인터넷상에서 프락시가 될 수 있는 잠재노드들이 양방향 통신을 지원하는 링크들로 선형(linear)과 고리(ring) 구조를 이룰 때 서비스 노드들 각각이 정해진 임계 응답시간을 보장하기에 필요한 최소한의 프락시의 개수와 그의 위치를 동시에 찾아내는 알고리즘을 제안한다. 여기서 프락시의 위치는 위상의 어느 족에 위치해도 무방하다고 본다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.166-168
• /
• 2000

자바가상기계(JVM : Java Virtual Machine)는 실행전에 바이트코드를 확인하는 바이트코드 검증기와 실행환경에서 점검하는 바이트코드 인터프리터를 포함한다. 자바 애플릿은 서비스 거부 공격이나, 사용자를 속이기 위한 조작한 링크 정보를 상태바에 보인다거나, 전자메일을 위조하여 보내는 등의 사용자에 유해한 행위를 할 수 있다. 웹브라우저를 통해 유해한 행동을 하는 클래스에 대해 사전에 바이트코드 수정을 통하여 안전한 클래스로 대체한다. 바이트코드 수정에는 클래스 수준 수정과 메소드 수준 수정이 있다. 클래스 수준 수정은 자바의 상속성을 이용하고. final 클래스나 인터페이스처럼 상속되지 않는 클래스는 메소드 수준에서 바이트 코드 수정을 한다. 메소드 수준 수정은 바이트코드 명령과 Constant Pool을 수정한다. 바이트 코드 수정을 적용하면 웹서버, 클라이언트, 브라우저에 대해 어떠한 별도의 작업도 필요없이 프락시 서버에서 유해클래스를 Safe 클래스로 수정한 후 브라우저에 보인다.

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

• Convergence Security Journal
• /
• v.8 no.1
• /
• pp.49-56
• /
• 2008

Recently, Phising attack uses trick of URL and sites, and technical concealment method which infiltrates sophisticated malicious code. However, sometimes Phising security technology cannot cover all of Phising methods. Consequently, this research proposes inspection to solve this problem. First, we can install Proxy server for a strong open information exchange of web environment between web servers and clients. Therefore, it compares and analyzes harmful site and Phising URL with White domain list, and filters them. Finally, designs for stable web based information so that we can block Phising with least regulation and active control. So the purpose of this paper is introducing this design system and structure, and inspect them.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.19-26
• /
• 2006

Recently, web server hacking is trending toward web application hacking which uses comparatively vulnerable web applications based on open sources. And, it is possible to hack databases using web interfaces because web servers are usually connected databases. Web application attacks use vulnerabilities not in web server itself, but in web application structure, logical error and code error. It is difficult to defend web applications from various attacks by only using pattern matching detection method and code modification. In this paper, we propose a method to secure the web applications based on profiling which can detect and filter out abnormal web application requests.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.1
• /
• pp.69-80
• /
• 2005

Recent popularity of web-ready mobile devices such as PDA and cellphone has made mobile Internet access very popular. However, most of existing Web contents and services are optimized for desktop computing environment and not well suited for mobile devices. Considering different system features of mobile devices such as small display and limited input capability, an alternative scheme to access the Web efficiently is required. On the other hand, personalization plays an important role in the tailored access to the Web contents and services. In this paper, we propose a proxy- based personalization scheme of Web service pages for mobile users. For that purpose, in addition to log data. service related features of Web pages are considered for the correct identification of popular services. It automatically provides mobile users with the tailored list of Web services well suited for diverse mobile devices. Consequently, mobile users can utilize customized Web services with minimum navigation on the mobile devices with limited capability. In order to show its effectiveness, we have performed several experiments on the prototype system and reported some of the results.

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

We propose a web document transcoding technique that translates existing web pages designed for desktop computers into an appropriate form for hand-held devices connected to the wireless internet. By defining a content block based on a visual separation and using it as a minimum unit for analyzing and converting processes, we can get web pages converted more exactly. We also apply the reallocation of the content block and the generation of new index in order to provide convenient interface without left-right scrolling in small screen devices. These methods, compared with existing ways such as text level summary or partial extraction method, can provide efficient navigation and a full recognition of web documents. To gain those transcoding benefits, we propose the Layout-Forming Tag Analysis Algorithm that analyzes structural tags, which motivate visual separation and the Component Grouping Algorithm that extracts the content block. We also classify and rearrange the content block and generate the new index to produce an appropriate form of web pages for small display devices. We have designed and implemented our transcoding system in a proxy server and evaluated the methods and the algorithms through an analysis of transcoded results. Our transcoding system showed a good result on most of popular web pages that have complicated structures.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.775-782
• /
• 2005

In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. The more the frequency of requesting the video is, the higher the probability of caching it among HENs increases. Therefore, the requests for the cached video data can be served by HENs. Multicast from server is generated when the playback time exceeds the amount of cached video data. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server's workload and the network bandwidth. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the Proposed multicast technique offers substantially better performance.