• 전기전자학회논문지
• /
• 제23권4호
• /
• pp.1203-1207
• /
• 2019

As the number of IP cores has been increasing in a System-on-Chip (SoC), multiple routers are included in on-chip-networks. Each router has its own arbitration policy and it is difficult to obtain a desired arbitration result by combining multiple routers. Allocating desired bandwidths to the ports across the routers is more difficult. In this paper, a guaranteed bandwidth allocation scheme using an IP-level QoS control is proposed to overcome the limitations of existing local arbitration policies. Each IP can control the priority of a packet depending on the data communication requirement within the allocated bandwidth. The experimental results show that the proposed mechanism guarantees for IPs to utilize the allocated bandwidth in multiple router on-chip-networks. The maximum error rate of bandwidth allocation of the proposed scheme is only 1.9%.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.221-224
• /
• 2001

A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1733-1751
• /
• 2015

The IEEE 802.15.4 standard not only provides a maximum of seven guaranteed time slots (GTSs) for allocation within a superframe to support time-critical traffic, but also achieves ultralow complexity, cost, and power in low-rate and short-distance wireless personal area networks (WPANs). Real-time wireless body area sensor networks (WBASNs), as a special purpose WPAN, can perfectly use the IEEE 802. 15. 4 standard for its wireless connection. In this paper, we propose an adaptive GTS allocation scheme for real-time WBASN data transmissions with different priorities in consideration of low latency, fairness, and bandwidth utilization. The proposed GTS allocation scheme combines a weight-based priority assignment algorithm with an innovative starvation avoidance scheme. Simulation results show that the proposed method significantly outperforms the existing GTS implementation for the traditional IEEE 802.15.4 in terms of average delay, contention free period bandwidth utilization, and fairness.

• 한국광학회지
• /
• 제22권4호
• /
• pp.161-169
• /
• 2011

본 논문에서는 광학 민감도가 큰 IR 광학계의 조립정렬과정에서 목표 성능을 만족시키기 위한 조립정렬 허용범위를 설정하는 방법을 제시하였다. 조립정렬 과정에서 편심측정기를 이용하여 각각의 광학소자에 대한 반사 편심량을 측정할 수 있다. 측정된 값을 이용하여 몬테카를로 시뮬레이션을 수행하였고 이를 이용하여 조립 정렬 이후의 광학계의 성능을 예측하였다. 시뮬레이션 결과와 실제 제작된 광학계의 광학 성능을 비교하여 본 논문에서 제시한 공차 할당 기법의 타당성을 확인하였다.

• 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.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.222-227
• /
• 2013

This paper presents an analytical framework for dynamic spectrum allocation in cognitive radio networks. We propose a distributed queuing based Markovian model each for single channel and multiple channels access for a contending user. Knowledge about spectrum mobility is one of the most challenging problems in both these setups. To solve this, we consider probabilistic channel availability in case of licensed channel detection for single channel allocation, while variable data rates are considered using channel aggregation technique in the multiple channel access model. These models are designed for a centralized architecture to enable dynamic spectrum allocation and are compared on the basis of access latency and service duration.

• ETRI Journal
• /
• 제40권6호
• /
• pp.726-735
• /
• 2018

Femtocells are good examples of the ultimate networking technology, offering enhanced indoor coverage and higher data rate. However, the dense deployment of femto base stations (FBSs) and the exploitation of subcarrier reuse between macrocell base stations and FBSs result in significant co-tier and cross-tier interference, thus degrading system performance. Therefore, appropriate resource allocations are required to mitigate the interference. This paper proposes a discrete bacterial foraging optimization (DBFO) algorithm to find the optimal resource allocation in two-tier networks. The simulation results showed that DBFO outperforms the random-resource allocation and discrete particle swarm optimization (DPSO) considering the small number of steps taken by particles and bacteria.

• Journal of information and communication convergence engineering
• /
• 제17권3호
• /
• pp.185-190
• /
• 2019

The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.

• International journal of advanced smart convergence
• /
• 제10권2호
• /
• pp.1-9
• /
• 2021

In the Internet-of-Things (IoT) and artificial intelligence (AI), complete implementations are dependent largely on the speed of the fifth generation (5G) networks. However, successive interference cancellation (SIC) in non-orthogonal multiple access (NOMA) of the 5G mobile networks can be still decoding latency and receiver complexity in the conventional SIC NOMA scheme. Thus, in order to reduce latency and complexity of inherent SIC in conventional SIC NOMA schemes, we propose a rate-lossless non-SIC NOMA scheme. First, we derive the closed-form expression for the achievable data rate of the asymmetric 2PAM non-SIC NOMA, i.e., without SIC. Second, the exact achievable power allocation interval of this rate-lossless non-SIC NOMA scheme is also derived. Then it is shown that over the derived achievable power allocation interval of user-fairness, rate-lossless non-SIC NOMA can be implemented. As a result, the asymmetric 2PAM could be a promising modulation scheme for rate-lossless non-SIC NOMA of 5G networks, under user-fairness.

• 한국산업융합학회 논문집
• /
• 제25권4_2호
• /
• pp.645-653
• /
• 2022

Recently, deep reinforcement learning has been applied to a variety of industries, such as games, robotics, autonomous vehicles, and data cooling systems. An algorithm called reinforcement learning allows for automated asset allocation without the requirement for ongoing monitoring. It is free to choose its own policies. The purpose of this paper is to carry out an empirical analysis of the performance of asset allocation strategies. Among the strategies considered were the conventional Mean- Variance Optimization (MVO) and the Proximal Policy Optimization (PPO). According to the findings, the PPO outperformed both its benchmark index and the MVO. This paper demonstrates how dynamic asset allocation can benefit from the development of a reinforcement learning algorithm.