• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2981-2986
• /
• 2015

In this paper, there are m servers to carry out broadcasts and the scheduling problem to serve the requests with deadlines is studied. If a server broadcasts a page, then all the requests which require the page are satisfied. A scheduling algorithm shall determine which pages are broadcasted on servers at a time. Its goal is to maximize the sum of weights of requests satisfied within their deadlines. The performance of an on-line algorithm is compared with that of the optimal off-line algorithm which can see all the inputs in advance. In general, the off-line algorithms outperform the on-line algorithms. So we will use the resource augmentation analysis in which the on-line algorithms can utilize more resources. We consider the case that the on-line algorithms can use more servers in this paper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2303-2308
• /
• 2012

In this paper, we deal with the problem of scheduling parallel tasks with deadlines. Parallel tasks can be simultaneously executed on various machines and specially, we consider the malleable tasks, that is, the tasks whose execution time is given by a function of the number of machines on which they are executed. The goal of the problem is to maximize the throughput of tasks completed within their deadlines. This problem is well-known as NP-hard problem. Thus we will find an approximation algorithm, and its performance is compared with that of the optimal algorithm and analyzed by finding the approximation ratio. In particular, the algorithm has more resources, that is, more machines, than the optimal algorithm. This is called the resource augmentation analysis. We propose an algorithm to guarantee the approximation ratio of 3.67 using 1.5 times machines.

• Environmental and Resource Economics Review
• /
• v.11 no.1
• /
• pp.99-119
• /
• 2002

As an alternative to classical maximum likelihood approach for analyzing dichotomous choice contingent valuation (DCCV) data, this paper develops a Bayesian approach. By using the idea of Gibbs sampling and data augmentation, the approach enables one to perform exact inference for DCCV models. A by-product from the approach is welfare measure, such as the mean willingness to pay, and its confidence interval, which can be used for policy analysis. The efficacy of the approach relative to the classical approach is discussed in the context of empirical DCCV studies. It is concluded that there appears to be considerable scope for the use of the Bayesian analysis in dealing with DCCV data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1934-1939
• /
• 2013

In this paper, we consider the online scheduling problem of jobs with deadlines. The jobs arrive over time and the scheduling algorithm has no information about the arriving jobs in advance. The jobs have the processing time of the equal length and the goal of the scheduling algorithm is to maximize the number of jobs completed in their deadlines. The performance of the online algorithm is compared with that of the optimal algorithm which has the full information about all the jobs. The raio of the two performances is called the competitive ratio. In general, the ratio is unbouned. So the case that the online algorithm can have more resources than the optimal algorithm is considered, which is called the resource augmentation analysis. In this paper, the online algorithm have more machines. We show that the online algorithm can have the same performance as the optimal algorithm.

• Smart Media Journal
• /
• v.13 no.6
• /
• pp.24-34
• /
• 2024

If the future can be predicted from network traffic data, which is a time series, it can achieve effects such as efficient resource allocation, prevention of malicious attacks, and energy saving. Many models based on statistical and deep learning techniques have been proposed, and most of these studies have focused on improving model structures and learning algorithms. Another approach to improving the prediction performance of the model is to obtain a good-quality data. With the aim of obtaining a good-quality data, this paper applies a dense sampling technique that augments time series data to the application of network traffic prediction and analyzes the performance improvement. As a dataset, UNSW-NB15, which is widely used for network traffic analysis, is used. Performance is analyzed using RMSE, MAE, and MAPE. To increase the objectivity of performance measurement, experiment is performed independently 10 times and the performance of existing sparse sampling and dense sampling is compared as a box plot. As a result of comparing the performance by changing the window size and the horizon factor, dense sampling consistently showed a better performance.