• 제목/요약/키워드: Network-Based Allocation Model

검색결과 146건 처리시간 0.019초

Resource Allocation Strategy of Internet of Vehicles Using Reinforcement Learning

  • Xi, Hongqi;Sun, Huijuan
    • Journal of Information Processing Systems
    • /
    • 제18권3호
    • /
    • pp.443-456
    • /
    • 2022
  • An efficient and reasonable resource allocation strategy can greatly improve the service quality of Internet of Vehicles (IoV). However, most of the current allocation methods have overestimation problem, and it is difficult to provide high-performance IoV network services. To solve this problem, this paper proposes a network resource allocation strategy based on deep learning network model DDQN. Firstly, the method implements the refined modeling of IoV model, including communication model, user layer computing model, edge layer offloading model, mobile model, etc., similar to the actual complex IoV application scenario. Then, the DDQN network model is used to calculate and solve the mathematical model of resource allocation. By decoupling the selection of target Q value action and the calculation of target Q value, the phenomenon of overestimation is avoided. It can provide higher-quality network services and ensure superior computing and processing performance in actual complex scenarios. Finally, simulation results show that the proposed method can maintain the network delay within 65 ms and show excellent network performance in high concurrency and complex scenes with task data volume of 500 kbits.

Optimal Allocation Method of Hybrid Active Power Filters in Active Distribution Networks Based on Differential Evolution Algorithm

  • Chen, Yougen;Chen, Weiwei;Yang, Renli;Li, Zhiyong
    • Journal of Power Electronics
    • /
    • 제19권5호
    • /
    • pp.1289-1302
    • /
    • 2019
  • In this paper, an optimal allocation method of a hybrid active power filter in an active distribution network is designed based on the differential evolution algorithm to resolve the harmonic generation problem when a distributed generation system is connected to the grid. A distributed generation system model in the calculation of power flow is established. An improved back/forward sweep algorithm and a decoupling algorithm are proposed for fundamental power flow and harmonic power flow. On this basis, a multi-objective optimization allocation model of the location and capacity of a hybrid filter in an active distribution network is built, and an optimal allocation scheme of the hybrid active power filter based on the differential evolution algorithm is proposed. To verify the effect of the harmonic suppression of the designed scheme, simulation analysis in an IEEE-33 nodes model and an experimental analysis on a test platform of a microgrid are adopted.

A Secure and Efficient Cloud Resource Allocation Scheme with Trust Evaluation Mechanism Based on Combinatorial Double Auction

  • Xia, Yunhao;Hong, Hanshu;Lin, Guofeng;Sun, Zhixin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권9호
    • /
    • pp.4197-4219
    • /
    • 2017
  • Cloud computing is a new service to provide dynamic, scalable virtual resource services via the Internet. Cloud market is available to multiple cloud computing resource providers and users communicate with each other and participate in market transactions. However, since cloud computing is facing with more and more security issues, how to complete the allocation process effectively and securely become a problem urgently to be solved. In this paper, we firstly analyze the cloud resource allocation problem and propose a mathematic model based on combinatorial double auction. Secondly, we introduce a trust evaluation mechanism into our model and combine genetic algorithm with simulated annealing algorithm to increase the efficiency and security of cloud service. Finally, by doing the overall simulation, we prove that our model is highly effective in the allocation of cloud resources.

