• Journal of the Korea Computer Industry Society
• /
• v.9 no.4
• /
• pp.171-176
• /
• 2008

Most booking techniques make a reservation without customer's preference on internet. These techniques have booking problems not to improve customer's preference in the service industry. We have tried to apply object-based scheduling technique to performing art reservation. For customer's satisfaction, we have considered customer's preferences in the reservation scheduling. The scheduling technique for performing art reservation proposed in this thesis is based on object-oriented concepts. To consider the over all satisfaction, the events of every object are alloted to the sitting plan board along its priority. To minimize backtracking or not to fail the allotment of events, we have scheduled to rise customer's preference in the scheduling.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.145-152
• /
• 2021

In the Recent times, various technological enhancements in the field of artificial intelligence and big data has been noticed. This advancement coupled with the evolution of the 5G communication and Internet of Things technologies, has helped in the development in the domain of smart mine construction. The development of unmanned vehicles with enhanced and smart scheduling system for open-pit mine transportation is one such much needed application. Traditional open-pit mining systems, which often cause vehicle delays and congestion, are controlled by human authority. The number of sensors has been used to operate unmanned cars in an open-pit mine. The sensors haves been used to prove the real-time data in large quantity. Using this data, we analyses and create an improved transportation scheduling mechanism so as to optimize the paths for the vehicles. Considering the huge amount the data received and aggregated through various sensors or sources like, the GPS data of the unmanned vehicle, the equipment information, an intelligent, and multi-target, open-pit mine unmanned vehicle schedules model was developed. It is also matched with real open-pit mine product to reduce transport costs, overall unmanned vehicle wait times and fluctuation in ore quality. To resolve the issue of scheduling the transportation, we prefer to use algorithms based on artificial intelligence. To improve the convergence, distribution, and diversity of the classic, rapidly non-dominated genetic trial algorithm, to solve limited high-dimensional multi-objective problems, we propose a decomposition-based restricted genetic algorithm for dominance (DBCDP-NSGA-II).

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.6
• /
• pp.584-590
• /
• 2016

This paper proposed "Priority Scheduling and MultiPath Routing Protocol (RRPS) for preventing communication disruption in the urban environment" to minimize the disconnection or disruption of V2I and V2V communication in the urban environment where communication is frequently disconnected according to density. The flow of the RRPS is explained as follows. RSU Request Priority Scheduling (RRPS) is used to apply the priority of the request message prior to reaching the end line by using the Start Line and End Line, which are the management areas of the RSU). This paper also proposed MPRP (Multi Path Routing Protocol) design to set up the multipath to the destination. As a result, the proposed RRPS improves the processing efficiency of V2I by applying priority scheduling to the message of the vehicle requesting the information in the RSU, and can prevent the communication disconnection. Thereby, it is improved the transmission success probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5917-5935
• /
• 2018

Adaptive Multi-Rate Codec is one of the codecs which is used for making voice calls. It helps to connect people who are scattered in various geographical areas. It adjusts its bit-rate according to the user's channel conditions. It plays a vital role in providing an improved speech quality of voice connection in Long Term Evolution (LTE). There are some constraints which need to be addressed in providing this service profitably. Quality of Service (QoS) is the dominant mechanism which determines the quality of the speech in communication. On several occasions, number of users are trying to access the same channel simultaneously by standing in a particular region for a longer period of time. It refers to Multi-user channel sharing problem which leads to resource loss very often. The main aim of this paper is to develop a novel RSA - QoS scheduling algorithm for reducing the Resource Loss Ratio. Eventually, it increases the throughput.The simulation result shows that the RSA - QoS increases the number of users for accessing the resources better than the existing algorithms in terms of resource loss and throughput. Ultimately, it enhances the QoS in Mobile Networks.

• 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 Korea Contents Association
• /
• v.5 no.1
• /
• pp.89-99
• /
• 2005

