Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
6 results
Search Results
Item Modified RED algorithm to improve the performance of web traffic(2013) Dadhania, M.K.; Kumar, K.V.Reducing the delay of web traffic has been an important issue in Internet works. However, it is difficult to reduce delay while improving throughput. This is because, in order to reduce delay queue size should be less but to improve throughput queue size should be more. In our modification, web traffic and ECN marked packets are dropped only when high congestion occurs at router. We propose a solution to improve response time as well as the number of packets transmitted of web traffic without affecting throughput of bottleneck link. We applied this solution to RED algorithm and tested the performance and efficiency of modified RED algorithm as compared to the original RED algorithm. © 2013 IEEE.Item Comparative analysis of queue mechanisms with respect to various traffic in wired-cum-wireless network(Institute of Electrical and Electronics Engineers Inc., 2014) Dhadse, J.S.; Chandavarkar, B.R.Current Active Queue Management (AQM) and TCP are designed to work well for wired networks where packet loss is mainly due to network congestion. In wired cum wireless networks, however, wireless bandwidth is much smaller than the wired network and at base station packet loss occurs due to bottleneck wireless link. As a result, the performance of TCP flows is significantly degraded. To overcome this problem, Base Station (BS) is the key point for performance enhancement in wired-cum-wireless network. There is need of AQM at base station which stabilize the system and achieve low delay, low packet loss, and high link utilization regardless the dynamic of network conditions. To study the behavior of Queue at base station, we carry out simulation of wired-cum-wireless network with respect to various traffics (Background, streaming, conversational) in ns-2. © 2014 IEEE.Item Performance evaluation of CoDel for active queue management in wired-cum-wireless networks(Institute of Electrical and Electronics Engineers Inc., 2014) Jain, T.; Annappa, B.; Tahiliani, M.P.Internet is the major source of information today and its usage is increasing at an alarming rate. A wide variety of data travels over the Internet to cater the needs of end users. This has eventually led to heavy congestion in the network which in turn, worsens the user perceived latency. Internet routers are the main agents that detect congestion prior to end hosts. Traditional router incorporates Passive Queue Management (PQM) strategies which fail to control congestion. Moreover, PQM has several drawbacks which drew the attention of researchers towards the evolution of Active Queue Management (AQM). AQMs are designed to effectively avoid congestion at network routers. AQM apparently became very popular for wired networks, but there are very few researches to find their effectiveness over wireless networks. In this paper we evaluate the effectiveness of a recently proposed AQM mechanism called Controlled Delay (CoDel) in wired-cum-wireless networks. Simulations are carried out by using ns-2 and CoDel's performance is compared with that of Random Early Detection (RED) and Droptail. © 2014 IEEE.Item Extended ECN mechanism to mitigate ECN-based attacks(Institute of Electrical and Electronics Engineers Inc., 2014) Bommisetti, S.; Annappa, B.; Tahiliani, M.P.Today, usage of internet is growing exponentially. Congestion detection and avoidance algorithms are the major issues in TCP/IP. Earlier, packet drops are only source of congestion indication, but it leads to loss of throughput. Active Queue Management (AQM) can detect congestion before the queue overflows and informs the end hosts to respond congestion. It allows gateways to drop packets when average queue is greater than maximum threshold and marks the packets otherwise. Explicit Congestion Notification (ECN) mechanism marks the packets when the average queue size is between predefined thresholds and improves the throughput of a network. But it depends on the end hosts to respond to congestion. So there is a possibility of misbehavior by sender to increase its congestion window, even if the receiver correctly signals about congestion. So misbehaving ECN sender flow obtains more throughput than the normal ECN-enabled flows. We present an Extended ECN mechanism that enables a router to mark packets and the receiver to signal congestion to the sender without trusting the sender whether it has responded congestion or not. Our improved mechanism is robust in detection and prevention of this misbehaving sender in network and compatible with ECN and TCP/IP mechanisms. © 2014 IEEE.Item Revisiting TCP outcast problem using DCTCP in data center networks(Institute of Electrical and Electronics Engineers Inc., 2015) Patidar, A.; Tahiliani, M.P.Data Center Networks (DCNs) today are used to compute and store the data of multiple users because of low cost, flexibility and availability. In this multi-tenant cloud environment, resources are shared among different users. Suppose two users fetch data at same time from the same DCNs, one fetches small amount of data (like web search) while another user fetches larger amount of data (like software update). If these large set of flows and small set of flows arrive at two different input ports of a switch and compete for same output port, then large flow packets get the buffer while small flow packets are dropped consecutively. This issue occurs due to drop tail implementation of queue in switches and as one set of flows is outcast by other, the problem is known as TCP Outcast. While a few studies have already explored the TCP Outcast problem, this paper aims to revisit this problem by using DCTCP in DCNs. The experiments carried out using Mininet show that DCTCP solves the problem of TCP Outcast by ensuring fairness for all types of flows. © 2015 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.