Congestion Control Using Polynomial Window Size Adjustment Algorithms for Wired and Wireless TCP networks

2006 ◽  
Author(s):  
M. Chandrasekaran ◽  
M. Kalpana ◽  
R.S.D.W. Banu
Keyword(s):  
Congestion Control ◽  
Window Size ◽  
Wireless Tcp ◽  
Size Adjustment

scholarly journals A Model-based Scalable Reliable Multicast Transport Protocol for Satellite Networks

2017 ◽  
Vol 1 (1) ◽  
pp. 24
Author(s):  
Prawit Chumchu ◽  
Roksana Boreli ◽  
Aruna Seneviratne
Keyword(s):  
Congestion Control ◽  
Error Control ◽  
Forward Error Correction ◽  
Transmission Control Protocol ◽  
Window Size ◽  
Satellite Networks ◽  
Transport Protocol ◽  
Reliable Multicast ◽  
Auto Repeat Request ◽  
Control Part

In this paper, we design a new scalable reliable multicast transport protocol for satellite networks (RMT). This paper is the extensions of paper in [18]. The proposed protocoldoes not require inspection and/or interception of packets at intermediate nodes. The protocol would not require anymodification of satellites, which could be bent-pipe satellites or onboard processing satellites. The proposed protocol is divided in 2 parts: error control part and congestion control part. In error control part, we intend to solve feedback implosion and improve scalability by using a new hybrid of ARQ (Auto Repeat Request) and adaptive forward error correction (AFEC). The AFEC algorithm adapts proactive redundancy levels following the number of receivers and average packet loss rate. This leads to a number of transmissions and the number of feedback signals are virtually independent of the number of receivers. Therefore, wireless link utilization used by the proposed protocol is virtually independent of the number of multicast receivers. In congestion control part, the proposed protocol employs a new window-based congestion control scheme, which is optimized for satellite networks. To be fair to the other traffics, the congestion control mimics congestion control in the wellknown Transmission Control Protocol (TCP) which relies on “packet conservation” principle. To reduce feedback implosion, only a few receivers, ACKers, are selected to report the receiving status. In addition, in order to avoid “drop-to-zero” problem, we use a new simple wireless loss filter algorithm. This loss filter algorithm significantly reduces the probability of the congestion window size to be unnecessarily reduced because of common wireless losses. Furthermore, to improve achievable throughput, we employ slow start threshold adaptation based on estimated bandwidth. The congestion control also deals with variations in network conditions by dynamically electing ACKers.

Reliability of Congestion Control Based on Packet Transmission Interval with Hybrid ARQ

2021 ◽  
pp. 2140004
Author(s):  
Mitsutaka Kimura ◽  
Mitsuhiro Imaizumi ◽  
Takahito Araki
Keyword(s):  
Congestion Control ◽  
Error Correction ◽  
High Performance ◽  
Data Communication ◽  
Window Size ◽  
Correction Method ◽  
Packet Transmission ◽  
Hybrid Arq ◽  
Packet Losses ◽  
Data Packets

Code error correction methods have been important techniques at a radio environment and video stream transmission. In general, when a server transmits some data packets to a client, the server resends the only loss packets. But in this method, a delay occurs in a transmission. In order to prevent the transmission delay, the loss packets are restored by the error correction packet on a client side. The code error correction method is called Hybrid Automatic Repeat reQuest (ARQ) and has been researched. On the other hand, congestion control schemes have been important techniques at a data communication. Some packet losses are generated by network congestion. In order to prevent some packet losses, the congestion control performs by prolonging packet transmission intervals, which is called High-performance and Flexible Protocol (HpFP). In this paper, we present a stochastic model of congestion control based on packet transmission interval with Hybrid ARQ for data transmission. That is, if the packet loss occurs, the data packet received in error is restored by the error correction packet. Moreover, if errors occur in data packets, the congestion control performs by prolonging packet transmission intervals. The mean time until packet transmissions succeed is derived analytically, and a window size which maximizes the quantity of packets per unit of time until the transmission succeeds is discussed.

TCP for High-Speed Networks

2008 ◽  
pp. 626-632
Author(s):  
Nelson Luís Saldanha da Fonseca ◽  
Neila Fernanda Michel
Keyword(s):  
Congestion Control ◽  
High Speed ◽  
Transmission Control Protocol ◽  
Window Size ◽  
Transport Layer ◽  
The Internet ◽  
Congestion Window ◽  
High Speed Networks ◽  
Congestion Control Mechanism ◽  
Tcp Reno

