• Title/Summary/Keyword: packet amount

Search Result 232, Processing Time 0.02 seconds

Performance Improvement of TCP over Wired-Wireless Networks by Predicting Packet Loss of Mobile Host (유. 무선 혼합망에서 이동 호스트의 패킷 손실 예측을 통한 TCP 성능 향상)

  • Kwon, Kyung-Hee;Kim, Jin-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.1
    • /
    • pp.131-138
    • /
    • 2007
  • In wired networks, packet losses mostly occur due to congestion. TCP reacts to the congestion by decreasing its congestion window, thus to reduce network utilization. In wireless networks, however, losses may occur due to the high bit-error rate of the transmission medium or due to fading and mobility. Nevertheless, TCP still reacts to packet losses according to its congestion control scheme, thus to reduce the network utilization unnecessarily. This reduction of network utilization causes the performance of TCP to decrease. In this paper, we predict packet loss by using RSS(Received Signal Strengths) on the wireless and suggest adding RSS flag bit in ACK packet of MH. By using RSS flag bit in ACK, the FH(Fixed Host) decides whether it adopt congestion control scheme or not for the maximum throughput. The result of the simulation by NS-2 shows that the proposed mechanism significantly increases sending amount and receiving amount by 40% at maximum.

A Modified-PLFS Packet Scheduling Algorithm for Supporting Real-time traffic in IEEE 802.22 WRAN Systems (IEEE 802.22 WRAN 시스템에서 실시간 트래픽 지원을 위한 Modified-PLFS 패킷 알고리즘)

  • Lee, Young-Du;Koo, In-Soo;Ko, Gwang-Zeen
    • Journal of Internet Computing and Services
    • /
    • v.9 no.4
    • /
    • pp.1-10
    • /
    • 2008
  • In this paper, a packet scheduling algorithm, called the modified PLFS, is proposed for real-time traffic in IEEE 802.22 WRAN systems. The modified PLFS(Packet Loss Fair Scheduling) algorithm utilizes not only the delay of the Head of Line(HOL) packets in buffer of each user but also the amount of expected loss packets in the next-next frame when a service will not be given in the next frame. The performances of the modified PLFS are compared with those of PLFS and M-LWDF in terms of the average packet loss rate and throughput. The simulation results show that the proposed scheduling algorithm performs much better than the PLFS and M-LWDF algorithms.

  • PDF

An Efficient Retransmission of Multimedia Packet Using Network Analysis (네트워크 상태 분석을 통한 효율적인 멀티미디어 패킷 재전송)

  • 최정용;윤희돈;이근영
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.93-96
    • /
    • 2001
  • In this paper, we propose a delay-constrained retransmission method to control packet error or loss in common internet. The Delay Regulator(or Jitter Buffer) which is used to control errors caused by unreliable UDP connection, stores received data packets fDr a small amount of time to prevent network jitter from affecting display quality, which causes constant delay. In this paper, we propose a retransmission method to increase efficiency of ARQ(Automatic Repeat reQuest) by using characteristic of delay regulator.

  • PDF

A Hierarchical Packet Classification Algorithm Using Set-Pruning Binary Search Tree (셋-프루닝 이진 검색 트리를 이용한 계층적 패킷 분류 알고리즘)

  • Lee, Soo-Hyun;Lim, Hye-Sook
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.482-496
    • /
    • 2008
  • Packet classification in the Internet routers requires multi-dimensional search for multiple header fields for every incoming packet in wire-speed, hence packet classification is one of the most important challenges in router design. Hierarchical packet classification is one of the most effective solutions since search space is remarkably reduced every time a field search is completed. However, hierarchical structures have two intrinsic issues; back-tracking and empty internal nodes. In this paper, we propose a new hierarchical packet classification algorithm which solves both problems. The back-tracking is avoided by using the set-pruning and the empty internal nodes are avoided by applying the binary search tree. Simulation result shows that the proposed algorithm provides significant improvement in search speed without increasing the amount of memory requirement. We also propose an optimization technique applying controlled rule copy in set-pruning.

Development of Fragmentation Management Simulator for 6LoWPAN (6LoWPAN 단편화 관리 기법 시뮬레이터 개발)

  • Seo, Hyun-Gon;Han, Jae-Il
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.191-198
    • /
    • 2008
  • 6LoWPAN (IPv6 Low-power Wireless Personal Area Network) is IPv6 packets transmission technology at Sensor network over the IEEE 802.15.4 Standard MAC and Physical layer. Adaptation layer between IP layer and MAC layer performs fragmentation and reassembly of packet for transmit IPv6 packets. RFC4944, IETF 6LoWPAN WG standard document define packet fragmentation and reassembly. In this paper, we propose the 6PASim (6LoWPAN Packet Simulator) to perform IPv6 packet fragmentation and reassembly for performance evaluation. The 6PASim consist of two parts. One is Packet_Transmit_module that makes IEEE 802.15.4 frames the IPv6 packet from upper layer, and transmit its. and the another is Packet_Receive_module that reassembles transferred frames and completes original IPv6 packets. we can evaluate frame transmit rate and amount of control message through 6PASim. The result of simulation shows the SRM (Selective Retransmission Method) scheme provider better performance than IRM (Immediate Retransmission Method) scheme.

  • PDF

