• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3269-3277
• /
• 1999

To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we propose a router mechanism, Extended FRED(ex-FRED). In this paper, we catagorize the TCP controlled traffics into robust and fragile traffic and discuss several unfairness conditions between them caused by the diverse applications. For example, fragile traffic from bursty application cannot use its fair share due to their slow adaptation. Ex-FRED modifies the FRED(Fair Random Early Drop), which can show wrong information due to the narrow view of actual buffer. Therefore, Ex-FRED uses per-flow accounting in larger virtual buffer to impose an each flow a loss rate that depends on the virtual buffer use of a flow. The simulation results show that Ex-FRED uses fair share and has good throughput.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.142-145
• /
• 1999

In this paper, delay performances are evaluated and compared for three dual-plane switch architectures; dual input queue/dual switching plane (DQDP The terms of DQDP, DQDP-PS and DQDP-GQ were not used in [Turner88], [Lee96] and [Son97]. All these tern are designated in this letter for convenience.) switch, DQDP with plane selector (DQDP-PS) switch and DQDP based on output group queueing (DQDP-OGQ) switch. We show that under random traffic these switches give almost identical delay performances to that of the output queueing switch but under bursty traffic only the DQDP-PS and the DQDP-OGQ switches ran do.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.199-208
• /
• 2002

The downlink rate scheduling problem is considered for CDMA networks with multiple users carrying packets of heterogeneous traffic (voice/audio only, bursty data only or mixed traffic), with each type having its own distinct quality of service requirements. Several rate scheduling algorithms are developed, the common factor of which is that part of the decision on which users to serve is based on a function of the deadline of their head-ofline packets. An approach of Andrews et al., in which the basic Earliest-Deadline-First algorithm is studied for similar systems, is extended to result in better performance by considering a more efficient power usage and by allowing service of more than one user per timeslot if the power resources permit it. Finally, the performance of the proposed schemes is compared through simulations.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1554-1561
• /
• 1998

When the superposition of realtime traffic and non-realtime traffic is applied to the ATM network, the successive cell loss(block loss) is more influential on the quality of service (QoS) of two traffic streams than the single loss in case of bursty traffic. Block loss can be identified as an important performance measure because of delay-oriented policy for realtime traffic. In this paper, we consider the system with the two-level overload control reducing of the recurrence of shut-down periods and develop a recursive algorithm to obtain both block loss and cell loss probabilities of both traffic. We can see that it gives the more precise and diverse investigations on performance analysis of queuing strategy.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.62-62
• /
• 1999

In this paper, we propose a new technique of estimating tail of steady-state queue length distribution; Pr(Q>q), fo ATM multiplexer. Pr(Q>q) is a fundamental measure of network congestion. Assessing Pr(Q>q) properly is crucial for design and control of ATM networks. Data traffic pattern of high-speed networks is highly correlated and bursty. Estimating Pr(Q>q) is very difficult because of correlation and burstiness. We estimate entropy(rate-function) using large deviation principles and threshold bootstrap. Simulation studies are conducted to compare the performance of an existing method and our new method.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.383-386
• /
• 2004

본 논문에서는 패킷 CDMA 망에서 버스트 트래픽 서비스를 위한 MAC 프로토콜을 제안한다. 제안한 프로토콜은 임의 접속에 의한 패킷 충돌을 줄이기 위하여 코드 상태 감지 및 예약 기법을 사용한다 이를 위하여 기지국에서는 매 프레임마다 예약된 코드의 상태를 방송하고, 단말기는 이를 기반으로 임의의 예약되지 않은 코드를 선택하여 프리앰블을 전송한다. 기지국으로부터 코드 예약에 대한 응답을 수신한 단말기는 남은 프레임 동안 패킷을 전송한다. 한편 전송할 패킷이 단말기 버퍼에 남아있는 경우, 기지국에서는 코드의 상태를 예약상태로 방송하고, 단말기에서는 다음 프레임에서 예약한 코드를 통하여 남은 패킷을 전송한다.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1184-1195
• /
• 1998

In this paper, we compare vaious input-buffered ATM switch architectures in structures on input buffer and switching fabric, the resons for performance improvement and degradation, arbitration scheme and maximum throughput, and present comparative merits and demerits of each architecture under random and bursty traffic. We also analyze the prformance of combined architectures of windowing scheme, destination-queueing based input-port expansion schemeand output-port expansion scheme, and show that it is possible to achieve 100% throughput with combined scheme of destination-queueing based input-port expansion scheme and output-port expansio scheme when the number of output group is 2 and output port expansion ratio is 2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.2
• /
• pp.99-113
• /
• 1992

In general, TDMA and FDMA have been used for multiple access communication methods. Recently. However, ALOHA and CSMA protocols came to exist as new schemes for VSAT data networks and LANs, respectively. These schemes are proven to be effective for packet switched communication systems that has bursty traffic but packet collisions. In this paper we analyze capture statistics arising from fading channels in packet radio communication systems in the context of ALOHA protocol. We derive general results of the exact form of capture probabilities and present numerical data for wide range of fading parameters. Since the capture probabilities are found to approach zero when the number of transmitted signals become larger, we are able to determine the achievable channel throughput by a least squares fitting of an exponential-type function to the probabilities.