<p dir="ltr">Network models are essential for representing a myriad of real-world problems. Two of the most important categories of networks are centralized and distributed networks. In this thesis, we investigate the efficient resource allocation for one centralized communication network and two distributed epidemic networks.</p><p dir="ltr">In Chapter 2, we study three proposed centralized coded caching schemes with uncoded pre-fetching for scenarios where end users are grouped into classes with different file demand sets. We provide a lower bound for the transmission rate for the system with heterogeneous user profiles. Then the transmission rates of the three schemes are compared with the lower bound to evaluate their gap to optimality, and also compared with each other to show that each scheme can outperform the other two when certain conditions are met. Finally, we propose a cache distribution method that results in a minimal peak rate and a minimal average rate for one of the schemes when the users’ storage is relatively small compared with the size of the library.</p><p dir="ltr">In Chapter 3, we examine a discrete-time networked SIR (susceptible-infected-recovered) epidemic model, where the infection, graph, and recovery parameters may be time-varying. We propose a stochastic framework to estimate the system states from observed testing data and provide an analytic expression for the error of the estimation algorithm. We validate some of our assumptions for the stochastic framework with real COVID-19 testing data. We identify the system parameters with the system states from our estimation algorithm. Employing the estimated system states, we provide a novel distributed eradication strategy that guarantees at least exponential convergence to the set of healthy states. We illustrate the results via simulations over northern Indiana, USA.</p><p dir="ltr">In Chapter 4, we propose a novel discrete-time multi-virus SIR model that captures the spread of competing SIR epidemics over a population network. First, we provide a sufficient condition for the infection level of all the viruses over the networked model to converge to zero in exponential time. Second, we propose an observation model which captures the summation of all the viruses’ infection levels in each node, which represents the individuals who are infected by different viruses but share similar symptoms. We present a sufficient condition for the model to be strongly locally observable. We propose a distributed Luenberger observer for the system state estimation. We demonstrate how to calculate the observer gain for the estimator and prove that the estimation error of our proposed estimator converges to zero asymptotically with the observer gain found. We also propose a distributed feedback controller which guarantees that all viruses are eradicated at an exponential rate. We then show via simulations that the estimation error of the Luenberger observer converges to zero before the viruses die out.</p><p dir="ltr">We conclude in Chapter 5, where we summarize the findings of this thesis and introduce several challenging open research questions that arise from its results. These questions encompass a range of topics, including the design of optimal testing strategies for large populations, the investigation of estimation techniques in the presence of noisy measurement models, the extension of the SIR epidemic model to more complex models like SEIR and SAIR, and the exploration of efficient vaccine allocation schemes.</p>
| Identifer | oai:union.ndltd.org:purdue.edu/oai:figshare.com:article/24582681 |
| Date | 21 November 2023 |
| Creators | Ciyuan Zhang (17409372) |
| Source Sets | Purdue University |
| Detected Language | English |
| Type | Text, Thesis |
| Rights | CC BY 4.0 |
| Relation | https://figshare.com/articles/thesis/EFFICIENT_RESOURCE_ALLOCATION_IN_NETWORKS_FROM_CENTRALIZED_TO_DISTRIBUTED_APPROACHES/24582681 |
Page generated in 0.002 seconds