HPI system provides 1-3 Mbps data transmission speed to terminals moving up to 60 km/sec. Since HPI supports rtPS, nrtPS, and BE services requiring different QoS, it needs an efficient scheduling method based on those different QoSs. This paper suggests an uplink scheduling method which gives priority to services in the order of rtPS, nrtPS and BE services but which reserves some bandwidth for the low priority services before it allocates the bandwidth to higher priority services. Simulation results show that it can improve the uplink performance by reserving mean transmission rate to each nrtPS terminal and by reserving bandwidth, which amounts to about 1.5 times the mean transmission rate of the whole BE terminals, to the whole BE terminals.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2398-2421
• /
• 2020

In third world countries like Pakistan, the production of electricity has been quickly reduced in past years due to rely on the fossil fuel. According to a survey conducted in 2017, the overall electrical energy capacity was 22,797MW, since the electrical grids have gone too old, therefore the efficiency of grids, goes down to nearly 17000MW. Significant addition of fossil fuel, hydro and nuclear is 64.2%, 29% and 5.8% respectively in the total electricity production in Pakistan. In 2018, the demand crossed 20,223MW, compared to peak generation of 15,400 to 15,700MW as by the Ministry of Water and Power. Country faces a deficit of almost 4000MW to 5000MW for the duration of 2019 hot summer term. Focus on one aspect considering Demand Side Management (DSM) cannot oversea the reduction of gap between power demand and customer supply, which eventually leads to the issue of load shedding. Hence, a scheduling scheme is proposed in this paper called RPSMDSM that is based on selection of those appliances that need to be only Turned-On, on priority during peak hours consuming minimum energy. The Home Energy Management (HEM) system is integrated between consumer and utility and bidirectional flow is presented in the scheme. During peak hours of electricity, the RPSMDSM is capable to persuade less power consumption and accomplish productivity in load management. Simulations show that RPSMDSM scheme helps in scheduling the electricity loads from peak price to off-peak price hours. As a result, minimization in electricity cost as well as (Peak-to-Average Ratio) PAR are accomplished with sensible waiting time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.57-64
• /
• 2012

Multiplayer, real-time games are a kind of soft real-time systems because a game server has to respond to requests from many clients within specified time constraints. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to different priorities on CPU processing. Events can be divided into different groups, depending on their consistency degree and priority. To handle these events with different priority and meet their timing constraints, we propose a priority-based group task scheduling policy in this paper. The number of clients or events requested by each client may be increased temporarily. In the presence of transient overloading, the game server needs to allocate more CPU bandwidth to serve an event with the higher priority level preferentially. The proposed scheduling policy is capable of enhancing real-time performance of the entire system by maximizing the number of events with higher priority completed successfully within their deadlines. The performance of this policy is evaluated through extensive simulation experiments.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.4
• /
• pp.87-92
• /
• 2020

Although GPGPU (General-Purpose GPU) can maximize performance by parallelizing a task with tens of thousands of threads, those threads are internally grouped into a thread block, which is a base unit for processing and resource allocation. A thread block scheduler is a specialized hardware gadget whose role is to allocate thread blocks to GPGPU processing hardware in a round-robin manner. However, round-robin is a sequential allocation policy and is not optimized for GPGPU resource utilization. In this paper, we propose a thread block scheduler model which can analyze and quantify performances for various thread block scheduling policies. Experiment results from the implemented simulator of our model show that the legacy hardware thread block scheduling does not behave well when workload becomes heavy.

• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.197-202
• /
• 2007

This study focused on design and implementation of Mobile 3D Bluetooth Game Engine based on OpenGL-ES. In Mobile 3D network game so far, there is a form the mainstream of wireless inter-net game using WAP and VM. But, VM game we popular because of an excessive communication expense problem for this mobile network game that occur when connect to wireless internet as point out to problem by it, that is, stand-alone game are very popular. This study introduce a mobile 3D Bluetooth Game Engine which is based on mobile 3D standard using OpenGL-ES to solve a problem like mobile network game generally that occur when connect to take pleasure a wireless internet from some people into a short distance. When the number of concurrent packet datum by Bluetooth terminal transfers to each other, we shows that the proposed scheduling scheme for enhancing the process speed up on Bluetooth.