Optimal anticipative congestion control of flows with time-varying input stream-Reference-Cited by-同舟云学术

Optimal anticipative congestion control of flows with time-varying input stream

Published:2012-02 Issue:2 Volume:69 Page:86-101
ISSN:0166-5316
Container-title:Performance Evaluation
language:en
Short-container-title:Performance Evaluation

Author:

Jacko Peter,Sansò Brunilde

Publisher

Elsevier BV

Subject

Computer Networks and Communications,Hardware and Architecture,Modelling and Simulation,Software

Reference31 articles.

1. Promoting the use of end-to-end congestion control in the Internet;Floyd;IEEE/ACM Transactions on Networking,1999

2. D. Wischik, How to mark fairly, Manuscript, 1999.

3. Fair end-to-end window-based congestion control;Mo;IEEE/ACM Transactions on Networking,2000

4. E. Altman, K. Avrachenkov, A. Garnaev, Generalized α-fair resource allocation in wireless networks, in: Proceedings of the 47th IEEE Conference on Decision and Control, Cancun, Mexico, pp. 2414–2419.

5. Restless bandits: activity allocation in a changing world;Whittle;Journal of Applied Probability,1988

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. RMAB in Opportunistic Scheduling;Restless Multi-Armed Bandit in Opportunistic Scheduling;2021

2. When to Switch? Index Policies for Resource Scheduling in Emergency Response;Production and Operations Management;2019-10-13

3. INDEXABILITY AND OPTIMAL INDEX POLICIES FOR A CLASS OF REINITIALISING RESTLESS BANDITS;Probability in the Engineering and Informational Sciences;2015-10-16

4. Fair Allocation of Throughput Under Harsh Operational Conditions;Multiple Access Communications;2015

5. Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories;Operations Research;2014-06