• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.12-22
• /
• 2000

This paper presents the window-based permit distribution scheme for efficient medium access control to support multiclass traffic in APON(ATM over passive optical network). The proposed MAC protocol considers the characteristics of QoS(Quality of Service) for various traffic classes. A periodic RAU(request access unit) in upstream direction, includes dedicative request fields for each traffic category within the request slot. The transmission of upstream cell is permitted by the proposed window-based spacing scheme which distributes the requested traffic into several segments in the unit of one spacing window. The delay sensitive traffic source such as CBR or VBR with the stringent requirements on CDV and delay, is allocated prior to any other class. In order to reduce the CDV, so that the permit arrival rate close to the cell arrival rate, Running-Window algorithm is applied to permit distribution processing for these classes. The ABR traffic, which has not-strict CDV or delay criteria, is allocated flexibly to the residual bandwidth in FIFO manner. UBR traffic is allocated with the lowest priority for the remaining capacity. The performance of proposed protocol is evaluated in terms of transfer delay and 1-point CDV according to various offered load. The simulation results show that our protocol has the prominent improvement on CDV and delay performance with compared to the previous protocol.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.128-135
• /
• 2002

We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1123-1140
• /
• 2019

Many Internet of Things (IoT) applications involving bursty traffic have emerged recently with event detection. A power management scheme qualified for uplink bursty traffic (PM-UBT) is proposed by distinguishing between bursty and general uplink traffic patterns in the IEEE 802.11 standard to balance energy consumption and uplink latency, especially for stations with limited power and constrained buffer size. The proposed PM-UBT allows a station to transmit an uplink bursty frame immediately regardless of the state. Only when the sleep timer expires can the station send uplink general traffic and receive all downlink frames from the access point. The optimization problem (OP) for PM-UBT is power consumption minimization under a constrained buffer size at the station. This OP can be solved effectively by the bisection method, which demonstrates a performance similar to that of exhaustive search but with less computational complexity. Simulation results show that when the frame arrival rate in a station is between 5 and 100 frame/second, PM-UBT can save approximately 5 mW to 30 mW of power compared with an existing power management scheme. Therefore, the proposed power management strategy can be used efficiently for delay-intolerant uplink traffic in event-driven IoT applications, such as health status monitoring and environmental surveillance.

• Journal of Korean Society of Transportation
• /
• v.34 no.3
• /
• pp.278-290
• /
• 2016

Maximum traffic flow rate is an important performance measure of operational status in transport networks, and has been considered as a key parameter for transportation operation since a bottleneck in congestion decreases maximum traffic flow rate. Although previous studies for traffic flow analysis have been widely conducted, a detection method for changes in dynamic traffic flow has been still veiled. This paper explores the dynamic traffic flow detection that can be utilized for various traffic operational strategies. Turning point analysis (TPA), as a statistical method, is applied to detect the changes in traffic flow rate. In TPA, Bayesian approach is employed and vehicle arrival is assumed to follow Poisson distribution. To examine the performance of the TPA method, traffic flow data from Jayuro urban expressway were obtained and applied. We propose a novel methodology to detect turning points of dynamic traffic flow in real time using TPA. The results showed that the turning points identified in real-time detected the changes in traffic flow rate. We expect that the proposed methodology has wide application in traffic operation systems such as ramp-metering and variable lane control.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.69-75
• /
• 2012

In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.603-627
• /
• 1998

The leaky bucket scheme is a promising method that regulates input traffics for preventive congestion control. In the ATM network, the input traffics are bursty and transmitted at high-speed. In order to get the low loss probability for bursty input traffics, it is known that the leaky bucket scheme with static leaky rate requires larger data buffer and token pool size. This causes the increase of the mean waiting time for an input traffic to pass the policing function, which would be inappropriate for real time traffics such as voice and video. We present the leaky bucket scheme with dynamic leaky rate in which the token generation period changes according to buffer occupancy. In the leaky bucket scheme with dynamic leaky rate, the cell loss probability and the mean waiting time are reduced in comparison with the leaky bucket scheme with static leaky rate. We analyze the performance of the proposed leaky bucket scheme in discrete-time case by assuming arrival process to be Markov-modulated Bernoulli process (MMBP).

• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.433-440
• /
• 2011

In this paper, we propose a new scheduling method that can guarantee reliable jitter by minimizing the queue length variation in the streaming service provisioning such as IPTV and VoD. The amount of traffic to be delivered within a certain time is very fluid because MPEG-4 and H.264 encoders use VBR(Variable Bit Rate) for delivering video streaming traffic. This VBR characteristic increases the end-to-end propagation delay variation when existing scheduling methods are used for delivering video frames. Therefore, we propose the new scheduling method that can minimize change rate of queue length by adaptively controling service rate taking into account the size of bulk incoming packets and arrival rate for bulk streaming traffic. Video frames can be more reliably transmitted through the minimization of the queue length variation using the proposed method. We use the queueing model and also carry out OPNET simulation to validate the proposed method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.47-61
• /
• 1996

An ATM switch must deal with various kinds of input sources having different traffic characteristics and it must guarantee very small value of cel loss probability, about 10$^{8}$ -10$^{12}$ , to deal with loss-sensitive traffics. In order to estimate such a rate event probability with simulation procedure, a variance reduction technique is essential for obtaining an appropriate level of precision with reduced cost. In this paper, we propose a hybrid simulation technique to achieve reduction of variance of cell loss probability estimator, where hybrid means the combination of analytical method and simulation procedure. A discrete time queueing model with multiple input sources and a finite shared buffer is considered, where the arrival process at an input source and a finite shared buffer is considered, where the arrival process at an input source is governed by an Interrupted Bernoulli Process and the service rate is constant. We deal with heterogeneous input sources as well as homogeneous case. The performance of the proposed hybrid simulation estimator is compared with those of the raw simulation estimator and the importance sampling estimator in terms of variance reduction ratios.

• Journal of Korean Society of Transportation
• /
• v.8 no.1
• /
• pp.5-15
• /
• 1990

As a result of the lack of methodology for the determination of navigational channel capacity and the consequence lack of effective management of traffic, navigational channels are often grossly underutilized or highly congested. The traditional rule of first-come-first-served admission of vessels to channels is not efficient as it assumes equal time intervals between entrance of consecutive vessels. A new vessel traffic management system is developed in this research and methodologies to measure the improvement in the channel capacity are developed. Methodology to measure the channel performances for three queue disciplines are developed. The effects of changes in major factors on the channel capacity model such as channel length, fleet mix and arrival rate, as well as changes in strategy are analyzed. Under given channel conditions, best strategy are recommended. Also, a method for effective stochastic channel capacity simulation was developed. The results of analysis and as ertions are compared with the results of simulation runs to prove their applicability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4389-4410
• /
• 2014

Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.