• Title/Summary/Keyword: Network packet

Search Result 2,657, Processing Time 0.031 seconds

An Enhanced Mobile Multicast Protocol

  • Nam, Sea-Hyeon
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.61-64
    • /
    • 2005
  • The packet loss problem that occurs in the mobile multicast (MoM) protocol due to designated multicast service provider (DMSP) handoff is investigated through simulation experiments for several DMSP selection policies. Then, two enhanced DMSP schemes are proposed to minimize the packet loss of the MoM protocol with single DMSP. The first scheme uses a backup DMSP and greatly reduces the packet loss rate at the expense of the increased network traffic. The second scheme utilizes the extended DMSP operation and shows many desirable features such as the almost-zero packet loss rate and relatively low network traffic.

  • PDF

Efficient multi-hop relay transmission on sensor network (센서 네트워크 기반 효율적인 멀티 홉 릴레이 전송)

  • Kwon, Tai-Gil;Kim, Do-Hoon;Won, Hui-Chul;Hwang, Kyu-Sung
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.7
    • /
    • pp.1-8
    • /
    • 2012
  • In this paper, we consider an efficient protocol for the multi-hop relay transmission on a sensor network which can be utilized in a ubiquitous environment. More specifically, we propose an efficient relaying protocol for the distance and position recognition on the proposed sensor network which performs with the differentially bi-orthogonal chirp spread spectrum (DBO-CSS) in the industrial, scientific and medical (ISM) bands. For an efficient networking access, we design and implement four different packet structures, zone information packet, hop information packet, tag information packet, and application serial packet. Additionally, we also propose an efficient position recognition algorithm. Finally, for verification of our proposed protocol's efficiency, we build the testbed system which consists of $15m{\times}15m$ multi-cell and 10 hops in the network.

Comparison about TCP and Snoop protocol on wired and wireless integrated network (유무선 혼합망에서 TCP와 Snoop 프로토콜 비교에 관한 연구)

  • Kim, Chang Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.141-156
    • /
    • 2009
  • As the TCP is the protocol designed for the wired network that packet loss probability is very low, because TCP transmitter takes it for granted that the packet loss by the wireless network characteristics is occurred by the network congestion and lowers the transmitter's transmission rate, the performance is degraded. The Snoop Protocol was designed for the wired network by putting the Snoop agent module on the BS(Base Station) that connect the wire network to the wireless network to complement the TCP problem. The Snoop agent cash the packets being transferred to the wireless terminal and recover the loss by resending locally for the error occurred in the wireless link. The Snoop agent blocks the unnecessary congestion control by preventing the dupack (duplicate acknowledgement)for the retransmitted packet from sending to the sender and hiding the loss in the wireless link from the sender. We evaluated the performance in the wired/wireless network and in various TCP versions using the TCP designed for the wired network and the Snoop designed for the wireless network and evaluated the performance of the wired/wireless hybrid network in the wireless link environment that the continuous packet loss occur.

Efficient Load Balancing Algorithms for a Resilient Packet Ring

  • Cho, Kwang-Soo;Joo, Un-Gi;Lee, Heyung-Sub;Kim, Bong-Tae;Lee, Won-Don
    • ETRI Journal
    • /
    • v.27 no.1
    • /
    • pp.110-113
    • /
    • 2005
  • The resilient packet ring (RPR) is a data optimized ring network, where one of the key issues is on load balancing for competing streams of elastic traffic. This paper suggests three efficient traffic loading algorithms on the RPR. For the algorithms, we evaluate their efficiency via analysis or simulation.

  • PDF

Behavior based Routing Misbehavior Detection in Wireless Sensor Networks

  • Terence, Sebastian;Purushothaman, Geethanjali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5354-5369
    • /
    • 2019
  • Sensor networks are deployed in unheeded environment to monitor the situation. In view of the unheeded environment and by the nature of their communication channel sensor nodes are vulnerable to various attacks most commonly malicious packet dropping attacks namely blackhole, grayhole attack and sinkhole attack. In each of these attacks, the attackers capture the sensor nodes to inject fake details, to deceive other sensor nodes and to interrupt the network traffic by packet dropping. In all such attacks, the compromised node advertises itself with fake routing facts to draw its neighbor traffic and to plunge the data packets. False routing advertisement play vital role in deceiving genuine node in network. In this paper, behavior based routing misbehavior detection (BRMD) is designed in wireless sensor networks to detect false advertiser node in the network. Herein the sensor nodes are monitored by its neighbor. The node which attracts more neighbor traffic by fake routing advertisement and involves the malicious activities such as packet dropping, selective packet dropping and tampering data are detected by its various behaviors and isolated from the network. To estimate the effectiveness of the proposed technique, Network Simulator 2.34 is used. In addition packet delivery ratio, throughput and end-to-end delay of BRMD are compared with other existing routing protocols and as a consequence it is shown that BRMD performs better. The outcome also demonstrates that BRMD yields lesser false positive (less than 6%) and false negative (less than 4%) encountered in various attack detection.

