• Title/Summary/Keyword: Network cache

Search Result 273, Processing Time 0.039 seconds

Cache Layout Management for Reducing Network Traffic (네트워크 트래픽 절감을 위한 캐시 배치 구조)

  • Ku, Tai-Yeon;Chung, Young-Sik;Park, Jong-Youl
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06d
    • /
    • pp.249-250
    • /
    • 2012
  • 스마트 캐쉬 시스템은 콘텐츠 전달망에서 콘텐츠 트래픽 양을 감소시키기 위해 필수적인 기술로써 가입자 네트워크 구간에 콘텐츠를 자동 저장하여 중복 전송을 최소화 하는 시스템이다. 부하 분산 시스템을 통해 특정 스마트 캐쉬 서버로 집중되는 요청을 분산하고 콘텐츠 요청자의 주소에 따른 최적의 스마트 캐쉬를 지정하는 기술이다. 이를 통해 스마트 캐쉬를 적용한 글로벌 딜리버리 클라우드 플랫폼을 구축하여 콘텐츠 전송 플랫폼 기술의 국내 기업 경쟁력을 확보할 수 있고, 차세대 콘텐츠 유통 시장에서의 기술력 확보와 국내 업체의 세계 시장 지배력 강화할 수 있다.

An Effective Pre-refresh Mechanism for Embedded Web Browser of Mobile Handheld Devices

  • Li Huaqiang;Kim Young-Hak;Kim Tae-Hyung
    • 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.

  • PDF

An Optimized Address Lookup Method in the Multi-way Search Tree (멀티웨이 트리에서의 최적화된 어드레스 룩업 방법)

  • 이강복;이상연;이형섭
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.261-264
    • /
    • 2001
  • This paper relates to a node structure of a multiway search tree and a search method using the node structure and, more particularly, to a search method for accelerating its search speed by reducing the depth of each small tree in a multi-way search tree. The proposed idea can increase the number of keys capable of being recorded on a cache line by using one pointer at a node of the multi-way search tree so that the number of branches in a network address search is also increased and thus the tree depth is reduced. As a result, this idea can accelerate the search speed and the speed of the forwarding engine and accomplish a further speed-up by decreasing required memories and thus increasing a memory rate.

  • PDF

A Study on a Design of Efficient Electronic Commerce System

  • Ko Il-Seok;Shin Seung-Soo;Choi Seung-Kwon;Cho Yong-Hwan
    • 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.

  • PDF

A Network Cache Management Policy for Continuous Media Objects Service (연속형 미디어 스트림 서비스를 위한 네트워크 캐쉬 관리 정책)

  • 박세철;손유익
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10c
    • /
    • pp.247-249
    • /
    • 2001
  • 본 논문에서는 패칭 기법[3]을 사용한 프락시 관리 기법을 사용하여 연속형 스트립 서비스를 하는 스트림 서비스 기법을 제안한다. 제안한 기법에서는 프락시에 캐슁된 데이터의 양에 따라 스트림 전송 방식을 달리한다. 첫째, 요청된 객체 전체가 캐슁되어 있을 경우 프락시 만으로 서비스 한다. 둘째, 요청된 객체가 전혀 캐쉽 되어있지 않을 경우 후행 스트림들이 서버로부터 객체를 전송할 때 발생하는 초기 지연을 상쇄할 만큼의 데이터를 선반입 한다. 셋째, 일부분 만이 캐슁 된 경우에는 해당 객체를 요청 하는 스트림 사이에 존재하는 데이터 양만큼을 프락시에 패칭하며 이 경우에는 사용자 노드는 두개의 채널을 열어 하나는 프락시에 패칭된 데이터를 읽는데 사용하며 또 하나의 채널로는 서버로부터 나머지 부분을 읽어오는데 사용한다.

  • PDF

A Client-based distributed web caching system (클라이언트 기반 분산 웹캐싱 시스템)

  • Park, Jong-Ho;Yoo, Sung-Goo;Chong, Kil-To
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.829-830
    • /
    • 2006
  • A distributed web caching system can transmit information to a user quickly and stably, avoiding a congested internet network by storing and later supplying requested content to a cache that is distributed and shared like a proxy server. This paper proposes a client-based distributed web caching system that assigns an object and controls the load using a user's direct connection to shared caches, without the aid of additional domain name system (DNS) requests. The proposed system simplifies information transmission by reducing both DNS queries and delay time.

  • PDF

