• Journal of the Korea Computer Industry Society
• /
• v.2 no.11
• /
• pp.1453-1464
• /
• 2001

Explosive growth of Internet populations results performance degradations of web service. Popular web sites cannot provide proper level of services to many requests, and such poor services cannot give user a satisfaction. Web caching, the remedy of this problem, reduces the amount of network traffic and gives fast response to user. In this paper, we analyze the characteristics of web cache traffics using traces of NLANR(National Laboratory for Applied Network Research) root caches and Education network cache in Seoul National University. Based on this analysis, we suggest a method of prefetching and we discuss the gains of our prefetching. As a result, we find proposed prefetching enhances hit rate up to 3%, response time up to 5%.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.167-172
• /
• 2005

A rapid growth in the number of Internet users and in massive media contents tends to cause server overload and high network traffic. As a consequence, it can be safely assumed that the quality of service is on the brink of deterioration. A solution of this problem is the development of the Content Distribution Network. Therefore, in this paper, we propose a transmission model using CDN. This model uses regional media server which closes to client, and uses MDC coding and multi-channel to reduce packet loss and delay. In conclusion, this study improved performance of multimedia service by reducing packet loss and delay.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.6
• /
• pp.73-79
• /
• 2020

Nowadays, with the rapid spread of streaming services in the internet world, security vulnerabilities are also increasing rapidly. For streaming security, this paper proposes a PN(pseudo-random noise) distributed structure-based security processor for web streaming contents(SP-WSC). The proposed SP-WSC is basically a PN distributed code algorithm designed for web streaming characteristics, so it can secure various multimedia contents. The proposed SP-WSC is independent of the security vulnerability of the web server. Therefore, SP-WSC can work regardless of the vulnerability of the web server. That is, the SP-WSC protects the multimedia contents by increasing the defense against external unauthorized signals. Incidentally it also suggests way to reduce buffering due to traffic overload.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.11-18
• /
• 2011

The increasing of web users load to the excessive transmission traffic and system overload problems. To solve these problems, cluster systems are studied. In conventional cluster systems, when the request size is large owing to such types as multimedia and CGI, the particular server load and response time tend to increase even if the overall loads are distributed evenly. In this paper, we consider the methodology of efficient resource usage, specially distributed web cluster system. We develope an algorithm that distributes the load on the web cluster system to use the system resources, such as system memory equally. The response time is chosen as a performance measure on the various clustering models. And based on the concurrent user to the web cluster system, the response time is also examined as the number of users increases. Simulation experience with this algorithm shows that the response time and average throughput seems to have a good results compare to those with the other algorithm.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.8
• /
• pp.327-334
• /
• 2013

Today's network traffic has become extremely complex and diverse since the speed of network became faster and a variety of application services appear. Moreover, many applications appear and disappear fast and continuously. However, the current traffic classification system does not give much attention to this dynamic change of applications. In this paper, we propose an application awareness system in order to solve this problem. The application awareness system can provide the information, such as the usage trend of conventional applications and the emergence of new applications by recognizing the application name in a rapidly changing network environment. In order to recognize the application name, the Host field of HTTP protocol has been utilized. The proposed mechanism consists of two steps. First, the system generates the candidates of application name by extracting the domain name from the Host field in HTTP packet. Second, the administrator confirms the name afterward. The validity of the proposed system has been proved through the experiments in campus network.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.69-75
• /
• 2012

In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.673-676
• /
• 2000

본 논문에서는 네트워크 트래픽 분석은 물론 자원을 관리하고 서버 및 특정 서비스에 대하 분석 자료를 제공하는 통합 시스템을 자바 언어로 구현하였다. SNMP 지원 모듈과 TCPdump 모듈, 그리고 시스템 관리 명령 모듈 등을 이용하여 구성 관리, 성능 관리, 장애 관리 및 시스템 자원 관리와 같은 상세 정보의 제공과 함에 다양한 자료 수집과 통계 분석을 통해 상세 보고서를 생성한다. 뿐만 아니라, 관리 대상 범위를 도메인 별로 구분하여 자료 수집을 독립시킴으로써 관리를 위한 트래픽이 전체 네트워크에 영향을 미치지 않도록 설계하였고, 실시간 모니터링은 물론 DB 에 최소화된 자료를 유지함으로써 네트워크 및 시스템에 대한 영속적인 관리 및 통계가 가능하도록 하여 운영의 항구성과 안정성, 분석의 정확성과 일치성, 사용의 편의성과 효용성을 제공하고자 하였다.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.705-715
• /
• 2005

A peer-to-peer web caching has been studied recently as it can reduce the traffic converged on the server side and can support the traditional web caching model. Although the peer-to-peer web caching has the merit of having additional cache space from the local caches of peers without additional infrastructure, several constraints such as dynamic participation and local caching strategy caused by the autonomy of peers in peer-to-peer networks nay limit the performance of the peer-to-peer web caching. To overcome these limitations, we propose an efficient directory-based peer-to-peer web caching system under dynamic participation of peers. In the proposed caching system, we present new peer selection and replica management schemes by introducing the concept of the object lifetime in P2P networks. We evaluate the effectiveness of the proposed system through trace-driven simulations with a web log dataset. Simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in feasible peer-to-peer networks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.346-353
• /
• 2002

The explosive increase of World Wide Web usage has incurred significant amount of network traffic and server load. To overcome these problems, web proxy caching replicates frequently requested documents in the web proxy closer to the users. Cache utilization depends on the replacement policy which tries to store frequently requested documents in near future. Temporal locality and Zipf frequency distribution, which are commonly observed in web proxy workloads, are considered as the important properties to predict the popularity of documents. In this paper, we propose a novel cache replacement policy, called Adaptive LFU (ALFU), which incorporates 1) Zipf frequency distribution by utilizing LFU and 2) temporal locality adaptively by measuring the amount of the popularity reduction of documents as time passed efficiently. We evaluate the performance of ALFU by comparing it to other policies via trace-driven simulation. Experimental results show that ALFU outperforms other policies.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.1-10
• /
• 2002

According to the rapid evolution of internet, the number of internet users has greatly increased, so that the web servers are getting more important. If there are a great number of users trying to connect to a popular web server, the load of the web server will increase rapidly, so that failures may occur or web services may stop. An efficient load monitoring technique is required for the available web services and the performance management. The traditional techniques for load monitoring of web server using the client-server method have the problem that the server programs in client-server method must be pre-installed to all web servers. This paper implements web server load monitoring system using the mobile agent in order to overcome the problem of client-server computing. The system based on the mobile agent has no need to install the program in advance and it reduces the network traffic and the additional overheads in web servers.