• Title/Summary/Keyword: Non-preemptive Queueing

Search Result 12, Processing Time 0.016 seconds

Estimation of Channel Capacity for Data Traffic Transmission (데이터 트래픽 특성을 고려한 적정 채널 용량 산정)

  • Park, Hyun Min
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.3
    • /
    • pp.589-595
    • /
    • 2017
  • We present an estimation model for optimal channel capacity required to data traffic transmission. The optimal channel capacity should be calculated in order to satisfy the permitted transmission delay of each wireless data services. Considering the discrete-time operation of digital communication systems and batch arrival of packet-switched traffic for various wireless services, $Geo^x$/G/1 non-preemptive priority queueing model is analyzed. Based on the heuristic interpretation of the mean waiting time, the mean waiting times of various data packets which have the service priority. Using the mean waiting times of service classes, we propose the procedure of determining the optimal channel capacity to satisfy the quality of service requirement of the mean delay of wireless services. We look forward to applying our results to improvement in wireless data services and economic operation of the network facilities.

A Study on Real Time and Non-real Time Traffic Multiplexing with Congestion Control (폭주제어를 포함한 실시간 및 비실시간 트래픽의 다중화에 관한 연구)

  • 송관호;이재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.4
    • /
    • pp.750-760
    • /
    • 1994
  • In this paper we proposed a multiplexing scheme of real time and non-real traffics in which a congestion control is embedded. Real time traffics are assumed to be nonqueuable and have preemptive priority over non-real time traffics in seizing the common output link, whereas the non-real time traffics wait in the common buffer if the output link is not available for transmission. Real time traffics are encoded according to the bandwidth reduction strategy, paticularly when congestion occurs among non-real time traffics. This scheme provides us an efficient way for utilizing the costly bandwidth resources, by accommodation as many real time traffics as possible with gauranteeing its mimimum bandwidth requirements, and also resloving the congestion encountered among non-real time traffics. We describe the system as a Markov queueing system, provide the analysis by exploiting the matrix geometric method, and present the performance for various performance measures of interest. Some numerical results are also provided.

  • PDF