Mukulika Maity

Mukulika Maity

Auto-generated profile, based on publicly available information

Mukulika Maity

Indraprastha Institute of Information Technology Delhi, India

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 March 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
BCBijoy Chand Chatterjee
Bijoy Chand Chatterjee
IAImran Ahmed
Imran Ahmed
AWAbdul Wadud
Abdul Wadud
MMMukulika Maity
Mukulika Maity
EOEiji Oki
Eiji Oki
Signal transmission using counter-propagation nowadays is adopted to enhance resource utilization in spectrally-spatially elastic optical networks (SS-EONs), where inter-mode and inter-core crosstalks always degrade signal quality and become bottlenecks for high transport capacity. In this paper, we propose BPRIA for the first time, a Bi-Partitioning-based crosstalk-avoided Resource Identification and Allocation scheme in SS-EONs to enhance resource utilization while suppressing both inter-mode and inter-core crosstalks. We introduce a bi-partitioning optimization problem with vertex elimination to maximize the number of non-adjacent cores and modes in each partition of the bipartite graph; two distinct sets of cores and modes are used in a counter-propagation manner for lightpath allocation. The optimization problem is formulated as an integer linear programming (ILP) problem, and we prove that the optimization problem is NP-complete. An algorithm for core-mode-spectrum allocation is developed considering two distinct sets of cores and modes obtained by ILP to serve lightpath requests while avoiding inter-mode and inter-core crosstalks. For dynamic scenarios, we present core-mode-spectrum allocation. Numerical results reveal that the blocking probability is reduced by BPRIA in SS-EONs, and it enhances traffic admissibility in the network.

13 November 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
IAImran Ahmed
Imran Ahmed
RRRoshan Kumar Rai
Roshan Kumar Rai
MMMukulika Maity
Mukulika Maity
EOEiji Oki
Eiji Oki
BCBijoy Chand Chatterjee
Bijoy Chand Chatterjee
A well-known drawback of spectrally-spatially elastic optical networks (SS-EONs) is crosstalk, which increases blocking probability; evaluating blocking probability analytically is challenging due to additional constraints. Not surprisingly, all the existing studies at this time mainly use simulation-based techniques to quantify blocking probabilities in multi-core and multi-mode fibers-based SS-EONs. This paper proposes AnalyticalBP, an exact analytical continuous-time Markov chain model for blocking probabilities considering the crosstalk-avoided approach in SS-EONs. AnalyticalBP generates all the feasible states and their transitions while avoiding inter-core and inter-mode crosstalks for both single and multi-class requests. Single-class requests use the same number of slots, whereas multi-class requests adopt different numbers of slots to satisfy clients’ requirements. When AnalyticalBP is not tractable due to scalability, we introduce an iterative approximate model for a single-hop link. We further extend the single-hop model for a multi-hop network. We compare AnalyticalBP, the iterative approximate model, and Monte Carlo simulation studies for a single-hop link. Numerical results indicate that the performances obtained by AnalyticalBP and the simulation studies, in terms of blocking probabilities and resource utilization, are comparable, and the accuracy of the iterative approximate model is also acceptable.

14 October 2024
Verified
Conference Paper
Open access
MJMohit Jain
Mohit Jain
AMAnis Mishra
Anis Mishra
AWAndreas Wiese
Andreas Wiese
SDSyamantak Das
Syamantak Das
ABArani Bhattacharya
Arani Bhattacharya
MMMukulika Maity
Mukulika Maity
Smart factories have data packets with a mix of stringent and non-stringent deadlines with varying levels of importance that need to be delivered via a wireless network. However, the scheduling of packets in the wireless network is crucial to satisfy the deadlines. In this work, we propose a technique of utilizing IEEE 802.11ax, popularly known as WiFi 6, for such applications. IEEE 802.11ax has a few unique characteristics, such as specific configurations of dividing the channels into resource units (RU) for packet transmission and synchronized parallel transmissions. We model the problem of scheduling packets by assigning profit to each packet and then maximizing the sum of profits. We first show that this problem is strongly NP-Hard, and then propose an approximation algorithm with a 12-approximate algorithm. Our approximation algorithm uses a variant of local search to associate the right RU configuration to each packet and identify the duration of each parallel transmission. Finally, we extensively simulate different scenarios to show that our algorithm works better than other benchmarks.

