This document summarizes a survey on congestion control mechanisms. It discusses how congestion control plays an important role in computer networks and modern telecommunications to prevent network congestion. It categorizes major congestion control mechanisms and algorithms, including black box approaches like TCP that rely only on binary feedback and grey/green box approaches that use more network information. Common goals for congestion control algorithms are discussed like efficiency, fairness and smooth convergence.
Congestion Control in Wireless Sensor Networks- An overview of Current TrendsEditor IJCATR
In WSN congestion occurs when traffic load exceeds the capacity available at any point in a network. Congestion
acts an important role in degrading the performance of the network or failure of the network. So it is essential to detect and
control the congestion in the entire WSN. Thus one can improve the performance of the network. Different factors are involved
in the congestion; the main factor is buffer over flow, packet loss, lowers network throughput and energy wastage. To address
this challenge this is essential for a distributed algorithm that mitigate congestion and allocate appropriate source rate to a sink
node for wireless sensor network. This paper gives some ideas how to control and manage the congestion in a wireless sensor
network.
Congestion Control in Wireless Sensor Networks Using Genetic AlgorithmEditor IJCATR
Sensor network consists of a large number of small nods, strongly interacting with the physical environment, takes
environmental data through sensors, and reacts after processing on information. Wireless network technologies are widely used in most
applications. As wireless sensor networks have many activities in the field of information transmission, network congestion cannot be
thus avoided. So it seems necessary that some new methods can control congestion and use existing resources for providing better traffic
demands. Congestion increases packet loss and retransmission of removed packets and also wastes of energy. In this paper, a novel
method is presented for congestion control in wireless sensor networks using genetic algorithm. The results of simulation show that the
proposed method, in comparison with the algorithm LEACH, can significantly improve congestion control at high speeds.
IRJET-A Survey on congestion control with TCP networkIRJET Journal
This document summarizes various mechanisms for congestion control in computer networks. It begins with an introduction to congestion and its impacts. It then classifies congestion control schemes into several categories such as window-based vs. rate-based, unicast vs. multicast, and end-to-end vs. router-supported. Several popular congestion control protocols are described, including TCP, RAP, TFRC, and TEAR. Window-based multicast congestion control approaches like RLA and MTCP are also summarized. The document provides an overview of different congestion control techniques in computer networks.
Study on Performance of Simulation Analysis on Multimedia NetworkIRJET Journal
This document summarizes a study that simulated voice communication over wired networks using the NS-2 network simulator. The study modeled VoIP traffic between nodes using the SCTP protocol and added background traffic to evaluate its effects. Key findings from the simulation included:
1) Average latency was 0.98 seconds and 98 packets were dropped, indicating degraded performance when background traffic was added.
2) Average jitter (packet delay variation) was calculated to be 0.006 seconds, showing instability in the network with changing traffic patterns.
3) A graph of latency over time demonstrated increased delays and bottlenecks as background traffic overloaded network links.
Congestion control in packet switched wide area networks using a feedback modelijcses
In a complex world, where networking expands very rapidly, the network stability of flow of bandwidth
played a vital role in transmitting packets. Hence, it was imperative to find solution to the problem of
congestion especially in the follow of bandwidth stability.
Congestion in computer networking is caused by so many factors. Some of the signs are packet loss,
queuing delay resulting from overloading the buffer, faulty hardware devices, intermixing of old and new
technologies and unstable flow of bandwidth resulting from positive feedback
Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless NetworksCSCJournals
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme
A Case Study on Ip Based Cdma Ran by Controlling RouterIJERA Editor
As communication plays an important role in day to day life, the effective and efficient data transmission is to be maintained. This paper mainly deals with implements a congestion control mechanism using Router control method for IP-RAN on CDMA cellular network. The Router control mechanism uses the features of CDMA networks using active Queue Management technique to reduce delay and to minimize the correlated losses. When utilizing these new personal tools and services to enrich our lives, while being mobile, we are using Mobile Multimedia applications. As new handsets, new technologies and new business models are introduced on the marketplace, new attractive multimedia services can and will be launched, fulfilling the demands. Because the number of multimedia services and even more so, the context in which the services are used is numerous, the following model is introduced in order to simplify and clarify how different services will evolve, enrich our lives and fulfill our desires.The proposed paper work is to be realized using Matlab platform.
This document summarizes a research paper that proposes a new algorithm for calculating TCP timeout over wireless ad hoc networks. The current TCP timeout calculation does not adapt well to the unstable nature of wireless networks where factors like node mobility can cause estimated round trip times to vary greatly. The proposed algorithm aims to make timeout calculation more adaptive to network conditions in wireless ad hoc networks to improve TCP performance and quality of service for real-time multimedia applications. It describes challenges with existing TCP timeout approaches over wireless networks and reviews related literature before introducing the novel algorithm developed and tested through simulation.
Congestion Control in Wireless Sensor Networks- An overview of Current TrendsEditor IJCATR
In WSN congestion occurs when traffic load exceeds the capacity available at any point in a network. Congestion
acts an important role in degrading the performance of the network or failure of the network. So it is essential to detect and
control the congestion in the entire WSN. Thus one can improve the performance of the network. Different factors are involved
in the congestion; the main factor is buffer over flow, packet loss, lowers network throughput and energy wastage. To address
this challenge this is essential for a distributed algorithm that mitigate congestion and allocate appropriate source rate to a sink
node for wireless sensor network. This paper gives some ideas how to control and manage the congestion in a wireless sensor
network.
Congestion Control in Wireless Sensor Networks Using Genetic AlgorithmEditor IJCATR
Sensor network consists of a large number of small nods, strongly interacting with the physical environment, takes
environmental data through sensors, and reacts after processing on information. Wireless network technologies are widely used in most
applications. As wireless sensor networks have many activities in the field of information transmission, network congestion cannot be
thus avoided. So it seems necessary that some new methods can control congestion and use existing resources for providing better traffic
demands. Congestion increases packet loss and retransmission of removed packets and also wastes of energy. In this paper, a novel
method is presented for congestion control in wireless sensor networks using genetic algorithm. The results of simulation show that the
proposed method, in comparison with the algorithm LEACH, can significantly improve congestion control at high speeds.
IRJET-A Survey on congestion control with TCP networkIRJET Journal
This document summarizes various mechanisms for congestion control in computer networks. It begins with an introduction to congestion and its impacts. It then classifies congestion control schemes into several categories such as window-based vs. rate-based, unicast vs. multicast, and end-to-end vs. router-supported. Several popular congestion control protocols are described, including TCP, RAP, TFRC, and TEAR. Window-based multicast congestion control approaches like RLA and MTCP are also summarized. The document provides an overview of different congestion control techniques in computer networks.
Study on Performance of Simulation Analysis on Multimedia NetworkIRJET Journal
This document summarizes a study that simulated voice communication over wired networks using the NS-2 network simulator. The study modeled VoIP traffic between nodes using the SCTP protocol and added background traffic to evaluate its effects. Key findings from the simulation included:
1) Average latency was 0.98 seconds and 98 packets were dropped, indicating degraded performance when background traffic was added.
2) Average jitter (packet delay variation) was calculated to be 0.006 seconds, showing instability in the network with changing traffic patterns.
3) A graph of latency over time demonstrated increased delays and bottlenecks as background traffic overloaded network links.
Congestion control in packet switched wide area networks using a feedback modelijcses
In a complex world, where networking expands very rapidly, the network stability of flow of bandwidth
played a vital role in transmitting packets. Hence, it was imperative to find solution to the problem of
congestion especially in the follow of bandwidth stability.
Congestion in computer networking is caused by so many factors. Some of the signs are packet loss,
queuing delay resulting from overloading the buffer, faulty hardware devices, intermixing of old and new
technologies and unstable flow of bandwidth resulting from positive feedback
Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless NetworksCSCJournals
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme
A Case Study on Ip Based Cdma Ran by Controlling RouterIJERA Editor
As communication plays an important role in day to day life, the effective and efficient data transmission is to be maintained. This paper mainly deals with implements a congestion control mechanism using Router control method for IP-RAN on CDMA cellular network. The Router control mechanism uses the features of CDMA networks using active Queue Management technique to reduce delay and to minimize the correlated losses. When utilizing these new personal tools and services to enrich our lives, while being mobile, we are using Mobile Multimedia applications. As new handsets, new technologies and new business models are introduced on the marketplace, new attractive multimedia services can and will be launched, fulfilling the demands. Because the number of multimedia services and even more so, the context in which the services are used is numerous, the following model is introduced in order to simplify and clarify how different services will evolve, enrich our lives and fulfill our desires.The proposed paper work is to be realized using Matlab platform.
This document summarizes a research paper that proposes a new algorithm for calculating TCP timeout over wireless ad hoc networks. The current TCP timeout calculation does not adapt well to the unstable nature of wireless networks where factors like node mobility can cause estimated round trip times to vary greatly. The proposed algorithm aims to make timeout calculation more adaptive to network conditions in wireless ad hoc networks to improve TCP performance and quality of service for real-time multimedia applications. It describes challenges with existing TCP timeout approaches over wireless networks and reviews related literature before introducing the novel algorithm developed and tested through simulation.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Analysis of Rate Based Congestion Control Algorithms in Wireless TechnologiesIOSR Journals
The document analyzes various rate-based congestion control algorithms for wireless technologies. It finds that TCP Vegas performs better than other TCP variants in terms of delivery fraction and delay. However, TCP Vegas has a consistent window size. Congestion avoidance is more effective at resolving congestion and has higher throughput than slow start. Cross-layer congestion control requires significant power and memory. The document then analyzes the performance of AIMD, TFRC, and TCP congestion control protocols via simulation. It finds that GAIMD performs better than TFRC in terms of throughput, while TFRC is better than GAIMD in terms of smoothness.
A packet drop guesser module for congestion Control protocols for high speed ...ijcseit
This document summarizes research on congestion control protocols for high-speed networks. It discusses how existing protocols like CUBIC consider every packet drop as congestion and reduce throughput. The document proposes a packet drop guesser module using k-NN to differentiate between packet drops due to congestion versus other factors like noise. It evaluates CUBIC integrated with this module and finds significant performance improvements over CUBIC alone in noisy conditions. Related work on high-speed protocols like BIC, FAST and CUBIC is also summarized.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A novel token based approach towards packet loss controleSAT Journals
This document summarizes a research paper that proposes a novel congestion control mechanism called Stable Token-Limited Congestion Control (STLCC). STLCC monitors inter-domain traffic rates and limits the number of tokens to control congestion and improve network performance. The authors implemented STLCC in a prototype application and found that it was effective at controlling packet loss and improving network performance compared to other congestion control methods. They concluded that STLCC can automatically measure and reduce congestion to allocate network resources stably.
Concurrent Multi - Path Real Time Communication Control Protocol (Cmprtcp)IRJET Journal
The document proposes a new transport protocol called Concurrent Multi-Path Real Time Communication Control Protocol (CMPRTCP) to handle real-time streams like video and audio over IP networks. CMPRTCP intelligently uses multiple paths between multi-homed hosts to concurrently transmit synchronized streams. It describes CMPRTCP's architecture and operation in detail. Experiments show CMPRTCP performs better than other protocols by maximizing timely data delivery under varying network conditions.
PERFORMANCE EVALUATION OF SELECTED E2E TCP CONGESTION CONTROL MECHANISM OVER ...ijwmn
TCP is one of the main protocols that govern the Internet traffic nowadays. However, it suffers significant
performance degradation over wireless links. Since wireless networks are leading the communication
technologies recently, it is imperative to introduce effective solutions for the TCP congestion control
mechanisms over such networks. In this research four End-to-End TCP implementations are discussed,
they are TCP Westwood, Hybla, Highspeed, and NewReno. The performance of these variants is compared
using LTE emulated environment in terms of throughput, delay, and fairness. Ns-3 simulator is used to
simulate the LTE networks environment. The simulation results showed that TCP Highspeed achieves the
best throughput results. Although TCP Westwood recorded the lowest latency values comparing to others,
it behaved unfairly among different traffic flows. Moreover, TCP Hybla demonstrated the best fairness
behaviour among other TCP variants
FREQUENCY AND TIME DOMAIN PACKET SCHEDULING BASED ON CHANNEL PREDICTION WITH ...ijwmn
1) The document discusses packet scheduling algorithms for LTE downlink systems that must operate under imperfect channel quality information (CQI) due to errors, delays, and other issues.
2) It proposes a new packet scheduling algorithm that uses a Kalman filter-based channel predictor in the frequency domain to estimate the true CQI from erroneous feedback, combined with a time domain grouping technique using proportional fair and modified largest weighted delay first algorithms.
3) Simulation results showed this approach achieves better performance than existing algorithms in terms of system throughput and packet loss ratio under imperfect CQI conditions.
KALMAN FILTER BASED CONGESTION CONTROLLERijdpsjournal
Facing burst traffic, TCP congestion control algorithms severely decrease window size neglecting the fact
that such burst traffics are temporal. In the increase phase sending window experiences a linear rise which
may lead to waste in hefty proportion of available bandwidth. If congestion control mechanisms be able to
estimate future state of network traffic they can cope with different circumstances and efficiently use
bandwidth. Since data traffic which is running on networks is mostly self-similar, algorithms can take
advantage of self-similarity property and repetitive traffic patterns to have accurate estimations and
predictions in large time scales.
In this research a two-stage controller is presented. In fact the first part is a RED congestion controller
which acts in short time scales (200 milliseconds) and the second is a Kalman filter estimator which do
RTT and window size estimations in large time scales (every two seconds). If the RED mechanism decides
to increase the window size, the magnitude of this increase is controlled by Kalman filter. To be more
precise, if the Kalman filter indicates a non-congested situation in the next large time scale, a magnitude
factor is calculated and given to RED algorithm to strengthen the amount of increase.
This document discusses handoff schemes for high-speed mobile internet services. It describes the issues with mobility and different types of handoffs between networks. It proposes two approaches - a prediction-based approach that performs authentication of neighboring access points in advance, and creating a heterogeneous mobile switching and management network (HMSMN) to support seamless vertical handoffs across different wireless technologies. The HMSMN would detect available networks, make handoff decisions, initiate handoffs using mobility protocols like MIP, and support tight integration with mobility protocols for seamless connectivity during vertical handoffs.
AN ANALYSIS OF VARIOUS PARAMETERS IN WIRELESS SENSOR NETWORKS USING ADAPTIVE ...ijasuc
This document analyzes the use of an adaptive forward error correction (FEC) technique in wireless sensor networks to improve various network parameters. It summarizes the results of a simulation study that evaluated throughput, packet delivery ratio, packet loss, delay, and error rate under different numbers of transmitted packets. The main findings are:
1) Throughput and packet delivery ratio increased with the number of transmitted packets when using adaptive FEC, unlike without FEC where performance degraded due to retransmissions.
2) Delay, packet loss, and error rate all decreased as the number of transmitted packets increased, showing that adaptive FEC improved network performance even under higher traffic loads.
3) Adaptively varying the FEC coding
DPI-BASED CONGESTION CONTROL METHOD FOR SERVERS AND NETWORK LINESIJCNCJournal
The use of Deep Packet Inspection (DPI) equipment in a network could simplify the conventional workload
for system management and accelerate the control action. The authors proposed a congestion control
method that uses DPI equipment installed in a network to estimate overload conditions of servers or
network lines and, upon detecting an overload condition, resolves congestion by moving some virtual
machines to other servers or rerouting some communication flows to other routes. However, since the
previous paper was focused on confirming the effectiveness of using DPI technology, it assumed some
restrictive control conditions.
This paper proposes to enhance the existing DPI-based congestion control, in order to dynamically select
an optimal solution for cases where there are multiple candidates available for: virtual machines to be
moved, physical servers to which virtual machines are to be moved, communication flows to be diverted,
and routes to which communication flows are to be diverted. This paper also considers server congestion
for cases where computing power congestion and bandwidth congestion occur simultaneously in a server,
and line congestion for cases where the maximum allowable network delay of each communication flow is
taken into consideration. Finally, the feasibility of the proposed methods is demonstrated by an evaluation
system with real DPI equipment.
A New QoS Renegotiation Mechanism for Multimedia ApplicationsABDELAAL
The document proposes an adaptive QoS architecture that uses call rejection notifications as feedback to capture network characteristics and allow multimedia applications to renegotiate QoS requirements dynamically. It aims to improve on existing static and dynamic QoS approaches by using flow-based traffic monitoring and a feedback mechanism with low overhead. Simulation results show the approach admits more calls, improves QoS parameters, and decreases call processing time compared to other methods.
The document discusses congestion in data networks. It defines congestion as occurring when the number of packets being transmitted approaches the network's handling capacity. This can cause packets to be lost if buffers fill up. Mechanisms for congestion control include backpressure from congested nodes to slow down incoming traffic, choke packets sent to sources to cut back transmission, and implicit or explicit signaling of congestion levels to sources. Frame relay and ATM networks employ various techniques for traffic management, policing, and scheduling to control congestion and meet quality of service guarantees for different connections.
This document presents a QoS-based packet scheduling algorithm for hybrid wireless networks. It proposes using the Earliest Deadline First (EDF) algorithm to schedule packets for online conference applications and the Least Slack Time First algorithm to schedule packets for online video applications. The goal is to reduce transmission delay and improve QoS. It implements this scheduling approach using the NS2 network simulator. The scheduling algorithm classifies packets by application type and places them in queues. EDF and Least Slack Time are then used to schedule packets from each queue to minimize delay for multimedia applications over hybrid wireless networks.
Reduce the probability of blocking for handoff and calls in cellular systems ...TELKOMNIKA JOURNAL
In cellular systems the high probability of blocking represents a big problem for users, the proposed solution by reducing the blocking probability and investigation cellular systems by method channels assignment. The aim from apaper is studying the effect the channel assignment on the value of blocking probability. The results showed that the fixe channeld assignment gives a large probability of blocking for high loads, while (FCA) reduce probability of blocking for handoff and calls according to cluster size. The cellular system representation in the case of (DCA), in (3-cell reuse) and (7-cell reuse), the results showed the first best way to reduce blocking probability and lead to reduce to approximately zero when loads that are less than 200%. Increasing the cluster size causes to reduce blocking probability. The results showed that the probability blocking for handoff less than from probability of blocking for new calls.
Implementing True Zero Cycle Branching in Scalar and Superscalar Pipelined Pr...IDES Editor
In this paper, we have proposed a novel architectural
technique which can be used to boost performance of modern
day processors. It is especially useful in certain code constructs
like small loops and try-catch blocks. The technique is aimed
at improving performance by reducing the number of
instructions that need to enter the pipeline itself. We also
demonstrate its working in a scalar pipelined soft-core
processor developed by us. Lastly, we present how a superscalar
microprocessor can take advantage of this technique and
increase its performance.
Iaetsd an effective approach to eliminate tcp incastIaetsd Iaetsd
This document proposes an Incast Congestion Control for TCP (ICTCP) scheme to eliminate TCP incast collapse in datacenter environments. TCP incast collapse occurs when multiple synchronized servers send data to the same receiver in parallel, overwhelming the switch buffer and causing packet loss. ICTCP is a receiver-side approach that proactively adjusts the TCP receive window size of connections to control their aggregate burstiness and prevent switch buffer overflow before packet loss occurs. It estimates available bandwidth and uses this as a quota to coordinate receive window increases. For each connection, the receive window is adjusted based on the ratio of the difference between measured and expected throughput. This allows adaptive tuning of receive windows to meet sender throughput needs while avoiding congest
Influence of carbon sources on α amylase production by brevibacillus sp. unde...eSAT Publishing House
1. The document examines the influence of various natural and synthetic carbon sources on the production of α-amylase by Brevibacillus sp. under submerged fermentation.
2. Secondary screening showed that the natural carbon source Saccharum officinarum (sugar cane) at 5% produced the maximum α-amylase activity, while the synthetic carbon sources maltose at 1% and sucrose at 4% also enhanced amylase production.
3. Other carbon sources like starch, dextrose, and galactose had an average effect on amylase production, while lactose and mannitol decreased enzyme production.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Comparative assessment of noise levels in various laboratories and constructi...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Analysis of Rate Based Congestion Control Algorithms in Wireless TechnologiesIOSR Journals
The document analyzes various rate-based congestion control algorithms for wireless technologies. It finds that TCP Vegas performs better than other TCP variants in terms of delivery fraction and delay. However, TCP Vegas has a consistent window size. Congestion avoidance is more effective at resolving congestion and has higher throughput than slow start. Cross-layer congestion control requires significant power and memory. The document then analyzes the performance of AIMD, TFRC, and TCP congestion control protocols via simulation. It finds that GAIMD performs better than TFRC in terms of throughput, while TFRC is better than GAIMD in terms of smoothness.
A packet drop guesser module for congestion Control protocols for high speed ...ijcseit
This document summarizes research on congestion control protocols for high-speed networks. It discusses how existing protocols like CUBIC consider every packet drop as congestion and reduce throughput. The document proposes a packet drop guesser module using k-NN to differentiate between packet drops due to congestion versus other factors like noise. It evaluates CUBIC integrated with this module and finds significant performance improvements over CUBIC alone in noisy conditions. Related work on high-speed protocols like BIC, FAST and CUBIC is also summarized.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A novel token based approach towards packet loss controleSAT Journals
This document summarizes a research paper that proposes a novel congestion control mechanism called Stable Token-Limited Congestion Control (STLCC). STLCC monitors inter-domain traffic rates and limits the number of tokens to control congestion and improve network performance. The authors implemented STLCC in a prototype application and found that it was effective at controlling packet loss and improving network performance compared to other congestion control methods. They concluded that STLCC can automatically measure and reduce congestion to allocate network resources stably.
Concurrent Multi - Path Real Time Communication Control Protocol (Cmprtcp)IRJET Journal
The document proposes a new transport protocol called Concurrent Multi-Path Real Time Communication Control Protocol (CMPRTCP) to handle real-time streams like video and audio over IP networks. CMPRTCP intelligently uses multiple paths between multi-homed hosts to concurrently transmit synchronized streams. It describes CMPRTCP's architecture and operation in detail. Experiments show CMPRTCP performs better than other protocols by maximizing timely data delivery under varying network conditions.
PERFORMANCE EVALUATION OF SELECTED E2E TCP CONGESTION CONTROL MECHANISM OVER ...ijwmn
TCP is one of the main protocols that govern the Internet traffic nowadays. However, it suffers significant
performance degradation over wireless links. Since wireless networks are leading the communication
technologies recently, it is imperative to introduce effective solutions for the TCP congestion control
mechanisms over such networks. In this research four End-to-End TCP implementations are discussed,
they are TCP Westwood, Hybla, Highspeed, and NewReno. The performance of these variants is compared
using LTE emulated environment in terms of throughput, delay, and fairness. Ns-3 simulator is used to
simulate the LTE networks environment. The simulation results showed that TCP Highspeed achieves the
best throughput results. Although TCP Westwood recorded the lowest latency values comparing to others,
it behaved unfairly among different traffic flows. Moreover, TCP Hybla demonstrated the best fairness
behaviour among other TCP variants
FREQUENCY AND TIME DOMAIN PACKET SCHEDULING BASED ON CHANNEL PREDICTION WITH ...ijwmn
1) The document discusses packet scheduling algorithms for LTE downlink systems that must operate under imperfect channel quality information (CQI) due to errors, delays, and other issues.
2) It proposes a new packet scheduling algorithm that uses a Kalman filter-based channel predictor in the frequency domain to estimate the true CQI from erroneous feedback, combined with a time domain grouping technique using proportional fair and modified largest weighted delay first algorithms.
3) Simulation results showed this approach achieves better performance than existing algorithms in terms of system throughput and packet loss ratio under imperfect CQI conditions.
KALMAN FILTER BASED CONGESTION CONTROLLERijdpsjournal
Facing burst traffic, TCP congestion control algorithms severely decrease window size neglecting the fact
that such burst traffics are temporal. In the increase phase sending window experiences a linear rise which
may lead to waste in hefty proportion of available bandwidth. If congestion control mechanisms be able to
estimate future state of network traffic they can cope with different circumstances and efficiently use
bandwidth. Since data traffic which is running on networks is mostly self-similar, algorithms can take
advantage of self-similarity property and repetitive traffic patterns to have accurate estimations and
predictions in large time scales.
In this research a two-stage controller is presented. In fact the first part is a RED congestion controller
which acts in short time scales (200 milliseconds) and the second is a Kalman filter estimator which do
RTT and window size estimations in large time scales (every two seconds). If the RED mechanism decides
to increase the window size, the magnitude of this increase is controlled by Kalman filter. To be more
precise, if the Kalman filter indicates a non-congested situation in the next large time scale, a magnitude
factor is calculated and given to RED algorithm to strengthen the amount of increase.
This document discusses handoff schemes for high-speed mobile internet services. It describes the issues with mobility and different types of handoffs between networks. It proposes two approaches - a prediction-based approach that performs authentication of neighboring access points in advance, and creating a heterogeneous mobile switching and management network (HMSMN) to support seamless vertical handoffs across different wireless technologies. The HMSMN would detect available networks, make handoff decisions, initiate handoffs using mobility protocols like MIP, and support tight integration with mobility protocols for seamless connectivity during vertical handoffs.
AN ANALYSIS OF VARIOUS PARAMETERS IN WIRELESS SENSOR NETWORKS USING ADAPTIVE ...ijasuc
This document analyzes the use of an adaptive forward error correction (FEC) technique in wireless sensor networks to improve various network parameters. It summarizes the results of a simulation study that evaluated throughput, packet delivery ratio, packet loss, delay, and error rate under different numbers of transmitted packets. The main findings are:
1) Throughput and packet delivery ratio increased with the number of transmitted packets when using adaptive FEC, unlike without FEC where performance degraded due to retransmissions.
2) Delay, packet loss, and error rate all decreased as the number of transmitted packets increased, showing that adaptive FEC improved network performance even under higher traffic loads.
3) Adaptively varying the FEC coding
DPI-BASED CONGESTION CONTROL METHOD FOR SERVERS AND NETWORK LINESIJCNCJournal
The use of Deep Packet Inspection (DPI) equipment in a network could simplify the conventional workload
for system management and accelerate the control action. The authors proposed a congestion control
method that uses DPI equipment installed in a network to estimate overload conditions of servers or
network lines and, upon detecting an overload condition, resolves congestion by moving some virtual
machines to other servers or rerouting some communication flows to other routes. However, since the
previous paper was focused on confirming the effectiveness of using DPI technology, it assumed some
restrictive control conditions.
This paper proposes to enhance the existing DPI-based congestion control, in order to dynamically select
an optimal solution for cases where there are multiple candidates available for: virtual machines to be
moved, physical servers to which virtual machines are to be moved, communication flows to be diverted,
and routes to which communication flows are to be diverted. This paper also considers server congestion
for cases where computing power congestion and bandwidth congestion occur simultaneously in a server,
and line congestion for cases where the maximum allowable network delay of each communication flow is
taken into consideration. Finally, the feasibility of the proposed methods is demonstrated by an evaluation
system with real DPI equipment.
A New QoS Renegotiation Mechanism for Multimedia ApplicationsABDELAAL
The document proposes an adaptive QoS architecture that uses call rejection notifications as feedback to capture network characteristics and allow multimedia applications to renegotiate QoS requirements dynamically. It aims to improve on existing static and dynamic QoS approaches by using flow-based traffic monitoring and a feedback mechanism with low overhead. Simulation results show the approach admits more calls, improves QoS parameters, and decreases call processing time compared to other methods.
The document discusses congestion in data networks. It defines congestion as occurring when the number of packets being transmitted approaches the network's handling capacity. This can cause packets to be lost if buffers fill up. Mechanisms for congestion control include backpressure from congested nodes to slow down incoming traffic, choke packets sent to sources to cut back transmission, and implicit or explicit signaling of congestion levels to sources. Frame relay and ATM networks employ various techniques for traffic management, policing, and scheduling to control congestion and meet quality of service guarantees for different connections.
This document presents a QoS-based packet scheduling algorithm for hybrid wireless networks. It proposes using the Earliest Deadline First (EDF) algorithm to schedule packets for online conference applications and the Least Slack Time First algorithm to schedule packets for online video applications. The goal is to reduce transmission delay and improve QoS. It implements this scheduling approach using the NS2 network simulator. The scheduling algorithm classifies packets by application type and places them in queues. EDF and Least Slack Time are then used to schedule packets from each queue to minimize delay for multimedia applications over hybrid wireless networks.
Reduce the probability of blocking for handoff and calls in cellular systems ...TELKOMNIKA JOURNAL
In cellular systems the high probability of blocking represents a big problem for users, the proposed solution by reducing the blocking probability and investigation cellular systems by method channels assignment. The aim from apaper is studying the effect the channel assignment on the value of blocking probability. The results showed that the fixe channeld assignment gives a large probability of blocking for high loads, while (FCA) reduce probability of blocking for handoff and calls according to cluster size. The cellular system representation in the case of (DCA), in (3-cell reuse) and (7-cell reuse), the results showed the first best way to reduce blocking probability and lead to reduce to approximately zero when loads that are less than 200%. Increasing the cluster size causes to reduce blocking probability. The results showed that the probability blocking for handoff less than from probability of blocking for new calls.
Implementing True Zero Cycle Branching in Scalar and Superscalar Pipelined Pr...IDES Editor
In this paper, we have proposed a novel architectural
technique which can be used to boost performance of modern
day processors. It is especially useful in certain code constructs
like small loops and try-catch blocks. The technique is aimed
at improving performance by reducing the number of
instructions that need to enter the pipeline itself. We also
demonstrate its working in a scalar pipelined soft-core
processor developed by us. Lastly, we present how a superscalar
microprocessor can take advantage of this technique and
increase its performance.
Iaetsd an effective approach to eliminate tcp incastIaetsd Iaetsd
This document proposes an Incast Congestion Control for TCP (ICTCP) scheme to eliminate TCP incast collapse in datacenter environments. TCP incast collapse occurs when multiple synchronized servers send data to the same receiver in parallel, overwhelming the switch buffer and causing packet loss. ICTCP is a receiver-side approach that proactively adjusts the TCP receive window size of connections to control their aggregate burstiness and prevent switch buffer overflow before packet loss occurs. It estimates available bandwidth and uses this as a quota to coordinate receive window increases. For each connection, the receive window is adjusted based on the ratio of the difference between measured and expected throughput. This allows adaptive tuning of receive windows to meet sender throughput needs while avoiding congest
Influence of carbon sources on α amylase production by brevibacillus sp. unde...eSAT Publishing House
1. The document examines the influence of various natural and synthetic carbon sources on the production of α-amylase by Brevibacillus sp. under submerged fermentation.
2. Secondary screening showed that the natural carbon source Saccharum officinarum (sugar cane) at 5% produced the maximum α-amylase activity, while the synthetic carbon sources maltose at 1% and sucrose at 4% also enhanced amylase production.
3. Other carbon sources like starch, dextrose, and galactose had an average effect on amylase production, while lactose and mannitol decreased enzyme production.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Comparative assessment of noise levels in various laboratories and constructi...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Study on transmission energy losses and finding the hazards using what if ana...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Smart analysis of most build multistoried rcc building of gulbarga regioneSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Quality of service parameter centric resource allocation for lte advancedeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Performance improvement of bottleneck link in red vegas over heterogeneous ne...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Achieving operational excellence by implementing an erp (enterprise resource ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document presents a comparison of linear regression and support vector machine (SVM) models for predicting construction project duration. A linear regression model was applied to data from 75 construction projects, using the Bromilow time-cost model. This achieved 73% accuracy based on R-squared and 10% error based on MAPE. An SVM model was then applied to the same data, achieving significantly improved prediction accuracy. The document provides background on linear regression, SVM, and the data and variables used to build and evaluate the two models.
ANALYSIS AND EXPERIMENTAL EVALUATION OF THE TRANSMISSION CONTROL PROTOCOL CON...IRJET Journal
This document analyzes and experimentally evaluates several TCP congestion control algorithms (variants) - TCP cubic, TCP hybla, TCP scalable, TCP Vegas, and TCP Westwood - in a wireless multihop environment. It aims to understand the throughput performance of each variant as the number of nodes increases. The analysis provides insights into how well different variants can adapt to dynamic multihop wireless networks. It experimentally tests the variants in a simulation using Network Simulator 2 and compares their throughput performance under varying node counts. The goal is to help develop more robust TCP algorithms that can effectively manage congestion in challenging wireless network conditions.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
This document summarizes a research paper that proposes using the Leaky Bucket Algorithm to enhance quality of service (QoS) in multi-hop wireless networks delivering constant bit rate (CBR) traffic. The Leaky Bucket Algorithm aims to reduce transmission delay by delivering packets at a constant rate even when packets arrive in bursts. It combines joint congestion control and a scheduling algorithm to not only achieve provable throughput guarantees, but also place explicit upper bounds on the end-to-end delay of each flow. Simulation results show the proposed approach reduces transmission time and improves throughput compared to existing scheduling algorithms that do not consider delay performance.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
Improved SCTP Scheme To Overcome Congestion Losses Over ManetIJERA Editor
Transmission control conventions have been utilized for data transmission process. TCP has been pre-possessed
for information transmission over wired correspondence having diverse transfer speeds and message delays over
the system. TCP gives correspondence utilizing 3-handshake which sends RTS and ACK originate from server
end and information message has been transmitted over the data transmission gave. This does not give security
over flooding assault happened on the system. TCP gives correspondence between distinctive hubs of the wired
correspondence however when multi-spilling happens in a system TCP does not gives legitimate throughput of
the framework which is significant issue that happened in the past framework. In the proposed work, to beat this
issue SCTP and Improved SCTP transmission control convention has been executed for the framework
execution of the framework. SCTP gives 4-handshake correspondence in the message transmit and improved
SCTP gives the performance when the queue length comes to its full value then it divides the message to other
nodes because of which security element get expansions and this likewise gives correspondence administrations
over multi-spilling and multi-homing. Numerous sender and recipients can impart over wired system utilizing
different methodologies of correspondence through same routers, which debases in the TCP convention. In last
we assess parameters for execution assessment. Here, we composed and actualized our proving ground utilizing
Network Simulator (NS-2.35) to test the execution of both Routing conventions.
Recital Study of Various Congestion Control Protocols in wireless networkiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This document discusses and compares several congestion control protocols for wireless networks, including TCP, RCP, and RCP+. It implemented an enhanced version of RCP+ in the NS-2 simulator. Simulation results showed that the proposed approach achieved higher throughput and packet delivery ratio than TCP and RCP+ in a wireless network with 10-50 nodes, with performance degrading as the number of nodes increased beyond 20 due to increased congestion. The paper analyzes the mechanisms and equations of each protocol and argues the proposed approach combines benefits of improved AIMD and RCP+ to address their individual shortcomings.
This document summarizes a review paper on congestion control approaches for real-time streaming applications on the Internet. It discusses how TCP is not well-suited for real-time streaming due to its reliance on packet loss and variable bitrates. The paper reviews different end-to-end and active queue management approaches for congestion control that aim to reduce latency and jitter. It covers issues with single and shared bottlenecks on the Internet that can lead to congestion and the need for new transport protocols and congestion control for real-time media streaming.
This document discusses improving congestion control in data communication networks using queuing theory models. It begins by defining congestion control and distinguishing it from flow control. It then discusses various techniques for congestion detection and avoidance, including using warning bits, choke packets, and traffic shaping algorithms like leaky bucket and token bucket. The document goes on to present queuing theory models like the pure birth-death model that can be used to model congestion control. It describes developing a computational software using these queuing theory concepts to calculate performance parameters and help network engineers with planning. In conclusion, it states that queuing theory models can effectively control congestion in data networks by enabling optimized network planning.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
This paper proposes a new end-to-end congestion control protocol called ACP that is designed for high bandwidth-delay product networks. ACP aims to achieve high link utilization, fairness among flows, and fast convergence. It does this by estimating the bottleneck queue size upon detecting congestion and decreasing the congestion window by exactly the amount needed to empty the queue. It also uses a "fairness ratio" metric to determine window increases to ensure convergence to a fair share of bandwidth among flows. The paper argues that existing protocols cannot achieve high utilization and fairness due to their inability to accurately measure link load. It claims ACP addresses this through a new congestion window control approach combining queue size estimation and a fairness measure.
Comparative Analysis of Different TCP Variants in Mobile Ad-Hoc Network partha pratim deb
The document analyzes the performance of different TCP variants (New Reno, Reno, Tahoe) with MANET routing protocols (AODV, DSR, TORA) through simulation. It finds that in scenarios with 3 and 5 nodes, AODV has better throughput than DSR and TORA for all TCP variants. Throughput decreases for all variants as node count increases. New Reno provides multiple packet loss recovery and is the best choice for AODV in MANETs due to its consistent performance with changes in node count. Further analysis of additional protocols and TCP variants is recommended.
Performance improvement of bottleneck link in red vegas over heterogeneous ne...eSAT Journals
1. The document discusses performance improvement of the bottleneck link in RED Vegas over heterogeneous networks. RED Vegas is a variant of TCP Vegas that can better detect random packet losses.
2. It analyzes factors that affect wireless TCP performance such as limited bandwidth, long round trip times, random losses, user mobility, and short flows. It also covers congestion control mechanisms like RED and compares TCP Reno and Vegas.
3. The key findings are that RED Vegas reacts appropriately to losses, improving throughput over heterogeneous networks. It also under-utilizes bandwidth less when random loss rates are high by improving the fast recovery mechanism.
This document analyzes the impact of signaling load on call blocking and dropping in UMTS networks. It calculates the acquisition time for different signaling service types based on message length and transmission rates. It then estimates the maximum number of signaling sessions that can be supported simultaneously within the control interval based on a signal-to-interference ratio analysis. An example traffic scenario is provided to illustrate the benefits of studying how different signaling loads affect network performance. The analysis aims to efficiently allocate radio resources and preserve quality of service for both signaling and user data traffic.
Token Based Packet Loss Control Mechanism for NetworksIJMER
This document summarizes a research paper that proposes a new congestion control mechanism using tokens. It begins with background on congestion control and modern IP networks. The proposed approach uses edge and core routers to write quality of service measures in packet headers as tokens. Tokers are interpreted by routers to gauge congestion, especially at edge routers. Based on tokens, edge routers can shape traffic from sources to reduce congestion. The mechanism aims to provide fairness while controlling packet loss. Key aspects discussed include stable token limit congestion control, core routers, edge routers, and how the approach compares to related work like CSFQ.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
In the last few years, video streaming facilities over TCP or UDP, such as YouTube, Facetime, Daily-motion, Mobile video calling have become more and more popular. The important
challenge in streaming broadcasting over the Internet is to spread the uppermost potential quality,
observe to the broadcasting play out time limitation, and efficiently and equally share the offered
bandwidth with TCP or UDP, and additional traffic types. This work familiarizes the Streaming
Media Data Congestion Control protocol (SMDCC), a new adaptive broadcasting streaming
congestion management protocol in which the connection’s data packets transmission frequency is
adjusted allowing to the dynamic bandwidth share of connection using SMDCC, the bandwidth share
of a connection is projected using algorithms similar to those introduced in TCP Westwood. SMDCC
avoids the Slow Jump phase in TCP. As a result, SMDCC does not show the pronounced rate
alternations distinguishing of modern TCP, so providing congestion control that is more appropriate
for streaming broadcasting applications. Besides, SMDCC is fair, sharing the bandwidth equitably
among a set of SMDCC connections. Main benefit is robustness when packet harms are due to
indiscriminate errors, which is typical of wireless links and is becoming an increasing concern due to
the emergence of wireless Internet access. In the presence of indiscriminate errors, SMDCC is also
approachable to TCP Tahoe and Reno (TTR). We provide simulation results using the ns3 simulator
for our protocol running together with TCP Tahoe and Reno.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
TCP INCAST AVOIDANCE BASED ON CONNECTION SERIALIZATION IN DATA CENTER NETWORKSIJCNCJournal
In distributed file systems, a well-known congestion collapse called TCP incast (Incast briefly) occurs
because many servers almost simultaneously send data to the same client and then many packets overflow
the port buffer of the link connecting to the client. Incast leads to throughput degradation in the network. In
this paper, we propose three methods to avoid Incast based on the fact that the bandwidth-delay product is
small in current data center networks. The first method is a method which completely serializes connection
establishments. By the serialization, the number of packets in the port buffer becomes very small, which
leads to Incast avoidance. The second and third methods are methods which overlap the slow start period
of the next connection with the current established connection to improve throughput in the first method.
Numerical results from extensive simulation runs show the effectiveness of our three proposed methods.
Abstract - The Transmission Control Protocol (TCP) is
connection oriented, reliable and end-to-end protocol that support
flow and congestion control, with the evolution and rapid growth
of the internet and emergence of internet of things IoT, flow and
congestion have clear impact in the network performance. In this
paper we study congestion control mechanisms Tahoe, Reno,
Newreno, SACK and Vegas, which are introduced to control
network utilization and increase throughput, in the performance
evaluation we evaluate the performance metrics such as
throughput, packets loss, delivery and reveals impact of the cwnd.
Showing that SACK had done better performance in terms of
numbers of packets sent, throughput and delivery ratio than
Newreno, Vegas shows the best performance of all of them.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Similar to A survey on congestion control mechanisms (20)
Hudhud cyclone caused extensive damage in Visakhapatnam, India in October 2014, especially to tree cover. This will likely impact the local environment in several ways: increased air pollution as trees absorb less; higher temperatures without tree canopy; increased erosion and landslides. It also created large amounts of waste from destroyed trees. Proper management of solid waste is needed to prevent disease spread. Suggested measures include restoring damaged plants, building fountains to reduce heat, mandating light-colored buildings, improving waste management, and educating public on health risks. Overall, changes are needed to water, land, and waste practices to rebuild the environment after the cyclone removed green cover.
Impact of flood disaster in a drought prone area – case study of alampur vill...eSAT Publishing House
1) In September-October 2009, unprecedented heavy rainfall and dam releases caused widespread flooding in Alampur village in Mahabub Nagar district, a historically drought-prone area.
2) The flood damaged or destroyed homes, buildings, infrastructure, crops, and documents. It displaced many residents and cut off the village.
3) The socioeconomic conditions and mud-based construction of homes in the village exacerbated the flood's impacts, making damage more severe and recovery more difficult.
The document summarizes the Hudhud cyclone that struck Visakhapatnam, India in October 2014. It describes the cyclone's formation, rapid intensification to winds of 175 km/h, and landfall near Visakhapatnam. The cyclone caused extensive damage estimated at over $1 billion and at least 109 deaths in India and Nepal. Infrastructure like buildings, bridges, and power lines were destroyed. Crops and fishing boats were also damaged. The document then discusses coping strategies and improvements needed to disaster management plans to better prepare for future cyclones.
Groundwater investigation using geophysical methods a case study of pydibhim...eSAT Publishing House
This document summarizes the results of a geophysical investigation using vertical electrical sounding (VES) methods at 13 locations around an industrial area in India. The VES data was interpreted to generate geo-electric sections and pseudo-sections showing subsurface resistivity variations. Three main layers were typically identified - a high resistivity topsoil, a weathered middle layer, and a basement rock. Pseudo-sections revealed relatively more weathered areas in the northwest and southwest. Resistivity sections helped identify zones of possible high groundwater potential based on low resistivity anomalies sandwiched between more resistive layers. The study concluded the electrical resistivity method was useful for understanding subsurface geology and identifying areas prospective for groundwater exploration.
Flood related disasters concerned to urban flooding in bangalore, indiaeSAT Publishing House
1. The document discusses urban flooding in Bangalore, India. It describes how factors like heavy rainfall, population growth, and improper land use have contributed to increased flooding in the city.
2. Flooding events in 2013 are analyzed in detail. A November rainfall caused runoff six times higher than the drainage capacity, inundating low-lying residential areas.
3. Impacts of urban flooding include disrupted daily life, damaged infrastructure, and decreased economic activity in affected areas. The document calls for improved flood management strategies to better mitigate urban flooding risks in Bangalore.
Enhancing post disaster recovery by optimal infrastructure capacity buildingeSAT Publishing House
This document discusses enhancing post-disaster recovery through optimal infrastructure capacity building. It presents a model to minimize the cost of meeting demand using auxiliary capacities when disaster damages infrastructure. The model uses genetic algorithms to select optimal capacity combinations. The document reviews how infrastructure provides vital services supporting recovery activities and discusses classifying infrastructure into six types. When disaster reduces infrastructure services, a gap forms between community demands and available support, hindering recovery. The proposed research aims to identify this gap and optimize capacity selection to fill it cost-effectively.
Effect of lintel and lintel band on the global performance of reinforced conc...eSAT Publishing House
This document analyzes the effect of lintels and lintel bands on the seismic performance of reinforced concrete masonry infilled frames through non-linear static pushover analysis. Four frame models are considered: a frame with a full masonry infill wall; a frame with a central opening but no lintel/band; a frame with a lintel above the opening; and a frame with a lintel band above the opening. The results show that the full infill wall model has 27% higher stiffness and 32% higher strength than the model with just an opening. Models with lintels or lintel bands have slightly higher strength and stiffness than the model with just an opening. The document concludes lintels and lintel
Wind damage to trees in the gitam university campus at visakhapatnam by cyclo...eSAT Publishing House
1) A cyclone with wind speeds of 175-200 kph caused massive damage to the green cover of Gitam University campus in Visakhapatnam, India. Thousands of trees were uprooted or damaged.
2) A study assessed different types of damage to trees from the cyclone, including defoliation, salt spray damage, damage to stems/branches, and uprooting. Certain tree species were more vulnerable than others.
3) The results of the study can help in selecting more wind-resistant tree species for future planting and reducing damage from future storms.
Wind damage to buildings, infrastrucuture and landscape elements along the be...eSAT Publishing House
1) A visual study was conducted to assess wind damage from Cyclone Hudhud along the 27km Visakha-Bheemli Beach road in Visakhapatnam, India.
2) Residential and commercial buildings suffered extensive roof damage, while glass facades on hotels and restaurants were shattered. Infrastructure like electricity poles and bus shelters were destroyed.
3) Landscape elements faced damage, including collapsed trees that damaged pavements, and debris in parks. The cyclone wiped out over half the city's green cover and caused beach erosion around protected areas.
1) The document reviews factors that influence the shear strength of reinforced concrete deep beams, including compressive strength of concrete, percentage of tension reinforcement, vertical and horizontal web reinforcement, aggregate interlock, shear span-to-depth ratio, loading distribution, side cover, and beam depth.
2) It finds that compressive strength of concrete, tension reinforcement percentage, and web reinforcement all increase shear strength, while shear strength decreases as shear span-to-depth ratio increases.
3) The distribution and amount of vertical and horizontal web reinforcement also affects shear strength, but closely spaced stirrups do not necessarily enhance capacity or performance.
Role of voluntary teams of professional engineers in dissater management – ex...eSAT Publishing House
1) A team of 17 professional engineers from various disciplines called the "Griha Seva" team volunteered after the 2001 Gujarat earthquake to provide technical assistance.
2) The team conducted site visits, assessments, testing and recommended retrofitting strategies for damaged structures in Bhuj and Ahmedabad. They were able to fully assess and retrofit 20 buildings in Ahmedabad.
3) Factors observed that exacerbated the earthquake's impacts included unplanned construction, non-engineered buildings, improper prior retrofitting, and defective materials and workmanship. The professional engineers' technical expertise was crucial for effective post-disaster management.
This document discusses risk analysis and environmental hazard management. It begins by defining risk, hazard, and toxicity. It then outlines the steps involved in hazard identification, including HAZID, HAZOP, and HAZAN. The document presents a case study of a hypothetical gas collecting station, identifying potential accidents and hazards. It discusses quantitative and qualitative approaches to risk analysis, including calculating a fire and explosion index. The document concludes by discussing hazard management strategies like preventative measures, control measures, fire protection, relief operations, and the importance of training personnel on safety.
Review study on performance of seismically tested repaired shear wallseSAT Publishing House
This document summarizes research on the performance of reinforced concrete shear walls that have been repaired after damage. It begins with an introduction to shear walls and their failure modes. The literature review then discusses the behavior of original shear walls as well as different repair techniques tested by other researchers, including conventional repair with new concrete, jacketing with steel plates or concrete, and use of fiber reinforced polymers. The document focuses on evaluating the strength retention of shear walls after being repaired with various methods.
Monitoring and assessment of air quality with reference to dust particles (pm...eSAT Publishing House
This document summarizes a study on monitoring and assessing air quality with respect to dust particles (PM10 and PM2.5) in the urban environment of Visakhapatnam, India. Sampling was conducted in residential, commercial, and industrial areas from October 2013 to August 2014. The average PM2.5 and PM10 concentrations were within limits in residential areas but moderate to high in commercial and industrial areas. Exceedance factor levels indicated moderate pollution for residential areas and moderate to high pollution for commercial and industrial areas. There is a need for management measures like improved public transport and green spaces to combat particulate air pollution in the study areas.
Low cost wireless sensor networks and smartphone applications for disaster ma...eSAT Publishing House
This document describes a low-cost wireless sensor network and smartphone application system for disaster management. The system uses an Arduino-based wireless sensor network comprising nodes with various sensors to monitor the environment. The sensor data is transmitted to a central gateway and then to the cloud for analysis. A smartphone app connected to the cloud can detect disasters from the sensor data and send real-time alerts to users to help with early evacuation. The system aims to provide low-cost localized disaster detection and warnings to improve safety.
Coastal zones – seismic vulnerability an analysis from east coast of indiaeSAT Publishing House
This document summarizes an analysis of seismic vulnerability along the east coast of India. It discusses the geotectonic setting of the region as a passive continental margin and reports some moderate seismic activity from offshore in recent decades. While seismic stability cannot be assumed given events like the 2004 tsunami, no major earthquakes have been recorded along this coast historically. The document calls for further study of active faults, neotectonics, and implementation of improved seismic building codes to mitigate vulnerability.
Can fracture mechanics predict damage due disaster of structureseSAT Publishing House
This document discusses how fracture mechanics can be used to better predict damage and failure of structures. It notes that current design codes are based on small-scale laboratory tests and do not account for size effects, which can lead to more brittle failures in larger structures. The document outlines how fracture mechanics considers factors like size effect, ductility, and minimum reinforcement that influence the strength and failure behavior of structures. It provides examples of how fracture mechanics has been applied to problems like evaluating shear strength in deep beams and investigating a failure of an oil platform structure. The document argues that fracture mechanics provides a more scientific basis for structural design compared to existing empirical code provisions.
This document discusses the assessment of seismic susceptibility of reinforced concrete (RC) buildings. It begins with an introduction to earthquakes and the importance of vulnerability assessment in mitigating earthquake risks and losses. It then describes modeling the nonlinear behavior of RC building elements and performing pushover analysis to evaluate building performance. The document outlines modeling RC frames and developing moment-curvature relationships. It also summarizes the results of pushover analyses on sample 2D and 3D RC frames with and without shear walls. The conclusions emphasize that pushover analysis effectively assesses building properties but has limitations, and that capacity spectrum method provides appropriate results for evaluating building response and retrofitting impact.
A geophysical insight of earthquake occurred on 21 st may 2014 off paradip, b...eSAT Publishing House
1) A 6.0 magnitude earthquake occurred off the coast of Paradip, Odisha in the Bay of Bengal on May 21, 2014 at a depth of around 40 km.
2) Analysis of magnetic and bathymetric data from the area revealed the presence of major lineaments in NW-SE and NE-SW directions that may be responsible for seismic activity through stress release.
3) Movements along growth faults at the margins of large Bengal channels, due to large sediment loads, could also contribute to seismic events by triggering movements along the faults.
Effect of hudhud cyclone on the development of visakhapatnam as smart and gre...eSAT Publishing House
This document discusses the effects of Cyclone Hudhud on the development of Visakhapatnam as a smart and green city through a case study and preliminary surveys. The surveys found that 31% of participants had experienced cyclones, 9% floods, and 59% landslides previously in Visakhapatnam. Awareness of disaster alarming systems increased from 14% before the 2004 tsunami to 85% during Cyclone Hudhud, while awareness of disaster management systems increased from 50% before the tsunami to 94% during Hudhud. The surveys indicate that initiatives after the tsunami improved awareness and preparedness. Developing Visakhapatnam as a smart, green city should consider governance
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSIJNSA Journal
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
Comparative analysis between traditional aquaponics and reconstructed aquapon...bijceesjournal
The aquaponic system of planting is a method that does not require soil usage. It is a method that only needs water, fish, lava rocks (a substitute for soil), and plants. Aquaponic systems are sustainable and environmentally friendly. Its use not only helps to plant in small spaces but also helps reduce artificial chemical use and minimizes excess water use, as aquaponics consumes 90% less water than soil-based gardening. The study applied a descriptive and experimental design to assess and compare conventional and reconstructed aquaponic methods for reproducing tomatoes. The researchers created an observation checklist to determine the significant factors of the study. The study aims to determine the significant difference between traditional aquaponics and reconstructed aquaponics systems propagating tomatoes in terms of height, weight, girth, and number of fruits. The reconstructed aquaponics system’s higher growth yield results in a much more nourished crop than the traditional aquaponics system. It is superior in its number of fruits, height, weight, and girth measurement. Moreover, the reconstructed aquaponics system is proven to eliminate all the hindrances present in the traditional aquaponics system, which are overcrowding of fish, algae growth, pest problems, contaminated water, and dead fish.
TIME DIVISION MULTIPLEXING TECHNIQUE FOR COMMUNICATION SYSTEMHODECEDSIET
Time Division Multiplexing (TDM) is a method of transmitting multiple signals over a single communication channel by dividing the signal into many segments, each having a very short duration of time. These time slots are then allocated to different data streams, allowing multiple signals to share the same transmission medium efficiently. TDM is widely used in telecommunications and data communication systems.
### How TDM Works
1. **Time Slots Allocation**: The core principle of TDM is to assign distinct time slots to each signal. During each time slot, the respective signal is transmitted, and then the process repeats cyclically. For example, if there are four signals to be transmitted, the TDM cycle will divide time into four slots, each assigned to one signal.
2. **Synchronization**: Synchronization is crucial in TDM systems to ensure that the signals are correctly aligned with their respective time slots. Both the transmitter and receiver must be synchronized to avoid any overlap or loss of data. This synchronization is typically maintained by a clock signal that ensures time slots are accurately aligned.
3. **Frame Structure**: TDM data is organized into frames, where each frame consists of a set of time slots. Each frame is repeated at regular intervals, ensuring continuous transmission of data streams. The frame structure helps in managing the data streams and maintaining the synchronization between the transmitter and receiver.
4. **Multiplexer and Demultiplexer**: At the transmitting end, a multiplexer combines multiple input signals into a single composite signal by assigning each signal to a specific time slot. At the receiving end, a demultiplexer separates the composite signal back into individual signals based on their respective time slots.
### Types of TDM
1. **Synchronous TDM**: In synchronous TDM, time slots are pre-assigned to each signal, regardless of whether the signal has data to transmit or not. This can lead to inefficiencies if some time slots remain empty due to the absence of data.
2. **Asynchronous TDM (or Statistical TDM)**: Asynchronous TDM addresses the inefficiencies of synchronous TDM by allocating time slots dynamically based on the presence of data. Time slots are assigned only when there is data to transmit, which optimizes the use of the communication channel.
### Applications of TDM
- **Telecommunications**: TDM is extensively used in telecommunication systems, such as in T1 and E1 lines, where multiple telephone calls are transmitted over a single line by assigning each call to a specific time slot.
- **Digital Audio and Video Broadcasting**: TDM is used in broadcasting systems to transmit multiple audio or video streams over a single channel, ensuring efficient use of bandwidth.
- **Computer Networks**: TDM is used in network protocols and systems to manage the transmission of data from multiple sources over a single network medium.
### Advantages of TDM
- **Efficient Use of Bandwidth**: TDM all
ML Based Model for NIDS MSc Updated Presentation.v2.pptx
A survey on congestion control mechanisms
1. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 09 | Sep-2014, Available @ http://www.ijret.org 159
A SURVEY ON CONGESTION CONTROL MECHANISMS
Mahammad Mastan1
, P.Suresh Verma2
, Mohammed Ali Hussain3
1
Associate Professor in CSE, Malla Reddy Engineering College, Telangana, India
2
Professor in CSE, Adikavi Nannaya University, Andhra Pradesh, India
3
Professor in ECM, KL University, Andhra Pradesh, India
Abstract
Congestion Control performs a very important role in Computer Networks, Modern Telecommunication, Internet and both wired
and wireless communications are being intended for high-speed communication of large amounts of data. Due to lack of proper
Congestion control mechanism the congestion collapse of such networks would become highly complex. A network with Streamed
media traffic is a challenge for Congestion control because of sensitivity. Many researchers have motivated and challenged over
the last decade to increase more congestion control protocols and mechanisms that go well with the traffic and provides fair
maintenance mutually for communications in unicast and multicast. We survey a major congestion control mechanisms, TCP-
Friendliness and categorization characteristics and a most recent for congestion control mechanisms designed for network and
estimate their characteristics in this paper.
Keywords: Congestion, Metrics of Congestion Control, UDP Traffic and TCP-Friendliness
-------------------------------------------------------------------***-------------------------------------------------------------------
1. INTRODUCTION
Congestion control over network, for all types of media
traffic, from the last decade it has been dynamic area of
research [1]. This is because of promising increase in the
audiovisual traffic of digital convergence. In a network
variety of applications are existed and rise on its ability of
media with streaming equally on demand or in real-time for
example voice over IP (VoIP) video streaming and
conferencing, and (VoD) video on demand. In an amount of
users for these network application is regularly increasing
therefore resulting in congestion.
The complete networks applications do not use TCP and
therefore do not allow fair allocation with the existing
bandwidth. Therefore, the result of inequality of the non-
TCP applications did not have much impact because of
mainly traffic with network uses TCP-based protocols.
Nevertheless, the quantity of streaming audio/video
applications while Internet video conferencing, audio and
video players, and corresponding category of real-time
applications is frequently increasing and soon expected as
there have a tendency for raise in the proportion in non-TCP
traffic. Here views of the fact that the applications
frequently carry out no merging mechanisms of TCP
compatible congestion control, network applications
consider challenging TCP flows in an awkward manner. The
TCP flow decrease their data rates and try to break up
congestion, where a non TCP flows maintains on the way to
transmit at their unique rate. It is highly biased condition
will lead to starvation of TCP-traffic i.e.., congestion fall
down [2], [3], It set out the disagreeable circumstances
where the network bandwidth is accessible almost totally in
use of packets which are leftover due to the congestion prior
to reach their destination. Due to, this is popular to identify
appropriate congestion control mechanisms for well
matched i.e., for non-TCP traffic through the mechanism
like rate adaptation TCP. The non TCP applications will
become TCP friendly by using these mechanisms, hence
guide to a fine allocation of bandwidth. Unicast is a
discussion type of communication in networks where
multicast will be one to many. Multicast is beneficial more
than unicast particularly in bandwidth reduction, however
unicast is until extensively widen communication variety
network.
2. CONGESTION CONTROL SYSTEM THEORY
A Congestion control concerns in controlling the network
traffic in a telecommunications network, to prevent the
congestive subside by trying to keep away from the unfair
allocation of several processing or capabilities of the
networks and making the proper resource dropping steps by
dropping the rate of packets sent.
Goals that are taken for the assessment procedure for
algorithms of congestion control:
1). It accomplishes more bandwidth consumption.
2). headed for congregate to efficiently and fairness quickly.
3). headed for decrease oscillations related to amplitude.
4). headed for maintain a more responsiveness.
5). headed for coexist moderately and well-matched through
long recognized broadly used protocols.
The Metrics [24] that have been set for Congestion control
are:
i. The Convergence speed - The Convergence speed
estimates time accepted to reach the equilibrium state.
ii. Smoothness - The Smoothness reflects the oscillations
magnitude through multiplicative reduction and it rely on
oscillations range.
iii. Responsiveness - The Responsiveness is calculated
through the round trip times (RTTs) to attain equilibrium.
2. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 09 | Sep-2014, Available @ http://www.ijret.org 160
The discrepancy among Convergence Speed and
Responsiveness is associated towards a particular flow and
the convergence is related to the method.
I. Efficiency - The Efficiency is the standard flow
throughput per step or round trip time, as the method is in
stability.
II. Fairness: The fairness classifies the equitable allocation
of resources among the flows in a mutual traffic jam link.
3. CONGESTION CONTROL ALGORITHMS
CLASSIFICATION
The Congestion Control Algorithms are classified mainly
based on the below criterion:
i. Can be classified by the category and size of the response
received from the network
ii. Can be classified by increasing the deploy capability on
the network. Simply the sender needs for the alteration (or)
sender and receiver require only the router needs for the
modification (or) tall the three: sender, receiver and routers
needs for the modification.
iii. Can be classified by the aspect of performance. To make
improvements in performance: high bandwidth networks,
lossy links, fairness, advantage to short flows, variable-rate
links
iv. Can be classified by the fairness criterion it uses
minimum potential delay, proportional, max min.
Algorithms of congestion control are able to use network
awareness as a standard. Following are three categories for
the congestion control mechanisms. The Black box consists
of a collection of algorithms based on the concept that
reflects on black box network type, affected of no awareness
of its condition much than the binary response leading to
congestion. A Grey box is grey group approximate that use
the dimensions to evaluate accessible bandwidth and the
contention level or still the provisional features of
congestion. Because of the opportunity of incorrect
assessment and measurement dimensions, a network is
examined as grey box. A Green box contains bimodal
congestion control through which it can calculate explicitly
the fairs hare, also the network assisted limitation, as a
network transfer through its transport layer. So, it is
considered as green box.
3.1 Black Box
A black box is a classified congestion control and it is also
known as the Blind Congestion Control method and this
methodology uses the AIMD (Additive Increase
Multiplicative Decrease) algorithm. AIMD implements TCP
window adjustments. Stability is achieved in set of
circumstances with algorithms everywhere the authoritative
ordinance of emulate flows exceeds the available
bandwidths of the channel. Congestion control mechanism is
conventional TCP and is predicated on the fundamental plan
of AIMD. The TCP-NewReno, TCP-Tahoe and TCP-Sack,
preservative rise in stage and is assumed exactly as in
AIMD, where protocols and mechanisms are within the
congestion control phase. In packet drop case, as an
alternative of the multiplicative reduction, an extra
conservative method is employ in TCP-Tahoe. Protocol
mechanisms enter again the slow-start phase and congestion
window reset. However, in TCP-sack and TCP-NewReno,
as soon as sender collects 3 DACKs, when both windows
and slow-start threshold phase is applied a multiplicative
reduction is used. The protocol mechanism remains at the
Congestion control phase in such case. It goes through the
slow start segment as in TCP Tahoe, as soon as
retransmission timeout expires. A Highspeed-TCP change
with the reaction function in environment through high
interruption bandwidth product, increases congestion
window extra violently ahead getting the acknowledgment,
furthermore it reduces window extra quietly ahead a failure
occurrence. BIC (Binary Increase Congestion Control
Protocol) TCP use a hollow raise rate a reference, following
all congestion events awaiting the window is equivalent to
that previous to the occurrence, to maximize the utilization
time of the network. CUBIC TCP - It is not as much of
powerful and further organized BIC derivative, everywhere
the window is a cubic task of time because of the final
congestion event, by means of modulation point put to the
window former to the occurrence. A current advancement of
Additive Increase Multiplicative Decrease (AIMD) by
means of Fast Convergence is not found on a recent
algorithm, although an optimization of AIMD and the
system of convergence permit the algorithm to congregate
quicker and attain superior efficiency. In nonlinear
congestion control algorithms Binomial Mechanisms forms
a new class and identified as algorithms of type binomial
congestion control. It is also called as binomial since the
control mechanism that is found on the contribution of two
added algebraic conditions with diverse exponents. TCP
friendly non linear congestion control algorithm is SIMD
which controls the congestion by utilizing the past
information. General AIMD Congestion Control induces
congestion control mechanism of AIMD with
parameterizing, „α‟ additive raise value and „β‟
multiplicative reduce ratio.
3.2 Grey Box
Grey box is also called as congestion control with
measurement based. Principles of TCP confide on packet
losses as virtual signal of congestion signal as congested
links. There are a number of reasons for indicating the
congestion one of the common reasons is the loss of packet
and random bit corruption is the main cause for the packet
loss and is caused when bandwidth is still accessible. At the
sender side acknowledgement-based loss detection can be
changed by the interweave traffic on the invert path. The
loss of packet, as a binary response, cannot specify the stage
of contention earlier than the amount of congestion. So, a
well-organized window alteration approach should replicate
diverse network situation, which cannot all be apprehend
simply by packet drops. Some measurement form transport
protocols collect in sequence on present network conditions.
The queuing delay is approximate by TCP Vegas. To make
a regular number of packets per flow the window is linearly
increased and decreased in the network.
3. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 09 | Sep-2014, Available @ http://www.ijret.org 161
The FAST TCP achieve the same stability as vegas,
however uses relative control as a substitute of linear raise,
and deliberately scales the increase behind as the bandwidth
increase with the aim of ensure stability. The loss cause the
window to be retune to the sender's estimation of the
bandwidth interruption product in TCP-Westwood which is
the minimum calculated round trip times the experimental
pace of getting acknowledgement. TFRC is based on the rate
based congestion control mechanism, which expects to
economically contend for bandwidth with flows during
network.
3.3 Green Box
A Green box contains bimodal congestion control
mechanism by which it can calculate explicitly the fairs hare
of the system flow in the network. Bimodal congestion
prevention and Control mechanism for each flow the fair
share of the whole bandwidth that have to be allocated is
calculated at any point through the execution of the method
flow. A RED (Random Early Detection) packet is randomly
dropped in fraction to the router's queue size, triggering
multiplicative reducing in several flows. In ECN (Explicit
Congestion Notification) routers are enabled to probabilistic
mark a bit in the IP header instead of dropping packets, near
intimate the end-hosts of imminent congestion when the
length of the queue exceeds a threshold [21]. The VCP
(variable structure congestion control protocol) uses two
ECN (Explicit Congestion Notification) bits to clearly get
the feedback of the network status of congestion.
4. CONGESTION CONTROL ALGORITHMS
4.1 RED (Random Early Detection) Algorithm
RED Algorithm B. Braden et al., had been proposed to be
primarily used in the performance of AQM (Active Queue
Management) [4]. The average queue size is calculated upon
the arrival of each packet, by means of the Exponential
Weighted Moving Average (EWMA) [5]. The calculation of
the standard queue size is differentiating by means of
minimum and maximum threshold to create after that
accomplishment.
4.2 Choke Algorithm
This algorithm was proposed by Konstantinos Psounis et al.,
[6, 7], every time the emergence of a new packet take place
at congested gateway router, randomly a packet is drawn
from the FIFO buffer, and the drawn packet is then
differentiate through the arriving packet. But in cooperation
together belong to the same flow in the network
subsequently both are dropped, also the packet that was
chosen randomly be kept integral as well as the fresh
arriving packet is admit to the buffer through a possibility
depending going on the phase with congestion. It will be the
computation of possibility is the similar as RED. This is
stateless and easy algorithm where no particular data
structure is required. Though, this algorithm be not present
fit while amount of flows is huge when compare to the
buffer space.
4.3 Drop Tail Algorithm
Drop Tail (DT) algorithm was deliberates by F. Postiglione
et al., [15] have a great accuracy, easy and generally make
use of the algorithm in the present networks, as the packets
drops from the full queue buffer tail. This algorithms major
advantage is suitability, effortlessness to its decentralized
nature and heterogeneity. Though, this algorithm also has
some severe disadvantage, such as no security alongside the
mischievous or non responsive flows, lack of fairness and no
comparative QoS (Quality of Service). QoS is of scrupulous
apprehension for constant transmission of multimedia
information and high- bandwidth video [15]. This type of
transmitting the content is complicated in the current
Internet and network through DT.
4.4 REM (Random Exponential Marking)
Algorithm
REM as specified by Debanjan Saha is a fresh method
meant for congestion control, as it focus to accomplish
more consumption of link scalability, capability, delay and
minor loss. Its major limits are it does not give reason to
cooperative sources and accurately considered and rigid
value of φ have got to be famous internationally [8].
4.5 VQ (Virtual Queue) Algorithm
The VQ algorithm is an essential method deliberates by
Gibben and Kelly [12]. A virtual queue is maintained in this
scheme and a link with similar approaching pace as real
queue. Though, the ability of the implicit queue is minor
than the capability of an actual queue. As soon as the
packets are dropped virtual, after that all packets by now
enqueued in real queue and every new incoming packet are
noticeable awaiting the virtual queue become vacant again.
4.6 Fair Queuing Algorithms
The Fair queuing algorithms was deliberates by Alan
Demers et al., [9] Stochastic Fair Queuing Algorithms [10]
are primarily use in the multimedia incorporated services
networks meant for their interruption bounding in the flow
and fairness. The frame establishes a class of FQ is known
as weighted round robin, everywhere a router queue
arrangement system is used in queues are service in fashion
like round robin in fraction to a weight assign for every
queue [11].
4.7 Adaptive Virtual Queue Algorithm
The Adaptive virtual queue algorithm was deliberates by
R.J. Gibben et al., the ability of the link and the needed
consumption maintains a virtual queue at the link. The
aptitude and buffer size of the virtual queue is the identical
as that of the real queue. On the arrival of each packet, the
virtual queue capacity is updated. The adjustment of virtual
queue algorithm does not suitably follow the varying traffic
model at flow in the network, and it is also FIFO base
approach [13].
4. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 09 | Sep-2014, Available @ http://www.ijret.org 162
5. CATEGORIZATION OF CONGESTION
CONTROL PROTOCOLS
Congestion control protocols were classified as four main
groups according to an amount of characteristics in their
method of work [20]. The subsequent shows the applicable
category of arrangement.
5.1 Window Based Congestion Control
The window based protocols are build based on the
technique of mechanism related to congestion window
based, and it is used at the dispatcher or recipient side [23].
The gap to facilitate window is held in reserve for every
packet as soon as the sent packet is acknowledged to be
arriving the slot becomes free and allows transmission only
when free slots are valid. In absence of congestion the size
of window increases and decreases when congestion occurs
in the network [14].
5.2 Rate-Based Congestion Control
Rate-Based protocols are built based on the adaptation of
their speed of transmission following to several incorporated
advice algorithm that intimates regarding congestion when it
exists. The rate based algorithms is separated in to easy
mechanisms and congestion control. The marks of saw tooth
throughput form are used and this kind of scheme frequently
is not completely compatible with the streaming media
applications on which the Simple schemes are based. The
current research tends to create the modification rate
mechanisms ensuring the equitable antagonism among TCP
and non TCP flows equally in the network.
5.3 Single Rate Congestion Control
Single rate congestion control mechanisms are usually
acquired by every unicast congestion control protocols.
Transmissions in unicast have single one receiver, hence
transfer rate is adapted in accordance to the receiver
position. Multicast broadcast can assume the single rate
approach also, everywhere the sender streams the data
among similar rate to everyone recipients of the multicast
group in the network.
5.4 Multi Rate Congestion Control
The covered multicast move towards in multi rate
congestion control, because multi-layering enables to
separate data of the sender into dissimilar layers to be sent to
diverse multicast groups. All receivers join the major
feasible amount of groups allowed by the traffic jam in the
mode to dispatcher. While data value to be send to the
receiver becomes high while union additional multicast
groups. As the characteristic is mainly evident in multicast
video periods where more the class that the recipient accept
in, is additional layers that the recipient encounter, and also
more improved feature of video is temporarily, designed for
previous mass data, the transmit time is decreased by
additional layers [19]. By the usage of this mechanism,
congestion control is attained absolutely through the group
managing and routing mechanisms of the primary multicast
procedure.
5.4 TCP Friendliness
The unicast protocol which is connection-oriented yield
consistent data transfer with congestion control and flow. As
TCP maintain a congestion window which control the
amount of exceptional unidentified data packets in the
network. The sender can send packets only as long as free
slots are available because the data send will consume slots
of the window. As soon as an acceptance intended for
exceptional packets is arriving, the window is deviated so
that the acknowledged packets can depart the window and
the identical number of free slots becomes accessible for the
upcoming data. TCP performs slow start, and the rate
roughly doubles each round-trip time (RTT) to quickly
increase its fair share of bandwidth. In its steady state, TCP
uses an additive increase, multiplicative decrease
mechanism to react to congestion by the detection of
additional bandwidth. TCP increases the congestion window
by one slot per round-trip time when there is no sign of loss.
During loss of packet it is specified by a timeout and the
congestion window is minimized to one slot and TCP re-
enters the slowstart phase.TCP-friendliness can be
calculated during the consequence of a non TCP flow going
on challenging TCP flows below the similar circumstances
about throughput and previous parameter. The non TCP
unicast stream can be TCP friendly but it do not control the
extensive term throughput for any of the synchronized TCP
flows by a issue that is further than that prepared by a TCP
flow under the same circumstances. A multicast flow is
assumed to be TCP friendly if it separately views for every
sender receiver pair of the multicast flow TCP-friendly [24].
6. FUTURE STUDY
As a developing research area, a number of unsolved issues
remain. A particular problem is the deficit of comparison
congestion control protocols standard methods. A test
background that investigates dissimilar important aspects
like as equality and scalability of the flow, united with
method to directly compare the protocol performance [18]
would be very useful which also provides standardized suite
of test scenarios. Even as such a test background is not
enough to walk around all details of a particular protocol, it
would offer a sensible source for more objective
comparisons of the protocols.
In numerous cases, the imitation scenarios offered for a
protocol concentrate on a few broad-spectrum scenarios and
are frequently too simple to capture behaviour and various
characteristics of protocol in non-standard situations. Traffic
circumstances in the network are getting too composite to be
formed in all the conditions by a network simulator, building
it significant to estimate the protocols also below real-time
applications. As we discussed the various features and
behaviour of single-rate and multi rate congestion control. It
is possible that diverse forms of congestion control are
practical possibly with router maintain and does not show
signs of the disability of these methods. While TCP-
5. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 09 | Sep-2014, Available @ http://www.ijret.org 163
friendliness is a practical fairness measure in today‟s
network, it is also possible that future network architectures
will agree to or necessitate dissimilar interpretations of
fairness. Moreover the fairness denotation for multicast and
many methodologies are still issues to investigate. We
offered one feasible factors and methods to overcome and
also momentarily addressed a dissimilar structure where
multicast flows are allowable to use a high percentage of
bandwidth than the unicast flows are, but these can be by no
means the only capable fairness definitions. In advance area
of research is the enhancement of the models for TCP
network traffic that are used for some of the rate based
congestion control mechanisms. Existing TCP formulae are
based on some assumptions that are frequently not met in
real-time circumstances. A feature of congestion control
mechanism is, that is not explicitly related to the traffic
examined in this paper but extremely appropriate to
congestion control in common is how to care for the short-
lived flows that consists of only some data packets. The
TCP congestion control, as well as the congestion control
strategy presented in this paper, requires that flows
persistence for a definite quantity of time period. If not those
forms of congestion control are insignificant.
7. CONCLUSIONS
In this paper, we presented a survey on current trends and
advancements in the part of TCP-Friendly congestion
control. We discuss the necessity for TCP-friendly
congestion control for together non-TCP based unicast
traffic and multicast communication and thus provided a
general idea of the plan for such congestion control
mechanisms. We briefly survey of various congestion
control algorithms. It shows that at present there is no single
algorithm that can resolve every problems of congestion
control on computer networks and the Internet. Further
research work is needed in this direction. It is also to note
that not almost all of the surveyed papers have employed
any statistical techniques to verify their simulation results.
The above discussed are the theory of congestion its goals
and merits and the most common factors for the occurrence
of congestion and the methods to overcome the congestion
collapse. This paper in brief discusses the congestion control
algorithms based on the network awareness and various
common congestion control algorithm used and its
protocols. The paper also discusses the TCP- friendliness
and the characteristics of the TCP and non-TCP flows and
also the discussed issues that remain to be solved.
REFERENCES
[1]. “Congestion control for streaming media,” Ph. D.
dissertation, W. Chung, Polytechnic Inst., Worcester, 2005.
[2]. “Promoting the use of end-to-end congestion control in
the Internet,” Sally Floyd and Kevin Fall, IEEE/ACM
Transactions on Networking, vol. 7, no. 4, pp. 458–472,
Aug. 1999.
[3]. “RFC 2309: Recommendations on queue management
and congestion avoidance in the Internet,” Braden, D. Clark,
J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V.
Jacobson, G. Minshall, C. Partridge, L. Peterson, K.
Ramakrishnan, S. Shenker, J.Wroclawski, and L.
Zhang,Apr. 1998, Status: INFORMATIONAL.
[4]. Recommendations on Queue Management and
Congestion, Braden, D. Clark, et al.
[5]. Avoidance in the Internet. Network Working Group,
RFC2309, Apr 1998.
[6]. Recursive Estimation and Time-Series Analysis. Young
P. Sringer-Verlag, 2000.
[7]. A Stateless Active Queue Management Scheme for
Approximating Fair Bandwidth Allocation. Rong Pan, Balaji
Prabhakar, and Konstantinos Psounis. CHOKe, IEEE
INFOCOM, Mar 2000.
[8]. A New Class of Active Queue Management Algorithms.
Debanjan Saha Wu-chang Feng, Dilip D. Kandlur and Kang
G. Shin. BLUE:Technical Report CSETR- 387-99,
University of Michigan, April 1999.
[9]. Steven H. Low Sanjeewa Athuraliya, Victor H. Li and
Qinghe Yin. REM: Active Queue Management. IEEE
Network, 2001.
[10]. Alan Demers, Srinivasan Keshav, and Scott Shenker.
Analysis and simulation of a fair queueing algorithm.
SIGCOMM Symposium on Communications Architectures
and Protocols, pages 1–12, Sep 1989. Austin,Texas.
[11]. P. E. McKenney. Stochastic Fairness Queueing. Proc.
IEEE INFOCOM, 2:733– 740, June 1990.
[12]. N. Pekergin. Stochastic Bounds on Delays of Fair
Queueing Algorithms. Technical Report PRISM, UVSQ 10,
Universit‟e de Versailles-St-Quentin, 1998.
[13]. R.J. Gibben and F.P. Kelly. Resource pricing and
evolution of congestion control. Automatica, 1999.
[14]. Srisankar Kunniyur. Analysis and Design of an
Adaptive Virtual Queue Algorithm for Active Queue
Management. ACM SIGCOMM, 2001.
[15]. De Marco, F. Postiglione, M. Longo, “Run-time
adjusted congestion control for multimedia: experimental
results”, Journal of Interconnection Networks (JOIN), vol. 5,
no. 3, pp. 249-266, 2004.
[16]. Greg Ewing, Krys Pawlikowski, and Don McNickle.
Akaroa 2 User‟s Manual. University Of Canterbury,
Christchurch, New Zealand, Aug 2001.
[17]. S. Floyd and K. Fall, “Promoting the Use of the End-
to-End Congestion Control in the Internet,” IEEE/ACM
Trans. Net., vol. 7, no. 4, Aug. 1999, pp. 458–72.
[18]. Szilveszter Nadas, Zoltan Nagy and Sandor Racz
Ericsson Research, Traffic Analysis and Network
Performance laboratory, 2009.
[19]. Warrier, S. Janakiraman, S. Ha and I. Rhee, DiffQ:
Differential Backlog Congestion Control for Multi-hop
Wireless Networks, INFOCOM 2009.
[20]. Sally Floyd, ICSI Center for Internet Research and
Eddie Kohler, UCLA Computer Science Department,
“Datagram Congestion Control Protocol”, USA, 2009
[21]. "Adding Explicit Congestion Notification (ECN)
Capability to TCP's SYN/ACK Packets" A. Kuzmanovic, A.
Mondal, S. Floyd and K. Ramakrishnan, AT&T Labs
Research, June 2009.
[22]. "Metrics for the Evaluation of Congestion Control
Mechanisms", S. Floyd, Ed., March 2008.
[23]. "Congestion Control in the RFC Series", M. Welzl, W.
Eddy, University of Innsbruck, October 30, 2008.
6. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 09 | Sep-2014, Available @ http://www.ijret.org 164
[24]. The Internet Engineering Task Force, IETF home
page,http://www.ietf.org/.
BIOGRAPHIES
Mastan Mahammad was working as an
Associate Professor in CSE Department,
Malla Reddy Engineering College,
Hyderabad, Telangana, India. He had
published several papers in National and
International Conferences & International
Journals. His research interests
Computer Networks, Wireless Networks with specialization
in Quality of Service (QoS) in IEEE 802.11 Wireless LANs.
P.Suresh Verma working Dean CDC &
Professor Department of CSE, Adikavi
Nannaya University, Rajahmundry,
Andhra Pradesh , India. He had
published several papers in National and
International Conferences &
International Journals. His research interests Computer
Networks, Wireless Networks He is a member of IACSIT
and ISTE.
Mohammed Ali Hussain working as
Professor Department of ECM, KLU,
Guntur, Andhra Pradesh, India. He had
published several papers in National and
International Conferences &
International Journals. His research
interests Computer Networks, Wireless
Networks with specialization in Quality of Service (QoS) in
IEEE 802.11 Wireless LANs. & Ad-Hoc Networks. He is a
member of IACSIT and ISTE .