Text

theses

Future Internet designs call for increased security, performance reliability, social content
distribution, mobility and distributed scalable resource allocation. The overarching goal
of the research presented in this thesis is to use game theoretical approaches for the
design of new networking paradigms for the future Internet in order to have better
performance with respect to content distribution, security and resource management.
The rst part of the thesis studies information-centric networking (ICN) which is a
new communication paradigm for future networks that replace the xed-host/server
model which has dominated today's Internet. ICN leverages in-network caching, multiparty
communication through replication, and interaction models decoupling senders
and receivers. We develop an analytical framework for distribution of popular content
in an ICN that comprises of Access ICNs, Transit ICNs and Content Providers. Using
a generalized Zipf distribution to model content popularity, we devise a game theoretic
approach to jointly determine caching and pricing strategies in such an ICN. Since the goal is to provide a network infrastructure that is better suited to content
distribution and more resilient to disruptions and security attacks, the second part
focuses on the security of content based networks and takes advantage of a classical
problem in game theory called the Colonel Blotto game (CBG){a multidimensional strategic resource allocation game to study the defense strategies against Advanced
Persistent Threat (APT) which applies multiple sophisticated methods to steal data
from the target system. We model the interaction between an APT attacker and a cloud
system defender in their allocation of the Central Processing Units (CPUs) over multiple
storage devices using Colonel Blotto Game, which considers the competition of two
players under given resource constraints over multiple battleelds. The Nash equilibria
(NEs) of the CBG-based APT defense game are derived for the case of symmetric and
asymmetric players with a dierent total number of CPUs to evaluate how the limited
CPU resources, the size of storage devices and the number of storage devices impact
the expected data protection level of the cloud storage system. The increasing number of mobile users and services show the importance of edge
wireless networks for connectivity and data transmission in future Internet. So, another
major challenge for designing the future Internet are Radio Resource Management
(RRM) and the task of allocating the scarce resources such as bandwidth in edge
wireless networks. The static traditional approaches limit the usage and result in poor
utilization and many spectrum holes. To overcome this problem and motivated by
many real-world examples such as communication of mobile devices, localized Internet
of Things (IoT) devices, or even autonomous vehicles, and aiming to capture the
influence of spectral allocation in a competitive environment on the performance of
communication devices, the third part of this thesis is devoted to study the problem of
dynamic competitive spectrum allocation. We study the scenario of two network service
providers (NSPs) which are trying to provide service for their regional users through
spectrum bidding. We show that the dynamic process of competitive spectrum allocation
can be described as a two-level game in which the upper level is modeled as
an optimal control problem and the lower level is modeled using CBG. We adopt a
dynamic non-cooperative repeated game as the decentralized approach for the NSPs to
determine their optimal strategies for the next time slot. We also provide the optimal strategy and value function of the dynamic game using Dynamic Programming (DP).

ETD_9314

Ph.D.

Includes bibliographical references

by Seyedmohammad Hajimirsadeghi

doi:10.7282/t3-727e-rh30

ETD doctoral

The author owns the copyright to this work.