In a distributed storage system, code symbols are dispersed across space in nodes or
storage units as opposed to time. In settings such as that of a large data center, an important …

We consider a wireless device-to-device (D2D) network where communication is restricted
to be single-hop. Users make arbitrary requests from a finite library of files and have pre …

Wireless video is the main driver for rapid growth in cellular data traffic. Traditional methods
for network capacity increase are very costly and do not exploit the unique features of video …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

The capacity of caching networks has received considerable attention in the past few years.
The problem consists of finding the minimum rate (or load) to deliver all users' requested …

While there has been much attention paid to the applications of modeling and simulation
(M&S) by the Department of Defense (DoD) lately, little has been done to address those …

The traditional means of ensuring reliability in data storage is to store multiple copies of the
same file in different storage units. Such a replication strategy is clearly inefficient in terms of …

Fractional repetition (FR) codes is a family of codes for distributed storage systems (DSSs)
that allow for uncoded exact repairs having the minimum repair bandwidth. However, in …

Geographically distributed storage is an important method of ensuring high data availability
in cloud computing and storage systems. With the increasing demand for moving file …

We study the throughput of a network formed by one server, k" helpers" and n users. The
users may request any file from a fixed library of m files, where each file can be regarded as …