Welcome to the InfoSci Platform
Reference Hub1
Fast Path Reservation Scheduler

Fast Path Reservation Scheduler

Vidya Sachin Kubde, Sudhir D. Sawarkar
Copyright: © 2022 |Volume: 14 |Issue: 1 |Pages: 15
ISSN: 1935-5661|EISSN: 1935-567X|EISBN13: 9781683180401|DOI: 10.4018/IJICTHD.299413
Cite Article Cite Article

MLA

Kubde, Vidya Sachin, and Sudhir D. Sawarkar. "Fast Path Reservation Scheduler." IJICTHD vol.14, no.1 2022: pp.1-15. http://doi.org/10.4018/IJICTHD.299413

APA

Kubde, V. S. & Sawarkar, S. D. (2022). Fast Path Reservation Scheduler. International Journal of Information Communication Technologies and Human Development (IJICTHD), 14(1), 1-15. http://doi.org/10.4018/IJICTHD.299413

Chicago

Kubde, Vidya Sachin, and Sudhir D. Sawarkar. "Fast Path Reservation Scheduler," International Journal of Information Communication Technologies and Human Development (IJICTHD) 14, no.1: 1-15. http://doi.org/10.4018/IJICTHD.299413

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In multihomed devices, Multipath Transmission Control Protocol is a transport layer protocol that allows TCP segments to be sent over several paths. We look at several Multipath TCP schedulers in this study and highlight some current outstanding concerns including head-of-line blocking, bandwidth aggregation, and out-of-order packets. The majority of these difficulties degrade MPTCP performance, which may be improved by constructing an MPTCP scheduler properly. Then, utilizing the bandwidth of all potential routes, we develop a novel MPTCP packet scheduler dubbed a Fast path reservation scheduler that not only helps to solve the aforesaid problems, but also delivers optimal throughput with a short execution time. The size of the receiver buffer or the size of the data being transmitted have no effect on the performance of FPRS, which transmits packets of data to the receiver in the order they were received. Both empirically and analytically, we show that the suggested scheduler outperforms the competition.