Packet Dropping Scheme Research Articles

IPv6 기반의 사물인터넷 환경에서 악성 노드의 패킷 유실 공격 탐지 및 우회 기법 분석

IPv6 기반의 사물인터넷 환경에서 악성 노드의 패킷 유실 공격 탐지 및 우회 기법 분석

User-Level Quality Assessment of a Delay-Aware Packet Dropping Scheme for VoIP

To deal with congestion control in internet protocol (IP) networks, different active queue management schemes have been successfully proposed. However, many of these schemes do not take into consideration the particular Voice over Internet Protocol (VoIP) requirements, thereby potentially penalizing this traffic. In this paper, we propose and evaluate a dropping packet selection algorithm for queue management schemes. This algorithm, called Drop-SwD , protects VoIP traffic without affecting other User Datagram Protocol (UDP) and Transmission Control Protocol (TCP) traffic. Additionally, to preserve the quality of the VoIP service, the proposed algorithm selects the lowest quality packets (with less impact on the subjective quality) to be dropped. The application of the algorithm in different active queue management schemes is evaluated using objective and subjective quality metrics and intelligibility metrics as well. As a result, we show that Drop-SwD improves the final quality of the voice packets’ flow, without degrading the performance of other traffic class, with respect to the packet dropping schemes of reference.

Fuzzy Based Packet Dropping Scheme in Wireless Cellular Networks

Wireless multimedia networks are becoming very popular owing to the user demands for multimedia services. Packet dropping in the event of buffer congestion is one of the important issue in wireless multimedia networks. A packet dropping scheme has to be flexible and adaptive such that acceptable quality of an application is maintained. The paper presents a fuzzy based packet dropping scheme for wireless multimedia networks. A buffer manager placed at the base station performs packet dropping depending upon the traffic conditions and type of an application. Packet dropping is performed by computing dropping factor by considering packet priority, queue length and adaptive queue length threshold. The adaptive queue length threshold is used to dynamically adjust the dropping factor. The queue length threshold is varied by using two fuzzy input parameters, channel condition and rate of flow of an application. The scheme has been extensively simulated to test the performance in terms of acceptance and dropping probability of real-time handoff and new calls.

Hop-count based probabilistic packet dropping: Congestion mitigation with loss rate differentiation

Network applications and users have very diverse service expectations and requirements, demanding for provisioning different levels of quality of service on the Internet. As the speed of network links has been rising at a pace that exceeds that of the growth in the buffer size, packet loss rate differentiation has been an active research topic. However, none of the existing packet dropping schemes for loss rate differentiation considered an important issue, that is, the retransmission overhead of dropped packets. In this paper, we design a hop-count based probabilistic packet dropper (HPPD) for congestion mitigation and loss rate differentiation. HPPD aims to meet a unique two-fold objective by two-dimensional loss rate differentiation: the primary one is the congestion mitigation that aims to reduce congestion in the first place by dropping intra-class packets differently based on their maturity levels to reduce retransmission cost; the other is inter-class proportional loss rate differentiation. The maturity level of a packet, the number of hops it has travelled, is inferred from its time-to-live value in the IP header. We propose a novel intra-class nth-root proportional dropping scheme. The scheme reduces retransmission cost by giving higher dropping probabilities to less mature packets while all packets have their forwarding chances. The n is a controllable parameter trading off dropping fairness for congestion mitigation. It provides great controllability to network operators. Simulation results show that HPPD can significantly mitigate the congestion by reducing the retransmission overhead of dropped packets and achieve the proportional loss rate differentiation at the same time.

A proactive mechanism for quality of service control in high speed networks

The internet offers best effort service only. The problem of providing Quality of Service (QoS) control to multimedia flows in a congested router is challenging in this scenario. A novel Active Queue Management (AQM) mechanism is proposed for use at the router. The design and modelling of this queue-based AQM is presented. The buffer at the outgoing link is a simple First-In-First-Out, shared by packets belonging to n flows. A packet-dropping scheme with a single threshold is applied. As against Random Early Detection (RED), which uses the average queue size to control dropping, this work uses instantaneous queue size for making the decisions. This improves the buffer utilisation at the IP routers. The mechanism helps multimedia applications by giving preferential treatment to their flows. The mechanism also considers inter-protocol fairness by reducing loss rates of Transmission Control Protocol (TCP) flows. By doing this, the scheme implements the fair queuing policy. The scheme is stateless and easy to implement. Simulation results indicate that the new service model gives a better than best-effort treatment to the flows that require good QoS.

A Study on Performance Evaluation based on Packet Dropping in ATM Network . New Scheme Proposal

Recently, the growth of applications and services over high-speed Internet increases, ATM networks as wide area back-bone has been a major solution. As the conventional TCP/IP suite is still the standard protocol used to support upper application on current. Internet, the issues regarding whether TCP/IP will operate efficiently on top of an ATM infrastructure and how to control its QoS still remain for studies. TCP uses a window-based protocol for flow control in the transport layer. When TCP uses the UBR service in ATM layer, the control method is only buffer management. If a cell is discarded in ATM layer, one whole packet of TCP will be lost; this fact occur the most TCP performance degradation. Several dropping strategies, such as Tail Drop, EPD, PPD, SPD, FBA, have been proposed to improve the TCP performance over ATM. In this paper, to improve the TCP performance, we propose a packet dropping scheme that is based on comparison with EPD, SPD and FBA. Our proposed scheme is applied to schemes discussed in the previous technology. Our proposed scheme does not need to know each connection's mean packet size. When the buffer exceeds the given threshold, it is based on comparison between the number of dropped packet and the approved packet. Our results are reported and discussed for comparing these discarding schemes under similar conditions. Although the number of virtual channel (VC) is increased, the simulation results showed that the proposed scheme can allocate more fairly each VC than other scheme.