• Title/Summary/Keyword: Bursty Traffics

Search Result 14, Processing Time 0.025 seconds

A Delay Efficient and Bursty Traffics Friendly MAC Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 지연과 버스티 트래픽에 적합한 MAC 프로토콜)

  • Kim, Hye Yun;Kim, Seong Cheol
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.254-260
    • /
    • 2017
  • Data packets from sensor nodes scattered over measuring fields are generally forwarding to the sink node, which may be connected to the wired networks, in a wireless sensor network. So many data packets are gathered near the sink node, resulting in significant data packet collisions and severe transmission latency. In an event detection application such as object tracking and military, bursty data is generated when an event occurs. So many data packet should be transmitted in a limited time to the sink node. In this paper, we present a delay efficient and bursty traffic friendly MAC protocol called DEBF-MAC protocol for wireless sensor networks. The DEBF-MAC uses a slot-reserved mechanism and sleep period control method to send multiple data packets efficiently in an operational cycle time. Our simulation results show that DEBF-MAC outperforms DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

THE DISCRETE-TIME ANALYSIS OF THE LEAKY BUCKET SCHEME WITH DYNAMIC LEAKY RATE CONTROL

  • Choi, Bong-Dae;Choi, Doo-Il
    • Communications of the Korean Mathematical Society
    • /
    • v.13 no.3
    • /
    • pp.603-627
    • /
    • 1998
  • The leaky bucket scheme is a promising method that regulates input traffics for preventive congestion control. In the ATM network, the input traffics are bursty and transmitted at high-speed. In order to get the low loss probability for bursty input traffics, it is known that the leaky bucket scheme with static leaky rate requires larger data buffer and token pool size. This causes the increase of the mean waiting time for an input traffic to pass the policing function, which would be inappropriate for real time traffics such as voice and video. We present the leaky bucket scheme with dynamic leaky rate in which the token generation period changes according to buffer occupancy. In the leaky bucket scheme with dynamic leaky rate, the cell loss probability and the mean waiting time are reduced in comparison with the leaky bucket scheme with static leaky rate. We analyze the performance of the proposed leaky bucket scheme in discrete-time case by assuming arrival process to be Markov-modulated Bernoulli process (MMBP).

  • PDF

A Bursty Traffics Friendly MAC Protocol in Wireless Sensor Networks (무선센서 네트워크에서 버스티 트래픽에 적합한 MAC 프로토콜)

  • Lee, Jin-young;Kim, Seong-cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.5
    • /
    • pp.772-778
    • /
    • 2018
  • Due to the recent advances in computing, communication and micro-electromechanical technology, Wireless Sensor Networks (WSNs) applications have been extended from military to many commercial areas such as object tracking, wire detection, and vehicular sensor networks. In some applications bursty data from many sensor nodes may be generated and the generated data from the monitoring area may be sent in a limited time to the final destination, sink node. In this paper, we present a BTF-MAC protocol adequate for WSNs applications in which bursty data packets are required to be transmitted in a limited time. The BTF-MAC is a synchronous duty-cycle MAC protocol and uses a slot-reserved and operational period extension mechanism adapted to the traffics. Our numerical analysis and simulation results show that BTF-MAC outperforms other related protocols such as DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

Performance Evaluation of a Switching System for Metropolitan Area Networks (메트로폴리탄 에어리어 네트워크를 위한 스위칭 시스템의 성능 분석)

  • Mun Youngsong
    • Journal of Internet Computing and Services
    • /
    • v.4 no.6
    • /
    • pp.69-73
    • /
    • 2003
  • ATM and Ethernet are desirable transport mechanisms for the realization MAN(Metropolitan Area Networks). A relatively small sized switching system for MAN based on ATM is proposed and its performance is evaluated in this paper. For the performance evaluation, traffics should be firstly modeled because they are highly bursty. By varing the ratio of VBR traffics, detrimental effect of VBR traffics may be observed. Traffic load at each input port is also varied, From the results of simulation, operation conditions of the system to meet required QoS are obtained.

  • PDF

Efficient data transmission mechanism for bursty traffics in the energy-harvesting wireless sensor networks (에너지 수확 무선 센서 네트워크에서 효율적인 버스티 데이터 전송 메커니즘)

  • Jeon, Jun-Heon;Kim, Seong-Cheol;Park, Hyun-Joo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.293-296
    • /
    • 2012
  • 본 논문에서는 에너지 수확 무선 센서 네트워크에서 버스티 데이터 전송에 효율적인 수신자 기반의 MAC 프로토콜을 제안한다. 에너지 수확 무선 센서 네트워크는 기존의 배터리에 의해 동작하는 센서 네트워크에 비해 태양열과 같은 주변의 환경으로부터 에너지를 수확하여 사용함으로써 전체 네트워크의 수명을 향상시킬 수 있는 장점으로 인하여 많은 연구가 이루어지고 있다. 본 논문에서는 에너지 수확 무선 센서 네트워크에서 데이터 전송에 참여하는 센서 노드의 에너지를 참고하여 비콘(beacon) 주기를 조절하고 수신자(receiver) 비콘에 응답(acknowledgment)신호를 포함시킴으로써 버시티 데이티(bursty data) 전송에 효율적이면서, 센서 노드의 에너지를 절약할 수 있는 MAC 프로토콜을 제안한다. 본 논문에서는 제안된 MAC 프로토콜과 기존에 연구되었던 ODMAC 프로토콜과 에너지 절약 및 버스티 데이터 전송 효율면에서 비교분석한다.

  • PDF

