• 제목/요약/키워드: bursty traffic

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

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

  • 래투안남;최선웅;장영민
    • 한국위성정보통신학회논문지
    • /
    • 제5권2호
    • /
    • pp.87-91
    • /
    • 2010
  • IEEE 802.15.4과 IEEE 802.15.7은 대표적인 저속 무선망 및 가시광 WPAN 표준이다. 이 표준의 MAC 프로토콜들은 비컨 모드에서 GTS를 이용하여 실시간 응용 프로그램에 대한 QoS 보장 트래픽 플로우를 지원할 수 있다. 그러나 최적으로 할당하는 방법은 아직 명확하게 해결되지 않았다. IEEE 802.15.4 MAC에 관한 현재의 분석 모델은 주로 포화 트래픽 또는 non-bursty 불포화 트래픽 상황이란 가정 하에 개발되었다. 이러한 가정은 bursty 멀티미디어 트래픽의 특성을 반영하지 못한다. 이 논문에서는 burst Markov 변조On-Off 도착 트래픽을 사용하여 GTS 할당을 위한 새로운 분석 모델을 제안한다.

PERFORMANCE ANALYSIS OF AAL MULTIPLEXER WITH CBR TRAFFIC AND BURSTY TRAFFIC

  • Park, Chul-Geun;Han, Dong-Hwan
    • Journal of applied mathematics & informatics
    • /
    • 제8권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
    • /
    • 제36권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)
    • /
    • 제13권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.

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

  • 전용희;박정숙;정태수
    • 한국통신학회논문지
    • /
    • 제23권8호
    • /
    • pp.1926-1940
    • /
    • 1998
  • 본 논문은 완전 결합형 ATM 스위치의 성능 분석에 관한 연구결과를 제시하고자 한 내용의 II부로서, 버스티 트래픽 및 비균일 분포에 대한 성능 분석 결과를 포함하고 있다. 사용한 스위치 모델은 ETRI에서 제안한 완전 결합형 ATM 스위치로써 비교적 소규모용으로 설계되었으며 트래픽의 버스트 특성을 효과적으로 홉수하기 위해 2단 버퍼링 구조를 사용하며, 주소 기법은 비트 어드레싱 방식을 사용하여 별도의 기능 블럭 추가없이 멀티캐스팅 기능 구현을 용이하게 하였다. 모의실험을 위해 입력 트래픽 모델은 트래픽의 군집적(bursty) 성질을 포착할 수 있는 IBP 모델과 기존의 트래픽 모델로 사용되어 온 랜덤 트래픽 모델을 고려하였다. 또한 다양한 시나리오 구성을 위해 출력 포트 분포는 균일과 비균일 둘 다를 고려하고 멀티캐스팅 기능도 구현하였다. 본 논문에서는 다양한 환경 하에서 수행한 모의실험 결과를 제시하고 성능 분석을 수행하였다.

  • PDF

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

  • 노홍준;이윤성;임재성;박형원;이호섭
    • 한국통신학회논문지
    • /
    • 제39C권11호
    • /
    • pp.1031-1041
    • /
    • 2014
  • 본 논문은 복제 패킷을 사용하는 위성 랜덤 액세스 채널에서 bursty 트래픽을 안정적으로 전송하기 위한 트래픽 부하 제어 기법으로 FCC (Fast Congestion Control)을 제안한다. 위성 랜덤 액세스 채널에서 순간적으로 발생하는 bursty 트래픽은 그 양이 많을 경우 충돌 확률로 인하여 backlogged 트래픽이 다수 발생할 수 있다. FCC는 access probability를 통해 트래픽 부하를 제어하며, backlogged 트래픽의 양을 추정한다. 또한 backlogged 트래픽이 최대 처리량에 해당하는 트래픽 부하를 넘어설 경우 빠르게 congestion 상태로 전환한다. Congestion 상태에서는 backlogged 트래픽이 우선적으로 처리되며, 새로 유입되는 트래픽은 congestion 상태가 지속되는 동안 채널에 접속하지 않고 대기하다가 congestion 상태가 종료되는 시점에 채널에 유입된다. Congestion 상태에서 backlogged 트래픽은 신속한 전송을 보장받기 때문에 지연 시간이 단축된다. 따라서 FCC는 긴급성이 요구되는 군 트래픽에 매우 적합한 기술이다. 본 논문은 모의실험을 통해 기존 기법 대비 제안 기법의 우수성을 확인하였다.

DISCRETE-TIME ANALYSIS OF OVERLOAD CONTROL FOR BURSTY TRAFFIC

  • Choi, Doo-Il
    • Journal of applied mathematics & informatics
    • /
    • 제8권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
    • /
    • 제5권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
    • /
    • 제12권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.

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

  • 안정희;정진욱
    • 한국정보처리학회논문지
    • /
    • 제6권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