• Title/Summary/Keyword: adaptive service rate control

Search Result 69, Processing Time 0.023 seconds

Performance Analysis of Random Early Dropping Effect at an Edge Router for TCP Fairness of DiffServ Assured Service

  • Hur Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.255-269
    • /
    • 2006
  • The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

An Adaptive Resource Allocation Scheme based on Renegotiation for QoS Provisioning in Wireless Mobile Netwerks (무선 이동 통신망에서 QoS 제공을 위한 재할당 기반의 적응적인 자원 할당 기법)

  • Hong, Jung-Pyo;Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9A
    • /
    • pp.1067-1074
    • /
    • 2004
  • In the wireless mobile networks, it IS important to provide the quality-of-service (QoS) guarantees as they are increasingly expected to support the multimedia applications Although the QoS provisioning problem arises in the wire-line networks as well, the mobility of hosts and the scarcity of bandwidth make QoS provisioning a challenging task in wireless mobile networks. The resource allocation to multimedia applications of varying QoS reqUlrement 15 a complex issue. In this paper, we propose a new adaptive resource allocation scheme based on the concept of the resource reservation and the renegotiation in order to guarantee the QoS of the real-tune traffic. The proposed scheme is aimed at improving the perfonnance in terms of the new call blocking rate, the bandoff dropping rate, and the bandwIdth utilization.

Quality of service management for intelligent systems

  • Lee, Sang-Hyun;Jung, Byeong-Soo;Moon, Kyung-Il
    • International journal of advanced smart convergence
    • /
    • v.3 no.2
    • /
    • pp.18-21
    • /
    • 2014
  • A control application requirements currently used is very low, such as packet loss rate, minimum delay on sensor networks with quality of service (QoS) requirements some packet delivery guarantee. This paper is the sampling period at the end of the actuator and sensor data transfer related to the Miss ratio for each source sensor node, use the controller and the internal ANFIS. The proposed scheme has the advantages of simplicity, scalability, and General. Simulation results of the proposed scheme can provide QoS support in WSANs.

Analysis of Aggregated HTTP-based Video Traffic

  • Biernacki, Arkadiusz
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.826-836
    • /
    • 2016
  • Increase of hypertext transfer protocol (HTTP)-based video popularity causes that broadband and Internet service providers' links transmit mainly multimedia content. Network planning, traffic engineering or congestion control requires understanding of the statistical properties of network traffic; therefore, it is desirable to investigate the characteristic of traffic traces generated, among others, by systems which employ adaptive bit-rate streaming. In our work, we investigate traffic originating from 120 client-server pairs, situated in an emulated laboratory environment, and multiplexed onto a single network link. We show that the structure of the traffic is distinct from the structure generated by first and second generation of HTTP video systems, and furthermore, not similar to the structure of general Internet traffic. The obtained traffic exhibits negative correlations, anti-persistence, and its distribution function is skewed to the right. Furthermore, we show that the traffic generated by clients employing the same or similar play-out strategies is positively correlated and synchronised (clustered), whereas traffic originated from different play-out strategies shows negative or no correlations.

Adaptive Cross-Layer Packet Scheduling Method for Multimedia Services in Wireless Personal Area Networks

  • Kim Sung-Won;Kim Byung-Seo
    • Journal of Communications and Networks
    • /
    • v.8 no.3
    • /
    • pp.297-305
    • /
    • 2006
  • High-rate wireless personal area network (HR-WPAN) has been standardized by the IEEE 802.15.3 task group (TG). To support multimedia services, the IEEE 802.15.3 TG adopts a time-slotted medium access control (MAC) protocol controlled by a central device. In the time division multiple access (TDMA)-based wireless packet networks, the packet scheduling algorithm plays a key role in quality of service (QoS) provisioning for multimedia services. In this paper, we propose an adaptive cross-layer packet scheduling method for the TDMA-based HR-WPAN. Physical channel conditions, MAC protocol, link layer status, random traffic arrival, and QoS requirement are taken into consideration by the proposed packet scheduling method. Performance evaluations are carried out through extensive simulations and significant performance enhancements are observed. Furthermore, the performance of the proposed scheme remains stable regardless of the variable system parameters such as the number of devices (DEVs) and delay bound.

