• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.115-122
• /
• 2002

This paper presents a new web cluster scheme based on dispatcher which does not depend on operating system for server and can examine server's status interactively. Two principal functions are proposed for new web cluster technique. The one is self-controlled load distribution and the other is transaction fail-safe. Self-controlled load distribution function checks response time and status of servers periodically, then it decides where the traffic goes to guarantee rapid response for every query. Transaction fail-safe function can recover lost queries including broken transaction immediately from server errors. Proposed new web cluster scheme is implemented by C language on Unix operating system and compared with legacy web cluster products. On the comparison with broadcast based web cluster, proposed new web cluster results higher performance as more traffic comes. And on the comparison with a round-robin DNS based web cluster, it results similar performance at the case of traffic processing. But when the situation of one server crashed, proposed web cluster processed traffics more reliably without lost queries. So, new web cluster scheme Proposed on this dissertation can give alternative plan about highly increasing traffics and server load due to heavy traffics to build more reliable and utilized services.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.29-36
• /
• 2004

As the number of Internet users and the amount of web contents have increased very fast, reducing the load of web servers and providing web services more rapidly have been great issues. A web-cache system, which is located between the user and the web server, has been used by many web service providers as an effective way to reduce the load of web servers and the web service response time. In this paper, we have developed a web-cache system which is based on the Squid cache and has a compression capability. The web-cache system in which compression capability reduces the amount of network traffic and the web service response time by transfering the web contents in the compressed format over the network between the web-cache system and the user. The performance enhancement is greater in the reverse-cache system than in the forward-cache system because in the case of the reverse-cache system, the cache reduces the amount of traffic on the Internet which is the bottleneck in the network path between the user and the web server. The experimentation result shows that the amount of data traffic has reduced from 2 to 8 times depending on the size of the web contents. The web server response time has reduced 37% on the average and when the size of the web content is greater than 10Kbyte, the response time has reduced 87% on the average.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.37-45
• /
• 2004

As Internet technologies are mature, many new applications that are different characteristics are emerging. Recently we see wide use of P2P(Peer to Peer) applications of which traffic shows different statistical characteristics compared with traditional application such as web(HTTP) and FTP(File Transfer Protocol). In this paper, we measured subscriber network of KT(Korea Telecom) to analyze P2P traffic characteristics. We show flow characteristics of measured traffic. We also estimate Hurst parameter of P2P traffic and compare self-similarity with web traffic. Analysis results indicate that P2P traffic is much bustier than web traffic and makes both upstream traffic and downstream traffic be symmetric. To predict parameters related QoS such as packet loss and delays we model P2P traffic using two self-similar traffic models and predict both loss probability and mm delay then compare their accuracies. With simulation we show that the self-similar traffic models we derive predict the performance of P2P traffic accurately and thus when we design a network or evaluate its performance, we can use the P2P traffic model as reference input traffic.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.101-106
• /
• 2014

Information and Communication Technology environment has been developing rapidly and variety of services are in service. As data becomes increasingly sophisticated. These data was applied techniques of visualization in order to visualize efficiently. Various agencies are providing the map based data in real-time. However, traffic information is getting more complex and users are having a difficulty to understand with convential visualization techniques. This study was designed and implemented in the web service of traffic information using Focus+Context. Web service implemented HTML5(Hyper Text Markup Language 5), and it runs on browser of either desktop or mobile devices. This study sets an example as web application from a user perspective by combining information visualization and traffic information.

• Journal of Korean Medicine Rehabilitation
• /
• v.27 no.4
• /
• pp.131-145
• /
• 2017

Objectives The purpose of this study is to understand current status of Korean Medicine treatment practice patterns for traffic injuries by web-based survey. Methods The structured questionnaire was distributed by a web based survey to 1,630 potential respondents by email from December 19th in 2016 to February 13th in 2017. All data were statistically analysed. Results The response rate was 79.4%. According to the analysis of the outcome of the survey, 88.0% of the participants felt necessity of the development of Korean medicine clinical practice guidelines (CPGs) for traffic injuries. Survey results showed cognitive degree about Korean Medicine CPGs' necessity, individual Korean medicine treatments and requirement for extending insurance coverage for patients with traffic injuries. Conclusions This survey study helps to determine current clinical practice patterns of Korea medicine treatments for traffic injuries. These results further anticipate to provide basic data for CPGs for traffic injuries.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.161-164
• /
• 2003

The sharing of caches among Web proxies is an important technique to reduce Web Traffic and alleviate network bottlenecks. Additionally, due to emerging network technologies cooperative Web caching among proxies shows great promise to become an effective approach for reducing Web document access latencies. Nevertheless it is not widely deployed due to the overhead of existing protocols such as ICP. We propose iSCSI-based hierarchical web caching scheme which provides more improved performance than existing web caching scheme.

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.477-482
• /
• 2010

Recently, advanced Internet applications such as Internet telephone, multimedia streaming, and file sharing have appeared. Especially, P2P or web-based file sharing applications have been notorious for their illegal usage of contents and massive traffic consumption by a few users. This paper presents a novel method to identify the P2P or web-based file names with traffic monitoring. For this purpose, we have utilized the Korean decoding method on the IP packet payload. From experiments, we have shown that the file names requested by BitTorrent, Clubbox, and Tple applications could be correctly identified.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.79-85
• /
• 2005

In order to handle client's requests while multiple servers seamlessly work in the web server cluster environment, it is vital to implement a router that execute a routing using TCP information and requested target content. The implemented package software measured packet volume that was generated from data generator, virtual server, and server 1, 2, 3, and could find out traffic distribution toward Server 1, 2, 3. As the result of the study shows, Round Robin Algorithm ensured definite traffic distribution, unless incoming data loads differ much. Although error levels were high in some partial cases, they were eventually alleviated by repeated tests for a longer time.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.197-206
• /
• 2019

Software-defined networking (SDN) is a modern approach for current computer and data networks. The increase in the number of business websites has resulted in an exponential growth in web traffic. To cope with the increased demands, multiple web servers with a front-end load balancer are widely used by organizations and businesses as a viable solution to improve the performance. In this paper, we propose a load-balancing mechanism for SDN. Our approach allocates web requests to each server according to its response time and the traffic volume of the corresponding switch port. The centralized SDN controller periodically collects this information to maintain an up-to-date view of the load distribution among the servers, and incoming user requests are redirected to the most appropriate server. The simulation results confirm the superiority of our approach compared to several other techniques. Compared to LBBSRT, round robin, and random selection methods, our mechanism improves the average response time by 19.58%, 33.94%, and 57.41%, respectively. Furthermore, the average improvement of throughput in comparison with these algorithms is 16.52%, 29.72%, and 58.27%, respectively.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.3
• /
• pp.10-18
• /
• 2007

According to the recent growth of the internet commercialization and differentiated QoS(quality of service), statistical traffic modeling is necessary for forecasting and controlling future network capacity. This paper reviews tile essential components in web workloads. And I propose adjusted internet traffic modeling using heavy-tailed distributions and intervention techniques.