• Title/Summary/Keyword: bursty traffic

Search Result 101, Processing Time 0.019 seconds

Queuing Analysis of IEEE 802.15.4 GTS Scheme for Bursty Traffic (Bursty Traffic을 위한 IEEE 802.15.4 GTS 기법의 대기 해석)

  • Le, Nam-Tuan;Choi, Sun-Woong;Jang, Yeong-Min
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.2
    • /
    • pp.87-91
    • /
    • 2010
  • The IEEE 802.15.4 and IEEE 802.15.7 standard are the typical of low rate wireless and Visible Light Wireless personal area networks. Its Medium Access Control protocol can support the QoS traffic flows for real-time application through guaranteed time slots (GTS) in beacon mode. However, how to achieve a best allocation scheme is not solved clearly. The current analytical models of IEEE 802.15.4 MAC reported in the literature have been mainly developed under the assumption of saturated traffic or non-bursty unsaturated traffic conditions. These assumptions don't capture the characteristics of bursty multimedia traffic. In this paper, we propose a new analytical model for GTS allocation with burst Markov modulated ON-OFF arrival traffic.

PERFORMANCE ANALYSIS OF AAL MULTIPLEXER WITH CBR TRAFFIC AND BURSTY TRAFFIC

  • Park, Chul-Geun;Han, Dong-Hwan
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.81-95
    • /
    • 2001
  • This paper models and evaluates the AAL multiplexer to analyze AAL protocol in ATM networks. We consider an AAL multiplexer in which a single periodically determinsitic CBR traffic stream and several variable size bursty background traffic streams are multiplexed and one ATM cell stream goes out. We model the AAL multiplexer as a B/sup X/ + D/D/1/K queue and analyze this queueing system. We represent various performance measures such as loss probability and waiting time in the basis of cell and packet.

An Approach to Scheduling Bursty Traffic

  • Farzanegan, Mahmoud Daneshvar;Saidi, Hossein;Mahdavi, Mehdi
    • ETRI Journal
    • /
    • v.36 no.1
    • /
    • pp.69-79
    • /
    • 2014
  • The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.

Power Saving Scheme by Distinguishing Traffic Patterns for Event-Driven IoT Applications

  • Luan, Shenji;Bao, Jianrong;Liu, Chao;Li, Jie;Zhu, Deqing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1123-1140
    • /
    • 2019
  • Many Internet of Things (IoT) applications involving bursty traffic have emerged recently with event detection. A power management scheme qualified for uplink bursty traffic (PM-UBT) is proposed by distinguishing between bursty and general uplink traffic patterns in the IEEE 802.11 standard to balance energy consumption and uplink latency, especially for stations with limited power and constrained buffer size. The proposed PM-UBT allows a station to transmit an uplink bursty frame immediately regardless of the state. Only when the sleep timer expires can the station send uplink general traffic and receive all downlink frames from the access point. The optimization problem (OP) for PM-UBT is power consumption minimization under a constrained buffer size at the station. This OP can be solved effectively by the bisection method, which demonstrates a performance similar to that of exhaustive search but with less computational complexity. Simulation results show that when the frame arrival rate in a station is between 5 and 100 frame/second, PM-UBT can save approximately 5 mW to 30 mW of power compared with an existing power management scheme. Therefore, the proposed power management strategy can be used efficiently for delay-intolerant uplink traffic in event-driven IoT applications, such as health status monitoring and environmental surveillance.

Performance evaluation of fully-interconnected ATM switch (part II: for bursty traffic andnonuniform distribution) (완전 결합형 ATM 스위치의 성능분석 (II부 : 버스티 트래픽 및 비균일 분포에 대하여))

  • 전용희;박정숙;정태수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.8
    • /
    • pp.1926-1940
    • /
    • 1998
  • This paper is the part II of research results on the performance evaluation of fully interconnected ATM switch, and includes the performance evaluation results for bursty traffic and nonuniform distribution. The switch model is a fyully interconnected switch type proposed by ETRI and is the proper architecutre for a small-sized switch element. The proposed switch consists of two steps of buffering scheme in the switch fabric in order to effectively absorb the effect of bursty nature of ATM traffic. The switch uses bit addressing method for addressing shcmeme and thus it is easy to implement multicasting function without adding additional functional block. In order to incorporate the bursty nature of traffic in ATM networks, we use IBP(Interrupted Bernoulli Process) model as an input traffic model as well as random traffic model which has been used as a traditional traffic model. In order to design the various scenarios for simulation, we considered both uniform and nonuniform output distribution, and also implemented multicast function. In this paper, we presented the simulation results in diverse environments and evaluated the performance of the switch.

  • PDF

