Name
Abstract | ||
|---|---|---|
The rate constraint of transmitting multiple priority classes over a time-varying service-rate channel is studied in this work. This constraint specifies the maximum data rate that can be transmitted reliably with QoS (quality of service) guarantee. In our framework, the time-varying service channel is modeled by an N-state discrete Markov process, where each Markov state is associated with a channel service rate, and the absolute priority scheduling is used to transport packets of different classes. The transmission rate constraint is derived based on effective bandwidth and capacity. To be more specific, given channel parameters and the maximum buffer size for each priority class, statistical QoS guarantees in terms of packet loss probabilities can be determined and translated to the transmission rate constraint. The derived result is verified by simulation in a time-varying wireless environment. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/ICME.2003.1220952 | ICME |
Keywords | Field | DocType |
time-varying service channel,transmission rate constraint,channel service rate,priority class,rate constraint,multiple priority class,maximum data rate,absolute priority scheduling,time-varying service-rate channel,channel parameter,wireless networks,markov processes,next generation networking,packet loss,quality of service,markov process,probability,bandwidth | Wireless network,Markov process,Computer science,Network packet,Markov chain,Packet loss,Quality of service,Computer network,Communication channel,Bandwidth (signal processing) | Conference |
ISBN | Citations | PageRank |
0-7803-7965-9 | 0 | 0.34 |
References | Authors | |
5 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| W. Kumwilaisak | 1 | 36 | 2.21 |
| Qian Zhang | 2 | 1378 | 167.73 |
| Wenwu Zhu | 3 | 4399 | 300.42 |
| C.-C. Jay Kuo | 4 | 7524 | 697.44 |
| Ya-Qin Zhang | 5 | 3684 | 320.41 |