Two-dimensional Binary Search Tree for Packet Classification at Internet Routers (인터넷 라우터에서의 패킷 분류를 위한 2차원 이진 검색 트리)

  • Lee, Goeun;Lim, Hyesook
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.6
    • /
    • pp.21-31
    • /
    • 2015
  • The Internet users want to get real-time services for various multi-media applications. Network traffic rate has been rapidly increased, and data amounts that the Internet has to carry have been exponentially increased. A packet is the basic unit in transferring data at the Internet, and packet classification is one of the most challenging functionalities that routers should perform at wire-speed. Among various known packet classification algorithms, area-based quad-trie (AQT) algorithm is one of the efficient algorithms which can lookup five header fields simultaneously. As a representative space decomposition algorithm, the AQT requires a small amount of memory in storing classification rules, but it does not provide high-speed classification performance. In this paper, we propose a new packet classification algorithm by applying a binary search for the codewords of the AQT to overcome the issue of the AQT. Throughout simulation, it is shown that the proposed algorithm provides a better performance than the AQT in the number of rule comparisons with each input packet.

A study on analysis of packet amount of Naver's mobile portal (네이버 무선포털의 패킷량 분석에 관한 연구)

  • Ryu, Gui-Yeol
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.3
    • /
    • pp.701-710
    • /
    • 2016
  • The purpose of this paper is to build a model of packet amount of Naver mobile portal. We collected 2004 cases by measuring the sixth per access from September, 2012 to October, 2015. We use regression model with autoregressive errors, in which predictors incorporated into the model were replication, date, time, week, month. It has been found the model which errors follow AR(36), based on AIC and adjusted $R^2$. We found some characteristics from our model as follows. In addition to model building, we also have discussed some meaningful features yielded from the selected model in this paper. Considering the importance of this topic, continuous researches are needed.

The Token Bucket Scheme to solve Buffer Overflow of Video Streaming in Wireless Network (무선 네트워크에서 비디오 스트리밍의 버퍼 오버플로우를 해결하기 위한 토큰버킷 기법)

  • Lee, Hyun-No;Kim, Dong-Hoi
    • Journal of Digital Contents Society
    • /
    • v.16 no.3
    • /
    • pp.365-371
    • /
    • 2015
  • In wireless network, the amount of video streaming packet information in receiver replay buffer can be varied according tothe wireless network condition. By the effect, unforeseeable delay and jitter are generated and then busty video traffics can be made. If the amount of buffer information coming in receiver replay buffer is larger than the amount of a specific buffer information, buffer overflow is generated. Such a problem makes the image skip effect and packet loss, and then causes the quality degradation and replay discontinuity of the video streaming service in destination receiver. To solve the buffer overflow problem, this paper applies the token bucket for the busty traffic to the receiver terminal and analyzes the effect of the token bucket. The simulation result using NS-2 and JSVM shows that the proposed scheme with the token bucket has significantly better performance than the conventional scheme without the token bucket in terms of overflow generation number, packet loss rate and PSNR.

A Light-weight and Dynamically Reconfigurable RMON Agent System

  • Lee, Jun-Hyung;Park, Zin-Won;Kim, Myung-Kyun
    • Journal of Information Processing Systems
    • /
    • v.2 no.3 s.4
    • /
    • pp.183-188
    • /
    • 2006
  • A RMON agent system, which locates on a subnet, collects the network traffic information for management by retrieving and analyzing all of the packets on the subnet. The RMON agent system can miss some packets due to the high packet analyzing overhead when the number of packets on the subnet is huge. In this paper, we have developed a light-weight RMON agent system that can handle a large amount of packets without packet loss. Our RMON agent system has also been designed such that its functionality can be added dynamically when needed. To demonstrate the dynamic reconfiguration capability of our RMON agent system, a simple port scanning attack detection module is added to the RMON agent system. We have also evaluated the performance of our RMON agent system on a large network that has a huge traffic. The test result has shown our RMON agent system can analyze the network packets without packet loss.

Design of Receiver Algorithms for VDL Mode-2 Systems (VDL Mode-2 시스템을 위한 수신 알고리듬 설계)

  • Lee, Hui-Soo;Lee, Ji-Yeon;Park, Hyo-Bae;Oh, Wang-Rok
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.6-8
    • /
    • 2009
  • In this paper. we propose receiver algorithms for VHF(Very High Frequency) digital link mode-2(VDL Mode-2) systems. Unlike conventional digital communication systems using the root raised cosine filter as a transmit and receive filter, raised cosine filter is used as a transmit filter in VDL Mode-2 systems. Hence, it is crucial to design and implement the optimum lowpass receive filter by considering the amount of inter-symbol interference and noise performance. On the other hand, due to the short preamble pattern, it is crucial to develop an efficient packet detection algorithm for reliable communication link. In this paper, we design the optimum receive filter and packet detection algorithm and evaluate the performance of receiver adopting the proposed receive filter and packet detection algorithm.

  • PDF