• Journal of Advanced Navigation Technology
• /
• v.21 no.1
• /
• pp.36-42
• /
• 2017

An airport surface movement scheduler using first-come first-served (FCFS) algorithm is developed to efficiently manage surface traffic in an airport. It is based on the previously developed traffic flow management scheduler. Link directionality and intersection processing, which are additional constraints for ground movement, are added to the scheduler. To verify each of additional constraints, several simulations were performed by making simple scenarios, and the results show that all constraints were satisfied. Also, a simulation was performed by making a scenario based on flight operation information system (FOIS) data which is real departure and arrival flight data of Jeju airport. To determine the practicality of the developed scheduler, we compare the actual average delay time with the average delay time calculated by the scheduler.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.11
• /
• pp.379-384
• /
• 2016

NAND flash storage is widely used for computer systems, because of it has faster response time, lower power consumption, and larger capacity per unit area than hard disk. However, currently used I/O scheduler in the operating system is optimized for characteristics of the hard disk. Therefore, the conventional I/O scheduler includes the unnecessary overhead in the case of the NAND flash storage to be applied. Particularly, when the write requests performed intensively, garbage collection is performed intensively. So, it occurs the problem that the processing of the I/O request delay. In this paper, we propose the new I/O scheduler to solve the problem of garbage collection performs intensively, and to optimize for NAND flash storage. In the result of performance evaluation, proposed scheme shows an improvement the user responsiveness by reducing 1% of the average read response time and 78% of the maximum response time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.8-18
• /
• 2009

CableLAB published DOCSIS 3.0 Specifications to supply broadband access to homes and small businesses. The primary technique of DOCSIS 3.0 Specification is channel bonding which provides cable operators with a flexible way to significantly increase up/downstream speeds. In this paper, we propose the upstream scheduler that serves channel bonding. Proposed scheduler consists of two sub-scheduler: bonding group scheduler and channel scheduler. Also, we propose three scheduling algorithms to allocate request bandwidth of CM to each bonding channel: equivalent scheduling algorithm, current request-based scheduling algorithm, and last grant-based scheduling algorithm. In order to evaluate the performance of these algorithms and DOCSIS 3.0 MAC protocol, we develop the DOCSIS 3.0 simulator with the network simulator, OPNET, to model DOCSIS network, CMTS, and CM. Our results show that equivalent scheduling algorithm is superior to others in the view of transmission delay and throughput and DOCSIS 3.0 protocol provides higher throughput than pre-DOCSIS 3.0 protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.3
• /
• pp.27-36
• /
• 2012

With the increase of various user's requirements, lots of interesting applications on the Internet have been emerging recently. However, Internet has many limitations for providing upcoming new services because it was only designed to provide basic connectivity between research networks and simplified forwarding functions at the first time. Internet has many problems in the aspects of routing scalability, mobility, security and QoS, so lots of researches are being actively performed in many countries to solve these problems. In this paper, we implement RED(Random Early Detection) scheduler using NetFPGA platform and local testbed to provide active queue management. Using the implemented RED scheduler, packets are dropped according to the specified drop probability, so Global Synchronization coming from simultaneous TCP segment losses in a congestion condition can be prevented. With the comparison to the Drop-Tail scheme in the basic router, we show TCP performance can be enhanced in the congestion situation using the NetFPGA-based RED scheduler.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.323-332
• /
• 2006

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two schemes in terms of the reference time used in calculating the timestamp of arriving packet; the Finish-Time (FT) and Start-Time (ST) schemes. The FT scheme, used in most schedulers, that has the property of an inversely rate-proportional latency is suitable to support various delay bounds because it can adjust the latency of a flow with raising the flow's reserved rate. However, the scheme may incur some bandwidth loss due to excess rate reservation. Meanwhile, although the ST scheme does not suffer from the bandwidth loss, it is hard to support multiple delay bounds because of its latency property relying on the number of flows. This paper is devoted to propose a ST scheme based scheduler to effectively support multiple delay bounds and analyze its performance comparing to the FT scheme based scheduler. The comparison results show that the proposed scheduler gives better utilization by up to 50%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1065-1071
• /
• 2009

