On the Role of Queue Length Information in Network Control
We study the role played by queue length information in the operation of flow control and server allocation policies. We first consider a simple model of a single server queue with congestion-based flow control. The input rate at any instant is decided by a flow control policy, based on the queue oc...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2012
|
| Online Access: | http://hdl.handle.net/1721.1/69886 https://orcid.org/0000-0002-6108-0222 https://orcid.org/0000-0001-8238-8130 |
| _version_ | 1826191722756964352 |
|---|---|
| author | Jagannathan, Krishna Prasanna Modiano, Eytan H. Zheng, Lizhong |
| author2 | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
| author_facet | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Jagannathan, Krishna Prasanna Modiano, Eytan H. Zheng, Lizhong |
| author_sort | Jagannathan, Krishna Prasanna |
| collection | MIT |
| description | We study the role played by queue length information in the operation of flow control and server allocation policies. We first consider a simple model of a single server queue with congestion-based flow control. The input rate at any instant is decided by a flow control policy, based on the queue occupancy. We identify a simple “two-threshold” control policy, which achieves the best possible exponential scaling for the queue congestion probability, for any rate of control. We show that when the control channel is reliable, the control rate needed to ensure the optimal decay exponent for the congestion probability can be made arbitrarily small. However, if control channel erasures occur probabilistically, we show the existence of a critical erasure probability threshold beyond which the congestion probability undergoes a drastic increase due to the frequent loss of control packets. We also determine the optimal amount of error protection to apply to the control signals by using a simple bandwidth sharing model. Finally, we show that the queue length based server allocation problem can also be treated using this framework and that the results obtained for the flow control setting can also be applied to the server allocation case. |
| first_indexed | 2024-09-23T09:00:42Z |
| format | Article |
| id | mit-1721.1/69886 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T09:00:42Z |
| publishDate | 2012 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/698862022-09-26T09:47:25Z On the Role of Queue Length Information in Network Control Jagannathan, Krishna Prasanna Modiano, Eytan H. Zheng, Lizhong Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Modiano, Eytan H. Modiano, Eytan H. Jagannathan, Krishna Prasanna Zheng, Lizhong We study the role played by queue length information in the operation of flow control and server allocation policies. We first consider a simple model of a single server queue with congestion-based flow control. The input rate at any instant is decided by a flow control policy, based on the queue occupancy. We identify a simple “two-threshold” control policy, which achieves the best possible exponential scaling for the queue congestion probability, for any rate of control. We show that when the control channel is reliable, the control rate needed to ensure the optimal decay exponent for the congestion probability can be made arbitrarily small. However, if control channel erasures occur probabilistically, we show the existence of a critical erasure probability threshold beyond which the congestion probability undergoes a drastic increase due to the frequent loss of control packets. We also determine the optimal amount of error protection to apply to the control signals by using a simple bandwidth sharing model. Finally, we show that the queue length based server allocation problem can also be treated using this framework and that the results obtained for the flow control setting can also be applied to the server allocation case. 2012-03-28T20:30:52Z 2012-03-28T20:30:52Z 2011-08 2010-10 Article http://purl.org/eprint/type/JournalArticle 0018-9448 INSPEC Accession Number: 12206749 http://hdl.handle.net/1721.1/69886 Jagannathan, Krishna, Eytan Modiano, and Lizhong Zheng. “On the Role of Queue Length Information in Network Control.” IEEE Transactions on Information Theory 57.9 (2011): 5884–5896. https://orcid.org/0000-0002-6108-0222 https://orcid.org/0000-0001-8238-8130 en_US http://dx.doi.org/10.1109/tit.2011.2162155 IEEE Transactions on Information Theory Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers MIT web domain |
| spellingShingle | Jagannathan, Krishna Prasanna Modiano, Eytan H. Zheng, Lizhong On the Role of Queue Length Information in Network Control |
| title | On the Role of Queue Length Information in Network Control |
| title_full | On the Role of Queue Length Information in Network Control |
| title_fullStr | On the Role of Queue Length Information in Network Control |
| title_full_unstemmed | On the Role of Queue Length Information in Network Control |
| title_short | On the Role of Queue Length Information in Network Control |
| title_sort | on the role of queue length information in network control |
| url | http://hdl.handle.net/1721.1/69886 https://orcid.org/0000-0002-6108-0222 https://orcid.org/0000-0001-8238-8130 |
| work_keys_str_mv | AT jagannathankrishnaprasanna ontheroleofqueuelengthinformationinnetworkcontrol AT modianoeytanh ontheroleofqueuelengthinformationinnetworkcontrol AT zhenglizhong ontheroleofqueuelengthinformationinnetworkcontrol |