• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.517-526
• /
• 2001

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). While active queue management in routers and gateways can potentially reduce total packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use queue lengths as the indicator of the severity of congestion. In this paper, in order to solve this problem, a new active queue management algorithm called MRED(Modified Random Early Detection) is proposed. MRED computes the packet drop probability based on our heuristic method rather than the simple method used in RED. Using simulation, MRED is shown to perform better than existing queue management schemes. To analyze the performance, we also measure throughput of traffics under the FIFO control, and compared the performance with that of this MRED system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.8
• /
• pp.710-718
• /
• 1991

In this pape, an analysis approach for the performance of serial search burst-format direct sequence spread-spectrum code acquisiion system using matched filter is presented. And an acquistion system using analog matched filter is analyzed by this approach. And special consideration is focused on the effect of the code autocorelation sideobes. The basic idea of thi approach is the constuction of state tansition digram at the time of random packet arrival and the calculation of the packet loss probability, which is deveoped in terms of the following parameters: the false alarm probability. the etection probability, and the probability of receiver blocking obtained from the blocked customers cleae queeing system model. The analysis results reveal that the performance of the acquisition system is degraded by the effet of the code autocorrelation sidelobes above a certain value of SN/chip.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.474-479
• /
• 2004

This paper describes a feedback-based congestion control algorithm to improve TCP performance over wireless network. In this paper, we adjust the packet marking probability at the router for Max-Min fair sharing of the bandwidth and full utilization of the link. Using the successive ECN (Explicit Congestion Notification), the proposed algorithm regulates the window size to avoid the congestion and sees the packet loss only due to the wireless link error. Based on the asymptotic analysis, it is shown that the proposed algorithm guarantees the QoS of the wireless TCP. The effectiveness of the proposed algorithm is demonstrated by simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10A
• /
• pp.1756-1763
• /
• 2001

In this paper, we propose an ATM-LAN IWU(interworking unit) with threshold based dynamic bandwidth allocation scheme. We analyze a discrete-time based finite queueing model with deterministic service times in order to investigate the performance of the proposed scheme. It is known that the arrival process of IP packets is bursty. So we use an MMPP(Markov Modulated Poisson Process) to model the bursty input traffic. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effects of the thresholds on the performance of the DBAS(dynamic bandwidth allocation scheme).

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.154-162
• /
• 2001

In this paper, we investigate the scheduling algorithm of router system for Internet service based on the qualify-of-service (QoS) level of the input source traffics. We suggest an approprite scheduling algorithm in order to satisfy their QoS requirements for the loss-sensitive traffic and delay-sensitive traffic. For this purpose, we first study the service requirements of the multiplexer in Internet and the definition of QoS based on the ITU-T white recommendations. Second. we suggest a functional architecture of the multiplexer and the scheduling algorithm to satisfy various QoS requirements for Internet service. Finally. the performance measures of interest, namely steady-state packet loss probability and average delay, are discussed by simulation results.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.4
• /
• pp.32-39
• /
• 1995

In this paper, a timer thresholds tuning algorithm is proposed, satisfying the required response time for traffic with time-critical applications and asynchronous traffic in FDDI network. Under light and medium load, priorities and timer thresholds play a minor role for medium access control. In these cases all quenes are served exhaustively with a ver high service probability and the packet loss probability approaches almost zero. Under overload condition, however, the performance of the FDDI Network is completely determined by the selection of the timer thresholds. The timer thresholds tuned by mathematical results is confirmed by simulation results using SIMAN/UNIX package. The allocation of guaranteed bandwidth can be controlled easily by tuning the timer thresholds according to the proposed rules.

• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.357-365
• /
• 2009

To effectively exploit the underlying network bandwidth while maximizing user perceivable QoS, mandatory to make proper estimation on packet loss and queuing delay of the underling network. This issue is further emphasized in wireless network environment where network bandwidth is scarce resource. In this work, we focus our effort on developing performance model for wireless network. We collect packet trace from actually wireless network environment. We find that packet count process and bandwidth process in wireless environment exhibits long range property. We extract key performance parameters of the underlying network traffic. We develop an analytical model for buffer overflow probability and waiting time. We obtain the tail probability of the queueing system using Fractional Brown Motion (FBM). We represent average queuing delay from queue length model. Through our study based upon empirical data, it is found that our performance model well represent the physical characteristics of the IEEE 802.11b network traffic.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.139-156
• /
• 1993

Various ATM switches have been proposed since Asynchronous Transfer Mode (ATM) was recognized as appropriate for implementing broadband integrated services digital network (BISDN). An ATM switching network may be evaluated on two sides : traffic performances (maximum throughput, delay, and packet loss probability, etc.) and structural features (complexity, i.e. the number of switch elements necessary to construct the same size switching network, maintenance, modularity, and fault tolerance, etc.). ATM switching networks proposed to date tend to show the contrary characteristics between structural features and traffic performance. The Knockout Switch, which is well known as one of ATM switches, shows a good traffic performance but it needs so many switch elements and buffers. In this paper, we propose an input and output buffered Knockout Switch for the purpose of reducing the number of switch elements and buffers of the existing Knockout Switch. We analyze the traffic performance and the structural features of the proposed switching architecture through a discrete time Markov chain and compare with those of the existing Knockout Switch. It was found that the proposed architecture could reduce more than 40 percent of switch elements and more than 30 percent of buffers under a given requirement of cell loss probability of the switch.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3684-3693
• /
• 2000

In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.113-121
• /
• 2006

To reduce switch cost, the optimum numbers of tunable wavelength converters (TWCs) and internal wavelengths required for contention resolution of asynchronous and variable length packets like internet traffics, is presented in the optical packet switch (OPS) with the shared fiber delay line (FDL) buffer. To optimize TWCs and internal wavelength related to on OPS design cost, we proposed a scheduling algorithm for the limited TWCs and internal wavelengths. For three TWC alternatives (not shared, partially shared, and fully shared cases), the optimum numbers of TWCs and internal wavelengths to guarantee minimum pocket loss are evaluated to prevent resource waste. Under o given load, TWCs and internal wavelengths could be significantly reduced, guaranteeing the same pocket loss probability as the performance of on OPS with full TWCs and internal wavelengths.