Debashis Roy

Mr. Debashis Roy

Microsoft, Redmond, Washington, USA
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
6 November 2007
Verified
Book Chapter
Closed access
PDF file
JLJianguo Lu
Jianguo Lu
YYYijun Yu
Yijun Yu
DRDebashis Roy
Debashis Roy
DSDeepa Saha
Deepa Saha

1 May 2010
Verified
Conference Paper
Closed access
ABA. Bari
A. Bari
YCY. Chen
Y. Chen
DRDebashis Roy
Debashis Roy
AJA. Jaekel
A. Jaekel
SBS. Bandyopadhyay
S. Bandyopadhyay
In hierarchical sensor networks, higher powered relay nodes can be deployed to act as cluster heads. The lifetime of such a network is primarily determined by the lifetime of the relay nodes. Recently, it has been shown that the use of a Mobile Data Collector (MDC), which moves through the sensor network to collect data, can improve the performance of the network in a number of ways. We propose a model for hierarchical networks using a MDC, where the MDC travels along a pre-determined trajectory at a known speed, and collects data from each relay node. In this model, the relay nodes need to buffer their data until they can be uploaded to the MDC. To reduce the buffer size, as well as the delay for the data communication, it is desirable to minimize the length of the trajectory. In our model the MDC "visits" a relay node, to collect data, at any point within the permitted transmission distance of the relay node. There is a trade-off in this approach, as a large permitted transmission distance means that the relay node will expend higher energy, and hence, have a reduced lifetime. In this paper, we present two formulations for computing the minimal trajectory of the MDC. Our approaches allow us to control the transmission distances of the relay nodes and hence, achieve the lifetime objectives. Minimizing the length of the trajectory reduces the buffer size requirements at each node as well as the delay between successive visits.

1 February 2011 in Pervasive and Mobile Computing
Verified
Journal Article
Closed access
ABAtaul Bari
Ataul Bari
YCYing Chen
Ying Chen
DRDebashis Roy
Debashis Roy
AJArunita Jaekel
Arunita Jaekel
SBSubir Bandyopadhyay
Subir Bandyopadhyay

5 October 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
DRDebashis Roy
Debashis Roy
SMSankalp Mulye
Sankalp Mulye
NGNarasimhan Govindarajan
Narasimhan Govindarajan
JRJay Rajeevalochanam
Jay Rajeevalochanam
Software increasingly spans a continuum of independently owned services and heterogeneous stores across regions, and data residency rules force live data to move between regions without interrupting service. A single logical entity spans many services, and no component knows its full dependency graph in advance. An early design that centralized this knowledge reported success while silently omitting data it had never been taught about—a failure invisible to conventional health metrics. We rebuilt it into a contract-based migration platform for a messaging service, resting on three ideas: a stable five-API service contract that keeps domain knowledge with each service; typed dependency semantics that make declarations executable policy; and runtime graph expansion that guarantees completeness without knowing the full graph. It ran 6–10 million migrations per day at 99.9% first-attempt success, growing from 7 to 15 services with no contract change.

26 October 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
DRDebashis Roy
Debashis Roy
SMSankalp Mulye
Sankalp Mulye
NGNarasimhan Govindarajan
Narasimhan Govindarajan
JRJay Rajeevalochanam
Jay Rajeevalochanam
Cross-region migration is difficult when one logical resource spans independently owned services and heterogeneous storage backends. Concurrent mutations and stale routing state complicate complete-ness and write authority at cutover. We present a four-phase protocol combining selective operation fencing, content-stripped deletion tombstones, routing-embedded locks, and atomic cutover. His-torical copy permits mutations; final synchronization temporarily fences them. Service-confirmed enforcement closes the mutation boundary, primary-write-replica routing reads expose current lock state, and token- and version-checked cutover transfers authority. We give correctness arguments under explicit service contracts. Production summaries from a messaging platform report 6–10 million conversation migrations per day over 30 days and 99.9% first-attempt success. Successful attempts had write-lock intervals of 13 s at the median and 19 s at the 99th percentile, measured from request issuance through cutover. Approximately 1000 lock-rejected message sends subsequently succeeded according to service-side telemetry; this does not establish absence of user-visible errors or delay. Count and sampled-content validation detected some schema-related contract drift before cutover. An analytical comparison illustrates fencing-window costs under fixed observed durations, without benchmarking alternative implementations. The contribution integrates established mechanisms with production observations and explicit consistency and availability boundaries.

28 July 2026 in International Journal of Computer Applications
Verified
Journal Article
Closed access
DRDebashis Roy
Debashis Roy