Diman Zad Tootaghaj

Diman Zad Tootaghaj

Auto-generated profile, based on publicly available information

Diman Zad Tootaghaj

Networking and Distributed Systems Lab, Hewlett Packard Enterprise Labs, Milpitas, CA, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
1 June 2018 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
DTDiman Zad Tootaghaj
Diman Zad Tootaghaj
NBNovella Bartolini
Novella Bartolini
HKHana Khamfroush
Hana Khamfroush
THTing He
Ting He
Nilanjan Ray ChaudhuriNilanjan Ray Chaudhuri
Nilanjan Ray Chaudhuri
TPThomas La Porta
Thomas La Porta
The interdependency of multiple networks makes today's infrastructures more vulnerable to failures. Prior works mainly focused on robust network design and recovery strategies after failures, given complete knowledge of failure location. Nevertheless, in real-world scenarios, the location of failures might be unknown or only partially known. In this work, we focus on cascading failures involving the power grid and its communication network with imprecision in failure assessment. We consider a model where functionality of the power grid and its failure assessment rely on the operation of a monitoring system and vice versa. We address ongoing cascading failures with a twofold approach: 1) Once a cascading failure is detected, we limit further propagation by re-dispatching generation and shedding loads, 2) We formulate a recovery plan to maximize the total amount of load served during the recovery intervention. We performed extensive simulations on real network topologies showing the effectiveness of the proposed approach in terms of number of disrupted power lines and total served load.

8 November 2018 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
DTDiman Zad Tootaghaj
Diman Zad Tootaghaj
NBNovella Bartolini
Novella Bartolini
HKHana Khamfroush
Hana Khamfroush
TPThomas La Porta
Thomas La Porta

1 September 2017
Verified
Conference Paper
Closed access
DTDiman Zad Tootaghaj
Diman Zad Tootaghaj
NBNovella Bartolini
Novella Bartolini
HKHana Khamfroush
Hana Khamfroush
TPThomas La Porta
Thomas La Porta
Vulnerability due to inter-connectivity of multiple networks has been observed in many complex networks. Previous works mainly focused on robust network design and on recovery strategies after sporadic or massive failures in the case of complete knowledge of failure location. We focus on cascading failures involving the power grid and its communication network with consequent imprecision in damage assessment. We tackle the problem of mitigating the ongoing cascading failure and providing a recovery strategy. We propose a failure mitigation strategy in two steps: 1) Once a cascading failure is detected, we limit further propagation by re-distributing the generator and load's power. 2) We formulate a recovery plan to maximize the total amount of power delivered to the demand loads during the recovery intervention. Our approach to cope with insufficient knowledge of damage locations is based on the use of a new algorithm to determine consistent failure sets (CFS). We show that, given knowledge of the system state before the disruption, the CFS algorithm can find all consistent sets of unknown failures in polynomial time provided that, each connected component of the disrupted graph has at least one line whose failure status is known to the controller.

27 August 2025
Verified
Conference Paper
Open access
SQShixiong Qi
Shixiong Qi
SZSongyu Zhang
Songyu Zhang
KRK. K. Ramakrishnan
K. K. Ramakrishnan
DTDiman Zad Tootaghaj
Diman Zad Tootaghaj
HSHardik Soni
Hardik Soni
PSPuneet Sharma
Puneet Sharma

5 July 2026
Verified
Conference Paper
Open access
SLSuyeon Lee
Suyeon Lee
KDKhaled Diab
Khaled Diab
DTDiman Zad Tootaghaj
Diman Zad Tootaghaj
LCLianjie Cao
Lianjie Cao
PSPuneet Sharma
Puneet Sharma
AGAda Gavrilovska
Ada Gavrilovska

26 September 2016 in arXiv
Verified
Preprint
Open access
PDF file
DTDiman Zad Tootaghaj
Diman Zad Tootaghaj
FFFarshid Farhat
Farshid Farhat
Parallel programming is emerging fast and intensive applications need more resources, so there is a huge demand for on-chip multiprocessors. Accessing L1 caches beside the cores are the fastest after registers but the size of private caches cannot increase because of design, cost and technology limits. Then split I-cache and D-cache are used with shared LLC (last level cache). For a unified shared LLC, bus interface is not scalable, and it seems that distributed shared LLC (DSLLC) is a better choice. Most of papers assume a distributed shared LLC beside each core in on-chip network. Many works assume that DSLLCs are placed in all cores; however, we will show that this design ignores the effect of traffic congestion in on-chip network. In fact, our work focuses on optimal placement of cores, DSLLCs and even memory controllers to minimize the expected latency based on traffic load in a mesh on-chip network with fixed number of cores and total cache capacity. We try to do some analytical modeling deriving intended cost function and then optimize the mean delay of the on-chip network communication. This work is supposed to be verified using some traffic patterns that are run on CSIM simulator.