In response to a series of collapses due to congestion on the Internet in the mid-’80s, congestion control was added to the transmission control protocol (TCP) (Jacobson, 1988), thus allowing individual connections to control the amount of traffic they inject into the network. This control involves regulating the size of the congestion window (cwnd) to impose a limit on the size of the transmission window. In the most deployed TCP variant on the Internet, TCP Reno (Allman, Floyd, & Partridge, 2002), changes in congestion window size are driven by the loss of segments. Congestion window size is increased by 1/cwnd for each acknowledgement (ack) received, and reduced to half for the loss of a segment in a pattern known as additive increase multiplicative decrease (AIMD). Although this congestion control mechanism was derived at a time when the line speed was of the order of 56 kbs, it has performed remarkably well given that the speed, size, load, and connectivity of the Internet have increased by approximately six orders of magnitude in the past 15 years. However, the AIMD pattern of window growth seriously limits efficienct operation of TCP-Reno over high-capacity links, so that the transport layer is the network bottleneck. This text explains the major challenges involved in using TCP for high-speed networks and briefly describes some of the variations of TCP designed to overcome these challenges.

Several Contention Window Adjustment Techniques for Improving Unsaturated throughput of Wireless LANs

2014 ◽  
Vol 931-932 ◽  
pp. 952-956
Author(s):  
Jesada Sartthong ◽  
Suvepon Sittichivapak ◽  
Nitthita Chirdchoo
Keyword(s):  
Load Condition ◽  
Window Size ◽  
Traffic Load ◽  
Contention Window ◽  
Area Network ◽  
Chain Model ◽  
Function Concept ◽  
Contention Window Size ◽  
Comparison Results ◽  
Size Adjustment

This paper proposes the several contention window adjustment schemes in backoff process as well-known backoff algorithm (BA) for improving the performance of wireless local area network (WLAN). In addition, this research introduces a new unsaturated discrete Markov chain model in fixed backoff stages and fixed contention window sizes technique (FBFC). The proposed contention window adjustment schemes are designed by applying the moment generating function concept in random variable and process theorem. Unsaturated throughput parameters are used to compare the performance of all contention window size adjustment techniques based on IEEE802.11b WLAN standards. The comparison results show that Bernoulli and Double adjustment schemes are good contention window size adjustments at light traffic load, and the Even contention window size adjustment operates well at high traffic load condition.

Reliability Analysis of Window Flow Control Based on Packet Transmission Interval with ECN Considering Packet Loss

2020 ◽  
Vol 28 (01) ◽  
pp. 2150001
Author(s):  
Mitsutaka Kimura ◽  
Mitsuhiro Imaizumi ◽  
Toshio Nakagawa
Keyword(s):  
Flow Control ◽  
Congestion Control ◽  
Packet Loss ◽  
High Performance ◽  
Window Size ◽  
Packet Transmission ◽  
Network Congestion ◽  
Constant Number ◽  
Control Scheme ◽  
Window Flow Control

This paper discusses the reliability model of a window flow control scheme using High-performance and Flexible Protocol (HpFP) with Explicit Congestion Notification (ECN) considering packet loss. HpFP is an important techniques as congestion control scheme in a radio environment and video stream communication. HpFP has the character that throughput is adjusted by changing a packet transmission interval. We have already discussed some reliability models of a window flow control scheme based on a packet transmission interval. In these models, if some packets has failed at a first-time transmission, the packet transmission interval is prolonged. On the other hand, the server checks the state of network congestion by ECN bit. That is, if ECN bit has been set during connection, a packet transmission interval is also prolonged. We consider an extended stochastic model of a window flow control scheme based on a packet transmission interval with ECN considering packet loss. That is, the server checks ECN bit during connection and if the server detects the network congestion, the server executes congestion control that a packet transmission interval is prolonged. Thereafter, if a constant number of the retransmission has failed, or a constant number of packets has failed, the server checks it again. We derive the mean time until packet transmissions succeed, and discuss analytically a window size which maximizes the amount of packets per unit of mean transmission time.

scholarly journals ECN Congestion Control Mechanism in IP Networks

1970 ◽  
Vol 8 (1-2) ◽  
pp. 12-24
Author(s):  
Subarna Shakya ◽  
Anup Sainju
Keyword(s):  
Congestion Control ◽  
Size Variation ◽  
Window Size ◽  
Ip Networks ◽  
Network Simulator ◽  
Network Resource ◽  
Advantages And Disadvantages ◽  
Wide Range ◽  
Explicit Congestion Notification ◽  
Congestion Control Mechanism

Explicit Congestion Notification (ECN) is a newer method for congestion control in TCP IP networks. Network Simulator 2 (NS2) software has been used to compare the performance of ECN packet marking to other older and newer congestion control schemes, such as DropTail and Random Early Detection (RED), in both LAN and WAN schemes. During the simulations different parameters including proportion of packet drops, window size variation, queue size, and throughput were measured to evaluate the performance. The overall objective was to independently and comparatively study ECN in a wide range of situations to better understand its advantages and disadvantages. The results of these simulations showed that when all the network prerequisites were met (i.e. all the nodes including being ECN-aware), ECN reduced packet drops and thereby optimized network resource utilization and data throughput.Key Words : Explicit Congestion Notification; Network Simulator; Random Early Detect; DropTailDOI: http://dx.doi.org/10.3126/jie.v8i1-2.5093Journal of the Institute of Engineering Vol. 8, No. 1&2, 2010/2011Page : 12-24Uploaded Date: 19 July, 2011

Sign in / Sign up

Export Citation Format

Share Document