Throughput-competitive on-line routing
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[2] F. Kelly. Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.
[3] Israel Cidon,et al. Paris: An approach to integrated high‐speed private networks , 1988 .
[4] Baruch Awerbuch,et al. Distributed control for PARIS , 1990, PODC '90.
[5] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[6] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[7] Juan A. Garay,et al. Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[8] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[9] Yossi Azar,et al. On-line load balancing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[10] Yossi Azar,et al. On-line Load Balancing (Extended Abstract) , 1992, FOCS 1992.
[11] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.
[12] Bala Kalyanasundaram,et al. On-Line Load Balancing of Temporary Tasks , 1993, J. Algorithms.
[13] Y. Mansour,et al. Eecient On-line Call Control Algorithms , 1993 .
[14] Yossi Azar,et al. Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.
[15] Fillia Makedon,et al. Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..
[16] M. Yung,et al. E cient On-Line Call Control , 2008 .