Eecient On-line Call Control Algorithms
暂无分享,去创建一个
Y. Mansour | J. Garay | M. Yung | S. Kutten | I. Gopal
[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[2] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[3] J. Turner,et al. New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.
[4] Israel Cidon,et al. Paris: An approach to integrated high‐speed private networks , 1988 .
[5] W. David Sincoskie,et al. An overview of the AURORA gigabit testbed , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[6] Juan A. Garay,et al. Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[7] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[8] Yuval Rabani,et al. On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[9] Yossi Azar,et al. Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.
[10] Amos Fiat,et al. Competitive non-preemptive call control , 1994, SODA '94.
[11] Serge A. Plotkin. Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..