• Title/Summary/Keyword: Queue Length Variation

Search Result 15, Processing Time 0.028 seconds

A Study on an Adaptive AQM Using Queue Length Variation

  • Seol, Jeong-Hwan;Lee, Ki-Young
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.1
    • /
    • pp.19-23
    • /
    • 2008
  • The AQM (Active Queue Management) starts dropping packets earlier to notify traffic sources about the incipient stage of congestion. The AQM improves fairness between response flow (like TCP) and non-response flow (like UDP), and it can provide high throughput and link efficiency. In this paper, we suggest the QVARED (Queue Variation Adaptive RED) algorithm to respond to bursty traffic more actively. It is possible to provide more smoothness of average queue length and the maximum packet drop probability compared to RED and ARED (Adaptive RED). Therefore, it is highly adaptable to new congestion condition. Our simulation results show that the drop rate of QVARED is decreased by 80% and 40% compare to those of RED and ARED, respectively. This results in shorter end-to-end delay by decreasing the number of retransmitted packets. Also, the QVARED reduces a bias effect over 18% than that of drop-tail method; therefore packets are transmitted stably in the bursty traffic condition.

A Study on Performance Improvement of Adaptive AQM Using the Variation of Queue Length (큐 변화량을 이용한 적응식 AQM 성능 향상에 관한 연구)

  • Kim, Jong-Hwa;Lee, Ki-Young
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.159-162
    • /
    • 2005
  • Random Early Detection (RED), one of the most well-known Active Queue Management (AQM), has been designed to substitute Tail Drop and is nowadays widely implemented in commercially available routers. RED algorithm provides high throughput and low delay as well as a solution of global synchronization. However RED is sensitive to parameters setting, so the performance of RED, significantly depends on the fixed parameters. To solve this problem, the Adaptive RED (ARED) algorithm is suggested by S. Floyd. But, ARED also uses fixed parameters like target-queue length; it is hard to respond to bursty traffic actively. In this paper, we proposed AQM algorithm based on the variation of current queue length in order to improve adaptability about burst traffic. We measured performance of proposed algorithm through a throughput, marking-drop rate and bias phenomenon. In experimentation, we raised a packet throughput as reduced packet drop rate, and we confirmed to reduce a bias phenomenon about bursty traffic.

  • PDF

A Scheduling Method to Ensure a Stable Delay Variation of Video Streaming Service Traffic (영상 스트리밍 서비스 트래픽의 안정적인 전달 지연변이 보장을 위한 스케줄링 방안)

  • Kim, Hyun-Jong;Choi, Won-Seok;Choi, Seong-Gon
    • The KIPS Transactions:PartC
    • /
    • v.18C no.6
    • /
    • pp.433-440
    • /
    • 2011
  • In this paper, we propose a new scheduling method that can guarantee reliable jitter by minimizing the queue length variation in the streaming service provisioning such as IPTV and VoD. The amount of traffic to be delivered within a certain time is very fluid because MPEG-4 and H.264 encoders use VBR(Variable Bit Rate) for delivering video streaming traffic. This VBR characteristic increases the end-to-end propagation delay variation when existing scheduling methods are used for delivering video frames. Therefore, we propose the new scheduling method that can minimize change rate of queue length by adaptively controling service rate taking into account the size of bulk incoming packets and arrival rate for bulk streaming traffic. Video frames can be more reliably transmitted through the minimization of the queue length variation using the proposed method. We use the queueing model and also carry out OPNET simulation to validate the proposed method.