A Study on an Adaptive UPC Algorithm Based on Traffic Multiplexing Information in ATM Networks (ATM 망에서 트래픽 다중화 정보에 의한 적응적 UPC 알고리즘에 관한 연구)

  • Kim, Yeong-Cheol;Byeon, Jae-Yeong;Seo, Hyeon-Seung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2779-2789
    • /
    • 1999
  • In this paper, we propose a new neural Buffered Leaky Bucket algorithm for preventing the degradation of network performance caused by congestion and dealing with the traffic congestion in ATM networks. We networks. We justify the validity of the suggested method through performance comparison in aspects of cell loss rate and mean transfer delay under a variety of traffic conditions requiring the different QoS(Quality of Service). also, the cell scheduling algorithms such as DWRR and DWEDF used for multiplexing the incoming traffics are induced to get the delay time of the traffics fairly. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate is changed by the predicted values. The prediction of traffic loss rate by neural networks can effectively reduce the cell loss rate and the cell transfer delay of next incoming cells and be applied to other traffic control systems. Computer simulation results performed for traffic prediction show that QoSs of the various kinds of traffics are increased.

  • PDF

Adaptive Absolute Delay Differentiation in Next-Generation Networks (차세대 네트워크에서의 적응형 절대적 지연 차별화 방식)

  • Paik, Jung-Hoon
    • Convergence Security Journal
    • /
    • v.6 no.1
    • /
    • pp.55-63
    • /
    • 2006
  • In this paper, an algorithm that provisions absolute differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features an adaptive scheme that compensates the deviation for prediction on the traffic to be arrived continuously. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot, and derives the deviation between the two quantity. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the constant rate traffic. It is demonstrated through simulation that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional mechanism.

  • PDF

Improved for Error Control Scheme in Wireless ATM (무선 ATM에서의 오류 제어 개선 방안)

  • Lee, Chang-Bum;Kim, Young-Woong;Soh, Surng-Ryurl;Kim, Yung-Kwon
    • Journal of IKEEE
    • /
    • v.4 no.2 s.7
    • /
    • pp.274-280
    • /
    • 2000
  • The fact that error probability is higher in wireless communication environment than the one in a fixed network makes it inappropriate to apply the same DLC (Data Link Control) protocol used in a wireline network to a wireless network. And since the existing DLC protocol for wireless network was optimized for low-rate data service, it is not suitable for a wireless network environment which should support high-speed and multimedia traffic. Therefore it is desperate to have a new DLC protocol for todays wireless mobile communication environment. In this paper, we propose an error control scheme in WATM (Wireless Asynchronous Transfer Mode) environment. which supportsmultiple traffic attributes, high-speed, multimedia data service. In this paper we modified the existing ASR ARQ (Adaptive Selective Repeat Automatic Repeat Request) protocol where cells exceeding maximum allowable delay range are discarded. And adding FEC (Forward Error Correction) for delay-sensitive traffic resulted in smaller increase of transmission delay.

  • PDF

Adaptive Dynamic Slot Assignment of VBR Traffics Using In-band Parameters in Wireless ATM (무선 ATM에서 In-Band 파라미터를 이용한 VBR 트래픽의 적응적 슬롯 할당)

  • Paek, Jong-Il;Jun, Chan-Yong;Kim, Young-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.7
    • /
    • pp.30-37
    • /
    • 2002
  • In this paper, we propose a new adaptive slot assignment algorithm called In-VDSA in order to guarantee the QoS(Quality of Service) of VBR(Variable Bit Rate) traffics in wireless ATM and maximize efficiency in use of wireless channels. In the proposed algorithm, the status of terminal buffers is encoded in signed number on the GFC(Generic Flow Control) field of an ATM cell header and piggybacked. And also, the number of slots to be assigned to the next frame is adjusted effectively, which is different to methods in the conventional slot assignment algorithms. As a result, we can guarantee QoS such as CLR(Cell Loss Rate) and cell delay and achieve the higher utilization of channels. The validity of the proposed algorithm has been justified in performance by analysis through simulation results using the BONeS tool and comparison with conventional methods.

Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

  • Zhu, Rongb;Qin, Yingying;Lai, Chin-Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.9
    • /
    • pp.1492-1512
    • /
    • 2011
  • Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.