• Title/Summary/Keyword: Network resource

Search Result 2,089, Processing Time 0.026 seconds

Invulnerability analysis of nuclear accidents emergency response organization network based on complex network

  • Wen Chen;Shuliang Zou;Changjun Qiu;Jianyong Dai;Meirong Zhang
    • Nuclear Engineering and Technology
    • /
    • v.56 no.8
    • /
    • pp.2923-2936
    • /
    • 2024
  • Modern risk management philosophy emphasizes the invulnerability of human beings to cope with all kinds of emergencies. The Nuclear Accidents Emergency Response Organization (NAERO) of Nuclear Power Plant (NPP) is the primary body responsible for nuclear accidents emergency response. The invulnerability of the organization to disturbance or attack from internal and external sources is crucial in the completion of its response missions, reduction of severity of accidents, and assurance of public and environmental safety. This paper focused on the NAERO of a certain NPP in China, and applied the complex network theory to construct the network model of the organization. The topological characteristics of the network were analyzed. Four importance evaluation indexes of network nodes including Degree Centrality (DC), Betweeness Centrality (BC), Closeness Centrality (CC) and Eigenvector Centrality (EC), along with Pearson coefficient correlation among the indexes were calculated and analyzed. Size of the Largest Connected Component (LCC) and Network Efficiency were used as measures regarding the invulnerability of the network. Simulation experiments were conducted to assess the invulnerability of network against various attack strategies. These experiments were conducted both in the absence of node protection measures and under protection measures with different node protection rates. This study evaluated the invulnerability of the NAERO network, and provided significant decision-making basis for the enhancement of the network's invulnerability.

A Resource Scheduling for Supply Chain Model

  • Yang Byounghak;Badiru Adedeji B.;Saripalli Sirisha
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.527-530
    • /
    • 2004
  • This paper presents an optimization formulation for resource scheduling in Critical Resource Diagramming (CRD) of production scheduling networks. A CRD network schedules units of resources against points of needs in a production network rather than the conventional approach of scheduling tasks against resource availability. This resource scheduling approach provides more effective tracking of utilization of production resources as they are assigned or 'moved' from one point of need to another. Using CRD, criticality indices can be developed for resource types in a way similar to the criticality of activities in Critical Path Method (CPM). In our supply chain model, upstreams may choose either normal operation or expedited operation in resource scheduling. Their decisions affect downstream's resource scheduling. The suggested optimization formulation models resources as CRD elements in a production two-stage supply to minimize the total operation cost

  • PDF

Resource Management Strategies in Fog Computing Environment -A Comprehensive Review

  • Alsadie, Deafallah
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.310-328
    • /
    • 2022
  • Internet of things (IoT) has emerged as the most popular technique that facilitates enhancing humans' quality of life. However, most time sensitive IoT applications require quick response time. So, processing these IoT applications in cloud servers may not be effective. Therefore, fog computing has emerged as a promising solution that addresses the problem of managing large data bandwidth requirements of devices and quick response time. This technology has resulted in processing a large amount of data near the data source compared to the cloud. However, efficient management of computing resources involving balancing workload, allocating resources, provisioning resources, and scheduling tasks is one primary consideration for effective computing-based solutions, specifically for time-sensitive applications. This paper provides a comprehensive review of the source management strategies considering resource limitations, heterogeneity, unpredicted traffic in the fog computing environment. It presents recent developments in the resource management field of the fog computing environment. It also presents significant management issues such as resource allocation, resource provisioning, resource scheduling, task offloading, etc. Related studies are compared indifferent mentions to provide promising directions of future research by fellow researchers in the field.

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.

Test for Resource Service by the User Web Portal and the NSI based Network Resource Service Agent (사용자 웹 포털과 NSI 기반의 네트워크 자원 서비스 에이전트에 의한 자원서비스 시험)

  • Lim, Huhnkuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.822-830
    • /
    • 2012
  • The most representative research network in Korea, KREONET has developed the NSI based NSA (Network Service Agent) technology. The developed NSA supports web service and provides services for reservation, provision, release and termination of network resource, whenever users want to utilize them. In this paper, the system blocks of the developed NSA and flows of NSI interface massage are presented firstly, Also, service test results for NSI connection reservation is given through internet communication of the web portal system to operate as the RA NSA and the NSA, Finally, it is confirmed that reservation, provision, release and termination of network resource can be established through NSI messages based on reservation information from user, between the web portal and the NSA.

