• Title/Summary/Keyword: Queuing delay

Search Result 109, Processing Time 0.03 seconds

A Study of the delay pattern of voice traffic for end-to-end users on the voice IP (VoIP 상에서 다양한 응용 서비스 트래픽에 따른 종단간 사용자의 음성 트래픽 지연 변화 연구)

  • 윤상윤;정진욱
    • Journal of the Korea Society for Simulation
    • /
    • v.10 no.2
    • /
    • pp.15-24
    • /
    • 2001
  • In this paper we study the delay patterns of voice traffic for end-to-end users Caused by serving the whole bunch of applications traffic at the same time on the Voice over Internet Protocol (VoIP) network. Given the current situation that voice traffic is served along with other application services on the VoIP network, it is quite necessary to figure out how and by what the voice traffic requiring high QoS is delayed. We compare the delay performance of voice traffic on the VoIP network under FIFO with the one under Weighted Fair Queuing(WFQ), and discover the differences of the delay performance resulting from the use of different voice codec algorithms. The results of our study show that using the voice codec algorithm with a higher coding rate nd the queuing algorithm of WEQ can provide users with high-quality voice traffic.

  • PDF

The Analysis of Priority Output Queuing Model by Short Bus Contention Method (Short Bus contention 방식의 Priority Output Queuing Model의 분석)

  • Jeong, Yong-Ju
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.459-466
    • /
    • 1999
  • I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.

  • PDF

Fair Queuing Algorithm Minimizing Packet Delay in Enterprise Network (엔터프라이즈 네트워크에서 패킷 지연시간을 최소화하는 공정 큐잉 알고리즘)

  • Youn, Yeo-Hoon;Kim, Tai-Yun
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.21-30
    • /
    • 2002
  • Nowadays the fair queuing field is studied actively for solving the unfair queuing problem which degrades the service performance of various applications on network. Above all DRR is a scheme that has lower work complexity and can be implemented easily. It guarantees the fair service by serving each queue every round Service Quantum(SQ) that includes the service deficit of the previous round. But it increases the delay by the numbers of unnecessary resetting of SQ or round circulation for the service that have the packet size over maximum several kbyte. In this paper, We propose the method that sets SQ dynamically to minimize this problem and the method that minimizes the work complexity on processing of packet. The proposed scheme minimizes the delay on various applications in enterprise environment by setting SQ dynamically and processing the packet simply.

An Experimental Delay Analysis Based on M/G/1-Vacation Queues for Local Audio/Video Streams

  • Kim, Doo-Hyun;Lee, Kyung-Hee;Kung, Sang-Hwan;Kim, Jin-Hyung
    • ETRI Journal
    • /
    • v.19 no.4
    • /
    • pp.344-362
    • /
    • 1997
  • The delay which is one of the quality of service parameters is considered to be a crucial factor for the effective usage of real-time audio and video streams in interactive multimedia collaborations. Among the various causes of the delay, we focus in this paper on the local delay concerned with the schemes which handle continuous inflow of encoded data from constant or variable bit-rate audio and video encoders. We introduce two kinds of implementation approaches, pull model and push model. While the pull model periodically pumps out the incoming data from the system buffer, the push model receives events from the device drivers. From our experiments based on Windows NT 3.51, it is shown that the push model outperforms the other for both constant and variable bit-rate streams in terms of the local delay, when the system suffers reasonable loads. We interpret this experimental data with M/G/1 multiple vacation queuing theories, and show that it is consistent with the queuing theoretic interpretations.

  • PDF

TCP Delayed Window Update Mechanism for Fighting the Bufferbloat

  • Wang, Min;Yuan, Lingyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4977-4996
    • /
    • 2016
  • The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. Researchers have made three types of suggestions to solve the bufferbloat problem. One is End to End (E2E) congestion control, second is deployment of Active Queue Management (AQM) techniques and third is the combination of above two. However, these solutions either seem impractical or could not obtain good bandwidth utilization. In this paper, we propose a Transmission Control Protocol(TCP)delayed window update mechanism which uses a congestion detection approach to predict the congestion level of networks. When detecting the network congestion is coming, a delayed window update control strategy is adopted to maintain good protocol performance. If the network is non-congested, the mechanism stops work and congestion window is updated based on the original protocol. The simulation experiments are conducted on both high bandwidth and long delay scenario and low bandwidth and short delay scenario. Experiment results show that TCP delayed window update mechanism can effectively improve the performance of the original protocol, decreasing packet losses and queuing delay while guaranteeing transmission efficiency of the whole network. In addition, it can perform good fairness and TCP friendliness.

