• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.762-771
• /
• 2005

In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.10
• /
• pp.1-10
• /
• 2002

Scheduling technology is one of the most important elements required to support the Qos(quality of service) in the Internet and a lot of scheduling algorithms have been developed. However, most of there algorithms are not flexible in the distribution of the excess bandwidth. In order to improve the weakness of existing algorithms, DGPS(decoupled generalized processor sharing)has suggested recently. But, the DGPS algorithm is complex to implement and difficult to apply to the existing algorithms. In this paper, we propose a scheduling algorithm for distribution of the excess bandwidth which improves the implementation complexity of the DGPS and easy to be applied to ordinary algorithms.

• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.87-93
• /
• 2007

In the component based software development, it is very important to interface between modules of component. Almost of existing method, Connectors are deal with all communication channels between two or more components/interfaces by RPC(Remote procedure call) and event call. But these process has limits when component send a lot of request call to other component through connector. That is, we need more efficient interface method that connector can process multi request call. In this paper, I propose interaction scheduling algorithm using message queue in the connector. For this purpose, I use message buffer which operate to save and load message temporarily.

• The Journal of the Korea Contents Association
• /
• v.6 no.11
• /
• pp.276-284
• /
• 2006

WRR scheme was developed for scheduling scheme for guaranteeing bandwidth requirement. In these days, WRR scheme can handle multiple queues straightforwardly by putting a different weight on each queue in order to offer differentiated services such as different bandwidth or delay bound in wireless communication network. Also, WRR algorithm can be implemented efficiently by dynamic binary scheduling wheel(DBSW) architecture. This paper performs the mathematical analysis of the DBSW architecture and compares the results with simulation results. The analysis data and simulation data show that the mathematical analysis developed properly.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.1
• /
• pp.135-139
• /
• 2014

In a connection-oriented packet switching network, the data communication starts after a virtual circuit is established between source and destination. The virtual circuit establishment time includes the queue waiting times in the direction from source to destination and the other way around. We use this two-way queueing delay to evaluate scheduling policies of a packet switching processor through simulation studies. In this letter, we also suggest user testing functions for the packet switching processor to manage virtual circuits. By detecting error causes, the user testing helps the packet switching processor provide reliable connection-oriented services.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2371-2377
• /
• 2010

As the substantial increment in program complexity and appearance of mega program, the programs need to be divided to small tasks with multiple partitions and performed with a priority based scheduling. And also, a program development has to be progressed according to diversify of development environment. For instance, there are some restrictions upon O/S environment such as embedded O/S or windows. Therefore, the adaptive scheduling technique which performs multiple task partitioning process, regardless environment or O/S, is suggested. In this study, In this study, the adaptive scheduling technique algorithm and its applied examples are described.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.1-10
• /
• 2008

In this paper, a packet scheduling algorithm, called the modified PLFS, is proposed for real-time traffic in IEEE 802.22 WRAN systems. The modified PLFS(Packet Loss Fair Scheduling) algorithm utilizes not only the delay of the Head of Line(HOL) packets in buffer of each user but also the amount of expected loss packets in the next-next frame when a service will not be given in the next frame. The performances of the modified PLFS are compared with those of PLFS and M-LWDF in terms of the average packet loss rate and throughput. The simulation results show that the proposed scheduling algorithm performs much better than the PLFS and M-LWDF algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.499-502
• /
• 2010

Because of the substantial increase in program complexity and appearance of mega program, the needs to devide the program into small task with multiple partitions, and perform a scheduling based on the priority is required. And also, a program can be developed on specific environment according to the diversify of development environment. for instance, there are some restrictions upon O/S environment such as Embedded or Windows. therefore, the adaptive scheduling technique which perform multiple task partitioning process regardless environment or O/S is suggested. In this study, Adaptive scheduling technique algorithm and its application to be described.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3523-3543
• /
• 2022

Autonomous vehicles are gradually being regarded as the mainstream trend of future development of the automobile industry. Autonomous driving networks generate many intensive and delay-sensitive computing tasks. The storage space, computing power, and battery capacity of autonomous vehicle terminals cannot meet the resource requirements of the tasks. In this paper, we focus on the task scheduling problem of autonomous driving in software-defined edge networks. By analyzing the intensive and delay-sensitive computing tasks of autonomous vehicles, we propose an emotion model that is related to task urgency and changes with execution time and propose an optimal base station (BS) task scheduling (OBSTS) algorithm. Task sentiment is an important factor that changes with the length of time that computing tasks with different urgency levels remain in the queue. The algorithm uses task sentiment as a performance indicator to measure task scheduling. Experimental results show that the OBSTS algorithm can more effectively meet the intensive and delay-sensitive requirements of vehicle terminals for network resources and improve user service experience.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.6 no.4
• /
• pp.369-375
• /
• 2001

This paper proposes a dual real-time scheduling design under real-time constraints kernel environments. In this paper, we have designed both the real-time kernel and the general kernel that have their different properties to satisfy these properties, that is, interrupt latency, scheduling precision, and message passing. In real-time tasks, interrupt processing should be run. In general kernel, non real-time tasks or general tasks are run. Also, when tasks conflict, it executed the mixed priority scheduling that non real-time kernel executed static scheduling and real-time kernel executed dynamic priority transformation scheduling, that is, least-laxity-first/minimization preemption scheduling. We have compared the results of this study for performance of the proposal real-time kernel with both RT Linux 0.5a and QNX 4.23A, that is, of interrupt latency scheduling precision and message passing.