• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.827-836
• /
• 2018

In this study, we developed a PC - based motorcycle simulator based on the development technology of a virtual patrol motorcycle training system. This simulator has been developed to be applied to a variety of fields such as driving training for beginners, driver factor research, and system development such as ABS, which can be seen in advanced models. The weight of the motorcycle operated by the patrol guards is more than 400Kg. There is a lot of risk due to the nature of work without prior practice. Therefore, we implemented a study on the untilization of physical stress and temporal pressure in emergency situations. In order to get a feeling that the motorcycle simulator is operating in real-life, it is important that the mutual reliable signal transmission and operation feel between the driver and the simulator. In order to achieve this, we developed a system that can apply the sub-systems of the actual vehicle to the motorcycle simulator in order to generate the same operation feeling as the actual vehicle. Based on these results, we have developed a method of generating a feedback queue.

• Journal of Korean Society of Transportation
• /
• v.11 no.1
• /
• pp.87-103
• /
• 1993

The subject this paper is the signal control strategy under oversaturated conditions. The nature of traffic control for oversaturation is essentially different from the standard control modes. While under non-saturated situation traffic control is needed for the sake of safety and efficiency, the throughput is essential under oversaturated conditions. Therefore berth objective and strategies differ. For an oversaturated stream the cycle time and the signal offset are thought to be of rather secondary importance. For this case the green split may well be the most important control variable to serve the excessive demand. Up to now, however, most efforts have concentrated on the strategy with the concept which lies just on the extension of Webster's. "Green-split Coordination Strategy for Over-Saturated Networks", presents newly contrived three types of strategies named Forward-coordination, Backward-coordination and Network-coordination respectively and describes the algorithms with the evaluations. The forward coordination strategy treats the forward wave of flow between two signals. The aim is to prevent the outbreak of queue due to the accumulation of temporary excess of demand in near-saturation or saturation flow. The backward coordination strategy treats the backward rave of flow between two signals. The goal is to prevent the waste of green time caused by the exit block at the upstream signal. for this purpose a feedback regulation is provided of the upstream green-split so that the inflow-outflow balance is kept zero. The resultant surplus of green time is alloted to other signal stages. Also here the examination is made of the appropriate value of the feedback control parameter. The network coordination strategy is operated to maximize the network throughput in a specific direction applying a bang-bang control at the bottleneck intersection. This is a type of intervenient control for policy reasons. For this strategy the green-split coordinations, particuarly the backward coordination, are essential as the tactical elements. In order to evaluate the preposed strategies those are compared with the latest existing strategy called saturation-degree-ratio control by the simulation experiments in an assumed 4$\times$4 grid network. The results are satisfactory showing a 10-15% reduction in delays and a 15% increase in network capacity.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.499-509
• /
• 2010

A plethora of transmission control protocol (TCP) congestion control algorithms have been devoted to achieving the ultimate goal of high link utilization and fair bandwidth sharing in high bandwidth-delay product (HBDP) networks. We present a new insight into the TCP congestion control problem; in particular an end-to-end delay-based approach for an HBDP network. Our main focus is to design an end-to-end mechanism that can achieve the goal without the assistance of any network feedback. Without a router's aid in notifying the network load factor of a bottleneck link, we utilize goodput and throughput values in order to estimate the load factor. The obtained load factor affects the congestion window adjustment. The new protocol, which is called TCP-goodput and throughput (GT), adopts the carefully designed inversely-proportional increase multiplicative decrease window control policy. Our protocol is stable and efficient regardless of the link capacity, the number of flows, and the round-trip delay. Simulation results show that TCP-GT achieves high utilization, good fairness, small standing queue size, and no packet loss in an HBDP environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.264-270
• /
• 2006

In this paper we verified that the window based TCP performance of throughput can be improved by the traffic connection efficiency. and have studied the performance of traffic congestion control that is controlling transmission rate. In wireless network, the bidirectional node is run by estimating the usage rate of link of error control idle and the throughput is shown by transmitting segments. The throughput rate shows almost no delay due to the bidirectional traffic connection efficiency up to the allowable point as increasing the transport rate by the critical value, depending on the size of end-to-end node queue of the increase of transport rate. This paper reports the performance improvement as the number of feedback connection traffic congestion control increases because of the increase of the number of asynchronous transport TCP connections.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2824-2837
• /
• 2019

