• Title/Summary/Keyword: Address Allocation

Search Result 144, Processing Time 0.024 seconds

A Study on Dynamic Address Allocation Protocol for MANET(Mobile Ad hoe NETwork) (MANET에서의 동적 주소 할당 기법011 관한 연구)

  • 김세훈;정현구;이은주;윤현주;이준원
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04d
    • /
    • pp.4-6
    • /
    • 2003
  • MANET(Mobile Ad hoc NETwork)은 기간망(infrastructure network)에 대한 의존 없이 필요에 따라 노드(node)들이 자발적으로 임시적인 네트워크를 형성해 데이터를 주고 받는 형태이다. 지금까지 MANET에 관한 대부분의 연구는 노드들이 네트워크에 합류하기 전에 IP주소를 할당받는다는 가정하에 이루어졌다. 기존의 네트워크에서는 IPv4주소의 부족으로 모든 노드에게 영구적으로 IP주소를 할당 할 수 없어 동적으로 IP주소를 할당할 필요가 있을 때 DHCP를 이용해 노드들에게 IP주소를 할당했다. 그러나 MANET의 경우 노드의 이동성으로 인해 중앙집중화 된 DHCP 서버로의 접근을 항상 보장할 수 없다 그러므로 본 논문에서는 MANET의 노드들에게 유일한 IP주소를 동적으로 할당하기 위한 토큰-기반 동적 주소 할당 프로토콜을 제안하였다.

  • PDF

Resource Management in 5G Mobile Networks: Survey and Challenges

  • Chien, Wei-Che;Huang, Shih-Yun;Lai, Chin-Feng;Chao, Han-Chieh
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.896-914
    • /
    • 2020
  • With the rapid growth of network traffic, a large number of connected devices, and higher application services, the traditional network is facing several challenges. In addition to improving the current network architecture and hardware specifications, effective resource management means the development trend of 5G. Although many existing potential technologies have been proposed to solve the some of 5G challenges, such as multiple-input multiple-output (MIMO), software-defined networking (SDN), network functions virtualization (NFV), edge computing, millimeter-wave, etc., research studies in 5G continue to enrich its function and move toward B5G mobile networks. In this paper, focusing on the resource allocation issues of 5G core networks and radio access networks, we address the latest technological developments and discuss the current challenges for resource management in 5G.

ASSESSMENT OF PUBLIC PERCEIVED ROADWAY SMOOTHNESS

  • Jamie Miller;Don Chen;Neil Mastin
    • International conference on construction engineering and project management
    • /
    • 2013.01a
    • /
    • pp.507-508
    • /
    • 2013
  • International Roughness Index (IRI) has been widely used by state DOTs to quantify pavement smoothness. When pavement condition falls below certain IRI thresholds, corresponding pavement maintenance treatments should be considered for application. Selection of appropriate IRI thresholds is essential to tactical allocation of limited resources to improve the conditions of states' roadway systems. This selection process is often challenging, however, because IRI thresholds are largely determined by Perceived Ride Quality (PRQ), and PRQ differs in each state. In this paper, a framework is proposed to address this problem. Passenger raters will be randomly selected from predetermined geographic locations, and their PRQ ratings collected. Taking this perceived ride data, along with other data collected, a statistical analysis will be conducted to establish the relationship between measured IRI values and PRQ. Appropriate IRI thresholds will then be determined. Once this framework is implemented, state DOTs could make informative maintenance decisions, which are expected to greatly enhance the public perception of pavement conditions in today's challenging economy.

  • PDF

