• Title/Summary/Keyword: research resource allocation

Search Result 345, Processing Time 0.027 seconds

An Efficient Resource Allocation Scheme For An Integrated Satellite/Terrestrial Networks (위성/지상 겸용 망 내 간섭을 고려한 최적 자원 할당 방식)

  • Park, Unhee;Kim, Hee Wook;Oh, Dae-Sub;Jang, Dae-Ik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.2
    • /
    • pp.298-306
    • /
    • 2015
  • In this paper, we propose an efficient resource allocation scheme for the integrated satellite/terrestrial networks. The proposed scheme is a frequency sharing technique to mitigate the inter-component interferences which can be generated between a satellite beam and terrestrial cells that are operated in the same frequency. The proposed dynamic resource allocation scheme can mitigate the total inter-component interference by optimizing the total transmission power and it can expect a result of which can lead to an increase in capacity. In such a system, the interference situation can be affected by the distributed traffic demands or up/down link communications environments. In this point of view, we evaluate the performance of the total consumed power, the amount of inter-component interference with respect to different traffic distributions and interference environments between the satellite beam and terrestrial systems.

Exploring the Impact of Live Commercial Anchors on Business Performance and Survival Strategy: Focusing on Resource Configuration and Environmental Choice

  • ZHANG, Li-Jie;HUANG, Fei
    • East Asian Journal of Business Economics (EAJBE)
    • /
    • v.10 no.4
    • /
    • pp.1-18
    • /
    • 2022
  • Purpose - Through the analysis and research of different characteristics and related mechanisms of live commerce anchors, this paper aimed to help live commerce anchors to strengthen their characteristic advantages, beautify the live broadcast environment, improve resource allocation and enhance business performance, so as to help live commerce anchors to achieve better high-quality development. Research design, data, and methodology - This study was conducted by sample survey method on 361 live commercial anchors who have experience in using major online shopping malls for more than one year. Data analysis methods were frequency analysis, confirmatory factor analysis, reliability analysis, correlation analysis, and structural equation model analysis. Result - Hypothesis 1 through Hypothesis 5 were all supported. The results of this study suggest that professionalism and mutual entertainment of live commercial anchors have a significant impact on business performance, survival strategy, resource allocation and environment selection. The resource allocation and environment selection of live commercial anchors play a mediating role in the professionalism and mutual entertainment of live commercial anchors on business performance and survival strategy. Conclusion -The results implied that the professionalism and inter entertainment of live commercial anchors have a positive impact on business performance and survival strategy. In the new situation, live commercial anchors should further improve their professionalism and mutual entertainment, so as to achieve better development.

A Study on the Label Allocation Method on MPLS Network (MPLS 망에서의 레이블 할당에 관한 연구)

  • 이철현;이병호
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.109-112
    • /
    • 1999
  • In this paper, we propose more effective method of label allocation on Multi-Protocol Label Switching (MPLS) which is IP over ATM integrated model. We research the problems, one is using downstream label allocation method case, the other is using both downstream and upstream label allocation method. Easily we can solve this problem through the downstream-on-demand label allocation method with RSVP(Resource ReSerVation Protocol). In experiment we can find 1.5~28% error which will be fixed by using downstream-on-demand label allocation method.

  • PDF

Optimal Resource Allocation for Fleet Availability Management in Closed Queueing Network

  • Park Kyung S.;Ahn Byung-ha
    • Journal of the military operations research society of Korea
    • /
    • v.6 no.2
    • /
    • pp.47-67
    • /
    • 1980
  • Interactions of major activities participating in fleet operations are investigated in the framework of a closed queueing network system with finite aircrafts assigned to it. An implementable algorithm is developed, which is useful for computing the distributions needed to evaluate the effects of the interactions on the fleet operations. The availability management program is focused on seeking an optimal resource allocation to multiple repair-shops to maximize the fleet availability subject to the budget constraint.

  • PDF

Event-Driven Real-Time Simulation Based On The RM Scheduling and Lock-free Shared Objects

  • Park, Hyun Kyoo
    • Journal of the military operations research society of Korea
    • /
    • v.25 no.1
    • /
    • pp.199-214
    • /
    • 1999
  • The Constructive Battle Simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under real-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. Conventionally, scheduling and resource allocation activities which have timing constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rate monotonic scheduling.

  • PDF