A Study of System Log and Volatile Information Collection for Computer Forensics (컴퓨터 포렌식스 지원을 위한 시스템 로그 및 휘발성 정보 수집에 관한 연구)

  • Gho, Eun-Ju;Oh, Se-Min;Jang, Eun-Gyeom;Lee, Jong-Sub;Choi, Yong-Rak
    • The Journal of Information Technology
    • /
    • v.10 no.4
    • /
    • pp.41-56
    • /
    • 2007
  • In Digital Computing Environment, volatile information such as register, cache memory, and network information are hard to make certain of a real-time collection because such volatile information are easily modified or disappeared. Thus, a collection of volatile information is one of important step for computer forensics system on ubiquitous computing. In this paper, we propose a volatile information collection module, which collects variable volatile information of server system based on memory mapping in real-time.

  • PDF

A Study of Information Collection for Computer Forensics on Digital Contents Computing Environment (디지털 콘텐츠 컴퓨팅 환경에서의 컴퓨터 포렌식스 정보 수집에 관한 연구 기술에 관한 연구)

  • Lee, Jong-Sup;Jang, Eun-Gyeom;Choi, Yong-Rak
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.507-513
    • /
    • 2008
  • In Digital Contents Computing Environment, information such as register, cache memory, and network information are hard to make certain of a real-time collection because such information collection are easily modified or disappeared. Thus, a collection of information is one of important step for computer forensics system on Digital Contents computing. In this paper, we propose information collection module, which collects variable information of server system based on memory mapping in real-time.

  • PDF

Communication Resource Allocation Strategy of Internet of Vehicles Based on MEC

  • Ma, Zhiqiang
    • Journal of Information Processing Systems
    • /
    • v.18 no.3
    • /
    • pp.389-401
    • /
    • 2022
  • The business of Internet of Vehicles (IoV) is growing rapidly, and the large amount of data exchange has caused problems of large mobile network communication delay and large energy loss. A strategy for resource allocation of IoV communication based on mobile edge computing (MEC) is thus proposed. First, a model of the cloud-side collaborative cache and resource allocation system for the IoV is designed. Vehicles can offload tasks to MEC servers or neighboring vehicles for communication. Then, the communication model and the calculation model of IoV system are comprehensively analyzed. The optimization objective of minimizing delay and energy consumption is constructed. Finally, the on-board computing task is coded, and the optimization problem is transformed into a knapsack problem. The optimal resource allocation strategy is obtained through genetic algorithm. The simulation results based on the MATLAB platform show that: The proposed strategy offloads tasks to the MEC server or neighboring vehicles, making full use of system resources. In different situations, the energy consumption does not exceed 300 J and 180 J, with an average delay of 210 ms, effectively reducing system overhead and improving response speed.

Implementation of a cache performance analyzer for roadside network based on SMPL (SMPL을 이용한 노변 네트워크 캐쉬 성능 분석기의 구현)

  • Lee, Junghoon
    • Annual Conference of KIPS
    • /
    • 2009.04a
    • /
    • pp.1045-1046
    • /
    • 2009
  • 본 논문에서는 이산 이벤트 시뮬레이터인 SMPL을 이용하여 노변 네트워크에서의 데이터 처리에 따르는 데이터 캐쉬 성능분석기를 구현한다. 구현된 성능분석기는 SMPL의 요청 도착과 서비스 사건 처리를 기본 골격으로 하여 실제 차량의 궤적 데이터에 기반한 데이터 요청 생성부와 큐잉 정책과 캐쉬 정책을 선택할 수 있는 정책 처리부 등으로 구성된다. 이 분석기는 서비스율, 해당 정책, 캐쉬의 크기 등의 수행인자를 설정하여 이에 따르는 큐 길이의 분포, 캐쉬의 히트율, 요청 처리시간의 분포 등을 측정할 수 있도록 한다. 추정된 성능 요소를 기반으로 노변 네트워크에 기반한 차량 텔레매틱스 시스템에서 RSU(RoadSide Unit)의 배치, 성능 요구사항 분석, 새로운 큐잉 정책과 캐쉬 정책의 설계 등 다양한 응용이 가능하다.