원문정보
보안공학연구지원센터(IJSEIA)
International Journal of Software Engineering and Its Applications
Vol.2 No.2
2008.04
pp.95-110
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
In this paper, we propose to support a fixed priority real time scheduler over 802.11 protocol called Deadline Monotonic (DM). We evaluate the performances of this policy for a simple scenario where two stations with different delay constraints contend for the channel.
For this scenario a Markov chain based analytical model is proposed. From the mathematical model, we derive the probability distribution of the packet service time at MAC layer. Analytical results are validated by simulation using the ns-2 network simulator.
목차
Abstract
1. Introduction
2. Related Works
3. Supporting Deadline Monotonic Policy over 802.11
3.1. Distributed Scheduling
3.2. DM medium access backoff policy
4. Mathematical Model of the DM policy over 802.11
4.1 Markov chain modeling station S1
4.2 Markov chain modeling station S2
4.3. Blocking probabilities in the Markov chains
4.4. Transition probability matrix of S1
4.5. Transition probability matrix of S2
5. Service Time Analysis
5.1. Z-transform of station S1 service time
5.2. Z-transform of station S2 service time
5.3. Service Time Distribution
5.4. Extended Simulation Results
6. Conclusion
7. References
1. Introduction
2. Related Works
3. Supporting Deadline Monotonic Policy over 802.11
3.1. Distributed Scheduling
3.2. DM medium access backoff policy
4. Mathematical Model of the DM policy over 802.11
4.1 Markov chain modeling station S1
4.2 Markov chain modeling station S2
4.3. Blocking probabilities in the Markov chains
4.4. Transition probability matrix of S1
4.5. Transition probability matrix of S2
5. Service Time Analysis
5.1. Z-transform of station S1 service time
5.2. Z-transform of station S2 service time
5.3. Service Time Distribution
5.4. Extended Simulation Results
6. Conclusion
7. References
저자정보
참고문헌
자료제공 : 네이버학술정보