14 citations · 17 across the 4 of their papers we have counts for
4 papers · 1 filter
Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)
Hemant Malik, Ovidiu Daescu, Ramaswamy Chandrasekaran
Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we present two algorithms to check if G can be decomposed into two edge disjoint spanning trees, and provide suc…
Lexico-minimum Replica Placement in Multitrees
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
In this work, we consider the problem of placing replicas in a data center or storage area network, represented as a digraph, so as to lexico-minimize a previously proposed reliabi…
Algorithms for Optimal Replica Placement Under Correlated Failure in Hierarchical Failure Domains
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
In data centers, data replication is the primary method used to ensure availability of customer data. To avoid correlated failure, cloud storage infrastructure providers model hier…
Algorithms for Replica Placement in High-Availability Storage
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
A new model of causal failure is presented and used to solve a novel replica placement problem in data centers. The model describes dependencies among system components as a direct…