Co-authorship Credit Allocation Methods in the Assessment of Citation Impact of Chemistry Faculty

  • 이종욱;양기덕
    • 한국문헌정보학회지
    • /
    • 제49권3호
    • /
    • pp.273-289
    • /
    • 2015
  • This study examined changes in citation index scores and rankings of thirty-five chemistry faculty members at Seoul National University using different co-authorship credit allocation models. Using 1,436 Web of Science papers published between 2007 and 2013, we applied the inflated, fractional, harmonic, network-based allocation, and harmonic+ models to calculate faculty's h-, R-, and normalization of h- and R- index scores and rankings. The harmonic+ model, which is based on our belief that contribution of primary authors should be the same regardless of collaboration, is designed to minimize the penalty for research collaboration imposed by harmonic and NBA models by boosting the contribution of collaborating primary authors to be on the equal footing with single authors. Although citation rankings by different models are correlated with each other within the same type of citation indicator, rankings of many faculty members changed across models, suggesting the importance of an accurate and relevant authorship credit allocation model in the citation assessment of researchers. The study also found that authorship patterns in conjunction with citation counts are important factors for robust authorship models such as harmonic and NBA, and harmonic+ model may be beneficial for collaborating primary authors. Future research that reexamines the models with updated empirical data would provide further insights into the robustness of the models.

Intervenient Stackelberg Game based Bandwidth Allocation Scheme for Hierarchical Wireless Networks

  • Kim, Sungwook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권12호
    • /
    • pp.4293-4304
    • /
    • 2014
  • In order to ensure the wireless connectivity and seamless service to mobile users, the next generation network system will be an integration of multiple wireless access networks. In a heterogeneous wireless access system, bandwidth allocation becomes crucial for load balancing to avoid network congestion and improve system utilization efficiency. In this article, we propose a new dynamic bandwidth allocation scheme for hierarchical wireless network systems. First, we derive a multi-objective decision criterion for each access point. Second, a bargaining strategy selection algorithm is developed for the dynamic bandwidth re-allocation. Based on the intervenient Stackelberg game model, the proposed scheme effectively formulates the competitive interaction situation between several access points. The system performance of proposed scheme is evaluated by using extensive simulations. With a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes under widely diverse network environments.

Load Allocation Strategy for Command and Control Networks based on Interdependence Strength

  • Bo Chen;Guimei Pang;Zhengtao Xiang;Hang Tao;Yufeng Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권9호
    • /
    • pp.2419-2435
    • /
    • 2023
  • Command and control networks(C2N) exhibit evident multi-network interdependencies owing to their complex hierarchical associations, interleaved communication links, and dynamic network changes. However, the existing command and control networks do not consider the effects of dependent nodes on the load distribution. Thus, we proposed a command and control networks load allocation strategy based on interdependence strength. First, a new measure of interdependence strength was proposed based on the edge betweenness, which was followed by proposing the inter-layer load allocation strategy based on the interdependence strength. Eventually, the simulation experiments of the aforementioned strategy were designed to analyze the network invulnerability with different initial load capacity parameters, allocation model parameters, and allocation strategies. The simulation indicates that the strategy proposed in this study improved the node survival rate of the interdependent command and control networks model and successfully prevented cascade failures.

Delivering IPTV Service over a Virtual Network: A Study on Virtual Network Topology

  • Song, Biao;Hassan, Mohammad Mehedi;Huh, Eui-Nam
    • Journal of Communications and Networks
    • /
    • 제14권3호
    • /
    • pp.319-335
    • /
    • 2012
  • In this study, we design an applicable model enabling internet protocol television (IPTV) service providers to use a virtual network (VN) for IPTV service delivery. The model addresses the guaranteed service delivery, cost effectiveness, flexible control, and scalable network infrastructure limitations of backbone or IP overlay-based content networks. There are two major challenges involved in this research: i) The design of an efficient, cost effective, and reliable virtual network topology (VNT) for IPTV service delivery and the handling of a VN allocation failure by infrastructure providers (InPs) and ii) the proper approach to reduce the cost of VNT recontruction and reallocation caused by VNT allocation failure. Therefore, in this study, we design a more reliable virtual network topology for solving a single virtual node, virtual link, or video server failure. We develop a novel optimization objective and an efficient VN construction algorithm for building the proposed topology. In addition, we address the VN allocation failure problem by proposing VNT decomposition and reconstruction algorithms. Various simulations are conducted to verify the effectiveness of the proposed VNT, as well as that of the associated construction, decomposition, and reconstruction algorithms in terms of reliability and efficiency. The simulation results are compared with the findings of existing works, and an improvement in performance is observed.