An Active Queue Management Method Based on the Input Traffic Rate Prediction for Internet Congestion Avoidance (인터넷 혼잡 예방을 위한 입력율 예측 기반 동적 큐 관리 기법)

  • Park, Jae-Sung;Yoon, Hyun-Goo
    • 전자공학회논문지 IE
    • /
    • v.43 no.3
    • /
    • pp.41-48
    • /
    • 2006
  • In this paper, we propose a new active queue management (AQM) scheme by utilizing the predictability of the Internet traffic. The proposed scheme predicts future traffic input rate by using the auto-regressive (AR) time series model and determines the future congestion level by comparing the predicted input rate with the service rate. If the congestion is expected, the packet drop probability is dynamically adjusted to avoid the anticipated congestion level. Unlike the previous AQM schemes which use the queue length variation as the congestion measure, the proposed scheme uses the variation of the traffic input rate as the congestion measure. By predicting the network congestion level, the proposed scheme can adapt more rapidly to the changing network condition and stabilize the average queue length and its variation even if the traffic input level varies widely. Through ns-2 simulation study in varying network environments, we compare the performance among RED, Adaptive RED (ARED), REM, Predicted AQM (PAQM) and the proposed scheme in terms of average queue length and packet drop rate, and show that the proposed scheme is more adaptive to the varying network conditions and has shorter response time.

Performance Analysis of a Packet Voice Multiplexer Using the Overload Control Strategy by Bit Dropping (Bit-dropping에 의한 Overload Control 방식을 채용한 Packet Voice Multiplexer의 성능 분석에 관한 연구)

  • 우준석;은종관
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.1
    • /
    • pp.110-122
    • /
    • 1993
  • When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

  • PDF

A Study on the Loop Detector System for Real-Time Traffic Adaptive Signal Control (실시간 교통신호제어를 위한 루프 검지기 체계 연구)

  • 이승환;이철기
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.2
    • /
    • pp.59-88
    • /
    • 1996
  • This study has determined optimal type, and location of loop detector to measure accurately traffic condition influenced by traffic variation with real time. Optimal type of loop detector for through vehicle at stop bar was determined by confidences of occupancy period, and nonoccupancy period, and so appropriate detector type for application to real time traffic control system has been decided on special loop detector.

    shows types and winding methods of existing detector (num1) and special detector (num 7,8) determined. It is desired that optimal location of through loop detector should be installed within 50cm of stop bar owing to vehicle behavior. And optimal location of loop detector for left turn vehicle is determined by left turn vehicle behavior on stop bar. In the case of install only one loop, it is desirable that within 20cm of stop bar. Both the special loop (1.8 × 4.0m : num 1.7) and existing loop (1.8 × 1.8m : num1) would be suitable. A location standard aspects, while regarding as economic, existing loop (1.8 × 1.8m : num1) would be suitable. A location of the queue detector and the spillback prevention detector considering the link length, the pedestran crossing is be or not and the estimation range of queue. And if the link length is shorter than 250m, locations of queue detector and spillback protect detector must be considered in the respect of queue management.

  • PDF

Development of Vehicle Arrival Time Prediction Algorithm Based on a Demand Volume (교통수요 기반의 도착예정시간 산출 알고리즘 개발)

  • Kim, Ji-Hong;Lee, Gyeong-Sun;Kim, Yeong-Ho;Lee, Seong-Mo
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.2
    • /
    • pp.107-116
    • /
    • 2005
  • The information on travel time in providing the information of traffic to drivers is one of the most important data to control a traffic congestion efficiently. Especially, this information is the major element of route choice of drivers, and based on the premise that it has the high degree of confidence in real situation. This study developed a vehicle arrival time prediction algorithm called as "VAT-DV" for 6 corridors in total 6.1Km of "Nam-san area trffic information system" in order to give an information of congestion to drivers using VMS, ARS, and WEB. The spatial scope of this study is 2.5km~3km sections of each corridor, but there are various situations of traffic flow in a short period because they have signalized intersections in a departure point and an arrival point of each corridor, so they have almost characteristics of interrupted and uninterrupted traffic flow. The algorithm uses the information on a demand volume and a queue length. The demand volume is estimated from density of each points based on the Greenburg model, and the queue length is from the density and speed of each point. In order to settle the variation of the unit time, the result of this algorithm is strategically regulated by importing the AVI(Automatic Vehicle Identification), one of the number plate matching methods. In this study, the AVI travel time information is composed by Hybrid Model in order to use it as the basic parameter to make one travel time in a day using ILD to classify the characteristics of the traffic flow along the queue length. According to the result of this study, in congestion situation, this algorithm has about more than 84% degree of accuracy. Specially, the result of providing the information of "Nam-san area traffic information system" shows that 72.6% of drivers are available.

