Samar Shailendra

MPSCTP: A Simple and Efficient Multipath Algorithm for SCTP

A simple multipath algorithm is proposed to augment Stream Control Transmission Protocol (SCTP) so that multiple available paths may be used concurrently. This requires an additional sequence number in the SCTP header for packets of each path and additional algorithms to handle the reordering that may naturally arise due to flow division over multiple paths. Performance of the proposed protocol has been studied using ns2 based simulation. The results indicate that our algorithm reduces the transmission delay and improves the throughput of the network.

Improving congestion control for Concurrent Multipath Transfer through bandwidth estimation based resource pooling

Stream Control Transmission Protocol (SCTP) was introduced in 2001 as a multipath variant to traditional transport protocols, i.e. Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). Concurrent Multipath Transfer (CMT) has been proposed as an extension for SCTP to support concurrent usage of available multiple paths. In this paper, we propose a new congestion control algorithm for CMT-SCTP based on the principle of resource pooling. We use the connection bandwidth estimates to obtain the collection of the network resources being used by different flows on multiple paths. Based on these bandwidth estimates, we have used the bandwidth estimation based resource pooling approach to adjust the congestion window of the respective paths. We compare our proposed scheme with CMT-SCTP through ns-2 based simulations.

MPSCTP: A multipath variant of SCTP and its performance comparison with other multipath protocols

Multipath protocols have great potential to improve error resilience and utilization of scarce network resources. In 2000, IETF introduced Stream Control Transmission Protocol (SCTP) for multihomed transport. Concurrent Multipath Transfer (CMT) and Multipath SCTP (MPSCTP) were proposed as extensions of SCTP to support concurrent usage of available paths. Our original MPSCTP proposal assumes that all the paths between the source and the destination are disjoint and there is no acknowledgement loss in the reverse direction. In this paper we propose a generalized version of the MPSCTP protocol where these assumptions are relaxed. We also present a comparative study of the performance of MPSCTP with CMT and MPTCP, a multipath variant of TCP, in different network scenarios using ns-2 based simulations.

Optimized flow division modeling for multi-path transport

Multipath Transport Protocols like Stream Control Transmission Protocol (SCTP) and Multipath TCP (MPTCP) support concurrent usage of multiple paths between the end users. In this paper we investigate the flow division at the source among multiple paths as an optimization problem. We also introduce link-by-link error recovery scheme and compare the system performance when the traditional end-to-end error recovery approach is adopted. The optimization objectives also depend upon whether the supported application is delay sensitive or delay insensitive in nature.

Performance evaluation of caching policies in NDN - an ICN architecture

Information Centric Networking (ICN) advocates the philosophy of accessing the content independent of its location. Owing to this location independence in ICN, the routers en-route can be enabled to cache the content to serve the future requests for the same content locally. Several ICN architectures have been proposed in the literature along with various caching algorithms for caching and cache replacement at the routers en-route. The aim of this paper is to critically evaluate various caching policies using Named Data Networking (NDN), an ICN architecture proposed in literature. We have presented the performance comparison of different caching policies naming First In First Out (FIFO), Least Recently Used (LRU), and Universal Caching (UC) in two network models; Watts-Strogatz (WS) model (suitable for dense short link networks such as sensor networks) and Sprint topology (better suited for large Internet Service Provider (ISP) networks) using ndnSIM, an ns3 based discrete event simulator for NDN architecture. Our results indicate that UC outperforms other caching policies such as LRU and FIFO and makes UC a better alternative for both sensor networks and ISP networks.

A multipath variant of SCTP with optimized flow division extension

In the literature, Multipath Stream Control Transmission Protocol (MPSCTP) has been proposed as a multipath variant of Stream Control Transmission Protocol (SCTP). Unlike SCTP, MPSCTP uses the multiple available paths between the source and the destination in concurrent fashion using the multihoming feature of SCTP. MPSCTP in its original form implicitly assumes no acknowledgment loss. In this work, a modified algorithm for MPSCTP is proposed to mitigate this limitation and its performance is compared with Concurrent Multipath Transfer (CMT) using ns2 based simulation. A new path selection strategy for data transmission is incorporated and its results are compared with the RTX-CWND strategy proposed in the literature. This paper also presents a heuristic to implement delay insensitive optimization. The performance of this optimization for MPSCTP has been studied using ns2 based simulations. We have also presented the performance results of MPSCTP implementation in the Linux Kernel.

Multipath TCP Path Scheduler for Drones: A Segregation of Control and User Data

Multipath Transport Control Protocol (MPTCP) has been originally proposed for the data centers. MPTCP aggregates multiple interfaces available at the end devices to provide improved throughput and reliability. These features of MPTCP can also be exploited in robotic and drone1 based communications. The biggest challenge observed in drone communication is the delay or failure in the reception of control signals due to congestion caused by high bandwidth video transmissions from drones to ground stations. Such delay in the control signals may cause unwanted misbehaviors at the drones. In this poster, we have proposed a new path scheduler for MPTCP which segregates the data and control packets intelligently. This not only guarantees the successful reception of control packets but also improves the average latency with increased reliability and resilience to link failures. We have implemented the proposed scheduler in the Linux kernel and observed its performance in a Robot Operating System (ROS)2 based drone environment.

Reliable robotic communication using multi-path TCP

Robotics is penetrating into all aspects of human life from being a helper at daily chores to a technician performing precision operations at warehouse. Deploying mobile robots and Unmanned Aerial Vehicles (UAV) to conduct search and rescue operations during industrial accidents and natural disasters is one of the recent applications of robotics. These robots/UAVs are controlled remotely over wireless connections. Any disruption in connectivity of robots/UAVs may be disastrous. It is possible to reduce the chances of outage and improve reliability of communication by using multiple available communication interfaces on a device. In this demo paper, we demonstrate the use of Multipath TCP (MPTCP) in robotics communication. MPTCP uses all available communication interfaces concurrently for communication. Its use in robotics improves the connection reliability as well as the throughput. We have ported MPTCP on resource constrained devices and conducted experiments to evaluate throughput performance and error resilience of different variants of MPTCP by comparing it with that of TCP.

Power efficient RACH mechanism for dense IoT deployment

In the world of Internet of Things (IoT), it is desired that every IoT device is able to communicate with the network all the time. Among various technologies to enable network connectivity, Long Term Evolution (LTE) is by far the most ubiquitous technology to provide coverage for IoT devices. The IoT devices are inherently resource constraint and efficient communication is one of the primary requirements of these devices. LTE Random Access Channel (RACH), one of the primary procedures to enable channel access for devices, is well suited for cellular deployment. In this work, we have demonstrated that the current LTE-RACH procedure is not power efficient for dense deployments because in such scenarios RACH failures are mostly due to request collisions and increasing the transmit power does not give any significant advantage. We have also proposed Delayed Power Ramping Algorithm (DPRA), a heuristic based approach to improve the energy footprint of the IoT devices. We have conducted extensive simulations using Network Simulator (ns3) and discussed the performance results of the proposed approach for different scenarios.

Analysis of in-network caching for ICN

Information Centric Networking (ICN) is one of the proposed alternative paradigms to improve traditional network performance. In ICN architecture, caching is used to enhance the efficiency of the content distribution. The major challenge for designing caching in ICN architecture is determining how a content is cached, including both the content placement policy and the replacement policy. There are many in-network caching mechanisms for ICN. In this paper, we study the performance of various content placement policies in combination with multiple content replacement policies. We evaluate these policies on different performance metrics for different network traffic patterns. These results will be helpful in designing caching mechanisms for the ICN architecture.