Analysis of fair scheduling and connection admission control in differentiated services wireless networks
暂无分享,去创建一个
[1] L. B. Milstein,et al. On the accuracy of a first-order Markov model for data transmission on fading channels , 1995, Proceedings of ICUPC '95 - 4th IEEE International Conference on Universal Personal Communications.
[2] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.
[3] Jon W. Mark,et al. Resource allocation in wireless networks based on joint packet/call levels QoS constraints , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).
[4] Zheng Wang,et al. An Architecture for Differentiated Services , 1998, RFC.
[5] David L. Black,et al. An Architecture for Differentiated Service , 1998 .
[6] Edward W. Knightly,et al. Opportunistic fair scheduling over multiple wireless channels , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[7] Ion Stoica,et al. Packet fair queueing algorithms for wireless networks with location-dependent errors , 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.
[8] R. Srikant,et al. Fair scheduling in wireless packet networks , 1999, TNET.
[9] Romano Fantacci,et al. Performance evaluation of polling systems for wireless local communication networks , 2000, IEEE Trans. Veh. Technol..