• Title/Summary/Keyword: Resources allocation

Search Result 790, Processing Time 0.032 seconds

Priority-Based Resource Allocation Algorithm for Virtual Network (가상 네트워크를 위한 우선순위 기반 자원 할당 알고리즘)

  • Kim, Hak-Suh;Lee, Sang-Ho
    • Journal of Digital Convergence
    • /
    • v.14 no.10
    • /
    • pp.303-310
    • /
    • 2016
  • Due to the ossification of the Internet, it is difficult to accommodate variety services. One of the efficient solution to this problem is network virtualization. It allows multiple parallel virtual networks to run on the shared physical infrastructure. It needs new resource allocation mechanism to share efficient physical resources. In this paper, we present efficient bandwidth allocation algorithm for virtual network request with high service priority. Our proposed algorithm can withdraw allocated bandwidth from low-level priority virtual network and maintain low-level virtual network service. We evaluated the performance of our proposed algorithm using simulation and found the improvement of approximately 8% acceptance rate.

A Dynamic Resource Allocation on Service Quality of Internet Shopping-mall (인터넷 쇼핑몰의 서비스 품질에 대한 동태적 자원배분 의사결정)

  • Kwak, Soo-Il;Choi, Kang-Hwa;Kim, Soo-Wook
    • Journal of Korean Society for Quality Management
    • /
    • v.33 no.4
    • /
    • pp.21-41
    • /
    • 2005
  • This study analyzes the Internet utilization pattern of customer by comprehensively investigating the previous studies on the behavior pattern of customer in terms of Internet business. Based on the analysis, this study develops research framework that supports strategic decision-making for resource allocation in Internet business. Such research framework would be helpful for providing the typology of Internet business model that can be specialized by each industry. As a result of the simulation analysis, it was found that the optimal resource allocation portfolio providing maximum profits to the Internet bookstore involves large-scale investment on delivery service and customer support service which are the key factors for post-purchase customer satisfaction, regardless of the growth pattern or size of Internet bookstore market. Consequently, from the above analysis, the investment ratio of resources for the profit maximization of Internet bookstore was drawn. Conclusively, based on the comprehensive examination of the results, this study provided a framework for dynamic resource allocation decision-making, and proposed a management strategy which allows consumers to shop under more favorable environment, and simultaneously enables the Internet bookstore to accomplish management objectives such as continuous growth and profit maximization.

Bus 형 LAN의 Contention-Token 혼합형 프로토콜에 관한 연구

  • 김정선
    • Information and Communications Magazine
    • /
    • v.4 no.4
    • /
    • pp.505-524
    • /
    • 1987
  • Nowaday all the countries of the world have studied the various problems caused in operating their own ports efficiently. Ship delay in the port is attributal to the inefficient operation in the navigation aids, the cargo handling, the storage and transfer facilities, and to the inefficient allocation of gangs or to a bad service for ships. Among these elements the allocation of gangs is the predominating factor in minimizing ship's turn round time. At present, in the case of Pusan Port. the labour union and stevedoring companies allocate gangs in every hatches of ships by a rule of thumb, just placing emphasis on minimizing ship's turn round time, without applying the principle of allocation during the cargo handling. Owing to this the efficiency of the cargo handling could not be expected to be maximized and this unsystematic operation result in supplying human resources of much unnecessary surplus gangs. Therefore in this paper the optimal size and allocation of gangs for minimizing the ship's turn round time is studied and formularized. For the determination of the priority for allocation the evaluation function, namely $F=PHi^{n}{\times}(W+H)$, can be obtained; where, PHI : Principal Hatch Index W : Total Cargo Weight represented in Gang-Shifts H : Total Number of Ship's hatches and also for the optimal size of gangs the average number of gang allocated per shift (Ng), namely Ng=W/PHI, is used. The proposed algorithm is applied to Pusan Port and its validity is verified.

  • PDF

