• Title/Summary/Keyword: update

Search Result 3,129, Processing Time 0.034 seconds

An Index for Efficient Processing of Uncertain Data in Ubiquitous Sensor Networks (유비쿼터스 센서 네트워크에서 불확실한 데이타의 효율적인 처리를 위한 인덱스)

  • Kim, Dong-Oh;Kang, Hong-Koo;Hong, Dong-Suk;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.3
    • /
    • pp.117-130
    • /
    • 2006
  • With the rapid development of technologies related to Ubiquitous Sensor Network (USN), sensors are being utilized in various application areas. In general, the data sensed by each sensor node on ubiquitous sensor networks are stored into the central server for efficient search. Because update is delayed to reduce the cost of update in this environment, uncertain data can be stored in the central server. In addition, Uncertain data make query processing produce wrong results in the central server. Thus, this paper examines how to process uncertain data in ubiquitous sensor networks and suggests a new index for efficient processing of uncertain data. The index reduces the cost of update by delaying update in uncertainty areas. Uncertainty areas are areas where uncertain data are likely to exist. In addition, it solves the problem of low accuracy in search resulting from update delay by delaying update only for specific update areas. Lastly, we analyze the performance of the index and prove the superiority of its performance by comparing its performance evaluation.

  • PDF

Weighted Competitive Update Protocol for DSM Systems (DSM 시스템에서 통신 부하의 가중치를 고려한 경쟁적인 갱신 프로토콜)

  • Im, Seong-Hwa;Baek, Sang-Hyeon;Kim, Jae-Hun;Kim, Seong-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2245-2252
    • /
    • 1999
  • Since DSM provides a user a simple shared memory abstraction, the user does not have to be concerned with data movement between hosts. Each node in DSM systems has processor, memory, and connection to a network. Memory is divided into pages, and a page can have multiple copies in different nodes. To maintain data consistency between nodes, two conventional protocols are used : write-update protocol and invalidate protocol. The performance of these protocols depends on the system parameters and the memory access patterns. for adapting to memory access patterns, competitive update protocol updates those copies of a page that are expected to be used in the near future, while selectively invalidating other copies. We present weighted competitive update protocols that consider different communication bandwidth for each connection a of two nodes. Test result by simulation show that the weighted competitive update protocol improves performance.

  • PDF

Performance evaluations of a link state update mechanism considering traffic variation (트래픽 변화를 고려한 링크 상태 업데이트 알고리즘의 성능 분석)

  • Choi, Seung-Hyuk;Jung, Myoung-Hee;Yang, Mi-Jeong;Kim, Tae-Il;Park, Jae-Hyung;Chung, Min-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.1
    • /
    • pp.27-33
    • /
    • 2006
  • To guarantee QoS (Quality of Service), routers should determine routing paths satisfying service requirements, based on link state information as well as network topology. Link status database (LSD) in routers should be efficiently managed to effectively reflect the current state of all links. However, there is a trade off between the exact reflection of the current link status and its update cost. For exactly reflecting the current link status, each router immediately notifies its neighbors that link state information is changed. This may degrade performance of the router due to the processing of link state update messages. On the other side, if the current link state information is not updated appropriately, a route setup request can be rejected because of the discrepancy between the current link state information and previously updated link state information in LSD. In this paper, we propose a traffic variation based link state update algorithm for adaptively controlling the generation of link state update messages and compare its performance with those of four existing algorithms by intensive simulations.

  • PDF

Improvement of Partial Update for the Web Map Tile Service (실시간 타일 지도 서비스를 위한 타일이미지 갱신 향상 기법)

  • Cho, Sunghwan;Ga, Chillo;Yu, Kiyun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.5
    • /
    • pp.365-373
    • /
    • 2013
  • Tile caching technology is a commonly used method that optimizes the delivery of map imagery across the internet in modern WebGIS systems. However the poor performance of the map tile cache update is one of the major causes that hamper the wider use of this technique for datasets with frequent updates. In this paper, we introduce a new algorithm, namely, Partial Area Cache Update (PACU) that significantly minimizes redundant update of map tiles where the update frequency of source map data is very large. The performance of our algorithm is verified with the cadastral map data of Pyeongtaek of Gyeonggi Province, where approximately 3,100 changes occur in a day among the 331,594 parcels. The experiment results show that the performance of the PACU algorithm is 6.6 times faster than the ESRI ArcGIS SERVER$^{(r)}$. This algorithm significantly contributes in solving the frequent update problem and enable Web Map Tile Services for data that requires frequent update.

A study on the Realtime Update of the Digital-Map by the General Survey Map (일반측량성과도에 의한 수치지도의 수시갱신방법 연구)

  • Lee, Sang-Gil;Kwon, Jay-Hyoun;Jeon, Jae-Han
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.15 no.3
    • /
    • pp.19-26
    • /
    • 2007
  • The renewal update of the digital map constructed through NGIS has been conducted for the enhancement of usage, maintenance so that the latest data is guaranteed. The total update has been done every five years for five regions of the country using aerial photographs and satellite images. By launching the third phase of NGIS, the updating plan was changed from total to total or partial update including the real time update scheme. Furthermore, the update period was improved from five to two years and four years for a large and a small city, respectively. Therefore, it is necessary to develope a matching technique which combines various geographic information (such as drawing map, surveying drawing and map) with exact position on the digital map. In this study, we developed a matching algorithm based on central point and suggested a method which uses general surveying drawing for revision/update of the digital map. The general survey is conducted when a civilian development on lands are approved. Thus, the outcome from the survey, which is the general survey drawing, contains the latest various contents such as road, building, water pipe and manhole. A consistent and efficient method using the general survey drawing for near real time update of the digital map by applying the developed matching algorithm is presented.

  • PDF