On the QoS Behavior of Self-Similar Traffic in a Converged ONU-BS Under Custom Queueing

  • Obele, Brownson Obaridoa;Iftikhar, Mohsin;Kang, Min-Ho
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.286-297
    • /
    • 2011
  • A novel converged optical network unit (ONU)-base station (BS) architecture has been contemplated for next-generation optical-wireless networks. It has been demonstrated through high quality studies that data traffic carried by both wired and wireless networks exhibit self-similar and long range dependent characteristics; attributes that classical teletraffic theory based on simplistic Poisson models fail to capture. Therefore, in order to apprehend the proposed converged architecture and to reinforce the provisioning of tightly bound quality of service (QoS) parameters to end-users, we substantiate the analysis of the QoS behavior of the ONU-BS under self-similar and long range dependent traffic conditions using custom queuing which is a common queuing discipline. This paper extends our previous work on priority queuing and brings novelty in terms of presenting performance analysis of the converged ONU-BS under realistic traffic load conditions. Further, the presented analysis can be used as a network planning and optimization tool to select the most robust and appropriate queuing discipline for the ONU-BS relevant to the QoS requirements of different applications.

Improving the Implementation Complexity of the Latency-Optimized Fair Queuing Algorithm (최적 레이턴시 기반 공정 큐잉 알고리즘의 구현 복잡도 개선)

  • Kim, Tae-Joon;Suh, Bong-Sue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6B
    • /
    • pp.405-413
    • /
    • 2012
  • WFQ(Weighted Fair Queuing) is the most popular fair queuing algorithm to guarantee the Quality-of-Service(QoS), but it has the inherent drawback of a poor resource utilization, particularly under the low rate traffic requiring a tight delay bound. It was recently identified that the poor utilization is mainly due to non-optimized latency of a traffic flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced. The LOFQ algorithm, however, renews their optimal latencies for all flows whenever a new flow arrives, which results in the high implementation complexity of O($N^2$).This paper is to reduce thecomplexity to O(1). The proposed method is first to derive the optimal latency index function from the statistical QoS characteristics of the offered load, and then to simply calculate the optimal latency index of the arriving flow using the function.

Algorithm of GTS Time Slots Allocation Based on Weighted Fair Queuing in Environments of WBAN (WBAN 환경에서 Weighted Fair Queuing 기반의 GTS 타임 슬롯 할당 알고리즘)

  • Kim, Kyoung-Mok;Jung, Won-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.45-56
    • /
    • 2011
  • WBAN is short range wireless communication technology which is consists of several small devices close to, attached to or implanted into the human body. WBAN is classified into between medical and non-medical by applications based on technology and medical data with periodic characteristics is used the GTS method for transmitting data to guarantee the QoS. In this paper we proposed algorithm that resolve lack of GTSs while data transmit GTS method in superframe structure of WBAN. Coordinator dynamically allocates GTSs according to the data rate of devices and make devices share GTSs when lack of GTSs. We compared delay bounds, throughput for performance evaluation of the proposed algorithm. In other words, we proposed algorithm adaptive WFQ scheduling that GTS allocation support differential data rate in environments of WBAN. The experiment results show the throughput increased and the maximum delay decreased compared with Round Robin scheduling.

Tandem Architecture for Photonic Packet Switches

  • Casoni, Maurizio;Raffaelli, Carla
    • Journal of Communications and Networks
    • /
    • v.1 no.3
    • /
    • pp.145-152
    • /
    • 1999
  • A new switch architecture is presented to enhance out-put queuing in photonic packet switches. Its appkication is for a packet switching enviroment based on the optical transport of fixed length packets. This architecture consists of a couple of cas-cading switching elements with output queuing, whose buffer ca-pacity is limited by photonic technology. The introduction of a suitable buffer management allows a very good and balanced ex-ploitation of the available optical memories, realized with fiber de-lay lines. In particular, packet loss performance is here evaluated showing the improvement with respect to the single switch and a way to design large optical switches is shown in order to meet broadband network requirements.

  • PDF

Comparative Performance Analysis of Network Security Accelerator based on Queuing System

  • Yun Yeonsang;Lee Seonyoung;Han Seonkyoung;Kim Youngdae;You Younggap
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.269-273
    • /
    • 2004
  • This paper presents a comparative performance analysis of a network accelerator model based on M/M/l queuing system. It assumes the Poisson distribution as its input traffic load. The decoding delay is employed as a performance analysis measure. Simulation results based on the proposed model show only $15\%$ differences with respect to actual measurements on field traffic for BCM5820 accelerator device. The performance analysis model provides with reasonable hardware structure of network servers, and can be used to span design spaces statistically.

  • PDF