• Title/Summary/Keyword: Overflow traffic

Search Result 59, Processing Time 0.026 seconds

Overflow Probability Analysis and Bandwidth Allocation for Traffic Regulated by Dual Leaky Bucket (Dual Leaky Bucket 에 의해 규제되는 트래픽의 오버플로 확률분석과 대역폭 할당방법)

  • Yoon, Y.H.;Lie, C.H.;Hong, J.S.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.3
    • /
    • pp.404-410
    • /
    • 1999
  • A scheme of more exact overflow probability analysis is proposed for traffic regulated by dual leaky bucket. To each regulated traffic stream is allocated bandwidth and buffer independent of other traffic stream and overflow occurs when total bandwidth or buffer allocated to each traffic exceed link capacity or physical buffer size. Ratio of buffer and bandwidth allocated to each traffic stream is assumed to be constant, and this ratio is larger than the ratio of physical buffer and bandwidth due to buffer sharing effect. Numerical experiments show that this sharing effect have significant influence on overflow probability and effective bandwidth.

  • PDF

COMPARISONS OF LOSS FORMULAS FOR A CIRCUIT GROUP WITH OVERFLOW TRAFFIC

  • Park, Chul-Geun;Han, Dong-Hwan
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.1_2
    • /
    • pp.135-145
    • /
    • 2012
  • Traditionally, ERM (Equivalent Random Method) is used to determine number of circuits in an overflow circuit group with rough traffic which has vmr(variance to mean ratio) greater than one. Recently, IPP(Interrupted Poisson Process) approximate method which represents the collective feature of the overflow has been introduced. The negative binomial loss formula can be applied to determine the required number of circuits in the overflow circuit group. In this paper, we deal with the negative binomial loss formula and determination method of number of circuits. We also analyze and compare these three loss formulas.

QUEUE RESPONSE APPROXIMATION WITH DISCRETE AUTOREGRESSIVE PROCESSES OF ORDER 1

  • Kim, Yoo-Ra;Hwang, Gang-Uk
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.12 no.1
    • /
    • pp.33-39
    • /
    • 2008
  • We consider a queueing system fed by a superposition of multiple discrete autoregressive processes of order 1, and propose an approximation method to estimate the overflow probability of the system. Numerical examples are provided to validate the proposed method.

  • PDF

A Study on the Multiplexing of ISDN D-channel using Statistical Multiplexer (총계적 다중 방식을 이용한 ISDN D채널 다중화에 관한 연구)

  • 구제길;김영철;이호준;조규섭;박병철;김병찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.4
    • /
    • pp.268-279
    • /
    • 1986
  • Recently, the improtance of the ISDN has been emphasized for the new services in the future information society. In this paper, new application of statistical multiplexer which can be used for CCITT D-channel multiplexing is suggested. The basic architecture of statistical multiplexer which can interleave eleven 16Kbps D-channels into one 64Kbps B-channel is also proposed. The necessary buffer size was estimated by computer simulation considering data traffic intensity, signal arrival length distribution and buffer overflow probability. Based on this buffer size, the basic architecture of the statistical multiplexer has been survetyed and hardware design principles are also studied.

  • PDF

Performance Improvement on RED Based Gateway in TCP Communication Network

  • Prabhavat, Sumet;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.782-787
    • /
    • 2004
  • Internet Engineering Task Force (IETF) has been considering the deployment of the Random Early Detection (RED) in order to avoid the increasing of packet loss rates which caused by an exponential increase in network traffic and buffer overflow. Although RED mechanism can prevent buffer overflow and hence reduce an average values of packet loss rates, but this technique is ineffective in preventing the consecutive drop in the high traffic condition. Moreover, it increases a probability and average number of consecutive dropped packet in the low traffic condition (named as "uncritical condition"). RED mechanism effects to TCP congestion control that build up the consecutive of the unnecessary transmission rate reducing; lead to low utilization on the link and consequently degrade the network performance. To overcome these problems, we have proposed a new mechanism, named as Extended Drop slope RED (ExRED) mechanism, by modifying the traditional RED. The numerical and simulation results show that our proposed mechanism reduces a drop probability in the uncritical condition.

  • PDF

