• Title/Summary/Keyword: Traffic burst

Search Result 128, Processing Time 0.023 seconds

A Self-Adaptive Agorithm for Optimizing Random Early Detection(RED) Dynamics (라우터 버퍼 관리 기반 체증 제어 방식의 최적화를 위한 자체 적응 알고리즘)

  • Hong, Seok-Won;Yu, Yeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.3097-3107
    • /
    • 1999
  • Recently many studies have been done on the Random Early Detection(RED) algorithm as an active queue management and congestion avoidance scheme in the Internet. In this paper we first overview the characteristics of RED and the modified RED algorithms in order to understand the current status of these studies. Then we analyze the RED dynamics by investigating how RED parameters affect router queue behavior. We show the cases when RED fails since it cannot react to queue state changes aggressively due to the deterministic use of its parameters. Based on the RED parameter analysis, we propose a self-adaptive algorithm to cope with this RED weakness. In this algorithm we make two parameters be adjusted themselves depending on the queue states. One parameter is the maximum probability to drop or mark the packet at the congestion state. This parameter can be adjusted to react the long burst of traffic, consequently reducing the congestion disaster. The other parameter is the queue weight which is also adjusted aggressively in order for the average queue size to catch up with the current queue size when the queue moves from the congestion state to the stable state.

  • PDF

An Adaptive FEC Mechanism Using Crosslayer Approach to Enhance Quality of Video Transmission over 802.11 WLANs

  • Han, Long-Zhe;Park, Sung-Jun;Kang, Seung-Seok;In, Hoh-Peter
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.3
    • /
    • pp.341-357
    • /
    • 2010
  • Forward Error Correction (FEC) techniques have been adopted to overcome packet losses and to improve the quality of video delivery. The efficiency of the FEC has been significantly compromised, however, due to the characteristics of the wireless channel such as burst packet loss, channel fluctuation and lack of Quality of Service (QoS) support. We propose herein an Adaptive Cross-layer FEC mechanism (ACFEC) to enhance the quality of video streaming over 802.11 WLANs. Under the conventional approaches, FEC functions are implemented on the application layer, and required feedback information to calculate redundancy rates. Our proposed ACFEC mechanism, however, leverages the functionalities of different network layers. The Automatic Repeat reQuest (ARQ) function on the Media Access Control (MAC) layer can detect packet losses. Through cooperation with the User Datagram Protocol (UDP), the redundancy rates are adaptively controlled based on the packet loss information. The experiment results demonstrate that the ACFEC mechanism is able to adaptively adjust and control the redundancy rates and, thereby, to overcome both of temporary and persistent channel fluctuations. Consequently, the proposed mechanism, under various network conditions, performs better in recovery than the conventional methods, while generating a much less volume of redundant traffic.

Object-oriented Modeling for Broadband Network Simulation (광대역 통신망 시뮬레이션을 위한 객체지향 모델링)

  • 이영옥
    • Journal of the Korea Society for Simulation
    • /
    • v.3 no.1
    • /
    • pp.151-165
    • /
    • 1994
  • Broadband network based on the Asynchronous Transfer Mode(ATM) concept are becoming the target technology for the emerging Broadband Integrated Services Digital Network(B-ISDN). Since B-ISDN is very complex and requites a great amount of investment, optimum design and performance analysis of such systems are very important. Simulation can be widely used to analyze and examine the broadband network behavior. However, for the complicated system like broadband networks it is extremely difficult and time-consuming to develop a complete model for simulation. In this paper, an object-oriented modeling approach for the broadband network simulation is presented for the effective and efficient modeling. Object-oriented approaches can provide a good structuring capability for complicated simulation models and facilitate the development of reusable and extensible simulation models. We have developed an object-oriented model which consists of object model and behavior model. In the object mode., the components of the broadband network and both constant bit rate(CBR) and variable bit rate(VBR) traffic types of call level, burst level, and cell level are modeled as object classes. In the behavior model, the dynamic features for each object class are represented using the state transition diagram. It has been shown by illustration that objectoriented modeling is an effective tool for modeling the complicated B-ISDN.

  • PDF

MAC Protocol for Multimedia Services in Wireless ATM Networks based on TDMA/TDD (TDMA/TDD 기반 무선 ATM망에서 멀티미디어 서비스를 위한 MAC 프로토콜)

  • 임인택
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.5
    • /
    • pp.899-906
    • /
    • 2003
  • In this paper, a channel access control algorithm and a slot allocation algorithm are proposed as MAC protocol for multimedia services in TDMA/TDD-based wireless ATM networks. In the proposed protocol, VBR terminals that require real-time services transmit a reservation request through a random access minislot. VBR terminals, which are successfully transmitted the reservation request, transmits the dynamic parameters through a dynamic parameter minislot without contention. On the other hand, ABR terminals transmit a reservation request with contention basis whenever a non-real-time traffic burst is generated. Based on the received dynamic parameters and the number of requested slots, the base station scheduler allocates a dynamic parameter minislot as well as uplink data slots into VBR terminals. Also the scheduler allocates uplink data slots into ABR terminals in proportion to the number of requested slots.

On Statistical Multiplexing of Data Signals with Dynamic Buffer Control (Buffer의 동적제어에 의한 데이터 신호의 통계적 다중화에 관한 연구)

  • 김낙명;은종관
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.3
    • /
    • pp.61-68
    • /
    • 1983
  • In this paper various aspects of statistical maltiplexing of data signs have been investigated. A queueing model with finite waiting room and batch poisson arrivals is studied assuming that data signals are transmitted at a constant rate. Using traffic intensity and average burst length as parameters, overflow probabilities and expected queueing delay due to buffering are obtained. Also, a real system model of a statistical multiplexer that can be directly used in micro-programmed hardware realization is proposed. To examine the performance of the system, computer simulation has been done at various conditions. The results obtained can be used in designing a buffer efficiently.

  • PDF