Energy-Efficient Resource Allocation for Heterogeneous Cognitive Radio Network based on Two-Tier Crossover Genetic Algorithm

  • Jiao, Yan;Joe, Inwhee
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.112-122
    • /
    • 2016
  • Cognitive radio (CR) is considered an attractive technology to deal with the spectrum scarcity problem. Multi-radio access technology (multi-RAT) can improve network capacity because data are transmitted by multiple RANs (radio access networks) concurrently. Thus, multi-RAT embedded in a cognitive radio network (CRN) is a promising paradigm for developing spectrum efficiency and network capacity in future wireless networks. In this study, we consider a new CRN model in which the primary user networks consist of heterogeneous primary users (PUs). Specifically, we focus on the energy-efficient resource allocation (EERA) problem for CR users with a special location coverage overlapping region in which heterogeneous PUs operate simultaneously via multi-RAT. We propose a two-tier crossover genetic algorithm-based search scheme to obtain an optimal solution in terms of the power and bandwidth. In addition, we introduce a radio environment map to manage the resource allocation and network synchronization. The simulation results show the proposed algorithm is stable and has faster convergence. Our proposal can significantly increase the energy efficiency.

Overlay Multicast Mechanism Supporting Differentiated QoS According to Service Level and User Environment over NGN (차세대네트워크 환경에서 서비스 등급 및 사용자 환경에 따른 차별화된 QoS를 지원하는 오버레이 멀티캐스트)

  • Rhee, Bo-Young;Cho, Sung-Chol;Han, Sun-Young
    • The KIPS Transactions:PartC
    • /
    • v.15C no.6
    • /
    • pp.557-566
    • /
    • 2008
  • NGN(Next Generation Network) is a communication network which can make use of broadband and QoS-enabled transport technologies. One of the main service issues over NGN is a multimedia service, such as IPTV, using a multicast method. And overlay multicast technology is one of the promising solutions instead of traditional multicast technology which has a few problems, and supports flexibility and scalability for multicast services. Also, the main controversial topic in NGN and overlay multicast is QoS. In the present paper, we designed an agent in each receiver's network, and a manager which is in a source network and which manages the whole multicast network. Both of them are communicating with each other and applying resource policies to their multicast network. This mechanism enables overlay multicast to support QoS, focusing on RACF(Resource and Admission Control Functions) in NGN QoS architecture.

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

Multi-Slice Joint Task Offloading and Resource Allocation Scheme for Massive MIMO Enabled Network

  • Yin Ren;Aihuang Guo;Chunlin Song
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.794-815
    • /
    • 2023
  • The rapid development of mobile communication not only has made the industry gradually diversified, but also has enhanced the service quality requirements of users. In this regard, it is imperative to consider jointly network slicing and mobile edge computing. The former mainly ensures the requirements of varied vertical services preferably, and the latter solves the conflict between the user's own energy and harsh latency. At present, the integration of the two faces many challenges and need to carry out at different levels. The main target of the paper is to minimize the energy consumption of the system, and introduce a multi-slice joint task offloading and resource allocation scheme for massive multiple input multiple output enabled heterogeneous networks. The problem is formulated by collaborative optimizing offloading ratios, user association, transmission power and resource slicing, while being limited by the dissimilar latency and rate of multi-slice. To solve it, assign the optimal problem to two sub-problems of offloading decision and resource allocation, then solve them separately by exploiting the alternative optimization technique and Karush-Kuhn-Tucker conditions. Finally, a novel slices task offloading and resource allocation algorithm is proposed to get the offloading and resource allocation strategies. Numerous simulation results manifest that the proposed scheme has certain feasibility and effectiveness, and its performance is better than the other baseline scheme.

Virtual Network Embedding with Multi-attribute Node Ranking Based on TOPSIS

  • Gon, Shuiqing;Chen, Jing;Zhao, Siyi;Zhu, Qingchao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.522-541
    • /
    • 2016
  • Network virtualization provides an effective way to overcome the Internet ossification problem. As one of the main challenges in network virtualization, virtual network embedding refers to mapping multiple virtual networks onto a shared substrate network. However, existing heuristic embedding algorithms evaluate the embedding potential of the nodes simply by the product of different resource attributes, which would result in an unbalanced embedding. Furthermore, ignoring the hops of substrate paths that the virtual links would be mapped onto may restrict the ability of the substrate network to accept additional virtual network requests, and lead to low utilization rate of resource. In this paper, we introduce and extend five node attributes that quantify the embedding potential of the nodes from both the local and global views, and adopt the technique for order preference by similarity ideal solution (TOPSIS) to rank the nodes, aiming at balancing different node attributes to increase the utilization rate of resource. Moreover, we propose a novel two-stage virtual network embedding algorithm, which maps the virtual nodes onto the substrate nodes according to the node ranks, and adopts a shortest path-based algorithm to map the virtual links. Simulation results show that the new algorithm significantly increases the long-term average revenue, the long-term revenue to cost ratio and the acceptance ratio.