An Engine for DRA in Container Orchestration Using Machine Learning

  • Gun-Woo Kim;Seo-Yeon Gu;Seok-Jae Moon;Byung-Joon Park
    • International journal of advanced smart convergence
    • /
    • v.12 no.4
    • /
    • pp.126-133
    • /
    • 2023
  • Recent advancements in cloud service virtualization technologies have witnessed a shift from a Virtual Machine-centric approach to a container-centric paradigm, offering advantages such as faster deployment and enhanced portability. Container orchestration has emerged as a key technology for efficient management and scheduling of these containers. However, with the increasing complexity and diversity of heterogeneous workloads and service types, resource scheduling has become a challenging task. Various research endeavors are underway to address the challenges posed by diverse workloads and services. Yet, a systematic approach to container orchestration for effective cloud management has not been clearly defined. This paper proposes the DRA-Engine (Dynamic Resource Allocation Engine) for resource scheduling in container orchestration. The proposed engine comprises the Request Load Procedure, Required Resource Measurement Procedure, and Resource Provision Decision Procedure. Through these components, the DRA-Engine dynamically allocates resources according to the application's requirements, presenting a solution to the challenges of resource scheduling in container orchestration.

5G Network Resource Allocation and Traffic Prediction based on DDPG and Federated Learning (DDPG 및 연합학습 기반 5G 네트워크 자원 할당과 트래픽 예측)

  • Seok-Woo Park;Oh-Sung Lee;In-Ho Ra
    • Smart Media Journal
    • /
    • v.13 no.4
    • /
    • pp.33-48
    • /
    • 2024
  • With the advent of 5G, characterized by Enhanced Mobile Broadband (eMBB), Ultra-Reliable Low Latency Communications (URLLC), and Massive Machine Type Communications (mMTC), efficient network management and service provision are becoming increasingly critical. This paper proposes a novel approach to address key challenges of 5G networks, namely ultra-high speed, ultra-low latency, and ultra-reliability, while dynamically optimizing network slicing and resource allocation using machine learning (ML) and deep learning (DL) techniques. The proposed methodology utilizes prediction models for network traffic and resource allocation, and employs Federated Learning (FL) techniques to simultaneously optimize network bandwidth, latency, and enhance privacy and security. Specifically, this paper extensively covers the implementation methods of various algorithms and models such as Random Forest and LSTM, thereby presenting methodologies for the automation and intelligence of 5G network operations. Finally, the performance enhancement effects achievable by applying ML and DL to 5G networks are validated through performance evaluation and analysis, and solutions for network slicing and resource management optimization are proposed for various industrial applications.

An Overlapping Types Model and the Pure Medium of Exchange Role of Fiat Money (중복유형모형(重複類型模型)과 화폐(貨幣)의 순수교환기능(純粹交換機能))

  • Park, Woo-kyu
    • KDI Journal of Economic Policy
    • /
    • v.14 no.2
    • /
    • pp.189-203
    • /
    • 1992
  • Any money model should address the most important phenomenon of a monetary economy, which is the phenomenon of the rate of return dominance. Even if the holding returns on financial or nonfinancial assets are higher than the rate of return on fiat money holding, which is typically zero, people still hold and use money. In a period of accelerating inflation, number of dominating assets increases continuously, yet people continue to hold and use money. Wallace's (1980) overlapping generations model cannot address the rate of return dominance phenomenon. His model does not capture the mediun of exchange role of fiat money. In this paper, an overlapping types model of fiat money is constructed, in which different types of consumers have different preferences on different types of goods, are endowed with different types of goods, are located at seperated regions, and live for only two periods. In this model, people hold and use money despite the dominating assets, even if inflation accelates. Money in this case serves as a pure medium of exchange, whereas in Wallace's model, money serves as a pure store of value, and money disappears if a dominating asset exists. An interesting feature of the overlapping types model presented in this paper is that money does not provide a cheap approximation to an idealized and efficient real allocation. A monetary economy is always superior to a nonmonetary economy, because money helps overcome the incompleteness of the overlapping types friction. In a monetary economy, however, a pareto optimal allocation cannot always be achieved, because money cannot always overcome the overlapping types friction itself. Therefore, with the criterion of optimality of real allocations, the monetary economy is more optimal than a nonmonetary economy but less optimal than a complete Arrow-Debreu economy. This feature has important implications on macro modelling. Because of the difficulty in introducing money into a macro model in an essential and endogenous manner as in the overlapping types model of this paper, a macro model typically ignores money and studies real allocations without the money factor. The possible inefficiencies of a monetary economy, relative to a complete real Arrow-Debreu economy, may indicate differences in real allocations between the two models.

  • PDF

