• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.83-90
• /
• 2009

Since traffic is aggregated to a MPP that acts as an Internet gateway, if traffic load is not balanced among the MPPs in a WMN, the overall performance of a WMN becomes poor even though the total traffic load is far below the capacity of the WMN. Therefore, in this paper, we propose a stochastic load balancing scheme where each MP (Mesh Point) probabilistically selects its serving MPP according to the congestion levels of MPPs. Through extensive simulations using ns-2, we have verified that our scheme can stabilize a WMN fast when congestion occurs and reduce packet loss rate by distributing traffic load of a congested MPP to multiple MPPs in the inverse proportional to their congestion levels. Compared to queue-based load balancing scheme, our method can decrease network stabilization time by 34 seconds, and reduce packet loss rate by 7.6%. Since the proposed scheme can reduce network stabilization time by efficiently using network resource, it is expected to contribute to the reliable operation of a WMN.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.5D
• /
• pp.579-585
• /
• 2009

In spite of the proven effectiveness of ramp metering system, it has not been successfully implemented in Korean setting. The purpose of this paper is to select target locations to introduce ramp metering into the Korean expressway system. For this, domestic standards to introduce ramp metering have been presented after reviewing those of the US. The major criteria are level of service (LOS), the existence of detour route, space for queue build-up and opened ramp. 15 different locations were selected and AHP has been used to make priority among them. Intuitively, the result of priority was in accordance with the congestion and traffic volume. The core results identified in this paper is expected to be used in different cities and expressway networks elsewhere.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.585-587
• /
• 2022

The visual motivation between AP devices is NTP-based visual motivation through the access of the Internet through the internal wired LAN, but this has several seconds of visual difference in hundreds of milliseconds (msec) depending on the network. The frame for the output of the video will vary depending on the application, but usually 24 (image) frames are output to the screen in one second. Therefore, the visual synchronization between peripheral devices can be performed through the adjacent moving camera device, not the wired method. The programming method of generating API for synchronization command when creating an application for visual synchronization and delivering it to AP through MAC may differ from the time in synchronization command according to the environment of the operating system at the transmission side and the situation of the buffer queue of the MAC. Therefore, as a method to solve this problem, the renewal of visual information in the device driver terminal controlling MAC can be much more effective.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.367-379
• /
• 1994

This paper describes scheduling algorithms of the UNIX operating system and shows an analytical approach to approximate the average conditional response time for a process in the UNIX operating system. The average conditional response time is the average time between the submittal of a process requiring a certain amount of the CPU time and the completion of the process. The process scheduling algorithms in thr UNIX system are based on the priority service disciplines. That is, the behavior of a process is governed by the UNIX process schuduling algorithms that (ⅰ) the time-shared computer usage is obtained by allotting each request a quantum until it completes its required CPU time, (ⅱ) the nonpreemptive switching in system mode and the preemptive switching in user mode are applied to determine the quantum, (ⅲ) the first-come-first-serve discipline is applied within the same priority level, and (ⅳ) after completing an allotted quantum the process is placed at the end of either the runnable queue corresponding to its priority or the disk queue where it sleeps. These process scheduling algorithms create the round-robin effect in user mode. Using the round-robin effect and the preemptive switching, we approximate a process delay in user mode. Using the nonpreemptive switching, we approximate a process delay in system mode. We also consider a process delay due to the disk input and output operations. The average conditional response time is then obtained by approximating the total process delay. The results show an excellent response time for the processes requiring system time at the expense of the processes requiring user time.

• Journal of Intelligence and Information Systems
• /
• v.28 no.1
• /
• pp.89-106
• /
• 2022

Recently, the amount of video data collected from smartphones, CCTVs, black boxes, and high-definition cameras has increased rapidly. According to the increasing video data, the requirements for analysis and utilization are increasing. Due to the lack of skilled manpower to analyze videos in many industries, machine learning and artificial intelligence are actively used to assist manpower. In this situation, the demand for various computer vision technologies such as object detection and tracking, action detection, emotion detection, and Re-ID also increased rapidly. However, the object detection and tracking technology has many difficulties that degrade performance, such as re-appearance after the object's departure from the video recording location, and occlusion. Accordingly, action and emotion detection models based on object detection and tracking models also have difficulties in extracting data for each object. In addition, deep learning architectures consist of various models suffer from performance degradation due to bottlenects and lack of optimization. In this study, we propose an video analysis system consists of YOLOv5 based DeepSORT object tracking model, SlowFast based action recognition model, Torchreid based Re-ID model, and AWS Rekognition which is emotion recognition service. Proposed model uses single-linkage hierarchical clustering based Re-ID and some processing method which maximize hardware throughput. It has higher accuracy than the performance of the re-identification model using simple metrics, near real-time processing performance, and prevents tracking failure due to object departure and re-emergence, occlusion, etc. By continuously linking the action and facial emotion detection results of each object to the same object, it is possible to efficiently analyze videos. The re-identification model extracts a feature vector from the bounding box of object image detected by the object tracking model for each frame, and applies the single-linkage hierarchical clustering from the past frame using the extracted feature vectors to identify the same object that failed to track. Through the above process, it is possible to re-track the same object that has failed to tracking in the case of re-appearance or occlusion after leaving the video location. As a result, action and facial emotion detection results of the newly recognized object due to the tracking fails can be linked to those of the object that appeared in the past. On the other hand, as a way to improve processing performance, we introduce Bounding Box Queue by Object and Feature Queue method that can reduce RAM memory requirements while maximizing GPU memory throughput. Also we introduce the IoF(Intersection over Face) algorithm that allows facial emotion recognized through AWS Rekognition to be linked with object tracking information. The academic significance of this study is that the two-stage re-identification model can have real-time performance even in a high-cost environment that performs action and facial emotion detection according to processing techniques without reducing the accuracy by using simple metrics to achieve real-time performance. The practical implication of this study is that in various industrial fields that require action and facial emotion detection but have many difficulties due to the fails in object tracking can analyze videos effectively through proposed model. Proposed model which has high accuracy of retrace and processing performance can be used in various fields such as intelligent monitoring, observation services and behavioral or psychological analysis services where the integration of tracking information and extracted metadata creates greate industrial and business value. In the future, in order to measure the object tracking performance more precisely, there is a need to conduct an experiment using the MOT Challenge dataset, which is data used by many international conferences. We will investigate the problem that the IoF algorithm cannot solve to develop an additional complementary algorithm. In addition, we plan to conduct additional research to apply this model to various fields' dataset related to intelligent video analysis.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.4
• /
• pp.421-429
• /
• 2000

