Seamless application execution in mobile cloud computing: Motivation, taxonomy, and open challenges

E Ahmed, A Gani, MK Khan, R Buyya… - Journal of Network and …, 2015 - Elsevier
Seamless application execution is vital for the usability of various delay-sensitive mobile
cloud applications. However, the resource-intensive migration process and intrinsic …

A statistical approach to background subtraction for surveillance systems

N Ohta - Proceedings Eighth IEEE International Conference on …, 2001 - ieeexplore.ieee.org
Background subtraction is a commonly used process in surveillance systems. One difficult
problem when using the process is maintaining a correct background image against …

Rack-aware regenerating codes for data centers

H Hou, PPC Lee, KW Shum… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Erasure coding is widely used for massive storage in data centers to achieve high fault
tolerance and low storage redundancy. Since the cross-rack communication cost is often …

The storage versus repair-bandwidth trade-off for clustered storage systems

N Prakash, V Abdrashitov… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
We study a generalization of the setting of regenerating codes, motivated by applications to
storage systems consisting of clusters of storage nodes. There are n clusters in total, with m …

Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model

Z Chen, A Barg - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
The paper is devoted to the problem of erasure coding in distributed storage. We consider a
model of storage that assumes that nodes are organized into equally sized groups, called …

Double regenerating codes for hierarchical data centers

Y Hu, PPC Lee, X Zhang - 2016 IEEE International Symposium …, 2016 - ieeexplore.ieee.org
Data centers increasingly adopt erasure coding to ensure fault-tolerant storage with low
redundancy, yet the hierarchical nature of data centers incurs substantial oversubscribed …

[图书][B] Towards a future internet architecture

T Zahariadis, D Papadimitriou, H Tschofenig, S Haller… - 2011 - library.oapen.org
In the near future, the high volume of content together with new emerging and mission
critical applications is expected to stress the Internet to such a degree that it will possibly not …

Irregular fractional repetition code optimization for heterogeneous cloud storage

Q Yu, CW Sung, TH Chan - IEEE Journal on Selected Areas in …, 2014 - ieeexplore.ieee.org
This paper presents a flexible irregular model for heterogeneous cloud storage systems and
investigates how the cost of repairing failed nodes can be minimized. The fractional …

Heterogeneity-aware data regeneration in distributed storage systems

Y Wang, D Wei, X Yin, X Wang - IEEE INFOCOM 2014-IEEE …, 2014 - ieeexplore.ieee.org
Distributed storage systems provide large-scale reliable data storage services by spreading
redundancy across a large group of storage nodes. In such big systems, node failures take …

Rack-aware minimum-storage regenerating codes with optimal access

J Wang, Z Chen - arXiv preprint arXiv:2304.08747, 2023 - arxiv.org
We derive a lower bound on the amount of information accessed to repair failed nodes
within a single rack from any number of helper racks in the rack-aware storage model that …