• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• The KIPS Transactions:PartD
• /
• v.18D no.4
• /
• pp.299-308
• /
• 2011

In the recent years, a variety of projects have been conducted in order to enhance competitiveness of leading businesses and their followers in the market. Accordingly, the importance of project portfolio management has risen in the open market industry. Project portfolio management refers to crucial decision-making processes which aim to maximize benefits by selecting projects most suitable for a strategic objective among multiple projects with limited resources. In this study, the trend of project portfolio management studies is introduced. The study also presents a mathematical model of the problem, which aims at maximizing project values, possibility, and similarity between projects in the limited resources. We use the genetic algorithm to obtain the priority orders of projects. In order to verify this study, we compare the results of this study and the existing schedules of the E-open market in South Korea. This study ultimately reduces project risks, improves efficiency of development and continuity of tasks by properly ordering projects and assigning developers to the projects.

• Journal of Satellite, Information and Communications
• /
• v.10 no.2
• /
• pp.24-29
• /
• 2015

Recently, with developments of various networks, devices and various services, energy efficiency has become one of the most crucial issues with respect to sustainability of mobile devices. For connecting to networks seamlessly to offer services, a scenario of RF energy harvesting which supplies energy to wireless devices with RF signals is assumed. To increase the efficiency of RF energy harvesting, this paper proposes a RF energy harvesting algorithm which is based upon a frequency selective fading map. Through the algorithm, a receiver of mobile device can get fading information at each frequency and select a frequency which has the best quality. At the end, the simulation result demonstrates its superiority by showing a 4.45dB improvement in comparison to a deep fading frequency point.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.5 s.347
• /
• pp.84-93
• /
• 2006

Ethernet-PON is an emerging access network technology that provides a low-cost method of deploying optical access lines between OLT and ONUs. It has a point-to-multipoint and multipoint-to-point architecture in downstream and upstream direction, respectively. Therefore, downstream packets are broadcast from an OLT toward all ONUs sithout collision. On the other hand, since alt ONUs share a common channel, the collision may be occurred for the upstream transmission. Therefore, earlier efforts on Ethernet-PON have been concentrated on an upstream MAC protocol to avoid collision. But it is needed to control downstream traffic in practical access network, where the network provider limits available bandwidth according to the number of users. In this paper, we propose a traffic control scheme for supporting the fairness of the downstream bandwidth. The objective of this algorithm is to guarantee the fairness of ONUs while maintaining good performance. In order to do this, we define the service probability that considers the past traffic information for downstream, the number of tokens and the relative size of negotiated bandwidth. We develop the simulation model for Ethernet-PON to evaluate the rate-limiting algorithm by using AWESIM. Some results are evaluated and analyzed in terms of defined fairness factor, delay and dropping rate under various scenario.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.400-406
• /
• 2014

In this paper, we propose an approach to minimizing total power consumption by deploying multiple clean-up robots simultaneously in a given area. For this, we propose to use the cooperative game theoretic approaches (i.e., Nash bargaining solution (NBS)) such that the robots can optimally and fairly negotiate the area division based on available resources and characteristics of the area, thereby leading to the minimum total power consumption. We define a utility function that includes power consumptions for characteristics of areas and the robots can agree on a utility pair based on the NBS. Simulation results show that the proposed approach can reduce the total average power consumption by 15-30% compared to a random area division approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.745-750
• /
• 2008

In a cognitive radio based system, quality of service (QoS) for the secondary user must be maintained as much as possible even while that of the primary user is protected all he time. In particular, switching wireless links for the secondary user during the transmission of multimedia data causes delay and information loss, and QoS degradations occur inevitably. The efficient resource management scheme is necessary to support the seamless multimedia service to the secondary user. This paper proposes a novel frequency selection method based on Multi-Criteria Decision Making (MCDM), in which uncertain parameters such as received signal strength, cell load, data rate, and available bandwidth are considered during the decision process for the frequency selection with the fuzzy set theory. Through simulation, we show that our proposed frequency selection method provides a better performance than the conventional methods which consider the received signal strength only.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2191-2204
• /
• 1997

An efficient packet transmit scheduling algorithm should be able to allocate the resource to each connection fairly based on the bandwidth and quality of service requirements negotiated during the call admission procedure and it should be able to isolate the effects of users that are behaving badly. In this paper, we propose an effective round-robin packet transmit scheduling mechanism, which we call the delay tolerant packet reserving scheme (DTPRS) based on delay QoS requirments. The proposed scheme can not only provide fairness and but also reduce delay, delay variation, and packet loss rate by reserving output link time slots of delay tolerant packets and assigning the reserved slotsto delay urgent packets. Our scheme is applicable to high speed networks including ATM network because it only requires O(1) work to process a packet, and is simple enough to implement.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.156-167
• /
• 2007

In this paper, we develop the model based prediction algorithm for Variable-Bit-Rate(VBR) video traffic with regular Group of Picture(GOP) pattern. We use multiplicative ARIMA process called GOP ARIMA (ARIMA for Group Of Pictures) as a base stochastic model. Kalman Filter based prediction algorithm consists of two process: GOP ARIMA modeling and prediction. In performance study, we produce three video traces (news, drama, sports) and we compare the accuracy of three different prediction schemes: Kalman Filter based prediction, linear prediction, and double exponential smoothing. The proposed prediction algorithm yields superior prediction accuracy than the other two. We also show that confidence interval analysis can effectively detect scene changes of the sample video sequence. The Kalman filter based prediction algorithm proposed in this work makes significant contributions to various aspects of network traffic engineering and resource allocation.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1433-1442
• /
• 1997

Algorithm design is needed to optimized bandwidth which satisfy quality of service(QoS) requirements of vary traffic classes for Multimedia service in ATM networks. The diverse flow characteristics e.g., burstiness, bit rate and burst length, have to guarantee the different quality of service(QoS) requirements in Asynchronous Transfer Mode(ATM). The QoS parameter may be measured in terms of cell loss probability and maximum cell dely. In this paper, we consider the ATM networks which the virtual path(vip) concept is implemented by applying the Markov Modulated Deterministic Process method. We develop an efficient algorithm to computer the minimum capacity required to satisfy all the QoS requirements when multiple classes of on-off source are multiplexed on single VP. Using above the result, we propose a simple algorithm to determine the VP combination to achieve the near optimum of total capacity required for satisfying the individual QoS requirements. Numerical results are also presented to demonstrate the performance of the algorithm, when compared to the optimal total capacity required.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.7
• /
• pp.22-28
• /
• 2009

As multiprocessors have been widely adopted in embedded systems, task computation energy consumption should be minimized with several low power techniques supported by the multiprocessors. This paper proposes an energy-aware task scheduling algorithm that adopts both dynamic voltage scaling and power shutdown in multiprocessor environments. Considering the timing and energy overhead of power shutdown, the proposed algorithm performs an iterative task assignment and task ordering for multiprocessor systems. In this case, the iterative priority-based task scheduling is adopted to obtain the best solution with the minimized total energy consumption. Total energy consumption is calculated by considering a linear programming model and threshold time of power shutdown. By analyzing experimental results for standard task graphs based on real applications, the resource and timing limitations were analyzed to maximize energy savings. Considering the experimental results, the proposed energy-aware task scheduling provided meaningful performance enhancements over the existing priority-based task scheduling approaches.