• Title/Summary/Keyword: In-network Caching

Search Result 169, Processing Time 0.026 seconds

New Control System Aspects for Supporting Complex Data and High Performance System

  • Yoo, Dae-Seung;Tan, Vu Van;Yi, Myeong-Jae
    • Journal of Computing Science and Engineering
    • /
    • v.2 no.4
    • /
    • pp.394-411
    • /
    • 2008
  • The data in automation and control systems can be achieved not only from different field devices but also from different OPC (OLE for Process Control) servers. However, current OPC clients can only read and decode the simple data from OPC servers. They will have some problems to acquire structured data and exchange the structured data. In addition to the large network control systems, the OPC clients can read, write, and subscribe to thousands of data points from/to OPC servers. Due to that, the most important factor for building a high performance and scalable industrial control system is the ability to transfer the process data between server and client in the most efficient and fastest way. In order to solve these problems, we propose a means to implement the OPC DA (Data Access) server supporting the OPC complex data, so that the OPC DA clients are able to read and decode any type of data from OPC servers. We also propose a method for caching the process data in large industrial control systems to overcome the limitation of performance of the pure OPC DA system. The performance analysis and discussion indicate that the proposed system has an acceptable performance and is feasible in order for applying to real-time industrial systems today.

An Efficient Caching Scheme to Enhance the Response Time of Geospatial Web Services (지리공간 웹 기반 서비스에서 응답시간을 향상시키기 위한 효율적인 캐싱 기법)

  • Moon, Jin-Yong
    • Journal of Digital Contents Society
    • /
    • v.10 no.3
    • /
    • pp.395-400
    • /
    • 2009
  • The wide spread of the Internet service has brought in web GIS development. But, there are problems of the user access latencies, the network traffic, and the server overload in Internet Geographic Information System because spatial data are transferred in large volumes. In this paper, I propose a cache algorithm on client side to solve the above problems. The proposed algorithm demonstrates the performance improvement over known studies by utilizing unit time and spatial proximity. In addition, this paper conducts a performance evaluation to measure the improvement in algorithm efficiency and analyzes the results of the performance evaluation. When spatial data queries are conducted, according to our performance evaluation, hit rate has been improved over the existing algorithms.

  • PDF

Prefetching Methods with User's Preference in Mobile Computing Environment (이동컴퓨팅 환경에서 사용자의 선호도를 고려한 프리페칭)

  • Choi, In-Seon;Cho, Gi-Hwan
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.651-658
    • /
    • 2006
  • Mobile computing environment is known to be quite difficult to provide user with a stable QoS(Qualify of Service) due to its mobility nature. In order to protect the inherent characteristics of wireless network such as low bandwidth and high transmission delay along with the user's mobility, many works are conducted to apply caching and prefetching methods. This paper presents a novel prefetching technique which is based on user's preference, that is, interest and Uuかity. It tries to improves the effectiveness of prefetching by separating and appling the interest with personal tendency of a given information, and the popularity with general tendency of the information. The proposed scheme shown relatively superior performance in terms of the utilization ratio of prefetched information and the failure ratio of information retrieval than the existing methods.

Efficient Service Discovery Scheme based on Clustering for Ubiquitous Computing Environments (유비쿼터스 컴퓨팅 환경에서 클러스터링 기반 효율적인 서비스 디스커버리 기법)

  • Kang, Eun-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.123-128
    • /
    • 2009
  • In ubiquitous computing environments, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery scheme that is combined a node id-based clustering service discovery scheme and a P2P caching-based information spreading scheme. To search quickly a service, proposed scheme store key information in neighbor's local cache and search services using it's information. We do not use a central look up server and do not rely on flooding. Through simulation, we show that the proposed scheme improves the performance of response time and network load compared to other methods.

  • PDF

Multi-Level Streaming Using Fuzzy Similarity in P2P Distribution Mobile Networks (P2P 분산 모바일 네트워크상에서 퍼지 유사도를 이용한 멀티-레벨 스트리밍)

  • Lee, Chong-Deuk
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.3
    • /
    • pp.364-371
    • /
    • 2011
  • In P2P distribution mobile networks, QoS of streaming media services are under heavy influence from overheads such as congestion, latency, and interference. The problem is further complicated by the fact that the popularity of media objects changes over time. This paper proposes a new FSMS+ (Fuzzy Similarity-based Multi-level Streaming Scheme) which minimizes performance degradation of streaming services due to overhead. We then utilize fuzzy similarity-based relevance that can dynamically stream the streaming media object with minimum overhead. The simulation result showed that the proposed scheme has better performance in retransmission rate, congestion control rate and latency rate than the other existing methods of distance method, DC (disk caching) method, and prefix method.

