• ETRI Journal
• /
• v.38 no.4
• /
• pp.622-633
• /
• 2016

A discontinuous reception (DRX) operation is included in the Long Term Evolution (LTE) system to achieve power saving and prolonged battery life of the user equipment. An improvement in DRX power saving usually leads to a potential increase in the packet delay. An optimum DRX configuration depends on the current traffic, which is not easy to estimate accurately, particularly for non-real-time applications. In this paper, we propose a novel way to vary the DRX cycle length, avoiding a continuous estimation of the data traffic when only non-real-time applications are running with no active real-time applications. Because a small delay in non-real-time traffic does not essentially impact the user's experience adversely, we deliberately allow a limited amount of delay in our proposal to attain a significant improvement in power saving. Our proposal also improves the delay in service resumption after a long period of inactivity. We use a stochastic analysis assuming an M/G/1 queue to validate this improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1023-1030
• /
• 2003

In this paper, we deal with an effective dynamic bandwidth allocation(DBA) scheme in order to support the qualify of services (QoS) in the customer access network which supports various applications with own service requirements. we discuss the DBA scheme for upstream traffic in the EPON which support both the delay sensitive traffic such as voice and real-time video and non-real time traffic such as data and BE. We propose the new DBA scheme which guarantee the delay performance of the real time traffic and utilize the upstream bandwidth effectively in the limited resource environment. We analize the delay performance of the proposed scheme by simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.539-546
• /
• 2002

In this paper, we consider a wireless multimedia environment to service both real-time video traffic and non-real-time WWW-application traffic In our suggested new packet scheduling algorithm, we consider both the accumulation counter and SIR to reduce delay in real-time traffic. In addition, our packet scheduling algorithm gives priority first to real-time video traffic service and then to non-real-time internet Packet service when real-time traffic service is absent. From the simulation results, we find that the AC (Accumulation Counter) scheme has much smaller delay than the conversional M-LWDF scheme for real-time video data users, which has a special quality sensitive to its own delay. We also consider the transmission structure of using both the frame period in the time-axis and the OVSF codes in the code-axis at the same time, which is similar to the structure of HSDPA system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2184-2196
• /
• 1998

Admission control is one of the most important congestion control mechanism to be executed at the call set up phase by regulating traffic into a network in a preventive way. An efficient QOS evaluation or bandwidth estimation method is required for call admission to be decided in real time. In this paper, we spropose a computtionally simple approximation method of estimating cell loss probability and mean cell delay for admission control of both delay sensitive and loss sensitive calls. Mixed input queueing system, where a new call combines with the existing traffic, is used as a queueing model for QOS estimation. Also traffic parameters are suggested to characterize both a new call and existing traffic. Aggregate traffic is approximated by a renewal process with these traffic parameters and then mean delay and cell loss probability are detemined using appropriate approximation formulas. The accuracy of this approximation approach is examined by comparing their results with exact analysis or simulation results of vrious mixed unput queueing systems. Based on this QOS estimation method, call admission control scheme which is traffic independent and computable in yeal time are proposed.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2779-2789
• /
• 1999

In this paper, we propose a new neural Buffered Leaky Bucket algorithm for preventing the degradation of network performance caused by congestion and dealing with the traffic congestion in ATM networks. We networks. We justify the validity of the suggested method through performance comparison in aspects of cell loss rate and mean transfer delay under a variety of traffic conditions requiring the different QoS(Quality of Service). also, the cell scheduling algorithms such as DWRR and DWEDF used for multiplexing the incoming traffics are induced to get the delay time of the traffics fairly. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate is changed by the predicted values. The prediction of traffic loss rate by neural networks can effectively reduce the cell loss rate and the cell transfer delay of next incoming cells and be applied to other traffic control systems. Computer simulation results performed for traffic prediction show that QoSs of the various kinds of traffics are increased.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.4
• /
• pp.60-67
• /
• 2010

