• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.31-41
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.140-148
• /
• 2011

Multimedia streaming service is susceptible to loss and delay of data as it requires high bandwidth and real time processing. Therefore QoS cannot be guaranteed due to data loss caused by heavy network traffic. To deal with these problems, a study on algorithm that can provide high quality multimedia service by considering both network congestion and characteristics of multimedia data is required. In this paper, we propose APQM algorithm which probabilistically removes packet by the congestion level of the queue in wireless station. The comparison with other existing scheduling algorithms shows tht congestion in the network is reduced and multimedia service quality of the proposed algorithm is improved.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.24 no.6
• /
• pp.670-678
• /
• 2018

In coastal waters where the traffic volume of the ship is high, there is a high possibility of a collision accident because complicated encounter situations frequently occurs between ships. To reduce the collision accidents at sea, a quantitative collision risk assessment is required in addition to the navigator's compliance with COLREG. In this study, a new collision risk assessment system was developed to evaluate the collision risk on ship's planned sailing routes. The appropriate collision risk assessment method was proposed on the basis of reviewing existing collision risk assessment models. The system was developed using MATLAB and it consists of three parts: Map, Bumper and Assessment. The developed system was applied to the test sea area with simple computational conditions for testing and to actual sea areas with real computational conditions for validation. The results show the length of own ship, ship's sailing time and sailing routes affect collision risks. The developed system is expected to be helpful for navigators to choose the optimum safe route before sailing.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.413-423
• /
• 2014

Recently, cloud computing has been affecting academic information system buildup. When university academic affairs information system is designed with cloud computing, it is very important to estimate the adequate processing capacity for the cloud computer taking into account a waste of resources and the quality of service. Cloud computer's processing capacity to meet the quality of service expected by users should be predicted based on users' transaction patterns and resource requirements characteristics. In this paper, we analyze actual traffic patterns occurring in university academic affairs business and propose a method to calculate the optimal processing capacity for cloud computer to satisfy the given average response time. To justify our research, we apply the research results to a real university academic affairs business case and obtain the optimal processing capacity for the integrated academic affairs business.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.71-77
• /
• 2012

In this paper, We have proposed an efficient SIP(Session Initiation Protocol) messages control which can be used to reduce conference servers load in distributed conference model. Each conference participant can control the amount of event notification messages from the conference server in real time according to its processing capacity and network circumstances. And the amount of SIP messages needed to maintain session with the conference servers can also be controlled actively in our system. The amount of SIP messages which should be processed by the conference servers can be reduced largely by using our suggested method. Therefore the conference system can be more easily expandable and total network traffic can be reduced largely in SIP environment. We have suggested new conference event packages and conference information data model with some added elements that are necessary for efficient SIP messages control. The performance of the proposed system has been evaluated by experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.97-106
• /
• 2012

Management of biosignal data in mobile devices causes many problems in real-time transmission of large volume of multimedia data or storage devices. Therefore, this research paper intends to suggest an m-Health system, a clinical data processing system using mobile in order to provide quick medical service. This system deployed health system on IP network, compounded outputs from many bio sensing in remote sites and performed integrated data processing electronically on various bio sensors. The m-health system measures and monitors various biosignals and sends them to data servers of remote hospitals. It is an Android-based mobile application which patients and their family and medical staff can use anywhere anytime. Medical staff access patient data from hospital data servers and provide feedback on medical diagnosis and prescription to patients or users. Video stream for patient monitoring uses a scalable transcoding technique to decides data size appropriate for network traffic and sends video stream, remarkably reducing loads of mobile systems and networks.

• International Journal of Highway Engineering
• /
• v.14 no.5
• /
• pp.179-188
• /
• 2012

PURPOSES: The aim of this study is to analyze overloading control effectiveness of enforcing overweighted vehicles using HS-WIM (High-Speed Weigh-in-Motion) at main lane of expressway. METHODS: To analyze the weight distribution statistically, HS-WIM system should has an appropriate weighing accuracy. Thus, the weighing accuracy of the two HS-WIM systems was estimated by applying European specifications and ASTM (American Standards for Testing and Materials) for WIM in this study. Based on the results of accuracy test, overweight enforcement system has been operated at main lanes of two expressway routes in order to provide weight informations of overweighted vehicle in real time for enforcement squad. To evaluate the overloading control effectiveness with enforcement, traffic volume and axle loads of trucks for two months at the right after beginning of the enforcement were compared with data set for same periods before the enforcement. RESULTS: As the results of weighing accuracy test, both WIM systems were accepted to the most precise type that can be useful to applicate not only statistical purpose but enforcing on overweight vehicles directly. After the enforcement, the rate of overweighted trucks that weighed over enforcement limits had been decreased by 27% compared with the rate before the enforcement. Especially, the rate of overweighted trucks that weighed over 48 tons had been decreased by 91%. On the other hand, in counterpoint to decrease of the overweighted vehicle, the rate of trucks that weighed under enforcement limits had been increased by 7%. CONCLUSIONS: From the results, it is quite clear that overloading has been controlled since the beginning of the enforcement.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.5
• /
• pp.36-45
• /
• 2013

This paper developed a new shortest path searching algorithm based on Dijkstra's algorithm and $A^*$ algorithm, so it guarantees to find a shortest path in efficient manner. In this developed algorithm, minimum expected weights implies the value that straight line distance from a visiting node to the target node multiplied by minimum link unit, and this value can be the lowest weights between the two nodes. In behalf of the minimum expected weights, at each traversal step, developed algorithm in this paper is able to decide visiting a new node or retreating to the previously visited node, and results are guaranteed. Newly developed algorithm was tested in a real traffic network and found that the searching time of the algorithm was not as fast as other $A^*$ algorithms, however, it perfectly found a minimum path in any case. Therefore, this developed algorithm will be effective for the domain of searching in a large network such as RGV which operates in wide area.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.217-228
• /
• 2011

In centralize CDN systems, the content server selection is performed by service node for every user request, and the selected node is notified to the user. In this paper, we present distributed CDN architecture and algorithm in which the request from a user is delivered to the content source by a P2P algorithm utilizing DHT(distributed hash table) through the overlay network and the user selects one of the source nodes based on real-time user-centric criteria. For this purpose, we propose a modified Pastry algorithm for contents registration, search and selection, in addition to the distributed architecture. The proposed architecture has the advantages of load balancing, traffic balancing, scalability, fault-tolerance due to the self-configuration, self-healing attributes of distributed architecture. Various simulation shows the feasibility of the proposed architecture and algorithm, and the performance is compared and discussed for the variations of the proposed scheme.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.65-73
• /
• 2017

Advances in Internet of Things Technology lead to the increasing number of daily-life things that are interconnected over the Internet. Also, several smart services are being developed by utilizing the connected things. Among the daily-life things surrounding user, the mirror can supports broad range of functionality and expandable service as it plays various roles in daily-life. Recently, various smart mirrors have been launched in certain places where people with specific goals and interests meet. However, most mirrors give the user limited information. Therefore, we designed and implemented a smart mirror that can support customized service. The proposed smart mirror utilizes information provided by other existing internet services to give user dynamic information as real_time traffic information, news, schedule, weather, etc. It also supports recommendation service based on user usage information.