• Journal of Communications and Networks
• /
• 제6권1호
• /
• pp.78-87
• /
• 2004

This paper presents deterministic, worst-case analysis of a queueing system whose multiple homogeneous input streams are regulated by the associated leaky buckets and the queueing system that has a single stream regulated by the jumping-window. Queueing delay averaged over all items is used for performance measure, and the worst-case input traffic and the worst-case performance are identified for both queueing systems. For the former queueing system, the analysis explores different phase relations among leaky-bucket token generations. This paper observes how the phase differences among the leaky buckets affect the worst-case queueing performance. Then, this paper relates the worst-case performance of the former queueing system with that of the latter (the single stream case, as in the aggregate streams from many users, whose item arrivals are regulated by one jumping-window). It is shown that the worst-case performance of the latter is identical to that of the former in which all leaky buckets have the same phase and have particular leaky bucket parameters.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.117-120
• /
• 1999

Input queueing is useful for high bandwidth switches and routers because of lower complexity and fewer circuits than output queueing. The input queueing switch, however, suffers HOL-Blocking, which limits the throughput to 58%. To get around this low throughput, we propose a simple scheduling algorithm called Synchronous Input Port (SIP). This method synchronize packets and switching without blocking, which is shown to have better performance over the established algorithms

• 전자공학회논문지S
• /
• 제35S권4호
• /
• pp.10-19
• /
• 1998

With the advent of high-speed networks, the increasingly stringent performance requeirements are being placed on the underlying switching systems. Under these circumstances, simulation methods for evaluating the performace of such a switch requires vast computational cost and accordingly the importance of anlytical methods increases. In general, the performance analysis of a switch architecture is also a very difficult task in that the conventional queueing system such as switching systems, which consists of a large numbe of queues which interact with each other in a fiarly complicated manner. To overcome these difficulties, most of the past research results assumed that multiple queues become decoupled as the switch size grows unboundely large, which enables the conventional queueing theory to be applied. In this apepr, w analyze a non-blocking space-division ATM swtich with input queueing, and prove analytically the pheonomenon that virtual queues formed by the head-of-line cells become decoupled as the switch size grows unboundedly large. We also establish various properties of the limiting queue size processes so obtained and compute the maximum throughput associated with ATM switches with input queueing.

• Communications for Statistical Applications and Methods
• /
• 제9권3호
• /
• pp.649-663
• /
• 2002

We consider an unlimited fluid queueing model which has Fractional Brownian motion(FBM) as an input and a single server of constant service rate. By using the result of Duffield and O'Connell(6), we investigate the asymptotic tail-distribution of the stationary work-load. When there are multiple homogeneous FBM inputs, the workload distribution is similar to that of the queue with one FBM input; whereas for the heterogeneous sources the asymptotic work-load distributions is dominated by the source with the largest Hurst parameter.

• 대한전자공학회논문지TC
• /
• 제38권12호
• /
• pp.58-66
• /
• 2001

입력큐방식의 교환기는 간결하며 고속교환을 위한 효과적인 교환방법이나 입력 측의 큐에서 발생하는 HOL-블로킹(HOL-Blocking)은 패킷들의 대기시간을 크게 증가시켜 전체 시스템의 효율을 58%로 제한한다. 이를 해결하는 방법은 별도의 스케줄러(scheduler, contention controller)를 두어 블로킹의 방지 및 높은 처리율을 얻고 있다. 대부분의 스케줄러의 구현은 중앙집중방식으로 구현되는데 이는 다양한 교환기의 구성을 어렵게 한다. 본 논문에서는 입력포트별로 간단하면서 분산된 형태의 스케줄러를 소개하고 모의실험을 통하여 성능을 검증한다.

• ETRI Journal
• /
• 제22권3호
• /
• pp.1-9
• /
• 2000

Self-Clocked Fair Queueing (SCFQ) algorithm has been considered as an attractive packet scheduling algorithm because of its implementation simplicity, but it has unbounded delay property in some input traffic conditions. In this paper, we propose a Rate Proportional SCFQ (RP-SCFQ) algorithm which is a rate proportional version of SCFQ. If any fair queueing algorithm can be categorized into the rate proportional class and input is constrained by a leaky bucket, its delay is bounded and the same as that of Weighted Fair Queueing (WFQ) which is known as an optimal fair queueing algorithm. RP-SCFQ calculates the timestamps of packets arriving during the transmission of a packet using the current value of system potential updated at every packet departing instant and uses a starting potential when it updates the system potential. By doing so, RP-SCFQ can have the rate proportional property. RP-SCFQ is appropriate for high-speed packet-switched networks since its implementation complexity is low while it guarantees the bounded delay even in the worst-case input traffic conditions.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2003년도 추계 학술발표회 논문집
• /
• pp.1-8
• /
• 2003

The traffic patterns of today's IP networks exhibit two important properties: self-similarity and long-range dependence. The fractional Brownian motion is widely used for representing the traffic model with the properties. We consider a single server fluid queueing system with input process of a fractional Brownian motion type. Formulas for effective bandwidth are derived in a single source and multiple source cases.

• Journal of Electrical Engineering and information Science
• /
• 제2권6호
• /
• pp.56-63
• /
• 1997

Under most system assumptions, closed form solutions of performance measures for ATM switches with input queueing are not available. In this paper, we present expressions and bounds for the derivatives of cell loss probabilities with respect to the arrival rate evaluated at a zero arrival rate. These bounds are used to give an approximation by Taylor expansion, thereby providing an economical way to estimate cell loss probabilities in light traffic.

• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 2007년도 춘계학술대회
• /
• pp.461-465
• /
• 2007

The BMAP/M/N/O queueing system operating in Markovian random environment is investigated. The stationary distribution of the system is calculated. Loss probability and other performance measures are calculated. Numerical experiments which show the necessity of taking into account the influence of random environment and correlation in input flow are presented.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.271-275
• /
• 2005

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.