Satellite application services can be divided into realtime services like voice communications and non-real time services like traditional data communications. To support both types of services on the same On-Board Switching(OBS), a scheduler which depends on their service classes is required. A fixed priority scheduling policy has a starvation problem. In this paper we propose a scheduling scheme based on premium and age. Premium is a fixed value which is given to a certain class of services. Age is another parameter of the scheduling policy and it will be increased by one for every scheduling cycle. The scheme we propose chooses a packet which has the largest sum of its age and premium. Simulation results indicate that the proposed approach shows better performance in both average cell delay and std-dev of cell delay for the lower class of service. There is no staying in infinite starvation state.

• Smart Media Journal
• /
• v.5 no.4
• /
• pp.18-25
• /
• 2016

Virtualized hardware resources provides efficiency in use and easy of management. Based on the benefits, virtualization techniques are used to build large server clusters and cloud systems. The performance of a virtualized system is significantly affected by the virtual machine scheduler. However, the existing virtual machine scheduler have a problem in that the I/O response is reduced in accordance with the scheduling delay becomes longer. In this paper, we introduce the Loan/Redemption mechanism of a virtual machine scheduler in order to improve the responsiveness to I/O events. The proposed scheme gives additional credits for to virtual machines and classifies the task characteristics of each virtual machine by analyzing the credit consumption pattern. When an I/O event arrives, the scheduling priority of a virtual machine is temporally increased based on the analysis. The evaluation based on the implementation shows that the proposed scheme improves the I/O response 60% and bandwidth of virtual machines 62% compared to those of the existing virtual machine scheduler.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.73-81
• /
• 2003

The controlled load service defined within the IETF's Integrated Services architecture for quality-of-service (QoS) in the Internet requires source nodes to regulate their traffic while the network, in combination with an admission control strategy, provides a guarantee of performance equivalent to that achieved in a lightly loaded network. Packets sent in violation of the traffic contract are marked so that the network may assign them a lower priority in the use of bandwidth and buffer resources. In this paper, we define the requirements of a scheduler serving packets belonging to the controlled load service and present a novel scheduler that exactly achieves these requirements. In this set of requirements, besides efficiency and throughput, we include an additional important requirement to bound the additional delay of unmarked packets caused due to the transmission of marked packets while dropping as few marked packets as possible. Without such a bound, unmarked packets that are in compliance with the traffic contract are not likely to experience delays consistent with that in al lightly loaded network. For any given desired bound ${\alpha}$ on this additional delay, we present the CL(${\alpha}$) scheduler which achieves the bound while also achieving a per-packet work complexity of O(1) with respect to the number of flows. We provide an analytical proof of these properties of the CL(${\alpha}$) scheduler, and we also verify this with simulation using real traces of video traffic. The scheduler presented here may be readily adapted for use in scheduling flows with multi-level priorities such as in some real-time video streams, as well as in other emerging service models of the Internet that mark packets to identify drop precedences.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.63-68
• /
• 2019

Emerging applications such as Smart factory, in-car network, wide area power network require strict bounds on the end-to-end network delays. Flow-based scheduler in traditional Integrated Services (IntServ) architecture could be possible solution, yet its complexity prohibits practical implementation. Sub-optimal class-based scheduler cannot provide guaranteed delay since the burst increases rapidly as nodes are passed by. Therefore a leaky-bucket type regulator placed next to the scheduler is being considered widely. This paper proposes a simple server that achieves both fair scheduling and traffic regulation at the same time. The performance of the proposed server is investigated, and it is shown that a few msec delay bound can be achieved even in large scale networks.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1642-1647
• /
• 2004

In this article, we present the development of the automated system for adjusting the 6 D.O.F circular fixator. The system includes scheduling software to adjust the Hexapod Circular Fixator (HCF) and an automated strut system with the ability of the multiple synchronized motion. HCF was designed to control a 6 degree-of-freedom Ilizarove fixator and it's mechanism is known as the Stewart Platform. HCF scheduler evaluates each value of altered length of the HCF struts to correct the complex skeletal deformity by using the X-ray data of the patient. The data of HCF scheduler feed into the automated strut system which be able to provide the scheduled adjustment and the automated strut is synchronized by input data.