• Title/Summary/Keyword: Packet drop rate

Search Result 43, Processing Time 0.021 seconds

Dynamic Jop Distribution Algorithm for Reducing Deadlock & Packet Drop Rate in NoC (NoC 시스템에서 Deadlock과 패킷 drop율 감소를 위한 동적 Job Distribution 알고리듬에 관한 연구)

  • Kim, Woo-Joo;Lee, Sung-Hee;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.528-537
    • /
    • 2008
  • This paper proposes a dynamic job distribution algorithm in a hybrid NoC structure which can improve system network performance by reducing deadlock and packet drop rate for various multimedia applications. The proposed job distribution algorithm schedules every job to the sub-cluster where packet drop rate can be minimized for each multimedia application program. The proposed Job distribution algorithm and network topology targets multimedia applications frequently used in modern embedded systems, such as MPEG4 and MP3 decoder, GPS positioning system, and OFDM demodulator. Experimental results show that packet drop rate was reduced by about 13.0%, and chip area was increased by about 2.7% compared to the APSRA algorithm. When compared to the XY algorithm popularly used for benchmarking, the packet drop rate was reduced by about 23.9%, while chip area was increased by about 3.0%.

An Adaptive Drop Marker for Edge Routers in DiffServ Networks

  • Hur, Kyeong
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.4
    • /
    • pp.411-419
    • /
    • 2011
  • In this paper, we propose an Adaptive Regulating Drop (ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services (ASs) without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate (TPR) for aggregate TCP flows. The TPR is set larger than the current input IN packet rate of aggregate TCP flows while inversely proportional to the measured input OUT packet rate. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, the ARD marker performs random early fair remarking of their excessive IN packets to OUT packets at the aggregate flow level according to the TPR. In addition, an aggregate dropper is combined to drop some excessive IN packets fairly and constantly according to the TPR. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

Comparison and Analysis of Cycling Packet Drop Algorithms and RIO as Packet Drop for the Congestion Control (혼잡제어용 패킷 폐기를 위한 사이클링 패킷 폐기 기법과 RIO 알고리즘의 비교 분석)

  • Kim, Su-Yeon;Gang, Hyeon-Guk
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.2
    • /
    • pp.59-68
    • /
    • 2002
  • In this paper, we compared and analyzed two new models of cyclic packet dropping algorithm, Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) with RIO. The ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. We modelled two cyclic packet drop algorithms and executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying the strict drop precedence policy, we get better performance on priority levels. The results show that two new algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than other algorithms.

A Packet Dropping Algorithm based on Queue Management for Congestion Avoidance (폭주회피를 위한 큐 관리 기반의 패킷 탈락 알고리즘)

  • 이팔진;양진영
    • Journal of Internet Computing and Services
    • /
    • v.3 no.6
    • /
    • pp.43-51
    • /
    • 2002
  • In this paper, we study the new packet dropping scheme using an active queue management algorithm. Active queue management mechanisms differ from the traditional drop tail mechanism in that in a drop tail queue packets are dropped when the buffer overflows, while in active queue management mechanisms, packets may be dropped early before congestion occurs, However, it still incurs high packet loss ratio when the buffer size is not large enough, By detecting congestion and notifying only a randomly selected fraction of connection, RED causes to the global synchronization and fairness problem. And also, it is the biggest problem that the network traffic characteristics need to be known in order to find the optimum average queue length, We propose a new efficient packet dropping method based on the active queue management for congestion control. The proposed scheme uses the per-flow rate and fair share rate estimates. To this end, we present the estimation algorithm to compute the flow arrival rate and the link fair rate, We shows the proposed method improves the network performance because the traffic generated can not cause rapid fluctuations in queue lengths which result in packet loss

  • PDF