The Token Bucket Scheme to solve Buffer Overflow of Video Streaming in Wireless Network (무선 네트워크에서 비디오 스트리밍의 버퍼 오버플로우를 해결하기 위한 토큰버킷 기법)

  • Lee, Hyun-No;Kim, Dong-Hoi
    • Journal of Digital Contents Society
    • /
    • v.16 no.3
    • /
    • pp.365-371
    • /
    • 2015
  • In wireless network, the amount of video streaming packet information in receiver replay buffer can be varied according tothe wireless network condition. By the effect, unforeseeable delay and jitter are generated and then busty video traffics can be made. If the amount of buffer information coming in receiver replay buffer is larger than the amount of a specific buffer information, buffer overflow is generated. Such a problem makes the image skip effect and packet loss, and then causes the quality degradation and replay discontinuity of the video streaming service in destination receiver. To solve the buffer overflow problem, this paper applies the token bucket for the busty traffic to the receiver terminal and analyzes the effect of the token bucket. The simulation result using NS-2 and JSVM shows that the proposed scheme with the token bucket has significantly better performance than the conventional scheme without the token bucket in terms of overflow generation number, packet loss rate and PSNR.

The Effect of the Buffer Size in QoS for Multimedia and bursty Traffic: When an Upgrade Becomes a Downgrade

  • Sequeira, Luis;Fernandez-Navajas, Julian;Saldana, Jose
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3159-3176
    • /
    • 2014
  • This work presents an analysis of the buffer features of an access router, especially the size, the impact on delay and the packet loss rate. In particular, we study how these features can affect the Quality of Service (QoS) of multimedia applications when generating traffic bursts in local networks. First, we show how in a typical SME (Small and Medium Enterprise) network in which several multimedia flows (VoIP, videoconferencing and video surveillance) share access, the upgrade of the bandwidth of the internal network may cause the appearance of a significant amount of packet loss caused by buffer overflow. Secondly, the study shows that the bursty nature of the traffic in some applications traffic (video surveillance) may impair their QoS and that of other services (VoIP and videoconferencing), especially when a certain number of bursts overlap. Various tests have been developed with the aim of characterizing the problems that may appear when network capacity is increased in these scenarios. In some cases, especially when applications generating bursty traffic are present, increasing the network speed may lead to a deterioration in the quality. It has been found that the cause of this quality degradation is buffer overflow, which depends on the bandwidth relationship between the access and the internal networks. Besides, it has been necessary to describe the packet loss distribution by means of a histogram since, although most of the communications present good QoS results, a few of them have worse outcomes. Finally, in order to complete the study we present the MOS results for VoIP calculated from the delay and packet loss rate.

Calculation of Blocking Probabilities in the Multi-slot Connection Traffic (다원 트래픽의 호손율 계산)

  • Kim, Seung-Hwan;Sung, Dan-Keun;Kim, Dae-Young
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.958-961
    • /
    • 1987
  • Four computational algorithms are discussed and compared which calculate the blocking probabilities in the multi-slot connection traffic for the wide-band services. The computational complexity and time can be significantly reduced, and the overflow and underflow problem can be circumvented as well, by a newly proposed algorithm, the last one.

  • PDF

Implement of Call blocking Probabilities in Mobile Communication Networks (이동통신 네트워크에서 호 블록킹 확률의 개선 방안)

  • Park, Sang-Hyun;Oh, Youn-Chil;Lee, Young-Seok;Yang, Hae-Kwon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.1
    • /
    • pp.67-74
    • /
    • 2009
  • This paper presents a method of improving the service availability by distributing the traffic of voice/data calls over the multi-layer cells in a mobile communication network. The traffic model is described and the call handling performance is analyzed. In our method, a fast moving call is moved to and serviced in the upper layer cell. A call is also moved upward when an overflow occurs. But unlike other methods, the call that is moved upward in the overflow case is the one which has the longest sojourn time in the cell. Moreover, when the call that was moved upward due to overflow condition stays longer than a certain period of time in the upper layer cell, the system moves the call back to the lower layer in order to save the more expensive resources of the upper layer cell. Call handling performance of this method evaluated from M/M/C/K models shows clear improvement with respect to call blocking probability and forced termination probability.

Analysis of Traffic Control System for Supporting MCS Multicasting on ATM Subnetworks (ATM 서브망에서 MCS 멀티캐스트 구현을 위한 전송 제어 시스템의 성능 평가)

  • Park, Sang-Joon;Lee, Hyo-Jun;Kim, Kwan-Joong;Kim, Young-Han;Kim, Byung-Gi
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.6
    • /
    • pp.48-53
    • /
    • 1997
  • The multicasting of MCS(Multicast Server) requires a effective traffic control scheme to prevent buffer overflow on ATM subnetworks. This paper considers MCS multicasting to TCP packets, and propose EPD + SPD scheme(Early Packet Discard-same Source Packet Discard) using common buffer. When the threshold of output buffer is reached, MCS drops an entire packet prior to buffer overflow, so that corrupted packets will not be transmitted by the server. And SPD scheme show that the EPD + SPD results in higher TCP throughput than that of tail drop and EPD + DFF.

  • PDF