PERFORMANCE ANALYSIS OF THE LEAKY BUCKET SCHEME WITH QUEUE LENGTH DEPENDENT ARRIVAL RATES

  • Choi, Doo-Il;Lee, Sang-Min
    • Bulletin of the Korean Mathematical Society
    • /
    • v.43 no.3
    • /
    • pp.657-669
    • /
    • 2006
  • In this paper, we analyze a leaky bucket (LB) scheme with queue length dependent arrival rates. In other words, if the queue length exceeds an appropriate threshold value on buffer, the arrivals need to be controlled. In ATM networks, if the congestion occurs, the input traffics must be controlled (reduced) for congestion resolution. By the bursty and correlated properties of traffics, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the loss probability and the waiting time distribution for arbitrary cell. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effects of our proposed LB scheme.

TRANSIENT ANALYSIS OF A QUEUEING SYSTEM WITH MARKOV-MODULATED BERNOULLI ARRIVALS AND OVERLOAD CONTROL

  • Choi, Doo-Il
    • Journal of applied mathematics & informatics
    • /
    • v.15 no.1_2
    • /
    • pp.405-414
    • /
    • 2004
  • This paper considers overload control in telecommunication networks. Markov-modulated Bernoulli process ( MMBP ) has been extensively used to model bursty traffics with time-correlation. Thus, we investigate the transient behavior of the queueing system MMBP/D/l/K queue with two thresholds. The model is analyzed recursively by using the generating function method. We obtain the transient queue length distribution and waiting time distribution at an arbitrary time. The transient behavior of the queueing system helps observing the temporary system behavior.

Traffic Management Scheme for Supporting QoS of VBR/ABR Services in ATM Switching Systems (ATM 스위칭 시스템의 VBR/ABR 서비스 품질 지원을 위한 트랙픽 관리 기법)

  • 유인태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8A
    • /
    • pp.1160-1168
    • /
    • 2000
  • This paper presents a real-time integrated traffic management (RITM) scheme that can effectively manage variable bit rate (VBR) and available bit rate (ABR) traffics having unpredictable characteristics in asynchronous transfer mode (ATM) networks. An unique feature of this scheme is that it has a special ATM cell control block which makes it possible to monitor bursty traffics in real-time so that the delay incurred to measure cell arrival rate is minimized. Additionally, the proposed scheme intends to dynamically reassign the leftover network resources to VBR/ABR connections without any deterioration in quality of service (QoS) of the existing connections. The RITM scheme has been verified to reliably monitor incoming traffics and to efficiently manage network resources by computer simulations. The capability of managing the incoming ATM traffics in real-time helps determine an optimal acceptable number of user connections for a given network condition. We can use this value as a threshold to protect the network from being congested and to find out a cost-effective buffer design method.

  • PDF

Extended FRED(Fair Random Early Detection) Method with Virtual Buffer (가상 버퍼를 이용한 공평성을 지원하는 확장된 FRED 기법)

  • U, Hui-Gyeong;Kim, Jong-Deok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11S
    • /
    • pp.3269-3277
    • /
    • 1999
  • To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we propose a router mechanism, Extended FRED(ex-FRED). In this paper, we catagorize the TCP controlled traffics into robust and fragile traffic and discuss several unfairness conditions between them caused by the diverse applications. For example, fragile traffic from bursty application cannot use its fair share due to their slow adaptation. Ex-FRED modifies the FRED(Fair Random Early Drop), which can show wrong information due to the narrow view of actual buffer. Therefore, Ex-FRED uses per-flow accounting in larger virtual buffer to impose an each flow a loss rate that depends on the virtual buffer use of a flow. The simulation results show that Ex-FRED uses fair share and has good throughput.

  • PDF

A New Error Spreading Method for MPEG Streaming Service Over the Internet (인터넷망에서 MPEG 스트리밍 서비스를 위한 새로운 에러 확산 기법)

  • Pyun, Jae-Young;Shim, Jae-Jeong;Lee, Jae-Yong;Ko, Sung-Jea
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.5
    • /
    • pp.21-31
    • /
    • 2002
  • As the MPEG streaming traffics are transmitted over the Internet, MPEG packet losses cause error propagation in both spatial and temporal domains which in turn leads to severe degradation in image quality. This image degradation is become worse by the bursty packet loss at the network. In this paper, we propose a new error spreading method to reduce the effects of bursty packet losses over the Internet. The proposed error spreading method spreads out the not utilize packet losses widely, and can be used for videocasting and video-broadcasting that do not utilize the ARQ method. The proposed method can not only reduce the consecutive losses of image blocks, but also improve the performance of error concealment. Experimental results show that the deterioration of MPEG video quality can be reduced by spreading out the MPEG packet losses.