Container technologies are widely used in infrastructures to deploy and manage applications in cloud computing environment. As containers are light-weight software, the cluster of cloud applications can easily scale up or down to provide Internet-based services. Container-based applications can well deal with fluctuate workloads by dynamically adjusting physical resources. Current works of scheduling applications often construct applications' performance models with collected historical training data, but these works with static models cannot self-adjust physical resources to meet the dynamic requirements of cloud computing. Thus, we propose a self-adaptive automatic container scheduling framework AutoScale for cloud applications, which uses a feedback-based approach to adjust physical resources by extending, contracting and migrating containers. First, a queue-based performance model for cloud applications is proposed to correlate performance and workloads. Second, a fuzzy Kalman filter is used to adjust the performance model's parameters to accurately predict applications' response time. Third, extension, contraction and migration strategies based on predicted response time are designed to schedule containers at runtime. Furthermore, we have implemented a framework AutoScale with container scheduling strategies. By comparing with current approaches in an experiment environment deployed with typical applications, we observe that AutoScale has advantages in predicting response time, and scheduling containers to guarantee that response time keeps stable in fluctuant workloads.

• Journal of Korea Multimedia Society
• /
• v.24 no.1
• /
• pp.95-105
• /
• 2021

In the case of laptops and tablet PC's that replace desktop, it uses the Windows operating system to provide various functions depending on operating system dependency, the Windows operating system does not support real-time processing because it uses multi-level feedback queue scheduling that extends round-robin scheduling. Also, since the initial value of Local APIC Counter can not be obtained from the Windows 8, the real-time processing function provided through the existing RTiK does not work. In this paper, we calculate Local APIC Counter value by using MSR_FSB_FREQ register to support real-time processing function on tablet PC's. We designed and implemented RTiK+, which provides real-time processing function to guarantee the periodicity by calculating the operation time of accurate timer. In order to verify and evaluate the performance of the implemented the RTiK+, the period was measured by using the Read Time-Stamp Counter(RDTSC) instruction and it was confirmed that it operates normally at 1ms and 0.1ms period.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.3
• /
• pp.533-542
• /
• 2020

In this study, we developed a PC - based motorcycle simulator based on the development technology of the virtual patrol motorcycle training system. In order to get the impression that the motorcycle simulator is operating in a realistic way, it is important to have a reliable signal transmission and operation feeling between the driver and the simulator. In order to achieve this, we developed a system that can apply the sub-systems of the actual vehicle to the motorcycle simulator in order to generate the same operation feeling as the actual vehicle. Based on these results, We have developed a method for generating a feedback queue. Vehicle dynamics simulates real-time vehicle motion by receiving input from a steering wheel, accelerating / decelerating pedal, etc. operated by a driver on a vehicle simulator and transmitting the result to a visual and acoustic system, It is the central element of the simulator to generate. I want to summarize the main requirements of simulation dynamics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.1890-1906
• /
• 1997

A new ER feedback switch control algorithm, called EMRCA(Explicit Max-min Rate Control Algorithm), to control the ABR services traffic in the ATM networks, is proposed in this thesis. This scheme was interpreted the ACR variation residing on between a transient state and a stable state using the two thresholds that is the $TH_{high}$ and $TH_{low}$ in the queue to detect switch nodes congestion, and decreased the difference of minimum and maximum ACR all active connection to enhance the line bandwidth utilization. The proiposed scheme used a minimum and maximum rate of all active connections to select the connection whose the congestion rate inveoked, and uses a congestion detection mechanixm to prevent some potential cogestion by regulating selected contection.s The EMRCA scheme showed ACR variation more stable that the EPRCA scheme, also reduced buffer size of the switch, and achieved higher link utilization than the EPRCA scheme.

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

The wireless asynchronous transfer mode (ATM) system has the advantage of providing the broadband services with various quality-of-service requirements to the mobile terminal efficiently by utilizing the ATM technology developed for the wired ATM system. The available bit rate (ABR) service among various ATM services utilizes the available bandwidth remaining in the ATM link, which allows the efficient bandwidth usage. During the handoff of the mobile terminal, however, the queue length in the access point (AP) which resides in the boundary of the wired ATM network and the wireless ATM network may increase abruptly. In this paper, we propose a scheme which prevents the buffer-overflow and buffer-underflow in the AP during the handoff of the wireless ABR connection in the wireless ATM system using binary feedback rate-based ABR traffic control. This scheme controls the source's cell generation rate during both handoff period and some time interval after the completion of the handoff procedure. The simulation results show that the proposed scheme prevents the buffer-overflow and buffer-underflow. The proposed scheme can contribute to increasing the throughput of the wireless ABR service during handoff by preventing the buffer overflow and underflow during handoff period.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.513-522
• /
• 2002

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.