Performance Analysis of MAC Protocol for Packet Data Service in CDMA Based Mobile Communication Systems (CDMA 기반 이동통신 시스템에서의 패킷 데이터 서비스를 위한 MAC 프로토콜의 성능분석)

  • 박성수;조동호;송영재
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7A
    • /
    • pp.973-986
    • /
    • 1999
  • In this paper, we propose MAC protocol that consists of channel access mechanism and transmission mechanism to support effective wireless packet data service. In channel access mechanism, broadcast channel announces status information of random access channel, and mobile station tries random access based on status information. Also, mobile station has access probability to prevent collision increase due to transmission of short message. For effective transmission, mobile station changes transmission rate based on transmission queue status to adapt burst traffic characteristics. In restricted environments of transmission code and bandwidth, proposed protocol shows better performance than cdma2000 system.

  • PDF

Performance Enhancement of High-Speed TCP Protocols using Pacing (Pacing 적용을 통한 High-Speed TCP 프로토콜의 성능 개선 방안)

  • Choi Young Soo;Lee Gang Won;Cho You Ze;Han Tae Man
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12B
    • /
    • pp.1052-1062
    • /
    • 2004
  • Recent studies have pointed out that existing high-speed TCP protocols have a severe unfairness and TCP friendliness problem. As the congestion window achieved by a high-speed TCP connection can be quite large, there is a strong possibility that the sender will transmit a large burst of packets. As such, the current congestion control mechanisms of high-speed TCP can lead to bursty traffic flows in hi인 speed networks, with a negative impact on both TCP friendliness and RTT unfairness. The proposed solution to these problems is to evenly space the data sent into the network over an entire round-trip time. Accordingly, the current paper evaluates this approach with a high bandwidth-delay product network and shows that pacing offers better TCP friendliness and fairness without degrading the bandwidth scalability.

A Channel Access Control algorithm and a Dynamic Slot Allocation algorithm for rt_VBR services and ABR services in Wireless ATM Networks (무선 ATM망에서 rt_VBR 및 ABR 서비스를 위한 채널 접속 제어 알고리즘과 동적 대역 할당 알고리즘)

  • Yang, Seong-Ryoung;Im, In-Taek;Heo, Jeong-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.191-199
    • /
    • 2003
  • In this paper, a channel access control algorithm and a dynamic slot allocation algorithm are proposed for rt_VBR services and ABR services in the wireless ATM networks. In the proposed algorithm, rt_VBR terminals that require real-time services transmit a reservation request packet by a RAS minislot. An rt_VBR terminal, which transmitted the reservation request packet, transmits the dynamic parameters by DPS minislot without contention. On the other hand, ABR terminals that have a non-real-time traffic burst transfer a reservation request packet with contention basis. Based on the received dynamic parameters, the base station scheduler allocates uplink data slots as well as DPS minislot into rt_VBR terminals.

A architecture and control method of Streaming Packet Scheduler at 100bps for Guaranteed QoS of Internet and Broadcasting Services (인터넷 및 방송서비스의 QoS 보장을 위한 10Gbps급 스트리밍 패킷 스케줄러 구조 및 제어방법)

  • Kim Kwang-Ok;Park Wan-Ki;Choi Byeoun-Chul;Kwak Dong-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.1
    • /
    • pp.23-34
    • /
    • 2004
  • This paper presents architecture and control method of packet scheduler to guarantee QoS of high quality streaming services in high-speed packet-switched networks. Since streaming services need far more stringent QoS requirements than the typical sort of burst data applications, they should be guaranteed minimum bandwidth and end-to-end delay bound to each flow, regardless of the behavior of other flows. To meet these requirements, a packet scheduler isolate a flow from the undesirable effects of other flows and provides end-to-end delay guarantees for individual flow and divides stringently the available link bandwidth among flows sharing the link. Until now, many vendors are developing traffic management chips running at 10Gbps, but most of chips have drawbacks to support high quality streaming services. In this paper, we investigate the drawbacks of commercial TM chips and traffic characteristic of streaming services and present implementation frameworks of the proposed packet scheduler. Finally, we analyze the simulation results of the proposed scheduler.

Improvement of F-GCRA Algorithm for ATM-GFR Service (ATM-GFR 서비스를 위한 F-GCRA 알고리즘 개선)

  • Park, In-Yong
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.889-896
    • /
    • 2006
  • ATM Forum has defined a guaranteed frame rate (GFR) service to serve Internet traffic efficiently. The GFR service provides virtual connections (VCs) for minimum cell rate (MCR) guarantees and allows them to fairly share the residual bandwidth. And ATM Forum has recommended a frame-based generic cell rate algorithm (F-GCRA) as a frame classifier, which determines whether an Am cell is eligible to use the guaranteed bandwidth in a frame level. An ATM switch accommodates cells in its buffer or drops them in a frame level according to current buffer occupancy. A FIFO shared buffer has so simple structure as to be feasibly implemented in switches, but has not been able to provide an MCR guarantee for each VC without buffer management based on per-VC accounting. In this paper, we enhance the F-GCRA frame classifier to guarantee an MCR of each VC without buffer management based on per-VC accounting. The enhanced frame classifier considers burstness of TCP traffic caused by congestion control algorithm so as to enable each VC to use its reserved bandwidth sufficiently. In addition, it is able to alleviate the unfairness problem in usage of the residual bandwidth. Simulation results show that the enhanced frame classifier satisfies quality of services (QoSs) of the GFR service for the TCP traffic.