Communication Resource Allocation Strategy of Internet of Vehicles Based on MEC

  • Ma, Zhiqiang
    • Journal of Information Processing Systems
    • /
    • 제18권3호
    • /
    • pp.389-401
    • /
    • 2022
  • The business of Internet of Vehicles (IoV) is growing rapidly, and the large amount of data exchange has caused problems of large mobile network communication delay and large energy loss. A strategy for resource allocation of IoV communication based on mobile edge computing (MEC) is thus proposed. First, a model of the cloud-side collaborative cache and resource allocation system for the IoV is designed. Vehicles can offload tasks to MEC servers or neighboring vehicles for communication. Then, the communication model and the calculation model of IoV system are comprehensively analyzed. The optimization objective of minimizing delay and energy consumption is constructed. Finally, the on-board computing task is coded, and the optimization problem is transformed into a knapsack problem. The optimal resource allocation strategy is obtained through genetic algorithm. The simulation results based on the MATLAB platform show that: The proposed strategy offloads tasks to the MEC server or neighboring vehicles, making full use of system resources. In different situations, the energy consumption does not exceed 300 J and 180 J, with an average delay of 210 ms, effectively reducing system overhead and improving response speed.

Network 모형에 의한 수자원의 최적배분 (Optimal Allocation of Water Resources based on the Network Model)

  • 연규방;심순보
    • 물과 미래
    • /
    • 제27권1호
    • /
    • pp.111-121
    • /
    • 1994
  • 본 연구의 목적은 한정된 자료원을 각 용수 수요점 별로 용수공급 우선 순위에 따라서 최적배분하기 위한 Network 모형을 구성하는 것이다. 본 모형의 해법은 OKA(Out of Kilter Algorithm)를 사용하였다. 모형에 대한 이론적 방법론과 프로그램을 검증하고 적용하기 위하여 금강유역을 선정했다. 대청댐 방유량과 금강 유역의 용수수요량을 사용하여, 각 수요점의 용수공급 우선 순위를 1~ 4개의 경우로 설정하고 수자원의 최적배분을 시행하였다. 모형을 적용한 결과, 물리적인 시스템을 타당성 있게 표현할 수 있었고, 높은 우선 순위로 조정된 수요점에서는 물 부족량을 줄일 수 있었다. 본 모형의 해법은 Revised Simplex 알고리즘에 의해 검증하였다.

  • PDF

A Genetic Algorithm for Directed Graph-based Supply Network Planning in Memory Module Industry

  • Wang, Li-Chih;Cheng, Chen-Yang;Huang, Li-Pin
    • Industrial Engineering and Management Systems
    • /
    • 제9권3호
    • /
    • pp.227-241
    • /
    • 2010
  • A memory module industry's supply chain usually consists of multiple manufacturing sites and multiple distribution centers. In order to fulfill the variety of demands from downstream customers, production planners need not only to decide the order allocation among multiple manufacturing sites but also to consider memory module industrial characteristics and supply chain constraints, such as multiple material substitution relationships, capacity, and transportation lead time, fluctuation of component purchasing prices and available supply quantities of critical materials (e.g., DRAM, chip), based on human experience. In this research, a directed graph-based supply network planning (DGSNP) model is developed for memory module industry. In addition to multi-site order allocation, the DGSNP model explicitly considers production planning for each manufacturing site, and purchasing planning from each supplier. First, the research formulates the supply network's structure and constraints in a directed-graph form. Then, a proposed genetic algorithm (GA) solves the matrix form which is transformed from the directed-graph model. Finally, the final matrix, with a calculated maximum profit, can be transformed back to a directed-graph based supply network plan as a reference for planners. The results of the illustrative experiments show that the DGSNP model, compared to current memory module industry practices, determines a convincing supply network planning solution, as measured by total profit.