Delay reduction of vehicles at the intersection is highly dependent on the signal operation method. Most previous traffic operations have focused on minimizing delay by adjust traffic offset. However, these methods have limitation in solving traffic problem if the volume reaches or exceeds the capacity. In this paper, it was analyzed that the effectiveness of various signal operation methods such as left-turn prohibition, and using protected mixed with permitted left turn using the traffic data from Daejeon city. In case of the left-turn prohibition of a intersection, the control delay reduced from 54.2 seconds to 22.7 seconds and especially, the delay of the southbound was drastically reduced. In addition, the delay was highly reduced from 27.0 seconds to 12.1 seconds when the operation system was changed to use protected mixed with permitted left turn.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.3-11
• /
• 2000

This paper considers the performance of a dynamic priority control function (DPCF) of a threshold-based Bernoulli priority jump (TBPJ) scheme. Loss-sensitive and delay-sensitive traffics are applied to a system with a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Loss-sensitive and delay-sensitive traffics represent sound and data, respectively. Under the TBPJ scheme, the first packet of the loss-sensitive traffic buffer goes into the delay-sensitive traffic buffer with Bernoulli probability p according to system states which 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. TBPJ scheme shows also better performance than that of HOL scheme.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.23 no.1
• /
• pp.41-48
• /
• 2015

Being a cost-efficient solution for alleviating the traffic congestion in airspace, Air Traffic Flow Management (ATFM) has drawn more attentions from not only air traffic controllers but also researchers in the field of Air Traffic Management (ATM). Among other ATFM initiatives, it is believed that Ground Delay Program (GDP) could be effectively applied to reduce the congestion particularly in the relatively small airspace with dense traffic demand. This paper introduces a novel way that suggests flights to be delayed on the departing airports together with amount of the delays (in time) for those flights to be delayed. Adopting a fast-time simulation for predicting airspace delay of each flight for a given flight plan, the method is designed to iteratively and incrementally adjust the departure times in the plan towards reducing total airspace delays. Applying the method to Jeju airport with a hypothetically high demand, the paper demonstrates the airspace delay could be significantly reduced by applying GDP at Gimpo airport where more than 60% of Juju-bound flights departure. Although the simulation model needs to be calibrated and validated for the real-world application, the results clearly shows that the approach can possibly implemented as a tool for preparing the daily plan at the pre-tactical stage defined in the ICAO ATFM manual.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.679-686
• /
• 2005

Because EPON access network shares a medium and aggregates the traffic from EPON subscribers, scheduling media access control on EPON bandwidth allocation is very important. Furthermore DBA mechanism of EPON based on TDMA is out of specification and up to implementation. This paper deals with a DBA method to guarantee the QoS of the delay sensitive traffic on the base of best-effort service and delay priority queue management. The proposed method performs virtual scheduling algorithm for the integrated traffic. It uses the same MAC messages and tries to guarantee the QoS of higher priority traffic first with a simple DBA architecture. We evaluate the algorithm for traffic delay according to polling interval and traffic load of upstream and downstream. The results show that the proposed method can guarantee the QoS of the delay sensitive traffic with priority of the service classes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.445-453
• /
• 2002

We propose a cell-multiplexing scheme for the real-time communication service in ATM network and a new service discipline guarantee end-to-end delay based on pseudo-isochronous cell switching. The proposed scheme consists of two level frame hierarchy, upper and lower frame, which is used to assign the bandwidth and to guarantee the requested delay bound, respectively. Since the proposed algorithm employs two level frame hierarchy, it can overcome the coupling problem which is inherent to the framing strategy. The proposed scheme consists of two components, traffic controller and scheduller, as the imput traffic description model and regulates the input traffic specification. The function of the traffic controller is to shape real-time traffic to have the same input pattern at every switch along the path. The end-to-end delay is bounded by the scheduller which can limit the delay variation without using per-session jitter controllers, and therefore it can decrease the required buffer size. The proposed algorithm can support the QoS's of non-real time traffic as well as those of real time traffic