Prithwish Basu

Prithwish Basu

Auto-generated profile, based on publicly available information

Prithwish Basu

Raytheon BBN Technologies, Cambridge, MA, USA

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
1 April 2011
Verified
Conference Paper
Closed access
SSSalvatore Scellato
Salvatore Scellato
ILIlias Leontiadis
Ilias Leontiadis
CMCecilia Mascolo
Cecilia Mascolo
PBPrithwish Basu
Prithwish Basu
MZMurtaza Zafer
Murtaza Zafer
The application of complex network theory to communication systems has led to several important results. Nonetheless, previous research has often neglected to take into account their temporal properties, which in many real scenarios play a pivotal role. Mainly because of mobility, transmission delays or protocol design, a communication network should not be considered only as a static entity. At the same time, network robustness has come extensively under scrutiny. Understanding whether networked systems can undergo structural damage and yet perform efficiently is crucial to both their protection against failures and to the design of new applications. In spite of this, it is still unclear what type of resilience we may expect in a network that continuously changes over time. In this work we present the first attempt to define the concept of temporal network robustness: we describe a measure of network robustness for time-varying networks and we show how it performs on different classes of random models by means of analytical and numerical evaluation. Particularly, we show how static approximation can wrongly indicate high robustness of fragile networks when adopted in mobile time-varying networks, while a temporal approach captures more accurately the system performance.

1 October 2011
Verified
Conference Paper
Closed access
WRWei Ren
Wei Ren
QZQ. Zhao
Q. Zhao
RRR. Ramanathan
R. Ramanathan
JGJ. Gao
J. Gao
ASA. Swami
A. Swami
PBP. Basu
P. Basu
We consider the broadcasting problem in multi-radio multi-channel ad hoc networks. The objective is to minimize the total broadcast cost, where the cost can be of any form that is summable over all the transmissions (e.g., the transmission and reception energy, the price for accessing a specific channel). Our technical approach is based on a simplicial complex model that allows us to capture the broadcast nature of the wireless medium and the heterogeneity across radios and channels. Specifically, we show that broadcasting in multi-radio multi-channel ad hoc networks can be formulated as a minimum spanning problem in simplicial complexes. We establish the NP-completeness of the minimum spanning problem and propose two approximation algorithms with order-optimal performance guarantee. These two algorithms offer tradeoffs between performance and time complexity. In a broader context, this work appears to be the first that studies the minimum spanning problem in simplicial complexes and weighted minimum connected set cover problem.

3 June 2024
Verified
Conference Paper
Open access
PBPrithwish Basu
Prithwish Basu
LZLiangyu Zhao
Liangyu Zhao
JFJason Fantl
Jason Fantl
SPSiddharth Pal
Siddharth Pal
AKArvind Krishnamurthy
Arvind Krishnamurthy
JKJoud Khoury
Joud Khoury
The all-to-all collective communications primitive is widely used in machine learning (ML) and high performance computing (HPC) workloads, and optimizing its performance is of interest to both ML and HPC communities. All-to-all is a particularly challenging workload that can severely strain the underlying interconnect bandwidth at scale. This paper takes a holistic approach to optimize the performance of all-to-all collective communications on supercomputer-scale direct-connect interconnects. We address several algorithmic and practical challenges in developing efficient and bandwidth-optimal all-to-all schedules for any topology and lowering the schedules to various runtimes and interconnect technologies. We also propose a novel topology that delivers near-optimal all-to-all performance.

19 November 2025 in Physical Review Letters
Verified
Journal Article
Closed access
SGSaikat Guha
Saikat Guha
TJTiju Cherian John
Tiju Cherian John
ZGZihao Gong
Zihao Gong
PBPrithwish Basu
Prithwish Basu
Augmenting a train of bright phase-modulated laser-light pulses of a coherent communications system with infinitesimally small quantum photons per pulse-entangled across several time bins-prepared by splitting squeezed light in a temporal-mode interferometer can dramatically enhance a homodyne receiver's ability to detect a sudden change in the channel loss, by up to a factor that is the inverse of the pre-change loss, without affecting the communications rate. We discuss the quantum limit of quickest change detection, and the problem of joint communications and change detection that our Letter opens up.

26 November 2022 in ACM Transactions on Modeling and Performance Evaluation of Computing Systems
Verified
Journal Article
Open access
NPNitish K. Panigrahy
Nitish K. Panigrahy
TVThirupathaiah Vasantam
Thirupathaiah Vasantam
PBPrithwish Basu
Prithwish Basu
DTDon Towsley
Don Towsley
ASAnanthram Swami
Ananthram Swami
KLKin K. Leung
Kin K. Leung
Distributed load balancing is the act of allocating jobs among a set of servers as evenly as possible. The static interpretation of distributed load balancing leads to formulating the load-balancing problem as a classical balls-and-bins problem with jobs (balls) never leaving the system and accumulating at the servers (bins). While most of the previous work in the static setting focus on studying the maximum number of jobs allocated to a server or maximum load , little importance has been given to the implementation cost , or the cost of moving a job/data to/from its allocated server, for such policies. This article designs and evaluates server proximity aware static load-balancing policies with a goal to reduce the implementation cost . We consider a class of proximity aware Power of Two (POT) choice-based assignment policies for allocating jobs to servers, where both jobs and servers are located on a two-dimensional Euclidean plane. In this framework, we investigate the tradeoff between the implementation cost and load-balancing performance of different allocation policies. To this end, we first design and evaluate a Spatial Power of two (sPOT) policy in which each job is allocated to the least loaded server among its two geographically nearest servers. We provide expressions for the lower bound on the asymptotic expected maximum load on the servers and prove that sPOT does not achieve classical POT load-balancing benefits. However, experimental results suggest the efficacy of sPOT with respect to expected implementation cost. We also propose two non-uniform server sampling-based POT policies that achieve the best of both implementation cost and load-balancing performance. We then extend our analysis to the case where servers are interconnected as an n -vertex graph G(S, E) . We assume each job arrives at one of the servers, u, chosen uniformly at random from the vertex set S. We then assign each job to the server with minimum load among servers u and v where v is chosen according to one of the following two policies: (i) Unif-POT( k ): Sample a server v uniformly at random from k -hop neighborhood of u; (ii) InvSq-POT( k ): Sample a server v from k -hop neighborhood of u with probability proportional to the inverse square of the distance between u and v . An extensive simulation over a wide range of topologies validates the efficacy of both the policies. Our simulation results show that both policies consistently produce a load distribution that is much similar to that of a classical POT. Depending on topology, we observe the total variation distance to be of the order of 0.002–0.08 for both the policies while achieving a 8%–99% decrease in implementation cost as compared to the classical POT.

17 April 2021 in Queueing Systems
Verified
Journal Article
Closed access
PDF file
PNPhilippe Nain
Philippe Nain
NPNitish K. Panigrahy
Nitish K. Panigrahy
PBPrithwish Basu
Prithwish Basu
DTDon Towsley
Don Towsley