Network function virtualization (NFV) resource allocation (RA) scheme and research trend (네트워크기능 가상화 (NFV) 자원할당 (RA) 방식과 연구동향)

  • Kim, Hyuncheol;Yoon, Seunghyun;Jeon, Hongseok;Lee, Wonhyuk
    • Convergence Security Journal
    • /
    • v.16 no.7
    • /
    • pp.159-165
    • /
    • 2016
  • Through the NFV (Network Function Virtualization), companies such as network service providers and carriers have sought to dramatically reduce CAPEX / OPEX by improving the speed of new service provisioning and flexibility of network construction through the S/W-based devices provided by NFV. One of the most important considerations for establishing an NFV network to provide dynamic services is to determine how to dynamically allocate resources (VNFs), the basic building blocks of network services, in the right place. In this paper, we analyzed the latest research trends on VNF node, link allocation, and scheduling in nodes that are required to provide arbitrary NS in NFV framework. In this paper, we also propose VNF scheduling problems that should be studied further in RA (Resource Allocation).

Efficient Resource Allocation Algorithm for Multiuser OFDM Systems (다중 사용자 OFDM 시스템에서의 효율적인 자원 할당 알고리즘)

  • Lee, Jung-Yoon;Yoon, Dong-Weon;Park, Sang-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4A
    • /
    • pp.344-350
    • /
    • 2007
  • Start after striking space key 2 times. Lately, a lot of researches have been done on the resource allocation for multiuser OFDM(Orthogonal Frequency Division Multiplexing) systems due to its spectral efficiency for high-rate multimedia data services. For multimedia services in which every user is guaranteed to have minimum required bit rate and bit error probability, it is critical to utilize the limited resources efficiently to improve the performance of the system. The introduced allocation method improves spectral efficiency to use the left subcarriers in Zhang's algorithm. By using this method, the system can provide services to more users constantly, except for a bit increasing complexity and memory for deciding the left subcarriers and reallocating the subcarriers.

A Game theoretic analysis of public goods allocation in p2p networks

  • Zhang, Qingfeng;Wang, Sheng;Liao, Dan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2854-2874
    • /
    • 2015
  • This paper presents a game theoretic approach to analyze the public goods (PGs) allocation in peer-to-peer (p2p) networks. In order to reduce the free-riders and promote the cooperation among peers, we propose an incentive mechanism with cooperation-based game theory. In this paper, we regarded the contributed resources by cooperators as public goods (PGs). We also build the PGs allocation in P2P networks to be the optimization problem, and the optimal solution of PGs allocation satisfies the Bowen-Lindahl-Samuelson equilibrium. Firstly, based on the subscriber mechanism, we analyze the feasibility and prove the validity, which can achieve Nash equilibrium. However, this strategy cannot meet to Bowen-Lindahl-Samuelson equilibrium as the free-riders do not pay with their private goods for consuming the PGs. Secondly, based on the Walker mechanism, we analyze the feasibility and prove the validity for the same allocation problem, which meets to Bowen-Lindahl-Samuelson equilibrium and achieves Pareto efficiency within cooperative game. Simulations show that the proposed walker mechanism can significantly improve the network performance of throughout, and effectively alleviate free-riding problem in P2P networks.

Channel Allocation Using Mobile Station Network in Reproduction Stage (이동통신망에서 재생산 단계를 적용한 채널할당)

  • Heo, Seo-Jung;Son, Dong-Cheol;Kim, Chang-Suk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.5
    • /
    • pp.577-582
    • /
    • 2012
  • If the mobile station requests the channel allocation in mobile networks, switching center is assigned a channel to mobile station that belong to each base station. Channel allocation schemes is a fixed channel allocation, dynamic channel allocation and a hybrid approach that combines the two forms. To assign a frequency well to use resources efficiently to provide quality service to our customers. In this paper, we proposed method to assign frequencies to minimize interference between channels and to minimizes the number of searching time. The proposed method by the genetic algorithm to improve accuracy and efficiency of the verification steps and reproduction stages were used. In addition, the proposed method by comparing with other methods showed that proposed method is better through the simulations.

