Abstract
This paper presents two approaches for estimating buffer overflow probability in OFDM-TDMA networks. The first approach is based on Queuing Theory and Markov Chains and is used to evaluate the performance of the transmission link in OFDM-TDMA systems. The second approach is based on Network Service Curve and Envelope Processes of the traffic flows. More specifically, it is proposed an equation to estimate the probability of buffer overflow in OFDM-TDMA systems. To this end, an equation for the Service Curve of the considered system, is also proposed. The results show that the estimates are very close to those obtained by simulations and that the computational complexity to obtain them are significantly reduced due to the absence of matrix computation.
Highlights
This paper presents two approaches for estimating buffer overflow probability in OFDM-TDMA networks
The first approach is based on Queuing Theory and Markov Chains and is used to evaluate the performance of the transmission link in OFDM-TDMA systems
The second approach is based on Network Service Curve and Envelope Processes of the traffic flows
Summary
Atualmente, a modulacao OFDM (Orthogonal Frequency Division Multiplexing [1]) eutilizada em uma gama de redes sem fio de alta velocidade, em redes locais sem fio (WLAN) como o Wi-Fi (padrao IEEE 802.11 [2]), em redes metropolitanas sem fio (WMAN) como o WiMAX (padrao IEEE 802.16 [3]) e no LTE [4]. Todas estas tecnologias sao promissoras no mundo contemporaneo das telecomunicacoes, tendo em vista a inovacao trazida e os investimentos recentemente realizados para implantacao e desenvolvimento dessas tecnologias em inumeros paıses. Este trabalho apresenta o modelo fundamentado em Teoria de Filas e em Cadeias de Markov descrito em [7] para avaliar o desempenho do enlace de transmissao em sistemas OFDM-TDMA
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.