Mahesh Sathiamoorthy

I

Helper Node Allocation Strategies for Content Dissemination in Intermittently Connected Mobile Networks

IEEE International Conference on Sensing Communication and Networking SECON

Jan 2014

We formulate and address the fundamental problem of allocating helper nodes in disseminating multiple content in an intermittently connected mobile network. We consider and solve two variations of the problem - one in which the goal is to maximize the expected demands satisﬁed and another in which the goal is to minimize the time taken to disseminate the contents. Further, we study this problem in a game theoretic perspective and show the effect of selﬁshness on the utility of the system.

V

Dynamic Online Storage Allocation for Multi-Content Dissemination in Two-Tier Hybrid Mobile Vehicular Networks

Vehicular Network ConferenceIEEE

Nov 2013

The ﬂeet of smart mobile devices in every aspect of daily life, has been raised serious concerns about the bandwidth availability within the current cellular structure. To address such concerns in urban areas, we present a two-tier hybrid mobile net- work. The two tiers are data plane consists of store and forward routing through an intermittently connected mobile network, and the control plane consists of an always-on infrastructure- based wireless network. With the use of such structure we can avoid bandwidth limitation while still maintaining the central- ized controlling aspect in data delivery. For such a structure, we formulate and address,from a theoretical perspective, the fundamental problem of how to dynamically allocate storage i

t

XORing Elephants: Novel Erasure Codes for Big Data

th International Conference on Very Large Data Bases VLDB

Jan 2013

Xorbas is our Hadoop version that implements a new set of regenerating codes called Locally Repairable Codes (LRC). It is built on top of Facebook's Hadoop system running HDFS-RAID, and thus can support Reed Solomon and XOR codes in addition to LRCs. Abstract: Distributed storage systems for large clusters typically use replication to provide reliability. Recently, erasure codes have been used to reduce the large storage overhead of three-replicated systems. Reed-Solomon codes are the standard design choice and their high repair cost is often considered an unavoidable price to pay for high storage efficiency and high reliability. This paper shows how to overcome this limitation. We present a novel family of erasure codes that are efficientl

V

Minimum Latency Data Diffusion in Intermittently Connected Mobile Networks

Vehicular Technology Conference VTC Spring IEEE th

May 2012

We consider the problem of diffusing cached content in an intermittently connected mobile network, starting from a given initial configuration to a desirable goal state where all nodes interested in particular contents have a copy of their desired contents. The goal is to minimize the time taken for the diffusion process to terminate at a goal state. Due to bandwidth and storage constraints, whenever two nodes encounter each other, they must decide which content if any to transfer to each other. While most prior work on this topic has focused on practically realizable heuristics for this problem, we take a more formal approach. Our main contribution is to show that, assuming global state information is available, this problem can be formula

I

Distributed Storage Codes Reduce Latency in Vehicular Networks

IEEE InfocomMini

Jan 2012

We investigate the benefits of distributed storage using erasure codes for file sharing in vehicular networks through realistic trace-based simulations. We find that coding offers substantial benefits over simple replication when the file sizes are large compared to the average download bandwidth available per encounter. Our simulations, based on a large real vehicle trace from Beijing combined with a realistic radio link quality model for a IEEE 802.11p dedicated short range communication (DSRC) radio, demonstrate that coding provides significant cost reduction in vehicular networks.

Mahesh Sathiamoorthy

About

Detail

Timeline

Résumé