Cycling Packet Dropping Mechanism for Assured Forwarding Packets in Internet (인터넷에서 Assured Forwarding 패킷을 위한 사이클링 패킷 폐기 메커니즘)

  • Kim, Su-Yeon;Gang, Hyeon-Guk
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.221-226
    • /
    • 2002
  • Cycling Packet Dropping mechanism we proposed in this paper adaptively drops packets, as predicting traffic pattern between each cycle. Therfore the proposed mechanism makes up for the drawback of RIO mechanism and minimizes errors being capable of predicting in Dynamic and Strict Packet Dropping mechanism. And we executed a simulation and analyzed the throughput and packet drop rate based on the Sending Drop Precedence changing dynamically depending on the network traffic. The results show that the proposed mechanism provides better performance on drop precedence levels and stricter drop precedence policy for AF class.

An Enhanced Transmission Mechanism for Supporting Quality of Service in Wireless Multimedia Sensor Networks

  • Cho, DongOk;Koh, JinGwang;Lee, SungKeun
    • Journal of Internet Computing and Services
    • /
    • v.18 no.6
    • /
    • pp.65-73
    • /
    • 2017
  • Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

Performance Analysis of Random Early Dropping Effect at an Edge Router for TCP Fairness of DiffServ Assured Service

  • Hur Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.255-269
    • /
    • 2006
  • The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

Analysis of Adaptive Cycle Packet Drop and Non-Adaptive Cycle Packet Drop for Congestion Control in Internet (인터넷에서 혼잡제어를 위한 적응적 사이클 패킷 폐기 기법과 비적응적 사이클 패킷 폐기 기법의 분석)

  • Kim, Su-Yeon;Kahng, Hyun-Kook
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.783-788
    • /
    • 2002
  • Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) are applying stricter drop precedence than that of RIO algorithm. Especially, the ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. And we executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying strict drop precedence policy, we get better performance on priority levels. The results show that the proposed algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than RIO and the NCPD algorithm.

The Performance Analysis of TRC Dropper to improve fairness on DiffServ Networks (DiffServ 네트워크에서 공평성 향상을 위한 TRC Dropper의 성능 분석)

  • Kim, Hoon-Ki;Hong, Sung-Hwa
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.91-102
    • /
    • 2009
  • The average window size is most closely related to average throughput. In order to improve fairness, the proposed dropper tries to control the window size of each flow to equal level by intentional packet drop. Intentional packet drop is performed only to the flows that have been occupied bandwidth in a large amount. Because of intentional packet drop, this flow cut down its transmission rate to a half. Accordingly, somewhat capacity of core link comes into existence. And other flow can use this new capacity of this link. Hence other flows have more throughput than before. In this paper, we propose the TRC (Transmission Rate Control) Dropper improving the fairness between individual flows of aggregated sources on DiffServ network. It has the fairness improvement mechanism mentioned above paragraph.

Study of Selective Cell Drop Scheme using Fuzzy Logic on TCP/IP (TCP/IP에서 퍼지 논리를 사용한 선택적 셀 제거 방식에 관한 연구)

  • 조미령;양성현;이상훈;강준길
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.1
    • /
    • pp.95-104
    • /
    • 2002
  • This paper presents some studies on the Internet TCP/IP(Transmission Control Protocol-Internet Protocol) traffic over ATM(Asynchronous Transfer Mode) UBR(Unspecified Bit Rate) and ABR(Available Bit Rate) classes of service. Fuzzy logic prediction has been used to improve the efficiency and fairness of traffic throughput. For TCP/IP over UBR, a novel fuzzy logic based cell dropping scheme is presented. This is referred to as fuzzy logic selective cell drop (FSCD). A key feature of the scheme is its ability to accept or drop a new incoming packet dynamically based on the predicted future buffer condition in the switch. This is achieved by using fuzzy logic prediction for the production of a drop factor. Packet dropping decision is then based on this drop factor and a predefined threshold value. Simulation results show that the proposed scheme significantly improves TCP/IP efficiency and fairness. To study TCP/IP over ABR, we applied the fuzzy logic ABR service buffer management scheme from our previous work to both approximate and exact fair rate computation ER(Explicit cell Rate) switch algorithms. We then compared the performance of the fuzzy logic control with conventional schemes. Simulation results show that on zero TCP packet loss, the fuzzy logic control scheme achieves maximum efficiency and perfect fairness with a smaller buffer size. When mixed with VBR traffic, the fuzzy logic control scheme achieves higher efficiency with lower cell loss.

  • PDF