• Title/Summary/Keyword: Data forwarding method

Search Result 60, Processing Time 0.024 seconds

Cache Management Method for Query Forwarding Optimization in the Grid Database (그리드 데이터베이스에서 질의 전달 최적화를 위한 캐쉬 관리 기법)

  • Shin, Soong-Sun;Jang, Yong-Il;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.1
    • /
    • pp.13-25
    • /
    • 2007
  • A cache is used for optimization of query forwarding in the Grid database. To decrease network transmission cost, frequently used data is cached from meta database. Existing cache management method has a unbalanced resource problem, because it doesn't manage replicated data in each node. Also, it increases network cost by cache misses. In the case of data modification, if cache is not updated, queries can be transferred to wrong nodes and it can be occurred others nodes which have same cache. Therefore, it is necessary to solve the problems of existing method that are using unbalanced resource of replica and increasing network cost by cache misses. In this paper, cache management method for query forwarding optimization is proposed. The proposed method manages caches through cache manager. To optimize query forwarding, the cache manager makes caching data from lower loaded replicated node. The query processing cost and the network cost will decrease for the reducing of wrong query forwarding. The performance evaluation shows that proposed method performs better than the existing method.

  • PDF

Performance Improvements of Handover in Mobile-IP Protocol for Mobile Computing (이동 컴퓨팅을 위한 Mobile-IP 프로토콜에서의 핸드오버 성능개선)

  • 박성수;송영재;조동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6A
    • /
    • pp.832-844
    • /
    • 1999
  • In this paper, we analyzed mobile-IP protocol of IETF, and propose new method to improve performance in handover environments. In proposed method, cache agent manages mobility binding information for mobile host. Thus, effective support of mobility is possible. Also, when handover occurs, mobile host recognizes change of foreign agent, and transmits registration message to new foreign agent. However, during registration time, data packet loss is occurs in old foreign agent. Thus, we prevent data loss by using data packet buffering and forwarding in old foreign agent.According to simulation results for data packet transmission performance in the case of handover occurring, proposed method has better performance than previous method in the view of transmission delay and throughput. Especially, if handover occurs very often, data buffering and forwarding method in foreign agent could guarantee better performance.

  • PDF

The Bit-Map Trip Structure for Giga-Bit Forwarding Lookup in High-Speed Routers (고속 라우터의 기가비트 포워딩 검색을 위한 비트-맵 트라이 구조)

  • Oh, Seung-Hyun;Ahn, Jong-Suk
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.2
    • /
    • pp.262-276
    • /
    • 2001
  • Recently much research for developing forwarding table that support fast router without employing both special hardware and new protocols. This article introduces a new forwarding data structure based on the software to enable forwarding lookup to be penormed at giga-bit speed. The forwarding table is known as a bottleneck of the routers penormance due to its high complexity proportional to the forwarding table size. The recent research that based on the software uses a Patricia trie and its variants. and also uses a hash function with prefix length key and others. The proposed forwarding table structure construct a forwarding table by the bit stream array in which it constructs trie from routing table prefix entries and it represents each pointer pointing the child node and the associated forwarding table entry with one bit The trie structure and routing prefix pointer need a large memory when representing those by linked-list or array. but in the proposed data structure, the needed memory size is small enough since it represents information with one bit. Additionally, by use a lookup method that start searching at desired middle level we can shorten the search path. The introduced data structure. called bit-map trie shows that we can implement a fast forwarding engine on the conventional Pentium processor by reducing the backbone routing table fits into Level 2 cache of Pentium II processor and shortens the searching path. Our experiments to evaluate the performance of proposed method show that this bit-map trie accomplishes 5.7 million lookups per second.

  • PDF

Prediction-Based Reliable Data Forwarding Method in VANET (차량 네트워크에서 예측 기반의 안정적 데이터 포워딩 기법)

  • Kim, Minho;Joo, Changhee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.128-139
    • /
    • 2017
  • Vehicular Ad hoc Network (VANET) is one of technologies to realize various ITS services for safe driving and efficient traffic control. However, data delivery in VANETs is complicated due to high mobility and unreliable wireless transmission. In this paper, we develop a novel forwarding scheme to deliver packets in a reliable and timely manner. The proposed forwarding scheme uses traffic statistics to predict the encounter of two vehicles, and optimize its forwarding decision by taking into consideration the probability of successful transmission between them at the encounter place. We evaluate our scheme through simulations and show that our proposed scheme provides reliable data delivery in VANETs.

