• 제목/요약/키워드: deadline violation probability

검색결과 2건 처리시간 0.02초

무선랜 시스템에서의 하향 우선 실시간 음성 트래픽 스케줄링 (Downlink-First Scheduling of Real-Time Voice Traffic in IEEE 802.11 Wireless LANs)

  • 정동운;이채영
    • 대한산업공학회지
    • /
    • 제29권2호
    • /
    • pp.150-156
    • /
    • 2003
  • The IEEE 802.11 MAC (Media Access Control) Protocol supports two modes of operation, a random access mode for nonreal-time data applications processed by Distributed Coordinated Function (DCF), and a polling mode for real-time applications served by Point Coordinated Function (PCF). It is known that the standard IEEE 802.11 is insufficient to serve real-time traffic. To provide Quality of Service (QoS) of real-time traffic, we propose the Downlink-first scheduling with Earliest Due Date (EDD) in Contention Free Period (CFP) with suitable admission control. The capacity and deadline violation probability of the proposed system is analyzed and compared to the standard pair system of downlink and uplink. Analytical and simulation results show that the proposed scheme is remarkably efficient in view of the deadline violation probability.

무선랜에서의 실시간 및 비실시간 트래픽 스케줄링 (Scheduling of Real-time and Nonreal-time Traffics in IEEE 802.11 Wireless LAN)

  • Lee, Ju-Hee;Lee, Chae Y.
    • 한국경영과학회지
    • /
    • 제28권2호
    • /
    • pp.75-89
    • /
    • 2003
  • Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.