The Experts below are selected from a list of 2937 Experts worldwide ranked by ideXlab platform
Mohit P Tahiliani - One of the best experts on this subject based on the ideXlab platform.
-
css cautious slow start algorithm to minimize Packet Drop Rate
IEEE International Conference on Advanced Networks and Telecommunications Systems, 2016Co-Authors: Chalavindala Swapna, Mohit P TahilianiAbstract:Slow Start algorithm helps the TCP flows to quickly ramp up their congestion window (cwnd) by employing an exponential increase pattern. This pattern of increasing cwnd leads to consecutive loss of Packets in bulk, and hence, results in large number of Packets being re-transmitted. Recently, the limitations of this approach have become apparent as many Internet applications are becoming more sensitive to Packet loss and latency. In this paper, we propose a Cautious Slow Start (CSS) algorithm which aims to mitigate the bulk Packet losses that occur with the traditional Slow Start algorithm. This is achieved by increasing the cwnd cautiously, instead of doubling it. We validate the effectiveness of CSS algorithm by simulating a variety of Internet like scenarios in ns-2, and comparing its performance with that of the traditional Slow Start algorithm. CSS algorithm successfully mitigates the bulk Packet losses, without affecting the overall link and buffer utilization.
-
ANTS - CSS: Cautious Slow Start algorithm to minimize Packet Drop Rate
2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS), 2016Co-Authors: Chalavindala Swapna, Mohit P TahilianiAbstract:Slow Start algorithm helps the TCP flows to quickly ramp up their congestion window (cwnd) by employing an exponential increase pattern. This pattern of increasing cwnd leads to consecutive loss of Packets in bulk, and hence, results in large number of Packets being re-transmitted. Recently, the limitations of this approach have become apparent as many Internet applications are becoming more sensitive to Packet loss and latency. In this paper, we propose a Cautious Slow Start (CSS) algorithm which aims to mitigate the bulk Packet losses that occur with the traditional Slow Start algorithm. This is achieved by increasing the cwnd cautiously, instead of doubling it. We validate the effectiveness of CSS algorithm by simulating a variety of Internet like scenarios in ns-2, and comparing its performance with that of the traditional Slow Start algorithm. CSS algorithm successfully mitigates the bulk Packet losses, without affecting the overall link and buffer utilization.
-
ADCONS - FARED: fast adapting RED gateways for TCP/IP networks
Lecture Notes in Computer Science, 2012Co-Authors: Mohit P Tahiliani, K. C. Shet, T. G. BasavarajuAbstract: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.
Emmanouil Fountoulakis - One of the best experts on this subject based on the ideXlab platform.
-
Information Freshness and Packet Drop Rate Interplay in a Two-User Multi-Access Channel.
arXiv: Networking and Internet Architecture, 2020Co-Authors: Emmanouil Fountoulakis, Themistoklis Charalambous, Nikolaos Nomikos, Nikolaos PappasAbstract:In this work, we combine the two notions of timely delivery of information in order to study their interplay; namely, deadline-constrained Packet delivery due to latency constraints and freshness of information at the destination. More specifically, we consider a two-user multiple access setup with random access, in which user 1 is a wireless device with a queue and has external bursty traffic which is deadline-constrained, while user 2 monitors a sensor and transmits status updates to the destination. For this simple, yet meaningful setup, we provide analytical expressions for the throughput and Drop probability of user 1, and an analytical expression for the average Age of Information (AoI) of user 2 monitoring the sensor. The relations reveal that there is a trade-off between the average AoI of user 2 and the Drop Rate of user 1: the lower the average AoI, the higher the Drop Rate, and vice versa. Simulations corroboRate the validity of our theoretical results.
-
GLOBECOM - Dynamic Power Control for Packets with Deadlines
2018 IEEE Global Communications Conference (GLOBECOM), 2018Co-Authors: Emmanouil Fountoulakis, Anthony Ephremides, Qi Liao, Nikolaos Pappas, Vangelis AngelakisAbstract:Wireless devices need to adapt their transmission power according to the fluctuating wireless channel in order to meet constraints of delay sensitive applications. In this paper, we consider delay sensitivity in the form of strict Packet deadlines arriving in a transmission queue. Packets missing the deadline while in the queue are Dropped from the system. We aim at minimizing the Packet Drop Rate under average power constraints. We utilize tools from Lyapunov optimization to find an approximate solution by selecting power allocation. We evaluate the performance of the proposed algorithm and show that it achieves the same performance in terms of Packet Drop Rate with that of the Earliest Deadline First (EDF) when the available power is sufficient. However, our algorithm outperforms EDF regarding the trade-off between Packet Drop Rate and average power consumption.
-
Dynamic Power Control for Packets with Deadlines
2018 IEEE Global Communications Conference (GLOBECOM), 2018Co-Authors: Emmanouil Fountoulakis, Anthony Ephremides, Qi Liao, Nikolaos Pappas, Vangelis AngelakisAbstract:Wireless devices need to adapt their transmission power according to the fluctuating wireless channel in order to meet constraints of delay sensitive applications. In this paper, we consider delay sensitivity in the form of strict Packet deadlines arriving in a transmission queue. Packets missing the deadline while in the queue are Dropped from the system. We aim at minimizing the Packet Drop Rate under average power constraints. We utilize tools from Lyapunov optimization to find an approximate solution by selecting power allocation. We evaluate the performance of the proposed algorithm and show that it achieves the same performance in terms of Packet Drop Rate with that of the Earliest Deadline First (EDF) when the available power is sufficient. However, our algorithm outperforms EDF regarding the trade-off between Packet Drop Rate and average power consumption.
Nikolaos Pappas - One of the best experts on this subject based on the ideXlab platform.
-
Information Freshness and Packet Drop Rate Interplay in a Two-User Multi-Access Channel.
arXiv: Networking and Internet Architecture, 2020Co-Authors: Emmanouil Fountoulakis, Themistoklis Charalambous, Nikolaos Nomikos, Nikolaos PappasAbstract:In this work, we combine the two notions of timely delivery of information in order to study their interplay; namely, deadline-constrained Packet delivery due to latency constraints and freshness of information at the destination. More specifically, we consider a two-user multiple access setup with random access, in which user 1 is a wireless device with a queue and has external bursty traffic which is deadline-constrained, while user 2 monitors a sensor and transmits status updates to the destination. For this simple, yet meaningful setup, we provide analytical expressions for the throughput and Drop probability of user 1, and an analytical expression for the average Age of Information (AoI) of user 2 monitoring the sensor. The relations reveal that there is a trade-off between the average AoI of user 2 and the Drop Rate of user 1: the lower the average AoI, the higher the Drop Rate, and vice versa. Simulations corroboRate the validity of our theoretical results.
-
GLOBECOM - Dynamic Power Control for Packets with Deadlines
2018 IEEE Global Communications Conference (GLOBECOM), 2018Co-Authors: Emmanouil Fountoulakis, Anthony Ephremides, Qi Liao, Nikolaos Pappas, Vangelis AngelakisAbstract:Wireless devices need to adapt their transmission power according to the fluctuating wireless channel in order to meet constraints of delay sensitive applications. In this paper, we consider delay sensitivity in the form of strict Packet deadlines arriving in a transmission queue. Packets missing the deadline while in the queue are Dropped from the system. We aim at minimizing the Packet Drop Rate under average power constraints. We utilize tools from Lyapunov optimization to find an approximate solution by selecting power allocation. We evaluate the performance of the proposed algorithm and show that it achieves the same performance in terms of Packet Drop Rate with that of the Earliest Deadline First (EDF) when the available power is sufficient. However, our algorithm outperforms EDF regarding the trade-off between Packet Drop Rate and average power consumption.
-
Dynamic Power Control for Packets with Deadlines
2018 IEEE Global Communications Conference (GLOBECOM), 2018Co-Authors: Emmanouil Fountoulakis, Anthony Ephremides, Qi Liao, Nikolaos Pappas, Vangelis AngelakisAbstract:Wireless devices need to adapt their transmission power according to the fluctuating wireless channel in order to meet constraints of delay sensitive applications. In this paper, we consider delay sensitivity in the form of strict Packet deadlines arriving in a transmission queue. Packets missing the deadline while in the queue are Dropped from the system. We aim at minimizing the Packet Drop Rate under average power constraints. We utilize tools from Lyapunov optimization to find an approximate solution by selecting power allocation. We evaluate the performance of the proposed algorithm and show that it achieves the same performance in terms of Packet Drop Rate with that of the Earliest Deadline First (EDF) when the available power is sufficient. However, our algorithm outperforms EDF regarding the trade-off between Packet Drop Rate and average power consumption.
Jin-yup Hwang - One of the best experts on this subject based on the ideXlab platform.
-
VTC Fall - A Packet-by-Packet Scheduling Algorithm for Wireless Multimedia Systems
2007 IEEE 66th Vehicular Technology Conference, 2007Co-Authors: Jinyoung Oh, Jin-yup HwangAbstract:In this paper, we propose a Packet-by-Packet scheduling algorithm which grants priority to each Packet instead of a user. The proposed scheduler classifies Packets inside of each user into three classes such as emergency, near emergency, and non-emergency Packets based on Packet delay ratio, and applies different scheduling schemes to grant priority in each region respectively. It can be possible to manage Packets more efficiently for guaranteeing various Quality of Services (QoS) in wireless multimedia systems. Simulation results show that the proposed scheme offers higher system throughput and lower Packet Drop Rate than other scheduling algorithms.
Balamurugan Balusamy - One of the best experts on this subject based on the ideXlab platform.
-
Robust Defense Scheme Against Selective Drop Attack in Wireless Ad Hoc Networks
IEEE Access, 2019Co-Authors: T. Poongodi, Mohammed S. Khan, Rizwan Patan, Amir H. Gandomi, Balamurugan BalusamyAbstract:Performance and security are two critical functions of wireless ad-hoc networks (WANETs). Network security ensures the integrity, availability, and performance of WANETs. It helps to prevent critical service interruptions and increases economic productivity by keeping networks functioning properly. Since there is no centralized network management in WANETs, these networks are susceptible to Packet Drop attacks. In selective Drop attack, the neighboring nodes are not loyal in forwarding the messages to the next node. It is critical to identify the illegitimate node, which overloads the host node and isolating them from the network is also a complicated task. In this paper, we present a resistive to selective Drop attack (RSDA) scheme to provide effective security against selective Drop attack. A lightweight RSDA protocol is proposed for detecting malicious nodes in the network under a particular Drop attack. The RSDA protocol can be integRated with the many existing routing protocols for WANETs such as AODV and DSR. It accomplishes reliability in routing by disabling the link with the highest weight and authenticate the nodes using the elliptic curve digital signature algorithm. In the proposed methodology, the Packet Drop Rate, jitter, and routing overhead at a different pause time are reduced to 9%, 0.11%, and 45%, respectively. The Packet Drop Rate at varying mobility speed in the presence of one gray hole and two gray hole nodes are obtained as 13% and 14% in RSDA scheme.