Caching Methods of Client-Server Systems for Vector Map Services based on Mibile Phone (휴대폰 기반 벡터 지도 서비스를 위한 클라이언트-서버 시스템의 캐슁기법)

  • 김진덕;최진오
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.3
    • /
    • pp.452-458
    • /
    • 2002
  • Although the reuse of the cached data for scrolling the map reduces the amount of passed data between client and server, it needs the conversions of data coordinates, selertive deletion of objects and cache compaction at client. The conversion is time intensive operation due to limited resources of mobile phones such as low computing power, small memory. Therefore, for the efficient map control in the vector map service based mobile phone, it is necessary to study the method for reducing wireless network bandwidth and for overwhelming the limited resources of mobile phone as well. This paper proposes the methods for racking pre-received spatial objects in client-server systems for mobile CIS. We also analyze the strengths and drawbacks between the reuse of cached data and transmission of raw data respectively.

A Performance Improvement Scheme for a Wireless Internet Proxy Server Cluster (무선 인터넷 프록시 서버 클러스터 성능 개선)

  • Kwak, Hu-Keun;Chung, Kyu-Sik
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.415-426
    • /
    • 2005
  • Wireless internet, which becomes a hot social issue, has limitations due to the following characteristics, as different from wired internet. It has low bandwidth, frequent disconnection, low computing power, and small screen in user terminal. Also, it has technical issues to Improve in terms of user mobility, network protocol, security, and etc. Wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. In this paper, wireless internet proxy server clusters are used for the wireless Internet because their caching, distillation, and clustering functions are helpful to overcome the above limitations and needs. TranSend was proposed as a clustering based wireless internet proxy server but it has disadvantages; 1) its scalability is difficult to achieve because there is no systematic way to do it and 2) its structure is complex because of the inefficient communication structure among modules. In our former research, we proposed the All-in-one structure which can be scalable in a systematic way but it also has disadvantages; 1) data sharing among cache servers is not allowed and 2) its communication structure among modules is complex. In this paper, we proposed its improved scheme which has an efficient communication structure among modules and allows data to be shared among cache servers. We performed experiments using 16 PCs and experimental results show 54.86$\%$ and 4.70$\%$ performance improvement of the proposed system compared to TranSend and All-in-one system respectively Due to data sharing amount cache servers, the proposed scheme has an advantage of keeping a fixed size of the total cache memory regardless of cache server numbers. On the contrary, in All-in-one, the total cache memory size increases proportional to the number of cache servers since each cache server should keep all cache data, respectively.

Analysis of Web Caching Techniques for Efficient Web Data Loading (효율적인 웹 데이터 로딩을 위한 웹 캐싱 기법 분석)

  • Kim, Hyun-Gook;Park, Jin-Tae;Moon, Il-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.497-500
    • /
    • 2018
  • As the fourth industrial revolution began to take off in earnest, the quality and quantity of data shared among devices began to increase exponentially over the network. In addition, the category of devices where people are exposed to such data has become diversified into desktops, mobile phones, smart phones, smart pads, and smart watches. As a result, the medium that contacts the data has begun to change, and the place where modern society has the most data is smart device. However, smart devices still leave much to be desired in terms of network speed and hardware specifications to handle large amounts of data at one time. Therefore, in this paper, we analyze the use of Service Worker, IndexedDB, and LocalStroage, which can retrieve a large amount of web contents more efficiently from mobile devices, and suggest ways to improve it.

  • PDF

S-XML Transformation Method for Efficient Distribution of Spatial Information on u-GIS Environment (u-GIS 환경에서 효율적인 공간 정보 유통을 위한 S-XML 변환 기법)

  • Lee, Dong-Wook;Baek, Sung-Ha;Kim, Gyoung-Bae;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.1
    • /
    • pp.55-62
    • /
    • 2009
  • In u-GIS environment, we collect spatial data needed through sensor network and provide them with information real-time processed or stored. When information through Internet is requested on Web based applications, it is transmitted in XML. Especially, when requested information includes spatial data, GML, S-XML, and other document that can process spatial data are used. In this processing, real-time stream data processed in DSMS is transformed to S-XML document type and spatial information service based on web receive S-XML document through Internet. Because most of spatial application service use existing spatial DBMS as a storage system, The data used in S-XML and SDBMS needs transformation between themselves. In this paper, we propose S-XML a transformation method using caching of spatial data. The proposed method caches the spatial data part of S-XML to transform S-XML and relational spatial database for providing spatial data efficiently and it transforms cached data without additional transformation cost when a transformation between data in the same region is required. Through proposed method, we show that it reduced the cost of transformation between S-XML documents and spatial information services based on web to provide spatial information in u-GIS environment and increased the performance of query processing through performance evaluation.

  • PDF

A Method for Reducing Path Recovery Overhead of Clustering-based, Cognitive Radio Ad Hoc Routing Protocol (클러스터링 기반 인지 무선 애드혹 라우팅 프로토콜의 경로 복구 오버헤드 감소 기법)

  • Jang, Jin-kyung;Lim, Ji-hun;Kim, Do-Hyung;Ko, Young-Bae;Kim, Joung-Sik;Seo, Myung-hwan
    • Journal of IKEEE
    • /
    • v.23 no.1
    • /
    • pp.280-288
    • /
    • 2019
  • In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.