Resource Allocation Scheme for Public Safety Communications with High-Power User Equipment (재난안전통신 환경에서 고출력 단말의 자원할당 기법)

  • Nam, Jong-Hyun;Shin, Oh-Soon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.2
    • /
    • pp.9-15
    • /
    • 2017
  • In this paper, we propose a resource allocation scheme for high-power user equipment (HPUE) in public safety communication environments. The use of HPUE is being considered to increase the throughput and communication range of a UE in the disaster area where normal communication links are not available. However, HPUE may cause higher interference to UE's in adjacent cells that are allocated to the same radio resources. Therefore, it is necessary to deal with the potential interference through frequency planning and resource allocation. The performance of the proposed resource allocation scheme is evaluated through simulations in 3GPP public safety communication scenarios.

The evaluation of the appropriateness of resource allocation in a community health center (보건소 기능의 중요도에 따른 자원배분의 적절성 평가)

  • 전기홍;송미숙;정지연;김찬호
    • Health Policy and Management
    • /
    • v.7 no.2
    • /
    • pp.19-45
    • /
    • 1997
  • This study was performed to evaluate the appropriateness of resource allocation based on the ranking of health center function. Through the Delphi processes, health center functions were ranked in order of importance as follows; planning and research, followed by health education, health promotion, management of chronic diseases, health screening tests, welfare activities, mental health services, medical personnel management, medical services, prevention of communicable diseases, maternal and infant health services, housekeeping, management of oral hygiene, nutrition services, surveillance for community health services, family planning, and administration of the health center. In relation to the above priorities, the allocation of manpower was not appropriate. Even though the expert groups emphasized on functions such as planning and research, health education, and health promotion, they inputted more personnel for administration of a health center, maternal and infant health services, and medical services which were evaluated with lower importance. The budget allocation showed the same trends as the above. Although the functions such as planning and research, health education, and health promotion, and management of chronic diseases were evaluated highly, the budget was allocated accordingo to the the results of the former fiscal year rather than on the importance of function. However the budget for nutrition services, surveillance for the community health services, family planning, and administration of a health center was allocated according to priority. Based upon the above findings, community health center should be given the opportunity to make their own ranking of health center function and to allocate their resources including personnel and budget in order to improve the responsibilities and roles of the community health center.

  • PDF

Belowground Carbon Allocation of Natural Quercus mongolica Forests Estimated from Litterfall and Soil Respiration Measurements (Litterfall과 토양호흡 측정에 의한 신갈나무 천연림의 지하부 탄소 분배)

  • Yi Myong-Jong;Son Yowhan;Jin Hyun-O;Park In-Hyeop;Kim Dong-Yeop;Kim Yong-Suk;Shin Dong-Min
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.7 no.3
    • /
    • pp.227-234
    • /
    • 2005
  • From published data of mature forests worldwide, Raich and Nadelhoffer suggested that total belowground carbon allocation (TBCA) could be estimated from the difference between annual rates of soil respiration and aboveground litterfall. Here we analyze new measurements of IRGA-based soil respiration and litterfall of natural mature oak forests dominated by Quercus mongolica in Korea. Rates of in situ soil respiration and aboveground litter production are highly and positively correlated. Our results disagree with the Raich and Nadelhoffer model far world forests. A regression analysis of the data from Q. mongolica forests produced the following relationship: annual soil respiration : 141 + 2.08 ${\times}$ annual litterfall. The least squares regression line has a more gentle slope (2.08) than the slope (2.92) described by Raich and Nedelhoffer for mature forests worldwide. The regression slope of our study indicates that, on average, soil respiration is about two times the aboveground litterfall-C, which further implies that TBCA is similar with annual aboveground litterfall-C at natural Q. mongolica forests in Korea. The non-zero Y-intercept (141) of the regression indicates that TBCA may be greater than litterfall-C where litterfall rate are relativery low. Over a gradient of litterfall-C ranging from 200-370 g C $m^{-2}yr^{-l}$, TBCA increased from 350-530 g C $m^{-2}yr^{-l}$.