A Dynamic Bandwidth Allocation Scheme for a Multi-spot-beam Satellite System

  • Park, Unhee;Kim, Hee Wook;Oh, Dae Sub;Ku, Bon-Jun
    • ETRI Journal
    • /
    • v.34 no.4
    • /
    • pp.613-616
    • /
    • 2012
  • A multi-spot-beam satellite is an attractive technique for future satellite communications since it can support high data rates by projecting high power density to each spot beam and can reuse a frequency in different cells to increase the total system capacity. In this letter, we propose a resource management technique adjusting the bandwidth of each beam to minimize the difference between the traffic demand and allocated capacity. This represents a reasonable solution for dynamic bandwidth allocation, considering a trade-off between the maximum total capacity and fairness among the spot beams with different traffic demands.

A new approach for resource allocation in project scheduling with variable-duration activities

  • 김수영;제진권;이상우
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1994.04a
    • /
    • pp.410-420
    • /
    • 1994
  • In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.

An Adaptive Superframe Duration Allocation Algorithm for Resource-Efficient Beacon Scheduling

  • Jeon, Young-Ae;Choi, Sang-Sung;Kim, Dae-Young;Hwang, Kwang-il
    • Journal of Information Processing Systems
    • /
    • v.11 no.2
    • /
    • pp.295-309
    • /
    • 2015
  • Beacon scheduling is considered to be one of the most significant challenges for energy-efficient Low-Rate Wireless Personal Area Network (LR-WPAN) multi-hop networks. The emerging new standard, IEEE802.15.4e, contains a distributed beacon scheduling functionality that utilizes a specific bitmap and multi-superframe structure. However, this new standard does not provide a critical recipe for superframe duration (SD) allocation in beacon scheduling. Therefore, in this paper, we first introduce three different SD allocation approaches, LSB first, MSB first, and random. Via experiments we show that IEEE802.15.4e DSME beacon scheduling performs differently for different SD allocation schemes. Based on our experimental results we propose an adaptive SD allocation (ASDA) algorithm. It utilizes a single indicator, a distributed neighboring slot incrementer (DNSI). The experimental results demonstrate that the ASDA has a superior performance over other methods from the viewpoint of resource efficiency.

Regional Science and Technology Resource Allocation Optimization Based on Improved Genetic Algorithm

  • Xu, Hao;Xing, Lining;Huang, Lan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1972-1986
    • /
    • 2017
  • With the advent of the knowledge economy, science and technology resources have played an important role in economic competition, and their optimal allocation has been regarded as very important across the world. Thus, allocation optimization research for regional science and technology resources is significant for accelerating the reform of regional science and technology systems. Regional science and technology resource allocation optimization is modeled as a double-layer optimization model: the entire system is characterized by top-layer optimization, whereas the subsystems are characterized by bottom-layer optimization. To efficaciously solve this optimization problem, we propose a mixed search method based on the orthogonal genetic algorithm and sensitivity analysis. This novel method adopts the integrated modeling concept with a combination of the knowledge model and heuristic search model, on the basis of the heuristic search model, and simultaneously highlights the effect of the knowledge model. To compare the performance of different methods, five methods and two channels were used to address an application example. Both the optimized results and simulation time of the proposed method outperformed those of the other methods. The application of the proposed method to solve the problem of entire system optimization is feasible, correct, and effective.

SIMULATED ANNEALING FOR LINEAR SCHEDULING PROJECTS WITH MULTIPLE RESOURCE CONSTRAINTS

  • C.I. Yen
    • International conference on construction engineering and project management
    • /
    • 2007.03a
    • /
    • pp.530-539
    • /
    • 2007
  • Many construction projects such as highways, pipelines, tunnels, and high-rise buildings typically contain repetitive activities. Research has shown that the Critical Path Method (CPM) is not efficient in scheduling linear construction projects that involve repetitive tasks. Linear Scheduling Method (LSM) is one of the techniques that have been developed since 1960s to handle projects with repetitive characteristics. Although LSM has been regarded as a technique that provides significant advantages over CPM in linear construction projects, it has been mainly viewed as a graphical complement to the CPM. Studies of scheduling linear construction projects with resource consideration are rare, especially with multiple resource constraints. The objective of this proposed research is to explore a resource assignment mechanism, which assigns multiple critical resources to all activities to minimize the project duration while satisfying the activities precedence relationship and resource limitations. Resources assigned to an activity are allowed to vary within a range at different stations, which is a combinatorial optimization problem in nature. A heuristic multiple resource allocation algorithm is explored to obtain a feasible initial solution. The Simulated Annealing search algorithm is then utilized to improve the initial solution for obtaining near-optimum solutions. A housing example is studied to demonstrate the resource assignment mechanism.

  • PDF