TY - GEN
T1 - Multimedia wireless link controlled sharing with class-based packet scheduling
AU - Weng, Ying
AU - Hou, Chaohuan
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2004
Y1 - 2004
N2 - Controlled sharing of the wireless link by different packet streams is critical in transporting multimedia traffic across wireless networks. Consequently, it has been treated as providing support for quality of service (QoS) in medium access control (MAC) protocols. This paper proposes a distributed class-based access scheme whose allocation policy adopts token passing packet scheduling, designed to handle efficiently different service classes of traffic in heavy load wireless networks. The traffic is divided into three classes by QoS specifications and packet characteristics, and served with asymmetric exhaustive discipline. The probability generating function based on imbedded Markov chain for this discrete-time system is derived. We employ basic queuing analysis methodologies, calculate the average buffer size of each class queue at polling instants and then apply Little's law to find the average delay. Experiments are conducted to validate the new strategy, and the performance is analyzed and evaluated. Finally, we visualize and compare how the relative variable parameters effect on system characteristics.
AB - Controlled sharing of the wireless link by different packet streams is critical in transporting multimedia traffic across wireless networks. Consequently, it has been treated as providing support for quality of service (QoS) in medium access control (MAC) protocols. This paper proposes a distributed class-based access scheme whose allocation policy adopts token passing packet scheduling, designed to handle efficiently different service classes of traffic in heavy load wireless networks. The traffic is divided into three classes by QoS specifications and packet characteristics, and served with asymmetric exhaustive discipline. The probability generating function based on imbedded Markov chain for this discrete-time system is derived. We employ basic queuing analysis methodologies, calculate the average buffer size of each class queue at polling instants and then apply Little's law to find the average delay. Experiments are conducted to validate the new strategy, and the performance is analyzed and evaluated. Finally, we visualize and compare how the relative variable parameters effect on system characteristics.
UR - http://www.scopus.com/inward/record.url?scp=3042668594&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:3042668594
SN - 0769520510
SN - 9780769520513
T3 - Proceedings - International Conference on Advanced Information Networking and Application (AINA)
SP - 236
EP - 241
BT - Proceedings - 18th International Conference on Advanced Information Networking and Applications, AINA 2004 Volume 1 (Regional Papers)
A2 - Barolli, L.
T2 - Proceedings - 18th International Conference on Advanced Information Networking and Applications, AINA 2004
Y2 - 29 March 2004 through 31 March 2004
ER -