A Dynamic Defense Using Client Puzzle for Identity-Forgery Attack on the South-Bound of Software Defined Networks

  • Wu, Zehui;Wei, Qiang;Ren, Kailei;Wang, Qingxian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.846-864
    • /
    • 2017
  • Software Defined Network (SDN) realizes management and control over the underlying forwarding device, along with acquisition and analysis of network topology and flow characters through south bridge protocol. Data path Identification (DPID) is the unique identity for managing the underlying device, so forged DPID can be used to attack the link of underlying forwarding devices, as well as carry out DoS over the upper-level controller. This paper proposes a dynamic defense method based on Client-Puzzle model, in which the controller achieves dynamic management over requests from forwarding devices through generating questions with multi-level difficulty. This method can rapidly reduce network load, and at the same time separate attack flow from legal flow, enabling the controller to provide continuous service for legal visit. We conduct experiments on open-source SDN controllers like Fluid and Ryu, the result of which verifies feasibility of this defense method. The experimental result also shows that when cost of controller and forwarding device increases by about 2%-5%, the cost of attacker's CPU increases by near 90%, which greatly raises the attack difficulty for attackers.

Efficient Content Sharing using the Selection of Minimum Forwarding Peers in an Ad Hoc Network (최소의 Forwarding Peer 선택을 통한 애드 혹 네트워크에서의 효율적 콘텐츠 분배 방법)

  • Kang, Seung-Seok
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.4
    • /
    • pp.165-173
    • /
    • 2009
  • Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.

UNSTEADY AERODYNAMIC ANALYSIS FOR HELICOPTER ROTOR IN HOVERING AND FORWARDING FLIGHT USING OVERSET GRID (중첩격자를 이용한 제자리 및 전진 비행하는 헬리콥터 로터의 비정상 공력해석)

  • Im, Dong-Kyun;Wie, Seong-Yong;Kim, Eu-Gene;Kwon, Jang-Hyuk;Lee, Duck-Joo
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2007.10a
    • /
    • pp.77-81
    • /
    • 2007
  • In this paper, helicopter aerodynamics is simulated in hovering and forwarding flighst. The governing equation is the unsteady Euler equation. To consider the blade motion and moving effects, an overset grid technique is applied in this simulation. At the boundary, the Riemann invariants condition is used for inflow and outflow. To validate this method, the result is compared with Caradonna-Tung's experimental data.

  • PDF

A Hexagon Tessellation Approach for the Transmission Energy Efficiency in Underwater Wireless Sensor Networks

  • Kim, Sung-Un;Cheon, Hyun-Soo;Seo, Sang-Bo;Song, Seung-Mi;Park, Seon-Yeong
    • Journal of Information Processing Systems
    • /
    • v.6 no.1
    • /
    • pp.53-66
    • /
    • 2010
  • The energy efficiency is a key design issue to improve the lifetime of the underwater sensor networks (UWSN) consisting of sensor nodes equipped with a small battery of limited energy resource. In this paper, we apply a hexagon tessellation with an ideal cell size to deploy the underwater sensor nodes for two-dimensional UWSN. Upon this setting, we propose an enhanced hybrid transmission method that forwards data packets in a mixed transmission way based on location dependent direct transmitting or uniform multi-hop forwarding. In order to select direct transmitting or uniform multi-hop forwarding, the proposed method applies the threshold annulus that is defined as the distance between the cluster head node and the base station (BS). Our simulation results show that the proposed method enhances the energy efficiency compared with the existing multi-hop forwarding methods and hybrid transmission methods

PMIPv6 Global Handover Mechanism using Multicast Source Based Forwarding (멀티캐스트 소스기반 포워딩을 이용한 PMIPv6 글로벌 핸드오버 메커니즘)

  • Choi, Hoan-Suk;Lee, Jang-Hyun;Rhee, Woo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.745-759
    • /
    • 2011
  • In this paper, we propose the global handover mechanism that is able to provide the unlimited range of next-generation multimedia mobile services in an integrated environment. This mechanism consists of a multicast source based forwarding scheme and a global session management scheme. Global session management scheme provides LMA session information management, global mobility and route optimization. Multicast source based forwarding scheme delivers data between previously attached LMA and newly attached LMA without packet loss. In addition, this scheme removes the redundancy of buffered data. We present a performance evaluation and features analysis by the simulations using the ns-2. Global session management scheme has a less handover latency, propagation delay and signaling cost than the conventional methods. Multicast source based forwarding scheme can deliver buffer data without loss and it has less buffer size than conventional method.

Detection of False Data Injection Attacks in Wireless Sensor Networks (무선 센서 네트워크에서 위조 데이터 주입 공격의 탐지)

  • Lee, Hae-Young;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.83-90
    • /
    • 2009
  • Since wireless sensor networks are deployed in open environments, an attacker can physically capture some sensor nodes. Using information of compromised nodes, an attacker can launch false data injection attacks that report nonexistent events. False data can cause false alarms and draining the limited energy resources of the forwarding nodes. In order to detect and discard such false data during the forwarding process, various security solutions have been proposed. But since they are prevention-based solutions that involve additional operations, they would be energy-inefficient if the corresponding attacks are not launched. In this paper, we propose a detection method that can detect false data injection attacks without extra overheads. The proposed method is designed based on the signature of false data injection attacks that has been derived through simulation. The proposed method detects the attacks based on the number of reporting nodes, the correctness of the reports, and the variation in the number of the nodes for each event. We show the proposed method can detect a large portion of attacks through simulation.