• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.234-240
• /
• 2004

Now that the e-commerce users are explosively increasing, there is always followed by a sharp increase in load from the e-commerce system and the heavy traffic on the network, where leads to the delayed service for the client's request. The natural consequences contain decreasing customer satisfaction and weakening the business's competitive position in markets. Therefore, we'll need to study the e-commerce system in due consideration of the operational efficiency and response speed. This study includes a design of e-commerce system, with a hierarchical structure based on the local server, which has the capability of caching necessary to distribute the system load, makes a proposal concerning a split web-cache algorithm devoted to the local web server to finally give an analysis of the performance through the appropriate trial.

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

1990년대 초반에 등장한 인터넷을 기반으로 하는 서비스 중에 하나인 웹은 대중적인 인기를 확보하여 사용량이 기하급수적으로 증가하고 있다. 인터넷 사용자와 서비스 제공자의 증가에 따라 같은 객체에 대한 중복요청이 네트워크 대역폭의 상당 부분을 차지하여 불필요하게 낭비되며 일부 인기있는 서버로 부하가 집중되어 응답시간이 길어지게 된다. 이와 같은 문제를 해결하기 위해 인터넷 캐슁기법이 도입되어 연구되어 왔다. 사용자의 지연시간 및 네트워크 전송용량이 사용효율은 어떻게 캐슁을 설계하고 운영하는가에 따라 많은 영향을 받게 된다. 본 논문에서는 인터넷 캐슁을 위해 설계된 기존의 전략들을 살펴보고 우리의 새로운 알고리즘을 제안한다. 그리고, 각 알고리즘의 성능을 trace-driven 모의실험을 통해 검증한다.

• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.173-178
• /
• 2013

To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like network with improved peer features to better meet the mobility requirement of ad-hoc networks. The proposed system introduces a novel caching optimization technique and enhanced ultrapeer selection scheme to make communication more efficient between peers and ultrapeers. The paper also describes an enhanced query mechanism for efficient searching by applying multiple walker random walks with a jump and replication technique. According to the simulation results, the proposed system yields better performance than Gnutella, XL-Gnutella, and random walk in terms of the query success rate, query response time, network load, and overhead.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.649-651
• /
• 2005

본 논문에서는 실제 모바일 환경에서의 멀티미디어 컨텐츠의 요청 패턴을 분석하고 그 결과를 반영한 캐싱 알고리즘을 제안한다. 로그 데이터를 분석한 결과 컨텐츠의 연속적인 요청이 매우 짧은 시간 동안 이루어지는 시간적인 특성을 발견했으며, 컨텐츠의 다른 버전 사이의 요청 시간이 짧음을 통해서 버전별 컨텐츠의 요청이 응집되어 나타남을 확인했다. 제안된 알고리즘에서는 시간적인 특성과 컨텐츠의 인기도 특성을 반영하기 위해 측정 시간 윈도우 내에서 컨텐츠의 요청 횟수를 측정하고, 요청 횟수의 임계값 이상의 컨텐츠에 대해서 유지 시간 단위만큼의 컨텐츠 만료 시간을 정한다. 또한 공간적인 특성을 이용하여 컨텐츠가 캐시에서 제거될 때, 만료시간이 지난 컨텐츠의 다른 버전을 동시에 캐시에서 제거하는 방법을 사용한다 실험 결과 캐시의 크기가 작은 경우 제안된 알고리즘이 기존 알고리즘에 비해 $1-5\%$ 정도 성능향상을 보였다.

• Journal of Information Processing Systems
• /
• v.20 no.1
• /
• pp.131-147
• /
• 2024

A routing strategy based on traffic prediction and dynamic cache allocation for satellite nodes is proposed to address the issues of high propagation delay and overall delay of inter-satellite and satellite-to-ground links in low Earth orbit (LEO) satellite systems. The spatial and temporal correlations of satellite network traffic were analyzed, and the relevant traffic through the target satellite was extracted as raw input for traffic prediction. An improved gradient boosting regression tree algorithm was used for traffic prediction. Based on the traffic prediction results, a dynamic cache allocation routing strategy is proposed. The satellite nodes periodically monitor the traffic load on inter-satellite links (ISLs) and dynamically allocate cache resources for each ISL with neighboring nodes. Simulation results demonstrate that the proposed routing strategy effectively reduces packet loss rate and average end-to-end delay and improves the distribution of services across the entire network.

