• Journal of National Security and Military Science
• /
• s.1
• /
• pp.345-360
• /
• 2003

To build an information oriented armed forces, the Korean military telecommunication networks adopt TCP/IP standard communication infrastructures based on ATM packet switched networks. Utilizing this network infrastructure, the Korean armed forces also applies to the areas of battleship management for efficient operation command controls and resource management for efficient resource allocations. In this military communication networks, it is essential to determine the least cost network topology under equal performance and reliability constraints. Basically, this type of communication network design problem is known in the literature as an NP Hard problem. As the number of network node increases, it is very hard to obtain an optimal solution in polynomial time. Therefore, it is reasonable to use a heuristic algorithm which provides a good solution with minimal computational efforts. In this study, we developed a simulated annealing based heuristic algorithm which can be utilized for the design of military communication networks. The developed algorithm provides a good packet switched network topology which satisfies a given set of performance and reliability constraints with reasonable computation times.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4349-4371
• /
• 2019

Moldable parallel tasks are widely used in different areas, such as weather forecast, biocomputing, mechanical calculation, and so on. Considering the deadline and the speedup, scheduling moldable parallel tasks becomes a difficulty. Past work majorly focuses on the LA (List Algorithms) or OMA (Optimizing the Middle Algorithms). Different from prior work, our work normalizes execution time and makes all tasks have the same scope in normalized execution time: [0,1], and then according to the normalized execution time, a method is used to search for the reference execution time without considering the deadline of tasks. According to the reference execution time, we get an initial scheduling result based on AFCFS (Adaptive First Comes First Served) policy. Finally, a heuristic approach is used to improve the performance of the initial scheduling result. We call our method HSRET (a Heuristic Scheduling method based on Reference Execution Time). Comparisons to other methods show that HSRET has good performance in AWT (Average Waiting Time), AET (Average Execution Time), and PUT (Percentages of Unfinished Tasks).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.171-174
• /
• 2013

Virtualization technology opened a new era in the field of Data intensive, Grid and Cloud Computing. Today's Data centers are smarter than ever leveraging the Virtualization technology. In response to that, Dynamic consolidations of Virtual Machines (VMs) allow efficient resource management by live migration of VMs in the hosts. Moreover, each client typically has a service level agreement (SLA), leads to stipulation in dealing with energy-performance trade-off as aggressive consolidation may lead to performance degradation beyond the negotiation. In this paper we propose a Cloud Based CDN approach for allocation of VM that aims to maximize the client-level SLA. Our experiment result demonstrates significant enhancement of SLA at certain level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.505-516
• /
• 2012

According to distribute of resource of macro cell and reduce distance between transmitter and receiver, Femto cell system is promising to provide costeffective strategy for high data traffic and high spectral efficient services in future wireless cellular system environment. However, the co-channel operation with existing Macro networks occurs some severe interference between Macro and Femto cells. Hence, the interference cancellation or management schemes are imperative between Macro and Femto cells in order to avoid the decrease of total cell throughput. First, we briefly investigate the conventional resource allocation and interference cancellation scheme between Macro and Femto cells. So we found that cell throughput and frequency reuse ware decreased Then, we propose an adaptive resource allocation scheme based on the distribution of Femtocell traffic in order to increase the cell throughput and also maximize the spectral efficiency over the FFR (Fractional Frequency Reuse) based conventional resource allocation schemes. Simulation Results show that the proposed scheme attains a bit similar SINR (Signal to Interference Noise Ratio) distribution but achieves much higher total cell throughput performance distribution over the conventional resource allocation schemes for FFR and future IEEE 802.16m based Femtocell network environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.565-572
• /
• 2007

3G Long Term Evolution (3G LTE) is a next generation cellular networks system capable or providing various mobile multimedia services by using OFDMA and MIMO based radio access technology. Among many differences from existing WCDMA based systems, the facts that 3G LTE uses Physical Resource Block (PRB) as its radio resources and provides all services through the PS domain make the development of new resource management schemes necessary. This paper proposes an adaptive partitioning based downlink call admission control scheme. It separates realtime call requests from non-realtime ones, specifies maximum allowable resource amounts for each type, but if the maximum is exceeded, call requests are accepted with probability proportional to remaining resource amounts. Despite the fact that such adaptive concept has been already adopted by other call admission schemes, the contributions of our paper, which are that we are able to find an efficient way to apply the proposed scheme exploiting PRB characteristics and measure the resource usage of base stations by PRB utilization and payload ratio, are still valid. When judging from simulation results in comparison with others, our scheme is able to prioritize realtime call requests over non-realtime ones, and at the same time, overall system performance is superior.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1533-1546
• /
• 2013

