• Title/Summary/Keyword: Network Resource

Search Result 2,071, Processing Time 0.028 seconds

Resource and Network Routing Optimization in Smart Nodes Environment (스마트 네트워크 환경에서의 자원 및 경로 최적화 연구)

  • Seo, Dong-Won;Yoon, Seung Hyun;Chang, Byeong-Yoon
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.4
    • /
    • pp.149-156
    • /
    • 2013
  • In this research, we dealt with an optimization problem which aims to minimize total cost of resources usage and network routing in a smart node environment. Toward this, we briefly introduced technology trends in smart nodes, methods in resource optimization fields, economic effects of smart network and content delivery (or distribution) network (CDN). Moreover, based on CDN we proposed and implemented a mathematical (mixed integer) programming model to combine replica placement and requests distribution problem (RPRDP) and routing problem. Computational result of an example on RPRDP+Routing problem is also provided.

The Development of New dynamic WRR Algorithm for Wireless Sensor Networks (무선 센서망을 위한 새로운 동적 가중치 할당 알고리즘 개발)

  • Cho, Hae-Seong;Cho, Ju-Phil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.293-298
    • /
    • 2010
  • The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

Traffic Forecast Assisted Adaptive VNF Dynamic Scaling

  • Qiu, Hang;Tang, Hongbo;Zhao, Yu;You, Wei;Ji, Xinsheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.11
    • /
    • pp.3584-3602
    • /
    • 2022
  • NFV realizes flexible and rapid software deployment and management of network functions in the cloud network, and provides network services in the form of chained virtual network functions (VNFs). However, using VNFs to provide quality guaranteed services is still a challenge because of the inherent difficulty in intelligently scaling VNFs to handle traffic fluctuations. Most existing works scale VNFs with fixed-capacity instances, that is they take instances of the same size and determine a suitable deployment location without considering the cloud network resource distribution. This paper proposes a traffic forecasted assisted proactive VNF scaling approach, and it adopts the instance capacity adaptive to the node resource. We first model the VNF scaling as integer quadratic programming and then propose a proactive adaptive VNF scaling (PAVS) approach. The approach employs an efficient traffic forecasting method based on LSTM to predict the upcoming traffic demands. With the obtained traffic demands, we design a resource-aware new VNF instance deployment algorithm to scale out under-provisioning VNFs and a redundant VNF instance management mechanism to scale in over-provisioning VNFs. Trace-driven simulation demonstrates that our proposed approach can respond to traffic fluctuation in advance and reduce the total cost significantly.

A Comparative Study and Analysis of LoRaWAN Performance in NS3

  • Arshad Farhad;Jae-Young Pyun
    • Smart Media Journal
    • /
    • v.13 no.1
    • /
    • pp.45-51
    • /
    • 2024
  • Long Range Wide Area Network (LoRaWAN) is a widely adopted Internet of Things (IoT) protocol due to its high range and lower energy consumption. LoRaWAN utilizes Adaptive Data Rate (ADR) for efficient resource (e.g., spreading factor and transmission power) management. The ADR manages these two resource parameters on the network server side and end device side. This paper focuses on analyzing the ADR and Gaussian ADR performance of LoRaWAN. We have performed NS3 simulation under a static scenario by varying the antenna height. The simulation results showed that antenna height has a significant impact on the packet delivery ratio. Higher antenna height (e.g., 50 m) has shown an improved packet success ratio when compared with lower antenna height (e.g., 10 m) in static and mobility scenarios. Based on the results, it is suggested to use the antenna at higher allevation for successful packet delivery.

An Efficient Network Resource Reservation Mechanism with Mobility in Nested Heterogeneous Mobile Networks (중첩 이종 무선 망 환경에서 단말의 이동 속도를 고려한 효과적인 망 자원 예약)

  • Park, In-Soo;Tak, Dong-Kuk;Kim, Won-Tae;Park, Yong-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.83-98
    • /
    • 2007
  • The handover between different radio access networks, especially where their coverage overlaps, suffers various complications since the different access networks provide different service characteristics. One way to reduce service interruptions and QoS (i.e., bandwidth, throughput, delay) degradations during the inter-technology handover is to reserve the required resource in advance. The resource reservation algorithm should minimize the handover latency and maximize the resource utilization based on the accurate estimation on mobile's location, velocity, movement pattern and service requirements. In this paper, we propose a resource reservation algorithm based on the mobile terminal velocity and the cell selection probability, which maximizes resource utilization ana reduces network overhead. We compare the proposed algorithm with PMS(Predictive Mobility Support) and VCDS(Velocity and Call Duration Support scheme) based on 3-layer network model under various scenarios.

