• 제목/요약/키워드: Resources allocation

검색결과 790건 처리시간 0.027초

무선 인지 기반 시스템에서 QoS 보장 동적 주파수 할당 (A Dynamic Frequency Allocation for Provisioning QoS in Cognitive Radio System)

  • 이문호;이종찬
    • 한국산업정보학회:학술대회논문집
    • /
    • 한국산업정보학회 2008년도 추계 공동 국제학술대회
    • /
    • pp.634-642
    • /
    • 2008
  • Radio wave is the valuable resources in $21^{st}$ century. It will be widely used in various applications such as DMB, USN, telematics, and home network as well as mobile and wireless communications. Cognitive Radio technology is devised to maximize the utilization of radio resources by sensing near-by spectrum and dynamic and allocating free resources dynamically and adaptively. Wireless links for the secondary user need to be frequently switched to idle frequencies during the transmission of multimedia data in the cognitive radio based system. This may cause delay and information loss, and QoS degradations occur inevitably. The efficient frequency allocation scheme is necessary to support the seamless multimedia service to the secondary user while maintaining QoS of the primary user. This paper suggests a frequency selection scheme which considers other parameters such as cell load, data rate, and available bandwidth than just received signal strength during the frequency selection process. The performance of our proposed scheme is analyzed by simulation.

  • PDF

그리드 환경에서의 효율적인 자원 관리를 위한 공급-조정 전략 모델 (Supply-Driven Strategies Model for Resource Management in Grid Environment)

  • 마용범;이종식
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 2005년도 추계학술대회 및 정기총회
    • /
    • pp.65-70
    • /
    • 2005
  • Recently, Grid is embossed as a new issue according to the need of cooperation related to distributed resources, data sharing, Interaction and so on. It focuses on sharing of large scale resources, high-performance, applications of new paradigms, which improved more than established distributed computing. Because of the environmental specificity distributed geographically and dynamic, the most important problem in grid environment is to share and to allocate distributed grid resources. This paper proposes supply-driven strategies model that is applicable for resource management in grid environment and presents a optimal resource allocation algorithm based on resource demands. Supply-driven strategies model can offer efficient resource management by transaction allocation based on user demand and provider strategy. This paper implements the supply-driven strategies model on the DEVS modeling and simulation environment and shows the efficiency and excellency of this model by comparing with established models.

  • PDF

TCP/IP Using Minimal Resources in IoT Systems

  • Lee, Seung-Chul;Shin, Dongha
    • 한국컴퓨터정보학회논문지
    • /
    • 제25권10호
    • /
    • pp.125-133
    • /
    • 2020
  • 본 연구에서는 Internet of Things(IoT) 시스템에서 최소의 메모리 및 프로세서 자원을 사용하는 4계층의 TCP/IP에 관하여 연구하고 설계한다. 본 연구에서 설계한 TCP/IP는 다음과 같은 특징을 가지고 있다. 첫째, 메모리 할당량을 최소화하여 메모리 자원을 최소로 사용한다. 둘째, 메모리 복사량을 최소화하여 프로세서 자원을 최소로 사용한다. 셋째, TCP/IP의 수행 시간이 고정 시간에 완료될 수 있다. 넷째, 메모리 누수 문제가 발생하지 않는다. 본 연구에서 도출된 메모리 할당량 및 복사량에 대한 최소 자원 기준은 기 구현된 IoT 시스템의 통신 서브시스템이 효율적으로 구현되었는지를 점검하기 위해 유용하게 사용될 수 있다. 최근 리눅스 재단에서 발표한 공개 소스 커널인 Zephyr의 통신 서브시스템의 메모리 할당량 및 복사량을 측정한 결과, 본 연구에서 도출한 최소 자원 기준보다 더 크다는 것을 발견하였다. 본 연구에서 제안한 설계 방법에 따라 Zephyr 통신 서브시스템을 개선하여 메모리 할당량 및 복사량이 각각 약 39% 및 67% 감소함을 확인하였으며, 이에 따른 수행 시간도 약 28% 감소하였다.

Resource Allocation for Heterogeneous Service in Green Mobile Edge Networks Using Deep Reinforcement Learning

  • Sun, Si-yuan;Zheng, Ying;Zhou, Jun-hua;Weng, Jiu-xing;Wei, Yi-fei;Wang, Xiao-jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권7호
    • /
    • pp.2496-2512
    • /
    • 2021
  • The requirements for powerful computing capability, high capacity, low latency and low energy consumption of emerging services, pose severe challenges to the fifth-generation (5G) network. As a promising paradigm, mobile edge networks can provide services in proximity to users by deploying computing components and cache at the edge, which can effectively decrease service delay. However, the coexistence of heterogeneous services and the sharing of limited resources lead to the competition between various services for multiple resources. This paper considers two typical heterogeneous services: computing services and content delivery services, in order to properly configure resources, it is crucial to develop an effective offloading and caching strategies. Considering the high energy consumption of 5G base stations, this paper considers the hybrid energy supply model of traditional power grid and green energy. Therefore, it is necessary to design a reasonable association mechanism which can allocate more service load to base stations rich in green energy to improve the utilization of green energy. This paper formed the joint optimization problem of computing offloading, caching and resource allocation for heterogeneous services with the objective of minimizing the on-grid power consumption under the constraints of limited resources and QoS guarantee. Since the joint optimization problem is a mixed integer nonlinear programming problem that is impossible to solve, this paper uses deep reinforcement learning method to learn the optimal strategy through a lot of training. Extensive simulation experiments show that compared with other schemes, the proposed scheme can allocate resources to heterogeneous service according to the green energy distribution which can effectively reduce the traditional energy consumption.