Dimensioning leaky bucket parameters considering the cell delay variation (셀 지연 변이를 고려한 리키 버킷 계수 결정 방법)

  • 이준원;이병기
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.8
    • /
    • pp.31-38
    • /
    • 1995
  • In this paper, we consider the leaky bucket parameter dimensioning problem in the presence of the cell delay variation(CDV) which arises at the customer premises network dud to the multiplexing with other traffic streams. We consider an ATM multiplexer in which a single CBR stream and several heterogeneous VBR traffic streams are multiplexed. Choosing an MMPP model for the bursty traffic streams, we derive an (MMPP+DD)/D/1/K queueing model for the evaluation of the CDV experienced by the CBR stream. We first evaluate the equilibrium queue length distribution embedded at tagged-cell arrival-time instants, based on whcih we calcuate the inter-cell time distribution and the distribution kof the number of tagged-cell departures in an arbitrary interval. Then we apply the analysis to the dimensionging problem of the leaky bucket parameters, examining how the employed traffic model affects the determination of the bucket size. Through numerical examples, we confirm that the Poisson traffic model can underestimate the bucket size, thus causing a considerable blocking probability for compliant use cells while the MMPP model can optimally design the bucket size which keeps the blocking probability under the target value.

  • PDF

A Construction and Operation Analysis of Group Management Network about Control Devices based on CIM Level 3 (CIM 계층 3에서 제어 기기들의 그룹 관리 네트워크 구축과 운영 해석)

  • 김정호
    • The Journal of Society for e-Business Studies
    • /
    • v.4 no.1
    • /
    • pp.87-101
    • /
    • 1999
  • To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the control devices located in common manufacturing zone and operated by connecting them. In this paper, functional standard of the network layers are set as physical and data link layer of IEEE 802.2, 802.4, and VMD application layer and ISO-CIM reference model. Then, they are divided as minimized architecture, designed as group objects which perform group management and service objects which organizes and operates the group. For the stability in this network, this paper measures the variation of data packet length and node number and analyzes the variated value of the waiting time for the network operation. For the method of the analysis, non-exhausted service method are selected, and the arrival rates of the each data packet to the nodes that are assumed to form a Poission distribution. Then, queue model is set as M/G/1, and the analysis equation for waiting time is found. For the evalution of the performance, the length of the data packet varies from 10 bytes to 100 bytes in the operation of the group management network, the variation of the wating time is less than 10 msec. Since the waiting time in this case is less than 10 msec, response time is fast enough. Furthermore, to evaluate the real time processing of the group management network, it shows if the number of nodes is less than 40, and the average arrival time is less than 40 packet/sec, it can perform stable operation even taking the overhead such as software delay time, indicated packet service, and transmissin safety margin.

  • PDF

A comparative analysis on switch performances for congestion controls in ATM Networks (ATM망에서 폭주 제어를 위한 스위치 성능의 비교 분석)

  • 조미령;이상훈
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.4
    • /
    • pp.547-564
    • /
    • 2001
  • In this paper a simulation has been performed to compare and evaluate the performance between the EPRCA(Enhanced Proportional Rate Control Algorithm) and EMRCA(Explicit Max_min Rate Control Algorithm) switches. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. The EMRCA switch is more stable than the EPRCA switch and reduces its buffer size. Also, it achieves a higher utilization rate of the link bandwidth than the EPRCA switch. The hardware complexity of the EMRCA switch is significantly lower than the EPRCA and other rate-based switches. Since it eliminates the necessity of the floating-point operation for calculation of the MACR(Mean Allowed Cell Rate) at the switch.

  • PDF