• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

• Journal of the Society of Disaster Information
• /
• v.16 no.4
• /
• pp.650-657
• /
• 2020

Purpose: In this study, the effectiveness of pilot project of PLSP (Priority Lane and Signal Preference) system, which was operated in Cheongju City, was analyzed. Method: The priority signal was operated by a police officer switching to a blue signal when approaching a fire truck through CCTV, and the priority lane of emergency vehicles was displayed on the road to enable preferential traffic. VISSIM simulation analysis was performed for the 1.2km section (3.8km) of the pilot project section and vehicle data was analyzed for some of the test operation sections. Result: Simulation analysis shows that the moving speed of the emergency vehicle can be increased by 42 km/h with the introduction of PLSP, which can be increased by approximately twice the speed. Travel time was reduced by about 3 minutes, and considerable improvements of 69% compared to cities that are not operating was analyzed. The pilot operation of Cheongju City showed a time-shortening effect of about two minutes on average, with the average time reaching 4 minutes and 14 seconds in the first period and the average time reaching 5 minutes and 40 seconds in the second period. Conclusion: The system has been shown to be effective in minimizing time-to-site arrival of emergency vehicles.

• The Journal of the Korea Contents Association
• /
• v.20 no.4
• /
• pp.564-570
• /
• 2020

The development of cloud computing service technologies plays a particularly important role in the enterprise. The introduction of cloud computing services by companies is also contributing to the improvement of market value and changes in corporate earnings. In this study, we demonstrated the importance of priorities by selecting sub-items that can be evaluated by separating the expected characteristics of efficiency, economics, and dependencies when introducing cloud computing services. The main priority items were selected based on prior research and the survey was conducted by IT system experts. Using AHP analysis method, the results of performing a double contrast bridge resulted in the final priority. The findings will later be used as important data to determine an enterprise's decision to accept cloud computing services.

• Journal of Multimedia Information System
• /
• v.6 no.4
• /
• pp.239-244
• /
• 2019

With the development of Cyber-Physical Systems(CPS), several technologies such as automation control, automotive and intelligent house systems have been developed. To enable communication among various components of such systems, several wired and wireless communication protocols are used. The Controller Area Network(CAN) is one of such wired communication protocols that is popularly used for communication in automobiles and other machinery in the industry. In this paper, we designed and implemented a response time analysis system for CAN communication. The reliable data transfer among various electronic components in a significant time is crucial for the smooth operation of an electric vehicle. Therefore, this system is designed to conveniently analyze the response time of various electronic components of a CAN enabled system. The priority for transmission of the messages in the CAN bus is determined by the message identifier. As the number of nodes increases the transmission of low priority messages is delayed due to the existence of higher priority messages on the bus. We used Raspberry Pi3 and PiCAN2 board to simulate the data transfer for studying the comparative delay in low priority nodes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.85-94
• /
• 2005

In this thesis, we propose a Speed Accommodation Priority Algorithm Scheme(SPAS) and Traffic Control Model Scheme (TCMS) to satisfy a desired handoff dropping probability and to reduce the blocking probability of new calls using mobility characteristics and handoff rate in mobile communication networks. The guard channels below threshold can guarantee the Quality of Service(QoS) in terms of the request handoff dropping probability and the guard channels above the threshold can be used to handle high priority new calls and high priority handoff calls. When the ratio of the handoff call arrival rate is less then the ratio of the new call arrival rate, the proposed method can guarantee the new call better than the previous guard channel scheme.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.465-482
• /
• 2015

IEEE 802.11p is a standard MAC protocol for wireless access in vehicular environments (WAVEs). If a packet collision happens when a safety message is sent out, IEEE 802.11p chooses a random back-off counter value in a fixed-size contention window. However, depending on the random choice of back-off counter value, it is still possible that less important messages are sent out first while more important messages are delayed longer until sent out. In this paper, we present a new scheme for safety message scheduling, called the enhanced message priority mechanism (EMPM). It consists of the following two components: the benefit-value algorithm, which calculates the priority of the messages depending on the speed, deceleration, and message lifetime; and the back-off counter selection algorithm, which chooses the non-uniform back-off counter value in order to reduce the collision probability and to enhance the throughput of the highly beneficial messages. Numerical results show that the EMPM can significantly improve the throughput and delay of messages with high benefits when compared with existing MAC protocols. Consequently, the EMPM can provide better QoS support for the more important and urgent messages.

• Journal of Internet Computing and Services
• /
• v.24 no.5
• /
• pp.97-106
• /
• 2023

Citizens' demand for public CCTVs continues to rise, along with an increase in variouscrimes and social problems in cities. In line with the needs of citizens, the Seoul Metropolitan Government began installing CCTV cameras in 2010, and the number of new installations has increased by over 10% each year. As the large surveillance system represents a substantial budget item for the city, decision-making on location selection should be guided by reasonable standards. The purpose of this study is to improve the existing related models(such as public CCTV priority location analysis manuals) to establish the methodology foranalyzing priority regions ofSeoul-type public CCTVs and propose new mid- to long-term installation goals. Additionally, using the improved methodology, we determine the CCTV priority status of 25 autonomous districts across Seoul and calculate the goals. Through its results, this study suggests improvements to existing models by addressing their limitations, such as the sustainability of input data, the conversion of existing general-purpose models to urban models, and the expansion of basic local government-level models to metropolitan government levels. The results can also be applied to other metropolitan areas and are used by the Seoul Metropolitan Government in its CCTV operation policy

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.32 no.1B
• /
• pp.41-51
• /
• 2012

Sometimes, there exist many alternatives for doing a SOC project. However, the limitation of the fund requires the determination of investment priority for the alternatives. This may be performed according to the degree of importance of individual alternatives. Especially, the river improvement project at the downstream of dams has complex and various values and this characteristics make it difficult decision-maker to do reasonable determination. This study aims to determine an investment priority of 33 alternatives in the river improvement project at the downstream of dams using PROMETHEE method which has advantages in determining the priority. In this study, we determined evaluation criteria and attributes by considering the functions and objectives of the river improvement project at the downstream of dams. The eigenvector method in AHP was used to estimate the relative importance of evaluation criterion. Based on the estimation, we determined investment priority of 33 alternatives by PROMETHEE method and the priority of alternatives was derived in the order of Juam regulation dam, Unmun dam, Yongdam dam and so on. The results of this study could provide a reasonable standard to the decision-maker for the determination of investment priority of alternatives.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.39-48
• /
• 2008

Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.237-252
• /
• 2017

In recent years, data centers have become the core infrastructure to deal with big data processing. For these big data applications, network transmission has become one of the most important factors affecting the performance. In order to improve network utilization and reduce job completion time, in this paper, by real-time monitoring from the application layer, we propose job-aware priority scheduling. Our approach takes the correlations of flows in the same job into account, and flows in the same job are assigned the same priority. Therefore, we expect that flows in the same job finish their transmissions at about the same time, avoiding lagging flows. To achieve load balancing, two approaches (Flow-based and Spray) using ECMP (Equal-Cost multi-path routing) are presented. We implemented our scheme using NS-2 simulator. In our evaluations, we emulate real network environment by setting background traffic, scheduling delay and link failures. The experimental results show that our approach can enhance the Hadoop job execution efficiency of the shuffle stage, significantly reduce the network transmission time of the highest priority job.