• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.141-141
• /
• 2004

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.527-531
• /
• 1999

Instead of using the expected unfinished work, we use the expected number of customers in the system for finding the optimal D-policy for the M/G/1 queue in order to make it consistent with other control policies such as N-policy and T-policy.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.1
• /
• pp.1-14
• /
• 2014

The expansion of the physical road in response to changes in social conditions and policy of the country has reached the limit. In order to alleviate congestion on the existing road to reconsider the effectiveness of this method should be asking. Currently, how to collect traffic information for management of the intersection is limited to point detection systems. Intelligent Transport Systems (ITS) was the traffic information collection system of point detection method such as through video and loop detector in the past. However, intelligent transportation systems of the next generation(C-ITS) has evolved rapidly in real time interval detection system of collecting various systems between the pedestrian, road, and car. Therefore, this study is designed to evaluate the development of an algorithm for queue length based real-time traffic signal control methodology. Four coordinates estimate on time-space diagram using the travel time each individual vehicle collected via the interval detector. Using the coordinate value estimated during the cycle for estimating the velocity of the shock wave the queue is created. Using the queue length is estimated, and determine the signal timing the total queue length is minimized at intersection. Therefore, in this study, it was confirmed that the calculation of the signal timing of the intersection queue is minimized.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.29-37
• /
• 2000

Asynchronous transfer mode is flexible to support multimedia communication services using asynchronous time-sharing and statistical multimedia techniques to the existing data communication area, ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates, In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals, The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series, The predicted congestion information is backward to the node, NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction, Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.461-473
• /
• 2003

Multimedia applications are much more sensitive to QoS(Quality of Service) than text based ones due to their data continuity. In order to provide a fast moving MH(Mobil Host) using multimedia application with a consistent QoS,an efficient call admission mechanism is in need. This paper proposes the 2SCA(2-Step Call Admission) scheme based on cal admission scheme using pripority to guarantee the consistent QoS for mobile multimedia applications. A calls of MH are classified new calls, hand-off calls, and QoS upgrading calls. The 2SCA is composed of the basic call admission and advanced call admission; the former determines the call admission based on bandwidth available in each cell and the latter determines the call admission by applying DTT(Delay Tolerance Time), PQeueu(Priority Queue), and UpQueue(Upgrade Queue) algorithm according to the type of each call blocked at the basic call admission stage. In order to evaluate the performance of our mechanism, we measure the metrics such as the dropping probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The result shows that the performance of our mechanism is superior to that of existing mechanisms such as CSP(Complete Sharing Policy), GCP(Guard Channel Policy) and AGCP(Adaptive Guard Channel Policy).

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.27-35
• /
• 2015

We analyze an M/G/1/K queueing system with queue-length dependent service and arrival rates. There are a single server and a buffer with finite capacity K including a customer in service. The customers are served by a first-come-first-service basis. We put two thresholds $L_1$ and $L_2$($${\geq_-}L_1$$ ) on the buffer. If the queue length at the service initiation epoch is less than the threshold $L_1$, the service time of customers follows $S_1$ with a mean of ${\mu}_1$ and the arrival of customers follows a Poisson process with a rate of ${\lambda}_1$. When the queue length at the service initiation epoch is equal to or greater than $L_1$ and less than $L_2$, the service time is changed to $S_2$ with a mean of $${\mu}_2{\geq_-}{\mu}_1$$. The arrival rate is still ${\lambda}_1$. Finally, if the queue length at the service initiation epoch is greater than $L_2$, the arrival rate of customers are also changed to a value of $${\lambda}_2({\leq_-}{\lambda}_1)$$ and the mean of the service times is ${\mu}_2$. By using the embedded Markov chain method, we derive queue length distribution at departure epochs. We also obtain the queue length distribution at an arbitrary time by the supplementary variable method. Finally, performance measures such as loss probability and mean waiting time are presented.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.133-143
• /
• 2018

Roundabouts are generally installed at which traffic and pedestrian volume is relatively small intersections, and hence traffic can flow one direction around a circular island without traffic lights. A number of researches for roundabout signal metering have been processing ways to deal with operation efficiency drops in conditions of unusual traffic and pedestrian volume increases. However, there is still a shortcoming exists in previous operation algorithm does not consider the hidden vehicles between yield lines and detectors and queueing vehicles in circular lanes. These queueing vehicles between them can be cleared by introducing the queue clearance time. The purpose of this research is developing a real time signal metering operation algorithm by considering the vehicle queue clearance time. The results of varying queue clearance time application show that there is a substantial average vehicle delay reduction in VISSIM Com-Interface simulation. When the total number of entering vehicle is 3,200~4,800 vehicle/hour with varying queue clearance time application 21~50 seconds gives average delay reduction per vehicle by 16.1~71.7%.

• Journal of Internet of Things and Convergence
• /
• v.10 no.3
• /
• pp.19-24
• /
• 2024

Recent advances in large-scale data processing technologies such as big data, cloud computing, and artificial intelligence have increased the demand for high-performance storage devices in data centers and enterprise environments. In particular, the fast data response speed of storage devices is a key factor that determines the overall system performance. Solid state drives (SSDs) based on the Non-Volatile Memory Express (NVMe) interface are gaining traction, but new bottlenecks are emerging in the process of handling large data input and output requests from multiple hosts simultaneously. SSDs typically process host requests by sequentially stacking them in an internal queue. When long transfer length requests are processed first, shorter requests wait longer, increasing the average response time. To solve this problem, data transfer timeout and data partitioning methods have been proposed, but they do not provide a fundamental solution. In this paper, we propose a dual queue based scheduling scheme (DQBS), which manages the data transfer order based on the request order in one queue and the transfer length in the other queue. Then, the request time and transmission length are comprehensively considered to determine the efficient data transmission order. This enables the balanced processing of long and short requests, thus reducing the overall average response time. The simulation results show that the proposed method outperforms the existing sequential processing method. This study presents a scheduling technique that maximizes data transfer efficiency in a high-performance SSD environment, which is expected to contribute to the development of next-generation high-performance storage systems

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.2
• /
• pp.55-60
• /
• 2008

Packet-switched wavelength division multiplexing (WDM) ring networks have been extensively studied as solutions to the increasing amount of traffic in metropolitan area networks, which is widely expected to be a mix of unicast and multicast traffic. In this paper we study the fairness between unicasting and multicasting in slotted packet-switched WDM ring networks that employ a tunable transmitter and fixed tuned receiver at each node and a posteriori buffer selection. We find that single-step longest queue selection algorithm generally results in unfairness between unicasting and multicasting or a lilted relative priority for multicast vs. unicast traffic. We present the various virtual output queue structures and their performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.9-15
• /
• 2010

Cognitive radio is a technology, which automatically recognizes and searches for temporally and spatially unused frequency spectrum, then actively determines the communication method, bandwidth, etc. according to the environment, thus utilizing the limited spectrum resources efficiently. In this paper, with the imperfect sensing of misdetection and false alarm, we quantitatively investigate the effects of primary and secondary user's queue on the primary and secondary users' spectrum usage through the analysis of continuous time Markov Chain. With the queue primary user's spectrum usage improved up to 18%, and the secondary user's spectrum usage improved up to 50%.