An Efficient Addressing Scheme Using (x, y) Coordinates in Environments of Smart Grid (스마트 그리드 환경에서 (x, y) 좌표값을 이용한 효율적인 주소 할당 방법)

  • Cho, Yang-Hyun;Lim, Song-Bin;Kim, Gyung-Mok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.1
    • /
    • pp.61-69
    • /
    • 2012
  • Smart Grid is the next-generation intelligent power grid that maximizes energy efficiency with the convergence of IT technologies and the existing power grid. Smart Grid is created solution for standardization and interoperability. Smart Grid industry enables consumers to check power rates in real time for active power consumption. It also enables suppliers to measure their expected power generation load, which stabilizes the operation of the power system. Smart industy was ecolved actively cause Wireless communication is being considered for AMI system and wireless communication using ZigBee sensor has been applied in various industly. In this paper, we proposed efficient addressing scheme for improving the performance of the routing algorithm using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm has wasted address space. Therefore proposing x, y coordinate axes from divide address space of 16 bit to solve this problem. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verify performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduce multi hop than ZigBee distributed address assignment and another.

A GIS-based Geometric Method for Solving the Competitive Location Problem in Discrete Space (이산적 입지 공간의 경쟁적 입지 문제를 해결하기 위한 GIS 기반 기하학적 방법론 연구)

  • Lee, Gun-Hak
    • Journal of the Korean Geographical Society
    • /
    • v.46 no.3
    • /
    • pp.366-381
    • /
    • 2011
  • A competitive location problem in discrete space is computationally difficult to solve in general because of its combinatorial feature. In this paper, we address an alternative method for solving competitive location problems in discrete space, particularly employing deterministic allocation. The key point of the suggested method is to reducing the number of predefined potential facility sites associated with the size of problem by utilizing geometric concepts. The suggested method was applied to the existing broadband marketplace with increasing competition as an application. Specifically, we compared computational results and spatial configurations of two different sized problems: the problem with the original potential sites over the study area and the problem with the reduced potential sites extracted by a GIS-based geometric algorithm. The results show that the competitive location model with the reduced potential sites can be solved more efficiently, while both problems presented the same optimal locations maximizing customer capture.

Retransmission with Transmission Quantity Allocation for Energy Harvesting Wireless Sensor Networks

  • Gun-Hee Kim;Ikjune Yoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.29 no.6
    • /
    • pp.175-182
    • /
    • 2024
  • In wireless sensor networks, batteries limit lifespan, and heavy data transmission around the sink causes the hotspot problem. To address this, data collection amounts are allocated to child nodes to limit transmission. However, this approach has issues with nodes far from the sink having excessive energy and failing to transmit the allocated amount due to data transmission errors. This paper proposes a method to prevent sensor data loss through error recovery via retransmission. The method ensures that each node's retransmission volume stays within its allocated data amount and energy limits, using excess energy for error recovery. Simulations show that this technique effectively recovers data transmission errors, collects data, minimizes energy depletion around the sink, and increases data collection rates.

Workload-Driven Adaptive Log Block Allocation for Efficient Flash Memory Management (효율적 플래시 메모리 관리를 위한 워크로드 기반의 적응적 로그 블록 할당 기법)

  • Koo, Duck-Hoi;Shin, Dong-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.2
    • /
    • pp.90-102
    • /
    • 2010
  • Flash memory has been widely used as an important storage device for consumer electronics. For the flash memory-based storage systems, FTL (Flash Translation Layer) is used to handle the mapping between a logical page address and a physical page address. Especially, log buffer-based FTLs provide a good performance with small-sized mapping information. In designing the log buffer-based FTL, one important factor is to determine the mapping structure between data blocks and log blocks, called associativity. While previous works use static associativity fixed at the design time, we propose a new log block mapping scheme which adjusts associativity based on the run-time workload. Our proposed scheme improves the I/O performance about 5~16% compared to the static scheme by adjusting the associativity to provide the best performance.