Fast Congestion Control to Transmit Bursty Traffic Rapidly in Satellite Random Access Channel (위성 랜덤 액세스 채널에서 Bursty 트래픽의 신속한 전송을 위한 빠른 혼잡 제어 기법)

  • Noh, Hong-Jun;Lee, Yoon-Seong;Lim, Jae-Sung;Park, Hyung-Won;Lee, Ho-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.11
    • /
    • pp.1031-1041
    • /
    • 2014
  • In this paper, we propose a traffic load control scheme, called fast congestion control (FCC), for a satellite channel using enhanced random access schemes. The packet repetition used by enhanced random access schemes increases not only the maximum throughput but also the sensitivity to traffic load. FCC controls traffic load by using an access probability, and estimates backlogged traffic load. If the backlogged traffic load exceeds the traffic load corresponding to the maximum throughput, FCC recognizes congestion state, and processes the backlogged traffic first. The new traffic created during the congestion state accesses the channel after the end of congestion state. During the congestion state, FCC guarantees fast transmission of the backlogged traffic. Therefore, FCC is very suitable for the military traffic which has to be transmit urgently. We simulate FCC and other traffic load control schemes, and validate the superiority of FCC in latency.

DISCRETE-TIME ANALYSIS OF OVERLOAD CONTROL FOR BURSTY TRAFFIC

  • Choi, Doo-Il
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.285-295
    • /
    • 2001
  • We consider a queueing system under overload control to support bursty traffic. The queueing system under overload control is modelled by MMBP/D1/K queue with two thresholds on buffer. Arrival of customer is assumed to be a Markov-modulated Bernoulli process (MMBP) by considering burstiness of traffic. Analysis is done in discrete-time case. Using the generating function method, we obtain the stationary queue length distribution. Finally, the loss probability and the waiting time distribution of a customer are given.

PERFORMANCE ANALYSIS OF A MULTIPLEXER WITH THE THRESHOLD BASED OVERLOAD CONTROL IN ATM NETWORKS

  • Park, Chul-Geun
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.643-658
    • /
    • 1998
  • In this paper we analyze the performance of a statistical ATM multiplexer with bursty input traffic and two thresholds in the buffer by using queueing model. Two priority levels are considered for source traffic which is modeled by Markov Modulated Poisson Process to represent the bursty characteristics. Service time distributions of two priority sources are assumed to be same and deterministic for ATM environment. The partial buffer sharing scheme with one threshold may experience a sensitive state change around the threshold. But the proposed multiplexer with two thresholds avoids this hysterical phenominon to improve the system operation.

A Novel Multiple Access Scheme via Compressed Sensing with Random Data Traffic

  • Mao, Rukun;Li, Husheng
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.308-316
    • /
    • 2010
  • The problem of compressed sensing (CS) based multiple access is studied under the assumption of random data traffic. In many multiple access systems, i.e., wireless sensor networks (WSNs), data arrival is random due to the bursty data traffic for every transmitter. Following the recently developed CS methodology, the technique of compressing the transmitter identities into data transmissions is proposed, such that it is unnecessary for a transmitter to inform the base station its identity and its request to transmit. The proposed compressed multiple access scheme identifies transmitters and recovers data symbols jointly. Numerical simulations demonstrate that, compared with traditional multiple access approaches like carrier sense multiple access (CSMA), the proposed CS based scheme achieves better expectation and variance of packet delays when the traffic load is not too small.

Variable Queue Sharing Mechanism for ATM Traffic (ATM 트래픽을 위한 가변큐공유(VQS) 메카니즘)

  • An, Jeong-Hui;Jeong, Jin-Uk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.3
    • /
    • pp.742-749
    • /
    • 1999
  • This paper proposes the mechanism of cell buffering in the output buffer of ATM switch for the traffic with the different QOS in the ATM environment. The proposed mechanism, VQS(Variable Queue Sharing) can minimize the cell loss ratio(CLR) of bursty traffic through the sharing of CBR queue, VBR queue, ABR queue to maximize the utilization of queue resource. To evaluate VQS performance, we make simulator using Visual Slam 2.0. We compare the CLP and cell average delay of VQS and HOL, QLT_HOL using the bursty traffic patterns.

  • PDF