Resource Sharing Networks: Overview and an Open Problem
| Autor: | J. Michael Harrison, Yang Yang, Chinmoy Mandayam, Devavrat Shah |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Statistics and Probability
hierarchical business.industry Management science Computer science Bandwidth sharing models Open problem Distributed computing entrainment Management Science and Operations Research resource sharing networks Telecommunications network Shared resource heavy traffic analysis Modeling and Simulation The Internet Statistics Probability and Uncertainty Heavy traffic greedy ideal performance business dynamic resource allocation Dynamic resource |
| Zdroj: | Stoch. Syst. 4, no. 2 (2014), 524-555 |
| ISSN: | 1946-5238 |
| DOI: | 10.1287/13-ssy130 |
| Popis: | This paper provides an overview of the resource sharing networks introduced by Massoulié and Roberts [20] to model the dynamic behavior of Internet flows. Striving to separate the model class from the applications that motivated its development, we assume no prior knowledge of communication networks. The paper also presents an open problem, along with simulation results, a formal analysis, and a selective literature review that provide context and motivation. The open problem is to devise a policy for dynamic resource allocation that achieves what we call hierarchical greedy ideal (HGI) performance in the heavy traffic limit. The existence of such a policy is suggested by formal analysis of an approximating Brownian control problem, assuming that there is “local traffic” on each processing resource. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|