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

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.28-36
• /
• 2008

In this paper, a service mobility scheme using user's location & service information table management and user recognition skill is proposed to support the movement of the multimedia service user and provide the seamless multimedia service environment in home network. We analyzed the proposed scheme using queueing system and we built test bed for experiment onthe proposed scheme to verify the operation and performance. As a result, we can show the proposed scheme provides a seamless multimedia service through the new client terminal when a user move to the new location and shows the performance completing the service mobility through the new client terminal within the service delay time which is shorter than the service delay time generated in the previous scheme.

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

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.48-55
• /
• 1997

Advances in VLSI technology have brought us completely new design principles for the high-performance switching fabrics including ATM switches. From a practical point of view, port scalability of ATM switches emerges as an important issue while complexity and performance of the switches have been major issues in the switch design. In this paper, we propose a cost-effective approach to modular ATM switch design which provides the good scalability. Taking advantages of both time-division and space-division switch architectures, we propose a practically implementable large scale ATM switch architecture. We present a scalable shared buffer type switch for a building block and its expansion method. In our design, a large scale ATM switch is realized by interconnecting the proposed shared buffer switches in three stages. We also present an efficient control mechanism of the shared buffers, synchronization method for the switches in each stage, and a flow control between stages. It is believed that the proposed approach will have a significant impact on both improving the ATM switch performance and enhancing the scalability of the switch with a new cost-effective scheme for handling the traffic congestion. We show that the proposed ATM switch provides an excellent performance and that its cell delay characteristic is comparable to output queueing which provides the best performance in cell delay among known approaches.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.217-226
• /
• 2001

In this paper, for continuous media access operations performed by Clustered Continuous Media Storage Server (CCMSS) system, we present the analytical model based on the open queueing network, which considers simultaneously two critical delay factors, the disk I/O and the internal network, in the CCMSS system. And we derive by using the analytical model the stochastic model for the total service delay time in the system. Next, we propose the integrated stochastic admission control model for the CCMSS system, which estimate the maximum number of admittable service requests at the allowable service failure rate by using the derived stochastic model and apply the derived number of requests in the admission control operation. For the performance evaluation of the proposed model, we evaluated the deadline miss rates by means of the previous stochastic model considering only the disk I/O and the propose stochastic model considering the disk I/O and the internal network, and compared the values with the results obtained from the simulation under the real cluster-based distributed media server environment. The evaluation showed that the proposed admission control policy reflects more precisely the delay factors in the CCMSS system.

• The Korean Journal of Applied Statistics
• /
• v.17 no.2
• /
• pp.311-326
• /
• 2004

We propose a Markov model of two bottleneck ECN/RED gateways experiencing a large number of TCP users. We show that, as the number of users becomes large, the queue sizes per user of the both gateways converge at steady-state to individual fixed points. Also, we derive a computational algorithm to exactly obtain the fixed points and present simulation example showing the limiting behavior of the gateway traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2605-2619
• /
• 1996

In this paper, we evaluated performance of mobile exchange control part. Queueing network model is used for modeling of mobile exchange control part. We developed a call control processing and location registration scenartio which has a message exchange function between processors in mobile exchange control part. A network symbol are used the simulation models that are composed of the initialization module, message generation module, message routing module, message processing module, message generation module, HIPC network processing module, output analysis module. as a result of computer simulation, we obtain the processor utilization, the mean queue length, the mean waiting time of control part based on call processing and location registration capacity. The call processing and location registration capacity is referred by thenumber of call attempts in the mobile exchange and must be satisfied with the quality of service(delay time).

• IE interfaces
• /
• v.14 no.1
• /
• pp.67-78
• /
• 2001

This paper describes the simulation study which estimates the container crane efficiency in container terminal. In most simulation studies, it is assumed that container cranes are available at any time. Though the failures of container cranes don't occur often, they are very serious problems on terminal efficiency. As usual, the failures of container crane cause arrived ships to delay the departure time. In this study, a queueing simulation model for container terminal, which focuses on the failures of container cranes, is designed. The simulation approach appears to be the most appropriate one because it allows to avoid the usual exponential assumption on interarrivals of ships and service times of container cranes. Using the developed model, we tested the efficiency of container cranes considering failures with a real system size and performed the simulation experiment on real container terminal to validate the developed simulation model. The results of simulation experiment were analyzed using output statistics, which include the waiting times of vessels and yard tractors, the utilization for container cranes, and the berth occupancy rates.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.4
• /
• pp.26-33
• /
• 2012

Please WBAN(Wireless Body Area Networks) is wireless communication of within 3 m radius from inside and outside of the body. WBAN is many uses IEEE 802.15.4 MAC protocol for WBAN MAC protocol requirements. IEEE 802.15.4 MAC protocol applies GTS(Guaranteed Time Slot) allocation scheme for guarantee packet delivery of application which requests QoS(Quality of Service). However, GTS allocation scheme of IEEE 802.15.4 MAC protocol uses FIFS(First In First Service) queueing. So it reduces data transmission reliability and has many problems. Therefore, IEEE 802.15.4 applies not WBAN MAC protocol for emergency data transmission. In this paper, we proposes a priority based MAC protocol for emergency data transmission in wireless body area networks. the proposal MAC protocol sets priority the data. So GTS reqeuest throughput of emergency data increasing and GTS allocation delay of emergency data decreasing.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.61-70
• /
• 2013

The increasing number of mobile users and the popularity of real-time applications make wired-wireless integrated network extremely attractive. In this case, quality of service (QoS) adaptability is particularly important since some important features of the integrated network call for QoS adaptability, such as mobility, bursty applications and so on. Traditional QoS schemes include integrated service (IntServ) and differentiated service (DiffSev) as well as their variants. However, they are not able to balance well between scalability and QoS granularity. For example, IntServ faces the scalability problem, while DiffServ can only provide coarse granular QoS. In addition, they are also unable to efficiently support QoS adaptability. Therefore, a per-packet differentiated queueing service (DQS) was proposed. DQS was originally proposed to balance between scalability and QoS granularity in wired networks and then extended to wireless networks. This paper mainly discusses how to use DQS to support QoS adaptability in wired-wireless integrated networks. To this end, we propose a scheme to determine dynamic delay bounds, which is the key step to implement DQS to support QoS adaptability. Simulation studies along with some discussions are further conducted to investigate the QoS adaptability of the proposed scheme, especially in terms of its support of QoS adaptability to mobility and to bursty real-time applications.