Mohit P. Tahiliani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mohit P. Tahiliani has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- A R Sharan Kumar
Wireless Information Networking Group, Dept. of Computer Science and Engineering, National Institute of Technology Karnataka, Surathkal, Mangalore, India
2 shared publications - Abhinaba Rakshit
National Institute of Technology Karnataka, Surathkal, India
2 shared publications - Dayma Khan
National Institute of Technology Karnataka, Surathkal, India
2 shared publications - S B L Prateek
Wireless Information Networking Group, Dept. of Computer Science and Engineering, National Institute of Technology Karnataka, Surathkal, Mangalore, India
2 shared publications - Aditya R Rudra
National Institute of Technology Karnataka, Surathkal, India
1 shared publication Archit Pandey
Wireless Information Networking Group (WiNG), National Institute of Technology Karnataka,Department of Computer Science and Engineering,Surathkal, Mangalore,India,575025
1 shared publication
Latest Publications
- Open Access
- 18 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 100-108
Design and Implementation of rLEDBAT in ns-3
- 18 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 100-108
Open AccessDesign and Implementation of rLEDBAT in ns-3
- Open Access
- 18 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 91-99
Design and Implementation of LEDBAT++ in ns-3
- 18 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 91-99
Open AccessDesign and Implementation of LEDBAT++ in ns-3
- Open Access
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 22-28
Operations and Control Networks (OCN) Model: A Systematic Approach to Operational and Information Technology Convergence
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 22-28
Open AccessOperations and Control Networks (OCN) Model: A Systematic Approach to Operational and Information Technology Convergence
- Open Access
- 28 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 121-126
Linux-like Socket Statistics Utility for ns-3
Collecting statistics in network experiments is crucial for understanding the behavior of the network protocols and identifying any anomalies or performance issues. Without accurate and comprehensive statistics, it is difficult to analyze network traffic, identify bottlenecks, and make informed decisions about network protocol improvements. One of the key features of ns-3 is its ability to collect detailed statistics about network behavior during simulations. It supports various modules to collect statistics, such as Flow Monitor to collect flow level statistics, trace sources to collect information about specific events that occur during simulation, packet captures (PCAP) that can be read and analyzed using various PCAP-compatible tools and ASCII traces for debugging and generating custom reports. Besides, ns-3 also provides a flexible and extensible framework for users to create their own custom statistics collection modules. Nevertheless, collecting and analyzing data from simulations using these tools can be a complex process and requires a good understanding of the ns-3 simulation framework and its internal data structures. This paper discusses the design and development of a Linux-like socket statistics (ss) utility for ns-3 which makes the task of gathering network statistics much simpler. The main objective of this work is to develop a user-friendly API that enables ns-3 users to easily generate socket statistics. We validate the proposed API by comparing the results obtained from the trace sources already present in ns-3, and observe a high degree of consistency between our API and the trace source results. In addition, we analyze the impact of the proposed API on ns-3 performance in terms of resource consumption.
- 28 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 121-126
Open AccessLinux-like Socket Statistics Utility for ns-3
Collecting statistics in network experiments is crucial for understanding the behavior of the network protocols and identifying any anomalies or performance issues. Without accurate and comprehensive statistics, it is difficult to analyze network traffic, identify bottlenecks, and make informed decisions about network protocol improvements. One of the key features of ns-3 is its ability to collect detailed statistics about network behavior during simulations. It supports various modules to collect statistics, such as Flow Monitor to collect flow level statistics, trace sources to collect information about specific events that occur during simulation, packet captures (PCAP) that can be read and analyzed using various PCAP-compatible tools and ASCII traces for debugging and generating custom reports. Besides, ns-3 also provides a flexible and extensible framework for users to create their own custom statistics collection modules. Nevertheless, collecting and analyzing data from simulations using these tools can be a complex process and requires a good understanding of the ns-3 simulation framework and its internal data structures. This paper discusses the design and development of a Linux-like socket statistics (ss) utility for ns-3 which makes the task of gathering network statistics much simpler. The main objective of this work is to develop a user-friendly API that enables ns-3 users to easily generate socket statistics. We validate the proposed API by comparing the results obtained from the trace sources already present in ns-3, and observe a high degree of consistency between our API and the trace source results. In addition, we analyze the impact of the proposed API on ns-3 performance in terms of resource consumption.
- Open Access
- 4 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 305-310
Towards Evaluating Multipath TCP using Linux Tools and Utilities
Multipath TCP (MPTCP) is a transport protocol standardized in RFC 8684 and is an ongoing research topic at IETF. The implementation of MPTCP is under active development in the Linux network community. Performing experiments with MPTCP using the Linux network stack requires installing external tools and utilities. This paper analyzes the tools and utilities that are popularly used for MPTCP experimentation using the Linux network stack. Subsequently, using these tools and utilities, we perform a deep-dive analysis of the implementation of the connection establishment phase of MPTCP in the Linux kernel by conducting experiments and comparing whether this implementation is in line with the RFC. We leverage Linux network namespaces to perform experiments because they provide a lightweight alternative to setting up physical testbeds or virtual machines. Moreover, it makes our experiments easily reproducible across different Linux platforms. Our experiments show that the Linux implementation of the connection establishment phase of MPTCP closely follows RFC 8684.
- 4 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 305-310
Open AccessTowards Evaluating Multipath TCP using Linux Tools and Utilities
Multipath TCP (MPTCP) is a transport protocol standardized in RFC 8684 and is an ongoing research topic at IETF. The implementation of MPTCP is under active development in the Linux network community. Performing experiments with MPTCP using the Linux network stack requires installing external tools and utilities. This paper analyzes the tools and utilities that are popularly used for MPTCP experimentation using the Linux network stack. Subsequently, using these tools and utilities, we perform a deep-dive analysis of the implementation of the connection establishment phase of MPTCP in the Linux kernel by conducting experiments and comparing whether this implementation is in line with the RFC. We leverage Linux network namespaces to perform experiments because they provide a lightweight alternative to setting up physical testbeds or virtual machines. Moreover, it makes our experiments easily reproducible across different Linux platforms. Our experiments show that the Linux implementation of the connection establishment phase of MPTCP closely follows RFC 8684.
- 14 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Group based Publisher-Subscriber Communication Primitives for ndnSIM
Named Data Networking (NDN), an information centric network architecture, aims to provide an efficient and scalable alternative for content distribution. Modern Internet applications have more emphasis on data, and are less concerned about the location from where data is retrieved. NDN's communication primitives being strictly pull based help in bringing this focus shift from location of data to the data itself. A concern for NDN is to enable the support of other popular communication primitives, such as the Publisher-Subscriber (Pub-Sub) model, seamlessly. The Pub-Sub model is well suited for applications that require periodic retrieval of data or event triggered data, such as in Industrial Automation Control Systems (IACS). This paper presents the design and development of a model to support the group based Pub-Sub communication primitives in ndnSIM, a popular ns-3 based network simulator for NDN. The functionality of the proposed model is tested by developing an end-to-end simulation environment in ndnSIM that is representative of the popular use cases of Pub-Sub communication primitives.
- 14 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Group based Publisher-Subscriber Communication Primitives for ndnSIM
Named Data Networking (NDN), an information centric network architecture, aims to provide an efficient and scalable alternative for content distribution. Modern Internet applications have more emphasis on data, and are less concerned about the location from where data is retrieved. NDN's communication primitives being strictly pull based help in bringing this focus shift from location of data to the data itself. A concern for NDN is to enable the support of other popular communication primitives, such as the Publisher-Subscriber (Pub-Sub) model, seamlessly. The Pub-Sub model is well suited for applications that require periodic retrieval of data or event triggered data, such as in Industrial Automation Control Systems (IACS). This paper presents the design and development of a model to support the group based Pub-Sub communication primitives in ndnSIM, a popular ns-3 based network simulator for NDN. The functionality of the proposed model is tested by developing an end-to-end simulation environment in ndnSIM that is representative of the popular use cases of Pub-Sub communication primitives.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2340-2344
Adaptive RED for FreeBSD: Design, Implementation and Challenges
Bufferbloat problem arises due to buffering of large amounts of data in queues, owing to the large size of these queues. Bufferbloat being a relatively new phenomenon meant that earlier queue management algorithms did not specifically address this problem. Despite this issue, there is merit in analysing and evaluating old queue management algorithms which have helped alleviate the undesirable performance issues that arose due to persistently full buffers. One of the earliest and most significantly studied Active Queue Management (AQM) algorithms is Random Early Drop (RED). RED helps to keep the average size of the queues low and allow occasional bursts of packets through the queue. Once the number of packets queued crosses a minimum threshold, incoming packets are dropped with a random probability. However, the resulting average queue length is quite sensitive to the level of congestion and the RED parameter settings. Adaptive RED (ARED) solves most of the issues faced by RED with minimal changes and leaves its basic idea intact. The ARED algorithm regularly adapts the value of the maximum dropping probability and ensures that the queue length stays within the targeted range. Despite its ability to resolve the inherent problems in RED, ARED went largely unnoticed for several years, until the issue of Bufferbloat arose. Although ARED predates Bufferbloat, its fundamental design makes it an effective solution to handle Bufferbloat. This discovery led to the implementation of ARED in Linux and in network simulators like ns-3. Besides Linux, FreeBSD is one of the most popular open source operating systems. Although RED is supported in FreeBSD, ARED is not. Since ARED is one of the viable solutions to tackle Bufferbloat, this paper discusses the design and implementation of ARED in FreeBSD. We also detail the challenges faced during the implementation, and validate through real testbed experiments that our implementation in FreeBSD exhibits ARED's key characteristics.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2340-2344
Adaptive RED for FreeBSD: Design, Implementation and Challenges
Bufferbloat problem arises due to buffering of large amounts of data in queues, owing to the large size of these queues. Bufferbloat being a relatively new phenomenon meant that earlier queue management algorithms did not specifically address this problem. Despite this issue, there is merit in analysing and evaluating old queue management algorithms which have helped alleviate the undesirable performance issues that arose due to persistently full buffers. One of the earliest and most significantly studied Active Queue Management (AQM) algorithms is Random Early Drop (RED). RED helps to keep the average size of the queues low and allow occasional bursts of packets through the queue. Once the number of packets queued crosses a minimum threshold, incoming packets are dropped with a random probability. However, the resulting average queue length is quite sensitive to the level of congestion and the RED parameter settings. Adaptive RED (ARED) solves most of the issues faced by RED with minimal changes and leaves its basic idea intact. The ARED algorithm regularly adapts the value of the maximum dropping probability and ensures that the queue length stays within the targeted range. Despite its ability to resolve the inherent problems in RED, ARED went largely unnoticed for several years, until the issue of Bufferbloat arose. Although ARED predates Bufferbloat, its fundamental design makes it an effective solution to handle Bufferbloat. This discovery led to the implementation of ARED in Linux and in network simulators like ns-3. Besides Linux, FreeBSD is one of the most popular open source operating systems. Although RED is supported in FreeBSD, ARED is not. Since ARED is one of the viable solutions to tackle Bufferbloat, this paper discusses the design and implementation of ARED in FreeBSD. We also detail the challenges faced during the implementation, and validate through real testbed experiments that our implementation in FreeBSD exhibits ARED's key characteristics.