In present, ATM integrated switching system has been developed to a mixed modules that complexed switching system including maintenance, operation based on B-ISDN/LAN service and plug-in module, , which runs on workstation computer system. Meanwhile, workstation has HMI operation system feature including file system management, time management, graphic processing, TMN agent function. The workstation has communicated with between ATM switching module and clients. This computer system architecture has much burden messages communication among processes or processor. These messages communication consume system resources which are socket, message queue, IO device files, regular files, and so on. Therefore, in this paper we proposed new performance modeling with this system architecture. We will analyze the system bottleneck and improve system performance. In addition, in the future, the system has many additional features should be migrated to workstation system, we need previously to evaluate system bottleneck and redesign it. In performance model, we use queueing network model and the simulation package is used PDQ and C-program.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.4D
• /
• pp.527-538
• /
• 2011

Currently, the only established criteria is on the location of bus stops on principal roads where uninterrupted flow mainly occurs. There are no clear guidelines on any method to locating bus stops considering the characteristics of bus operation and pedestrians. If the location or exterior of a bus stop is inappropriate, road users including bus drivers and pedestrians will be caused serious dangerous and inconvenience. In this study, the research below was performed in order to propose rational criteria for the location of bus stops integrated with or separated from speed-change lanes at signalized intersections considering smooth traffic flow and the characteristics of bus operation and pedestrians as well as traffic safety : First, the appropriate length of each of the near-side and far-side bus stops was calculated by categorizing bus stops to be constructed into those integrated with speed-change lanes and those separated from speed-change lanes. Secondly, the appropriate length of each of the bus stops divided into near-side bus stops and far-side bus stops and integrated with or separated from speed-change lanes was selected by considering the characteristics of pedestrians. Thirdly, whether the construction locations of bus stops were appropriate or not was determined based on the appropriate length of bus stops integrated with or separated from speed-change lanes, which was calculated and selected by considering traffic flow and the characteristics of pedestrians and considering traffic safety. The method for locating bus stops considering traffic flow, the characteristics of pedestrians, and traffic safety will be able to help suggestion criteria of bus stop and the location of safe and pleasant bus stops.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.5 no.1 s.9
• /
• pp.1-12
• /
• 2006

In order to estimate a dynamic origin and destination demand between on and off-ramps in the freeways, a traffic flow theory can be used to calculate a link distribution proportion of traffics moving between them. We have developed a dynamic traffic estimation model based on the three-phase traffic theory (Kerner, 2004), which explains the complexity of traffic phenomena based on phase transitions among free-flow, synchronized flow and moving jam phases, and on their complex nonlinear spatiotemporal features. The developed model explains and estimates traffic congestion in terms of speed breakdown, phase transition and queue propagation. We have estimated the link, on and off-ramp volumes at every time interval by using traffic data collected from vehicle detection systems in Korea freeway sections. The analyzed results show that the developed model describes traffic flows adequately.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.1 s.4
• /
• pp.53-65
• /
• 2004

A series of accidents, which are non-recurrent and non-anticipated, are called incidents. These incidents make standard traffic flows interrupt, which result in the decrease of road capacity and a number of social and economic costs, such as the traffic congestion and air pollution. In order to prevent the hazard of incidents, domestic and foreign traffic management center are likely to opt auto-sense system with algorithms of auto-incident sense. However, it is evaluated that the algorithms have a low function with frequent wrong alarms, even if they accurately ry to speculate the incidents. In the case of bottleneck which has lack of road capacity, compared with other roads, due to inefficient road structured over-capacity of the demand of on-off ramp, the incidents regularly take place. Nonetheless, it can be more difficult to speculate the auto-incidents sense owing to similar incidents, such as the queue of in-out flows of cars and the change of road line. Throughout this research, the function of the model has improved excluding near road line in the module of the incidents which is based on the auto-incidents algorithms during the sense of the congestion of ramp areas.