Wireless multicast is considered as an effective transmission mode for the future mobile social contact services supported by Long Time Evolution (LTE). Though wireless multicast has an excellent resource efficiency, its performance suffers deterioration from the channel condition and wireless resource availability. Cognitive Radio (CR) and Device to Device (D2D) are two solutions to provide potential resource. However, resource allocation for cognitive wireless multicast based on D2D is still a great challenge for LTE social networks. In this paper, a joint sub-carriers and power allocation model based on D2D for general cognitive radio multicast (CR-D2D-MC) is proposed for Orthogonal Frequency-Division Multiplexing (OFDM) LTE systems. By opportunistically accessing the licensed spectrum, the maximized capacity for multiple cognitive multicast groups is achieved with the condition of the general scenario of imperfect spectrum sensing, the constrains of interference to primary users (PUs) and an upper-bound power of secondary users (SUs) acting as multicast source nodes. Furthermore, the fairness for multicast groups or unicast terminals is guaranteed by setting a lower-bound number of the subcarriers allocated to cognitive multicast groups. Lagrange duality algorithm is adopted to obtain the optimal solution to the proposed CR-D2D-MC model. The simulation results show that the proposed algorithm improves the performance of cognitive multicast groups and achieves a good balance between capacity and fairness.

• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.883-891
• /
• 2008

Multiple antenna orthogonal frequency division multiplexing (OFDM) is a promising technique for the high downlink-capacity in the next generation wireless systems, in which adaptive resource allocation is an important research issue that can significantly improve the performance with guaranteed QoS for users. However, most of the current resource allocation algorithms are limited to unicast system. In this paper, dynamic resource allocation is studied for multiple antenna OFDM based systems with multicast service. In the simulation, the performance of multicast system was compared with that of the unicast system. Numerical results also show that by using the proposed algorithms the system capacity is significantly improved compared with the conventional scheme.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.283-292
• /
• 2002

This paper develops a scheme of resource management for guaranteeing QoS of realtime traffic in wireless mobile internet environments Mobile terminal has significant impact on the QoS originating mobility provided to a real-time application. The currently proposed MRSVP is not clear the boundary of resource reservation tregion and also can give rise to signal overhead to maintain sessions. To solve above problem, we propose the new reservation protocol, mobile cluster based H-MRSVP to combine MRSVP with moving cluster concept. In this paper, we analytically design our model for guaranteeing the QoS of realtime traffic and compare the three schemes: guard channel allocation schemes, DCA and our model. The performance measures are the probabilities of new call blocking, handoff dropping, resource utilization and service completion versus the system offered Erlang load. Consequently, Simulation indicate our model is more flexible than DCA in a view pint of channel utilization and gains the advantage over guard channel scheme with respects to the mobility.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1109-1114
• /
• 2003

In this paper, task control architecture is proposed for a mobile robot with behaviors based on cognition theory to endow the robot intelligence. In the task control architecture, task manager is introduced especially for the management of computational resource. The management is based on classical RMS (Rate Monotonic Strategy), but with online rate modulation strategy. The rate modulation is performed using the value variances of behavior execution for the task. Because the values are based on natively uncertain sensor information, they are modeled using PDF (probability Density Function). As a rate modulation process, the range of the rate modulation is defined firstly by real-time constraints of RMS and discrete control stability of behaviors. With the allowable range, rate modulations are performed considering harmonic bases to maintain utilization bound without decrease. To evaluate the efficiency of the proposed rate modulation strategy, a simulation test is performed to compare the efficiency between the control architecture with the proposed strategy and previous one. A performance index with the formalization of propensity of resource allocation is proposed and utilized for the simulation test. To evaluate the appropriateness of the performance index, the performance index is compared with practical one through a practical simulation test.

• Journal of Technology Innovation
• /
• v.19 no.3
• /
• pp.115-140
• /
• 2011

The fact that innovation activities of venture firms and start-ups play crucial role in driving industrial development and economic growth has significantly increased the importance of business incubator and techno-park which promote new businesses creations. This review paper aims at not only generating performance measurement index of business incubators but also categorizing performance determinants in accordance with three different theoretical perspectives of resource-based view, strategy patterns, and social networks. Futhermore, as future direction of research, this paper emphasizes structured research efforts on the critical effects of incubator's governance patterns, external and regional contexts, and analysis of government incubator policy.