Competitive On-Line Switching Policies
暂无分享,去创建一个
Joseph Naor | Amotz Bar-Noy | Ari Freund | Shimon Landa | A. Bar-Noy | J. Naor | Ari Freund | Shimon Landa
[1] Marek Chrobak,et al. The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts , 2001, ICALP.
[2] Boaz Patt-Shamir,et al. Buffer Overflow Management in QoS Switches , 2004, SIAM J. Comput..
[3] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[4] Albert G. Greenberg,et al. How fair is fair queuing , 1992, JACM.
[5] Yossi Azar. On-line Load Balancing , 1996, Online Algorithms.
[6] Galen H. Sasaki. Input Buffer Requirements for Round Robin Polling Systems , 1993, Perform. Evaluation.
[7] Israel Cidon,et al. Real-time packet switching: a performance analysis , 1988, IEEE J. Sel. Areas Commun..
[8] Roch Guérin,et al. Buffer Size Requirements Under Longest Queue First , 1993, Perform. Evaluation.
[9] Michael J. Franklin,et al. Scheduling for large-scale on-demand data broadcasting , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[10] Boaz Patt-Shamir,et al. Buffer overflow management in QoS switches , 2001, STOC '01.
[11] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[12] Moshe Sidi,et al. An optimal service policy for buffer systems , 1995, JACM.
[13] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.