Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
59 results
Search Results
Item Performance evaluation of TCP variants over routing protocols in multi-hop wireless networks(2010) Tahiliani, M.P.; Shet, K.C.; Basavaraju, T.G.Wireless internet has become popular in recent years due to the tremendous growth in the number of mobile computing devices and high demand for continuous network connectivity regardless of physical locations. In this paper, we investigate the effects of routing protocols on the performance of Transmission Control Protocol (TCP) variants in multi-hop wireless networks. Through simulations we study the effects of Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR), Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) routing protocols on TCP Tahoe, TCP Reno, TCP Newreno, TCP with Selective Acknowledgment (SACK) option and TCP Vegas. The simulations are carried out for static as well as mobile nodes. The performance metric used is throughput. Another metric, expected throughput is used for the comparison of throughput when nodes are mobile. ©2010 IEEE.Item AMul: Adaptive multicast routing protocol for multi-hop wireless networks(2011) Panwala, V.; Hegde, S.; Tahiliani, M.P.Wireless Networks have evolved as promising technology for numerous applications to provide Internet access to fixed and mobile wireless devices. Multicasting plays a crucial role in many applications of Wireless Networks. Several routing protocols have been proposed for multicast communication in mobile wireless networks. In this paper we propose a reactive and receiver initiated multicast routing protocol called Adaptive Multicast (AMul) to provide better Quality of Service (QoS) in Wireless Networks. Using simulations, we compare AMul with Protocol for Unified Multicasting through Announcements (PUMA) which is also a reactive and receiver initiated multicast routing protocol for Multi- Hop Wireless Networks. Based on the simulation results, we observe that AMul reduces the overall end to end delay while inducing negligible control overhead in the network. © Springer-Verlag 2011.Item Robust two-way locking protocol for key exchange(2011) Shetty, S.; Hegde, S.; Tahiliani, M.P.Sharing of symmetric key between the sender and receiver for encryption and decryption is considered to be one of the major issues in the communication networks. It is due to the fact that the strength of cryptosystem depends not only on the strength of the key, but also on the underlying key exchange protocol. In this paper, we propose a Robust Two-way Locking Protocol which overcomes the drawback of Diffie-Hellman key exchange protocol in terms of flexibility provided to the sender for selecting the desired key. Moreover we demonstrate the applicability of the proposed protocol in TCP handshake and compare it with Secure TCP which is based on Diffie-Hellman (DH) key exchange protocol. Based on the simulation results it is observed that Robust Two-way Locking (RoToLo) Protocol incurs negligible overhead in the network while providing greater flexibility of key selection to the sender as compared to Secure TCP. © Springer-Verlag 2011.Item Ant-CAMP: Ant based congestion adaptive multi-path routing protocol for wireless networks(2011) Raval, C.; Hegde, S.; Tahiliani, M.P.The advent of mobile computing devices and wide deployment of wireless networks have led to an exponential increase in the internet traffic. Long congestion epochs and frequent link failures in wireless network lead to more number of packets being dropped and incur high end-to-end delay, thereby degrading the overall performance of the network. Congestion control, though mainly incorporated at the transport layer, if coupled with the routing protocols, can significantly improve overall performance of the network. In this paper we propose Ant based Congestion Adaptive Multipath (Ant-CAMP) routing protocol that aims to avoid congestion by proactively sending congestion notification to the sender. The proposed Ant-CAMP routing protocol is implemented in Network Simulator-2 (NS-2) and its performance is compared with Ad-hoc On Demand Multi-Path Distance Vector (AOMDV) in terms of Packet Drops due to Congestion, Packet Delivery Fraction and Average End-to-End Delay. © Springer-Verlag 2011.Item TCP variants for data center networks: A comparative study(IEEE Computer Society help@computer.org, 2012) Tahiliani, R.P.; Tahiliani, M.P.; Chandra Sekaran, K.C.Transmission Control Protocol (TCP) has been the workhorse of the Internet ever since its inception. The success of the Internet, infact, can be partly attributed to the congestion control mechanisms implemented in TCP. Though the scale of the Internet and its usage increased exponentially in recent past, TCP has evolved to keep up with the changing network conditions and has proven to be scalable and robust. However, the performance of TCP in Data Center Networks has been a major concern recently because it leads to impairments such as TCP Incast, TCP Outcast, Queue build-up and Buffer pressure. With cloud computing becoming an important part of the foreseeable future, it has become extremely important to enhance the performance of TCP in Data Center Networks and overcome these impairments. In this paper, we describe the above mentioned impairments in brief and then compare the TCP variants proposed so far to ovecome these impairments in Data Center Networks. The advantages and shortcomings of every TCP variant are highlighted with respect to its efficacy and the deployment complexity. A few open issues related to TCP's performance in Data Center Networks are also discussed. © 2012 IEEE.Item CAMP: Congestion adaptive multipath routing protocol for VANETs(2012) Raviteja, B.L.; Annappa, B.; Tahiliani, M.P.Long congestion periods, frequent link failures and hand-offs in VANETs lead to more number of packets being dropped and incur high end to end delay, there by degrading the overall performance of the network. Congestion control mechanism, though mainly incorporated in transport protocols, if coupled with the routing protocols, can significantly improve overall performance of the network. In this paper we propose Congestion Adaptive Multipath Routing Protocol (CAMP) that aims to avoid congestion by proactively sending congestion notification to the sender. The proposed CAMP routing protocol is implemented in Network Simulator-2 (NS-2) and its performance is compared with Ad-hoc On Demand Multipath Distance Vector (AOMDV) in terms of Packet Drop due to Congestion, Packet Delivery Fraction, Throughput and Average End-to-End Delay. Simulation results show that CAMP routing protocol achieves significant performance gain as compared to that of AOMDV. © 2012 Springer-Verlag.Item FARED: Fast adapting RED gateways for TCP/IP networks(2012) Tahiliani, M.P.; Shet, K.C.; Basavaraju, T.G.Random Early Detection (RED) is a widely deployed active queue management mechanism to improve the performance of the network in terms of throughput and packet drop rate. The effectiveness of RED, however, highly depends on appropriate setting of its parameters. In this paper, we propose a Fast Adapting Random Early Detection (FARED) algorithm which efficiently varies the maximum drop probability to improve the overall performance of the network. Based on extensive simulations, we show that FARED algorithm reduces the packet drop rate and achieves better throughput than Adaptive RED (ARED) and Refined Adaptive RED (Re-ARED). Moreover, FARED algorithm does not introduce new parameters to improve the performance and hence can be deployed without any additional complexity. © 2012 Springer-Verlag.Item On the effectiveness of CoDel for active queue management(2013) Raghuvanshi, D.M.; Annappa, B.; Tahiliani, M.P.Internet in the present scenario has become a gigantic source of information. There has been a tremendous rise in the variety of Internet applications, with each application demanding a specific performance criteria to be satisfied. Routers presently use Passive Queue Management (PQM) mechanisms and hence, merely have any control over the queue occupancy. Therefore, there has been an increased interest in exploring Active Queue Management (AQM) in Internet routers so as to reduce the queue latency and meet the demands of time sensitive applications. In this paper, we mainly focus on analyzing the effectiveness of a recently proposed AQM mechanism called Controlled Delay (CoDel). We study the effectiveness of CoDel by carrying out simulations in ns-2 and comparing its performance with existing AQM mechanisms in variety of Internet scenarios. Based on the simulation results obtained, we discuss the advantages and shortcomings of CoDel in terms of bottleneck link utilization, mean queue length and packet drop rate. © 2013 IEEE.Item Analysis of cautious adaptive RED (CARED)(2013) Tahiliani, M.P.; Shet, K.C.Internet in the present scenario has become a gigantic source of information. There has been a tremendous rise in the variety of Internet applications with each application demanding a specific performance criteria to be satisfied. Routers presently use Passive Queue Management (PQM) mechanisms and hence, merely have any control over the queue occupancy. Therefore, there has been an increased interest in exploring Active Queue Management (AQM) in Internet routers so as to reduce the queue latency and meet the demands of time sensitive applications. In this paper, we mainly focus on analyzing the AQM mechanism which we proposed recently, named Cautious Adaptive Random Early Detection (CARED). We study the effectiveness of CARED by carrying out simulations in ns-2 and comparing its performance with Adaptive RED (ARED) and Refined Adaptive RED (Re-ARED) in a wide variety of Internet scenarios. Based on the simulation results obtained, we highlight the advantages of CARED in terms of throughput, packet drop rate and the stability of the average queue size. © 2013 IEEE.Item Analysis of sfqCoDel for Active Queue Management(IEEE Computer Society help@computer.org, 2014) Rao, V.P.; Tahiliani, M.P.; Shenoy, U.K.K.The availability of cheaper and high capacity Random Access Memory (RAM) has resulted in the growth of buffer size in all the computing devices. This aberrant increase of buffer capacity in network devices has resulted into high latency, leading to reduced throughput; thus decreasing the tendency of absorbing spontaneous burst of traffic. The requirement for Active Queue Management (AQM) has been evident for decades. These solutions require various parameter configuration and are dependent on a particular network condition to work efficiently. Hence an algorithm which is simple, efficient, does not require setting of parameters and works seamlessly irrespective of the network condition is required. Even though Controlled Delay (CoDel) is parameterless and adapts to dynamically changing link rates with no negative impact on utilization, it deviates from its primary purpose of reducing congestion when there is an increase in RTT and when congestion level varies abruptly. As a consequence, a variant of CoDel called Stochastic Fair Queue CoDel (sfqCoDel) is simulated and compared. The Stochastic Fair Queue CoDel proactively drops packets which occupy reasonably larger bandwidth as compared to CoDel, which proactively drops packet irrespective of the bandwidth consumption by packets. This paper aims to perform a comprehensive analysis of Stochastic Fair Queue CoDel for Active Queue Management. A comparison is also carried out between sfqCoDel with CoDel. The sfqCoDel appears to be much better than CoDel in certain areas where CoDel fails to perform well. © 2014 IEEE.