Request Distribution for Fairness with a Non-Periodic Load-Update Mechanism for Cyber Foraging Dynamic Applications in Web Server Cluster (웹 서버 클러스터에서 Cyber Foraging 응용을 위한 비주기적 부하 갱신을 통한 부하 분산 기법)

  • Lu, Xiaoyi;Fu, Zhen;Choi, Won-Il;Kang, Jung-Hun;Ok, Min-Hwan;Park, Myong-Soon
    • The KIPS Transactions:PartA
    • /
    • v.14A no.1 s.105
    • /
    • pp.63-72
    • /
    • 2007
  • This paper introduces a load-balancing algorithm focusing on distributing web requests evenly into the web cluster servers. The load-balancing algorithms based on conventional periodic load-information update mechanism are not suitable for dynamic page applications, which are common in Cyber Foraging services, due to the problems caused by periodic synchronized load-information updating and the difficulties of work load estimation caused by embedded executing scripts of dynamic pages. Update-on-Finish algorithm solves this problem by using non-periodic load-update mechanism, and the web switch knows the servers' real load information only after their reporting and then distributes new loads according to the new load-information table, however it results in much communication overhead. Our proposed mechanism improve update-on-finish algorithm by using K-Percents-Finish mechanism and thus largely reduce the communication overhead. Furthermore, we consider the different capabilities of servers with a threshold Ti value and propose a load-balancing algorithm for servers with various capabilities. Simulation results show that the proposed K-Percents-Finish Reporting mechanism can at least reduce 50% communication overhead than update-on-finish approach while sustaining better load balancing performance than periodic mechanisms in related work.

A TEST Frame Application Technique for Improving Data Communication and Topology Update Function in Ad-Hoc Tactical Wireless Networks (Ad-Hoc 전술 무선 통신망에서 데이터 통신 및 토폴로지 갱신 기능 향상을 위한 TEST 프레임 적용 기법)

  • You, Ji-Sang;Baek, In-Cheol
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.1
    • /
    • pp.44-54
    • /
    • 2007
  • In the military field, according to the MIL-STD-188-220, which is an Ad-Hoc communication protocol used for sending out or receiving data and voice smoothly among nodes in the situation that wireless communication nodes move arbitrarily, data communication is cut off because nodes can not know topology changes perpetually in the link disconnection state due to node movement in the case that transmitters do not confirm whether data is delivered to receivers or not, and transmit only the data having routine precedence continuously. In order to solve this problem, we have proposed the technique that makes efficient data communication possible by achieving a rapid topology change detection and link information update using TEST frame. We have analyzed TEST frame application effects in the two aspects of the topology update delay time and the data transmission success ratio.

Asynchronous Cache Consistency Technique (비동기적 캐쉬 일관성 유지 기법)

  • 이찬섭
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.2
    • /
    • pp.33-40
    • /
    • 2004
  • According as client/server is generalized by development of computer performance and information communication technology, Servers uses local cache for extensibility and early response time, and reduction of limited bandwidth. Consistency of cached data need between server and client this time and much technique are proposed according to this. This Paper improved update frequency cache consistency in old. Existent consistency techniques is disadvantage that response time is late because synchronous declaration or abort step increases because delaying write intention declaration. Techniques that is proposed in this paper did to perform referring update time about object that page request or when complete update operation happens to solve these problem. Therefore, have advantage that response is fast because could run write intention declaration or update by sel_mode electively asynchronously when update operation consists and abort step decreases and clearer selection.

  • PDF

A Study of Effective Method to Update the Database for Road Traffic Facilities Using Digital Image Processing and Pattern Recognition (수치영상처리 및 패턴 인식에 의한 도로교통시설물 DB의 효율적 갱신방안 연구)

  • Choi, Joon-Seog;Kang, Joon-Mook
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.20 no.2
    • /
    • pp.31-37
    • /
    • 2012
  • Because of road construction and expansion, Update of the road traffic facilities DB is steadily increased each year, and, Increasing drivers and cars, safety signs for traffic safety are required management and additional installation continuously. To update Safety Sign database promptly, we have developed auto recognition function of safety sign, and analyzed coordinates accuracy. The purpose of this study was to propose methods to update about road traffic facilities efficiently. For this purpose, omni-directional camera was calibrated for acquisition of 3-dimensional coordinates, integrated GPS/IMU/DMI system and applied image processing. In this experiment, we proposed a effective method to update database of road traffic facilities for digital map.

An Efficient BitmapInvert Index based on Relative Position Coordinate for Retrieval of XML documents (효율적인 XML검색을 위한 상대 위치 좌표 기반의 BitmapInvert Index 기법)

  • Kim, Tack-Gon;Kim, Woo-Saeng
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.1 s.307
    • /
    • pp.35-44
    • /
    • 2006
  • Recently, a lot of index techniques for storing and querying XML document have been studied so far and many researches of them used coordinate-based methods. But update operation and query processing to express structural relations among elements, attributes and texts make a large burden. In this paper, we propose an efficient BitmapInvert index technique based on Relative Position Coordinate (RPC). RPC has good preformance even if there are frequent update operations because it represents relationship among parent node and left, right sibling nodes. BitmapInvert index supports tort query with bitwise operations and does not casue serious performance degradations on update operations using PostUpdate algerian. Overall, the performance could be improved by reduction of the number of times for traversing nodes.