TCP Performance Improvement in Network Coding over Multipath Environments (다중경로 환경의 네트워크 코딩에서의 TCP 성능개선 방안)

  • Lim, Chan-Sook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.6
    • /
    • pp.81-86
    • /
    • 2011
  • In one of the most impacting schemes proposed to address the TCP throughput problem over network coding, the network coding layer sends an acknowledgement if an innovative linear combination is received, even when a new packet is not decoded. Although this scheme is very effective, its implementation requires a limit on the coding window size. This limitation causes low TCP throughput in the presence of packet reordering. We argue that a TCP variant detecting a packet loss relying only on timers is effective in dealing with the packet reordering problem in network coding environments as well. Also we propose a new network coding layer to support such a TCP variant. Simulation results for a 2-path environment show that our proposed scheme improves TCP throughput by 19%.

Improved PF_RING for High Performance Packet Capture (개선된 PF_RING을 이용한 고성능 패킷 캡쳐)

  • Chao Yi Duan;Yong Soo Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1012-1015
    • /
    • 2008
  • The packet capturing becomes a bottleneck in the network intrusion detection and monitoring system as the network performance developing. Many approaches, zero copy, interrupt coalescing and NAPI which attempt to improve packet capturing performance of Linux, are inefficient. PF_RING is a new type of network socket that dramatically improves the packet capture speed, but not perfect. This paper proposes some solutions which can improve the memory utilization and save some data copy time based on the commodity network adapters rather than on the commercial network adapters.

An Efficient Update Algorithm for Packet Classification With TCAM (TCAM을 이용한 패킷 분류를 위한 효율적인 갱신 알고리즘)

  • Jeong Haejin;Song Ilseop;Lee Yookyoung;Kwon Taeckgeun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2A
    • /
    • pp.79-85
    • /
    • 2006
  • Generally, it is essential that high-speed routers, switches, and network security appliances should have an efficient packet classification scheme in order to achieve the high-speed packet forwarding capability. For the multi-gigabit packet-processing network equipment the high-speed content search hardware such as TCAM and search engine is recently used to support the content-based packet inspection. During the packet classification process, hundreds and thousands of rules are applied to provide the network security policies regarding traffic screening, traffic monitoring, and traffic shaping. In addition, these rules could be dynamically changed during operations of systems if anomaly traffic patterns would vary. Particularly, in the high-speed network, an efficient algorithm that updates and reorganizes the packet classification rules is critical so as not to degrade the performance of the network device. In this paper, we have proposed an efficient update algorithm using a partial-ordering that can relocate the dynamically changing rules at the TCAM. Experimental results should that our algorithm does not need to relocate existing rules feature until 70$\%$ of TCAM utilization.

Simulation Analysis for Verifying an Implementation Method of Higher-performed Packet Routing

  • Park, Jaewoo;Lim, Seong-Yong;Lee, Kyou-Ho
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.10a
    • /
    • pp.440-443
    • /
    • 2001
  • As inter-network traffics grows rapidly, the router systems as a network component becomes to be capable of not only wire-speed packet processing but also plentiful programmability for quality services. A network processor technology is widely used to achieve such capabilities in the high-end router. Although providing two such capabilities, the network processor can't support a deep packet processing at nominal wire-speed. Considering QoS may result in performance degradation of processing packet. In order to achieve foster processing, one chipset of network processor is occasionally not enough. Using more than one urges to consider a problem that is, for instance, an out-of-order delivery of packets. This problem can be serious in some applications such as voice over IP and video services, which assume that packets arrive in order. It is required to develop an effective packet processing mechanism leer using more than one network processors in parallel in one linecard unit of the router system. Simulation analysis is also needed for verifying the mechanism. We propose the packet processing mechanism consisting of more than two NPs in parallel. In this mechanism, we use a load-balancing algorithm that distributes the packet traffic load evenly and keeps the sequence, and then verify the algorithm with simulation analysis. As a simulation tool, we use DEVSim++, which is a DEVS formalism-based hierarchical discrete-event simulation environment developed by KAIST. In this paper, we are going to show not only applicability of the DEVS formalism to hardware modeling and simulation but also predictability of performance of the load balancer when implemented with FPGA.

  • PDF

The study on effective PDV control for IEE1588 (초소형 기지국에서 타이밍 품질 향상을 위한 PDV 제어 방안)

  • Kim, Hyun-Soo;Shin, Jun-Hyo;Kim, Jung-Hun;Jeong, Seok-Jong
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.275-280
    • /
    • 2009
  • Femtocells are viewed as a promising option for mobile operators to improve coverage and provide high-data-rate services in a cost-effective manner Femtocells can be used to serve indoor users, resulting in a powerful solution for ubiquitous indoor and outdoor coverage. TThe frequency accuracy and phase alignment is necessary for ensuring the quality of service (QoS) forapplications such as voice, real-time video, wireless hand-off, and data over a converged access medium at the femtocell. But, the GPS has some problem to be used at the femtocell, because it is difficult to set-up, depends on the satellite condition, and very expensive. The IEEE 1588 specification provides a low-cost means for clock synchronisation over a broadband Internet connection. The Time of Packet (ToP) specified in IEEE 1588 is able to synchronize distributed clocks with an accuracy of less than one microsecond in packet networks. However, the timing synchronization over packet switched networks is a difficult task because packet networks introduce large and highly variable packet delays. This paper proposes an enhanced filter algorithm to reduce ths packet delay variation effects and maintain ToP slave clock synchronization performance. The results are presented to demonstrate in the intra-networks and show the improved performance case when the efficient ToP filter algorithm is applied.

  • PDF