• Journal of KIISE:Information Networking
• /
• v.27 no.3
• /
• pp.301-314
• /
• 2000

As the number of World Wide Web (Web) users grows, Web traffic continues to increase at an exponential rate. Currently, Web traffic is one of the major components of Internet traffic. Also, high bandwodth usage due to Web traffic is observed during peak periods while leaving bandwidth usage idle during off-peak periods. One of the solutions to reduce Web traffic and speed up Web access is through the use of Web caching. Unfortunately, Web caching has limitations for reducing network bandwidth usage during peak periods. In this paper, we focus our attention on the use of a prefetching algorithm for reducing bandwidth during peak periods by using off-peak period bandwidth. We propose a statistical, batch, proxy-side prefetching scheme that improves cache hit rate while only requiring a small amount of storage. Web objects that were accessed many times in previous 24 hours but would be expired in the next 24 hours, are selected and prefetched in our scheme. We present simulation results based on Web proxy and show that this prefetching algorithm can reduce peak time bandwidth using off-peak bandwidth.

• Journal of KIISE:Software and Applications
• /
• v.34 no.6
• /
• pp.519-529
• /
• 2007

In this paper, we investigate the use of fuzzy rules for efficient intrusion detection. We use evolutionary algorithm to optimize the set of fuzzy rules for intrusion detection by constructing fuzzy decision trees. For efficient execution of evolutionary algorithm we use supervised clustering to generate an initial set of membership functions for fuzzy rules. In our method both performance and complexity of fuzzy rules (or fuzzy decision trees) are taken into account in fitness evaluation. We also use evaluation with data partition, membership degree caching and zero-pruning to reduce time for construction and evaluation of fuzzy decision trees. For performance evaluation, we experimented with our method over the intrusion detection data of KDD'99 Cup, and confirmed that our method outperformed the existing methods. Compared with the KDD'99 Cup winner, the accuracy was increased by 1.54% while the cost was reduced by 20.8%.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.81-94
• /
• 2005

Recently, wireless LAN circumstance is being widely deployed in Public spots. Many People use Portable equipments such as PDA and laptop computer for multimedia applications, and also demand of mobility support is increasing. However, handoff latency is inevitably occurred between both APs when clients move from one AP to another. To reduce handoff latency. in this paper, we suggest WFH(Weighted Frequent Handoff) using effective data structure. WFH improves cache hit ratio using a new cache replacement algorithm considering the movement pattern of users. It also reduces unessential duplicate traffics. Our algorithm uses FHR(Frequent Handoff Region) that can change pre-authentication lesion according to QoS based user level, movement Pattern and Neighbor Graph that dynamically captures network movement topology.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.798-802
• /
• 2008

In this paper, we consider mobile ad hoc network routing protocols with respect to content sharing applications. We show that by utilizing social relations among participants, our routing protocols can improve its performance and efficiency of caching. Moreover, in certain situation which we can anticipate pattern of user's content consumption, our scheme can help such applications be more efficient in terms of access time and network overhead. Using NS2 simulator, we compare our scheme to DSDV and routing protocol using shortest path algorithm.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.330-338
• /
• 2006

Many web cache systems and policies concerning them have been proposed. These studies, however, consider large objects less useful than small objects in terms of performance, and evict them as soon as possible. Even if this approach increases the hit rate, the byte hit rate decreases and the connections occurring over congested links to outside networks waste more bandwidth in obtaining large objects. This paper puts forth a client-cluster approach for improving the web cache system. The client-cluster is composed of the residual resources of clients and utilizes them as exclusive storage for large objects. This proposed system achieves not only a high hit rate but also a high byte hit rate, while reducing outgoing traffic. The distributed hash table (DHT) based peer-to-peer lookup protocol is utilized to manage the client-cluster. With the natural characteristics of this protocol, the proposed system with the client-cluster is self-organizing, fault-tolerant, well-balanced, and scalable. Additionally, the large objects are managed with an index based allocation method, which balances the loads of all clients well. The performance of the cache system is examined via a trace driven simulation and an effective enhancement of the proxy cache performance is demonstrated.