Genetic Algorithm based Resource Management for Cognitive Mesh Networks with Real-time and Non-real-time Services

  • Shan, Hangguan;Ye, Ziyun;Bi, Yuanguo;Huang, Aiping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2774-2796
    • /
    • 2015
  • Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

A Framework of Resource Provisioning and Customized Energy-Efficiency Optimization in Virtualized Small Cell Networks

  • Sun, Guolin;Clement, Addo Prince;Boateng, Gordon Owusu;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5701-5722
    • /
    • 2018
  • The continuous increase in the cost of energy production and concerns for environmental sustainability are leading research communities, governments and industries to amass efforts to reduce energy consumption and global $CO_2$ footprint. Players in the information and communication industry are keen on reducing the operational expenditures (OpEx) and maintaining the profitability of cellular networks. Meanwhile, network virtualization has been proposed in this regard as the main enabler for 5G mobile cellular networks. In this paper, we propose a generic framework of slice resource provisioning and customized physical resource allocation for energy-efficiency and quality of service optimization. In resource slicing, we consider user demand and population resources provisioning scheme aiming to satisfy quality of service (QoS). In customized physical resource allocation, we formulate this problem with an integer non-linear programming model, which is solved by a heuristic algorithm based on minimum vertex coverage. The proposed algorithm is compared with the existing approaches, without consideration of slice resource constraints via system-level simulations. From the perspective of infrastructure providers, traffic is scheduled over a limited number of active small-cell base stations (sc-BSs) that significantly reduce the system energy consumption and improve the system's spectral efficiency. From the perspective of virtual network operators and mobile users, the proposed approach can guarantee QoS for mobile users and improve user satisfaction.

An Agent-based Network Management System Using Active Information Resources

  • Kinoshita, Tetsuo;Kitagata, Gen;Takahashi, Hideyuki;Sasai, Kazuto;Kalegele, Khamisi
    • International journal of advanced smart convergence
    • /
    • v.2 no.2
    • /
    • pp.10-15
    • /
    • 2013
  • An expert network administrator is not always stationed as disasters happen. In that case, it is desirable that a novice administrator is capable of taking part in network recovery operations as well. In this paper, an agent-based network management system in emergency situations is presented. We use the Active Information Resource based Network Management System (AIR-NMS) to relieve the human administrator from parts of her management tasks and present an interface that remotely can control this management system. The effectiveness of the system is demonstrated by experiments using a prototype system.

A Knowledge-based Network Management System Using Active Information Resources

  • Kinoshita, Tetsuo;Kitagata, Gen;Takahashi, Hideyuki;Sasai, Kazuto;Kalegele, Khamisi
    • International journal of advanced smart convergence
    • /
    • v.3 no.1
    • /
    • pp.1-6
    • /
    • 2014
  • An expert network administrator is not always stationed as disasters happen. In that case, it is desirable that a novice administrator is capable of taking part in network recovery operations as well. In this paper, aknowledge-based network management system in emergency situations is presented. We use the Active Information Resource based Network Management System (AIR-NMS) to relieve the human administrator from parts of her management tasks and present an interface that remotely can control this management system. The effectiveness of the system is demonstrated by experiments using a prototype system.

An Efficient Power Allocaction Scheme to Maximize Network Lifetime in Wireless Relay Networks with Energy Contraint (전송 용량 제한조건을 가진 무선 중계 네트워크의 수명을 최대화하는 효율적인 전송 전력 할당 기법)

  • Park, Dae-Jun;Kim, Hyung-Myung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7A
    • /
    • pp.660-668
    • /
    • 2010
  • In energy resource constrained networks, the network lifetime can be enhanced by optimally allocating energy resource among users based on the available channel state information and the residual energy information at each node. In this paper, we propose the relay selection scheme and power allocation scheme to maximize the network lifetime in wireless relay networks with capacity constraint. The computer simulation results show that the proposed scheme increase the network lifetime in comparison to the conventional schemes.