조선 중일정 블록 배량 계획 자동화 연구 (An Automatic Block Allocation Methodology at Shipbuilding Midterm Scheduling)

  • 황인혁;남승훈;신종계
    • 한국CDE학회논문집
    • /
    • 제17권6호
    • /
    • pp.409-416
    • /
    • 2012
  • Most of the shipbuilding scheduling researches so far have been conducted with stress on the dock plan. That is due to the fact that the dock is the least extendable resource in shipyards and its overloading is difficult to resolve. However, once the dock scheduling is completed, it is also important to make a plan that make the best use of the rest of the resources in the shipyard, so that any additional cost is minimized. This study automates block allocation process by analyzing the existing manual process that designates production bays for the blocks during the midterm planning. Also, a planning scenario validation method is suggested, where block allocation scenarios based on diagrams are edited and simulated.

A Game Theoretic Cross-Layer Design for Resource Allocation in Heterogeneous OFDMA Networks

  • Zarakovitis, Charilaos C.;Nikolaros, Ilias G.;Ni, Qiang
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제1권1호
    • /
    • pp.50-64
    • /
    • 2012
  • Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

  • PDF

Utility-based Resource Allocation with Bipartite Matching in OFDMA-based Wireless Systems

  • Zheng, Kan;Li, Wei;Liu, Fei;Xiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권8호
    • /
    • pp.1913-1925
    • /
    • 2012
  • In order to efficiently utilize limited radio resources, resource allocation schemes in OFDMA-based wireless networks have gained intensive attention recently. Instead of improving the throughput performance, the utility is adopted as the metric for resource allocation, which provides reasonable methods to build up the relationship between user experience and various quality-of-service (QoS) metrics. After formulating the optimization problem by using a weighted bipartite graph, a modified bipartite matching method is proposed to find a suboptimal solution for the resource allocation problem in OFDMA-based wireless systems with feasible computational complexity. Finally, simulation results are presented to validate the effectiveness of the proposed method.

Optimal Link Allocation and Revenue Maximization

  • Joutsensalo, Jyrki;Hamalainen, Timo
    • Journal of Communications and Networks
    • /
    • 제4권2호
    • /
    • pp.136-147
    • /
    • 2002
  • In this paper, the maximal capacity of the data network link has attempted to be exploited by using the dynamic allocation strategy. We propose a new methodology based on the economic models for competing traffic classes (classes of sessions) in packet networks. As the demand for network services accelerates, users' satisfaction to the service level might decrease due to the congestion at the network nodes. To prevent this, efficient allocation of a networks resources, such as available bandwidth and switch capacity, is needed. By using the so-called user profile as well as the utility (e.g., data rate) functions, it is possible to allocate data rates and other utilities using the arbitrary number of QoS classes, say $0.01,...,$10.

Two-Stage Resource Allocation to Improve Utilization of Synchronous OFDM-PON Supporting Service Differentiation

  • Doo, Kyeong-Hwan;Bang, Junseong;Han, Man Soo;Lee, Jonghyun;Lee, Sangsoo
    • ETRI Journal
    • /
    • 제37권4호
    • /
    • pp.657-666
    • /
    • 2015
  • We propose a two-stage resource allocation algorithm for the high link utilization of an orthogonal frequency-division multiplexing passive optical network (OFDM-PON). An OFDM-PON is assumed to use a synchronous frame structure in supporting service differentiation. In distributing resources, the proposed algorithm first allocates a time window for each optical network unit (ONU), and then it arranges a subchannel, which is a group of subcarriers. This algorithm needs to satisfy two constraints. First, computations for the resource allocation should be done using a frame unit. Second, an ONU has to use a single subchannel to send upstream data for multiple services within a frame duration. We show through a computer simulation that the proposed algorithm improves the link utilization.

불확실성을 고려한 해군함정 선석 할당 방안 (The Berth Allocation Method for the Navy Surface Vessels Considering Uncertainty)

  • 정환식;이재영;이용대
    • 한국군사과학기술학회지
    • /
    • 제13권5호
    • /
    • pp.748-758
    • /
    • 2010
  • Navy surface vessels require pier services such as emergency repair, oil supply, arm loading/unloading, craning, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. This study suggests Mixed Integer Programming model for berth allocation problem, considering precedence relationships among services and the uncertainty of the arrival and departure for each vessel. For an effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 6.0 and ILOG CPLEX 11.1., which shows a reasonable result.