Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
6 results
Search Results
Item Aggregate TCP congestion management for internet QoS(2012) Hemkumar, D.; VinayKumar, K.In this project we study the one of the most important performance in aggregate congestion control is fairness, i.e. the equal use of resources. The objective of Aggregate TCP congestion management is to achieve the fair sharing of the bottleneck bandwidth between the aggregate and other background TCP flows. There are many existing mechanism to prove the fairness property but none of mechanism proves fair share of the aggregated flows even where the number of flows in the aggregate is large. To solve this problem, unlike existing mechanism there are two congestion window loops, one is that loss event rate loop and other one is throughput control loop. Throughput control loop is used to adjust its window size with a weight N. Finally our simulation results prove an algorithm providing for fairly services to TCP flows that share a bottleneck link between the aggregate and other background TCP flows even where the number of flows in the aggregate is large. © 2012 IEEE.Item Improving RED for reduced UDP packet-drop(Institute of Electrical and Electronics Engineers Inc., 2015) Mukund, Y.R.; Rohit, C.; Chandavarkar, B.R.This paper gives an understanding of how the Random Early Detection(RED) algorithm can be implemented in a network involving UDP sources. The User Datagram Protocol(UDP) protocol is an unreliable protocol and does not have the mechanism to detect the packet drops that are carried out by the RED gateway which results in a bias by the gateway against UDP packets. By manipulating certain parameters of the RED algorithm we can make the algorithm less biased against the UDP packets. Various methods have been simulated and their corresponding results are shown in this paper. The aim is to show that the algorithm can be used in a network which consists of both the TCP and the UDP sources. © 2015 IEEE.Item TCP evaluation suite for ns-3(Association for Computing Machinery acmhelp@acm.org, 2016) Mishra, D.K.; Vankar, P.; Tahiliani, M.P.Congestion Control (CC) algorithms are essential to quickly restore the network performance back to stable whenever congestion occurs. A majority of the existing CC algorithms are implemented at the transport layer, mostly coupled with TCP. Over the past three decades, CC algorithms have incrementally evolved, resulting in many extensions of TCP. A thorough evaluation of a new TCP extension is a huge task. Hence, the Internet Congestion Control Research Group (ICCRG) has proposed a common TCP evaluation suite that helps researchers to gain an initial insight into the working of their proposed TCP extension. This paper presents an implementation of the TCP evaluation suite in ns-3, that automates the simulation setup, topology creation, traffic generation, execution, and results collection. We also describe the internals of our implementation and demonstrate its usage for evaluating the performance of five TCP extensions available in ns-3, by automatically setting up the following simulation scenarios: (i) single and multiple bottleneck topologies, (ii) varying bottleneck bandwidth, (iii) varying bottleneck RTT and (iv) varying the number of long flows. © 2016 ACM.Item Situation-Based Congestion Control Strategies for Wired and Wireless Networks(Institute of Electrical and Electronics Engineers Inc., 2018) Kharat, P.; Kulkarni, M.Performance of transport layer is measured mostly in terms of packet delivery ratio, transmission delay, and throughput. Congestion control (CC) strategies are responsible for transport layer performance. There are different congestion control algorithms are designed and developed by researchers to handle shared, highly distributed and heterogeneous environment. In this paper, we are analyzing most of the popular congestion control algorithms based on link state, type of traffic, mode of transmission and bandwidth delay product (BDP). In the proposed algorithmic solutions, networking researchers not only looking for congestion but also taking care of effective use of network resources in different types of environments such as wired, wireless, high-speed, long-delay, etc. To avoid severe congestion based on feedback mechanism few packets are dropped randomly by using active queue management (AQM) techniques. Using explicit congestion notification (ECN) mechanism unnecessary packet dropping is avoided. Data center network (DCN) uses a different approach to handle congestion. © 2018 IEEE.Item Effective RTO estimation using Eifel Retransmission Timer in CoAP(Institute of Electrical and Electronics Engineers Inc., 2020) Rathod, V.J.; Krishnam, S.; Kumar, A.; Baraskar, G.; Tahiliani, M.P.Internet of Things (IoT) is a system of interrelated devices with communication capabilities. Network congestion increases as the number of devices increase in the system and de-grades the Quality of Service (QoS). Unlike traditional Internet, TCP is not the de facto transport protocol for IoT because of the constrained nature of IoT devices. Therefore, congestion control mechanisms are coupled with application protocols, such as the Constrained Application Protocol (CoAP). Although there have been efforts to use CoAP with TCP, it typically uses UDP for data transport. CoAP defines a conservative congestion control mechanism that uses a fixed Retransmission TimeOut (RTO) for retransmissions regardless of the network conditions (e.g., Round Trip Time (RTT)). The Eifel Retransmission Timer is a popular algorithm originally proposed for TCP. It assesses prevalent network conditions by measuring RTT and accordingly sets the TCP RTO. This paper proposes to leverage the benefits of Eifel Retransmission Timer by integrating it with CoAP (when used with UDP) to obtain better RTO estimates and control congestion. The proposed algorithm is named as CoAP-Eifel. The effectiveness of the proposed approach has been validated by comparing it with the standard RTO estimation technique of CoAP. The experiments are carried out in a real testbed by using FIT/IoT-LAB. The results demonstrate that the proposed approach provides a better trade-off in terms of delay and throughput, without affecting the packet delivery ratio. © 2020 IEEE.Item Geometric Sequence Technique for Effective RTO Estimation in CoAP(IEEE Computer Society, 2020) Rathod, V.J.; Tahiliani, M.P.Internet of Things (IoT) is a network where physical objects with Internet connectivity can interact and exchange information with other connected objects. IoT devices are constrained in terms of power and memory, and have limited communication capabilities. The Constrained Application Protocol (CoAP) is a lightweight messaging protocol which is widely used by various IoT applications in low power and lossy wireless networks. CoAP provides reliability and minimal congestion control via a fixed Retransmission TimeOut (RTO) and Binary Exponential Backoff (BEB). It does not maintain end-to-end connection information and therefore, cannot adapt RTO based on the network conditions. Moreover, CoAP resets the RTO to its default value after having received the ACK for the retransmitted packet. This approach of resetting the RTO degrades the performance in a network with high latency and leads to spurious retransmissions. In this paper, we propose a Geometric Sequence Technique (GST) for effective RTO estimation in CoAP. GST retains the previous RTO value after having received the ACK for the retransmitted packet and eventually returns to the default value by decreasing the RTO depending on the number of consecutive successful transmissions. The proposed technique is implemented in Contiki OS and validated against the existing mechanisms. The experiments have been conducted using the Cooja simulator and the FIT/IoT-LAB testbed to verify the effectiveness of the proposed technique. The results show that GST minimizes the Flow Completion Times (FCT), reduces the number retransmissions and improves the network throughput. © 2020 IEEE.