28 February 2024 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
SCSapna Chaudhary
Sapna Chaudhary
NSNaval Kumar Shukla
Naval Kumar Shukla
PSPrince Sachdeva
Prince Sachdeva
SCSandip Chakraborty
Sandip Chakraborty
MMMukulika Maity
Mukulika Maity
With the push towards HTTP/3, most modern browsers have started supporting it. HTTP/3 uses QUIC, which runs on top of UDP. However, a few Internet middle-boxes tend to block or rate-limit UDP traffic; therefore, the browsers ensure compatibility by enabling connection racing via simultaneously initiating a TCP connection with the QUIC one. Each time the QUIC protocol suffers, connection racing is activated, and whichever protocol wins the race is further used for the application. In this paper, we study how browsers implement this connection racing mechanism and analyze its impact on applications that require a long-lived Internet connection, such as video streaming. We perform a large-scale measurement study across different browsers (Chrome/Chromium and Firefox), which helps to analyze why and how the repeated connection racing between protocols affects adaptive streaming QoE over 6013 YouTube sessions covering 5474 hours of streaming. Interestingly, we observe that YouTube QoE over an HTTP/3 supported browser suffers many times, and repeated connection racing is one of the major reasons that hinder the performance. We modified the Chromium browser source code to disable the connection racing altogether and observed that it improves the QoE for YouTube streaming over this modified browser. We then design and implement a solution that dynamically decides when to enable connection racing. We observe that it improves the QoE compared to the original browser. The analysis presented in this paper highlights the requirement of revisiting how browsers handle and switch between protocols through connection racing to ensure compatibility with middleboxes.

3 March 2025 in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
Verified
Journal Article
Open access
VSVijay Kumar Singh
Vijay Kumar Singh
AWAryan Walecha
Aryan Walecha
AGAshutosh Gera
Ashutosh Gera
RJRishabh Jay
Rishabh Jay
ABArani Bhattacharya
Arani Bhattacharya
MMMukulika Maity
Mukulika Maity
With the growing use cases of CSI-based WiFi sensing, future WiFi networks are moving towards integrating sensing and communication (ISAC) by sharing the same frequency resources between data communication and WiFi sensing. However, it is known that WiFi sensing is detrimental to WiFi communication due to its expensive use of frequency resources for collecting CSI samples, limiting its effectiveness in ISAC. To address this challenge, we propose Slim-Sense, a novel approach to resource saving while maximizing the sensing accuracy. We first demonstrate that it is possible to perform accurate WiFi sensing without using the entire bandwidth. In fact, we can obtain close to maximum accuracy while utilizing only 24.42% of the bandwidth and 25% of the antennas. Obtaining such accuracy at low bandwidth requires the selection of the antennas and bandwidth that are most relevant for sensing activities. One of Slim-Sense's highlights is using a novel approach consisting of a Sparse Group Regularizer (SGR) and Hierarchical Reinforcement learning (HRL) technique to select the minimum optimal bandwidth resources for sensing while maximizing sensing accuracy. Considering the stochastic nature of the sensing environment and the difference in requirements of different sensing applications, Slim-Sense provides an environment and application-specific bandwidth resources for sensing. We evaluate Slim-Sense with four different WiFi CSI datasets, each varying in sensing environment and application, including one we collected in 46 different environmental settings. The experimental evaluation shows that Slim-Sense saves up to 92.9% resources while incurring < 5% reduction in sensing accuracy compared to using entire spectrum resources. We show that Slim-Sense is generalized to different environments and sensing models. Compared to the state-of-art solution, Slim-Sense outperforms and achieves a maximum improvement of 28.75% in resource-saving and 42.18% in sensing accuracy.

31 March 2025
Verified
Conference Paper
Open access
SCShubham Chaudhary
Shubham Chaudhary
NMNavneet Mishra
Navneet Mishra
KGKeshav Gambhir
Keshav Gambhir
TRTanmay Rajore
Tanmay Rajore
ABArani Bhattacharya
Arani Bhattacharya
MMMukulika Maity
Mukulika Maity