• Title/Summary/Keyword: Optimal latency

Search Result 97, Processing Time 0.022 seconds

Design and Implementation of 256-Point Radix-4 100 Gbit/s FFT Algorithm into FPGA for High-Speed Applications

  • Polat, Gokhan;Ozturk, Sitki;Yakut, Mehmet
    • ETRI Journal
    • /
    • v.37 no.4
    • /
    • pp.667-676
    • /
    • 2015
  • The third-party FFT IP cores available in today's markets do not provide the desired speed demands for optical communication. This study deals with the design and implementation of a 256-point Radix-4 100 Gbit/s FFT, where computational steps are reconsidered and optimized for high-speed applications, such as radar and fiber optics. Alternative methods for FFT implementation are investigated and Radix-4 is decided to be the optimal solution for our fully parallel FPGA application. The algorithms that we will implement during the development phase are to be tested on a Xilinx Virtex-6 FPGA platform. The proposed FFT core has a fully parallel architecture with a latency of nine clocks, and the target clock rate is 312.5 MHz.

A Hierarchical Binary-search Tree for the High-Capacity and Asymmetric Performance of NVM (비대칭적 성능의 고용량 비휘발성 메모리를 위한 계층적 구조의 이진 탐색 트리)

  • Jeong, Minseong;Lee, Mijeong;Lee, Eunji
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.2
    • /
    • pp.79-86
    • /
    • 2019
  • For decades, in-memory data structures have been designed for DRAM-based main memory that provides symmetric read/write performances and has no limited write endurance. However, such data structures provide sub-optimal performance for NVM as it has different characteristics to DRAM. With this motivation, we rethink a conventional red-black tree in terms of its efficacy under NVM settings. The original red-black tree constantly rebalances sub-trees so as to export fast access time over dataset, but it inevitably increases the write traffic, adversely affecting the performance for NVM with a long write latency and limited endurance. To resolve this problem, we present a variant of the red-black tree called a hierarchical balanced binary search tree. The proposed structure maintains multiple keys in a single node so as to amortize the rebalancing cost. The performance study reveals that the proposed hierarchical binary search tree effectively reduces the write traffic by effectively reaping the high capacity of NVM.

DRL based Dynamic Service Mobility for Marginal Downtime in Multi-access Edge Computing

  • Mwasinga, Lusungu Josh;Raza, Syed Muhammad;Chu, Hyeon-Seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.114-116
    • /
    • 2022
  • The advent of the Multi-access Edge Computing (MEC) paradigm allows mobile users to offload resource-intensive and delay-stringent services to nearby servers, thereby significantly enhancing the quality of experience. Due to erratic roaming of mobile users in the network environment, maintaining maximum quality of experience becomes challenging as they move farther away from the serving edge server, particularly due to the increased latency resulting from the extended distance. The services could be migrated, under policies obtained using Deep Reinforcement Learning (DRL) techniques, to an optimal edge server, however, this operation incurs significant costs in terms of service downtime, thereby adversely affecting service quality of experience. Thus, this study addresses the service mobility problem of deciding whether to migrate and where to migrate the service instance for maximized migration benefits and marginal service downtime.

A reinforcement learning-based network path planning scheme for SDN in multi-access edge computing

  • MinJung Kim;Ducsun Lim
    • International journal of advanced smart convergence
    • /
    • v.13 no.2
    • /
    • pp.16-24
    • /
    • 2024
  • With an increase in the relevance of next-generation integrated networking environments, the need to effectively utilize advanced networking techniques also increases. Specifically, integrating Software-Defined Networking (SDN) with Multi-access Edge Computing (MEC) is critical for enhancing network flexibility and addressing challenges such as security vulnerabilities and complex network management. SDN enhances operational flexibility by separating the control and data planes, introducing management complexities. This paper proposes a reinforcement learning-based network path optimization strategy within SDN environments to maximize performance, minimize latency, and optimize resource usage in MEC settings. The proposed Enhanced Proximal Policy Optimization (PPO)-based scheme effectively selects optimal routing paths in dynamic conditions, reducing average delay times to about 60 ms and lowering energy consumption. As the proposed method outperforms conventional schemes, it poses significant practical applications.

Stochastic Radar Beam Scheduling Using Simulated Annealing (Simulated Annealing을 이용한 추계적 레이더 빔 스케줄링 알고리즘)

  • Roh, Ji-Eun;Ahn, Chang-Soo;Kim, Seon-Joo;Jang, Dae-Sung;Choi, Han-Lim
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.2
    • /
    • pp.196-206
    • /
    • 2012
  • AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed stochastic radar beam scheduling algorithm using simulated annealing(SA), and evaluated the performance on the multi-function radar scenario. As a result, we showed that our proposed algorithm is superior to previous dispatching rule based scheduling algorithm from the viewpoint of beam processing latency and the number of scheduled beams, with real time capability.

Hydrolysate Preparation with High Content of 5-Hydroxytryptophan from Liquid Egg Protein and Its Sleep-Potentiating Activity

  • Kwon, Jung Il;Park, Yooheon;Han, Sung Hee;Suh, Hyung Joo
    • Food Science of Animal Resources
    • /
    • v.37 no.5
    • /
    • pp.646-653
    • /
    • 2017
  • Alcalase hydrolysis of liquid egg white was used to produce 5-hydroxytryptophan (HTP) under various conditions and investigate the sleep-potentiating activity of liquid egg white hydrolysate (LEH) on pentobarbital-induced sleep. Alcalase hydrolysis yielded the highest content of 5-HTP ($13.50{\mu}g/mL$), while neutrase hydrolysis showed the lowest 5-HTP content ($5.23{\mu}g/mL$). The liquid egg white to water ratio (1:1) was optimal for the production of 5-HTP with high amino-nitrogen (A-N) content and degree of hydrolysis. The 5-HTP, amino-nitrogen, and degree of hydrolysis increased until 24 h of hydrolysis and slightly increased thereafter during hydrolysis with 2% and 5% enzyme addition. 5-HTP administration at doses of 6 and 9 mg/kg significantly increased sleep duration and decreased sleep latency time compared to that in the control (p<0.05). LEH (150 mg/mouse), which was equivalent to 5-HTP at 6 mg/kg, significantly decreased sleep latency time and increased sleep duration time compared to that in the control (p<0.05). Oral administration of LEH showed sleep-potentiating effects because of 5-HTP. The sleep-potentiating activity of LEH may have occurred through 5-HTP in our pentobarbital-induced sleep model. LEH may be a valuable alternative to sleep enhancement and may be used as a sleep-potentiating agent.

A New Measure for Monitoring Intraoperative Somatosensory Evoked Potentials

  • Jin, Seung-Hyun;Chung, Chun Kee;Kim, Jeong Eun;Choi, Young Doo
    • Journal of Korean Neurosurgical Society
    • /
    • v.56 no.6
    • /
    • pp.455-462
    • /
    • 2014
  • Objective : To propose a new measure for effective monitoring of intraoperative somatosensory evoked potentials (SEP) and to validate the feasibility of this measure for evoked potentials (EP) and single trials with a retrospective data analysis study. Methods : The proposed new measure (hereafter, a slope-measure) was defined as the relative slope of the amplitude and latency at each EP peak compared to the baseline value, which is sensitive to the change in the amplitude and latency simultaneously. We used the slope-measure for EP and single trials and compared the significant change detection time with that of the conventional peak-to-peak method. When applied to single trials, each single trial signal was processed with optimal filters before using the slope-measure. In this retrospective data analysis, 7 patients who underwent cerebral aneurysm clipping surgery for unruptured aneurysm middle cerebral artery (MCA) bifurcation were included. Results : We found that this simple slope-measure has a detection time that is as early or earlier than that of the conventional method; furthermore, using the slope-measure in optimally filtered single trials provides warning signs earlier than that of the conventional method during MCA clipping surgery. Conclusion : Our results have confirmed the feasibility of the slope-measure for intraoperative SEP monitoring. This is a novel study that provides a useful measure for either EP or single trials in intraoperative SEP monitoring.

Design and Performance Evaluation of Wireless Ad-Hoc Network System based on IEEE 802.16j MMR (IEEE 802.16j MMR 기반 무선 애드 혹 네트워크 시스템 설계 및 성능 평가)

  • Ju, Kwangsung;Chung, Kwangsue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.723-733
    • /
    • 2012
  • In wireless ad hoc networks, packet loss and latency are frequently occurred by movement of node. As the number of transmission hops increases in these networks, the throughput is increasingly deteriorated. In this paper, we design the wireless ad hoc network system based on IEEE 802.16j MMR (Mobile Multi-hop Relay), which improves the network performance. Our wireless ad hoc network system used adaptively the nearest BS and Farthest BS scheduling algorithms for efficient data transmission and chose the optimal path that minimize data loss and latency. In order to evaluate performance of the wireless ad hoc network system based on IEEE 802.16j MMR, we used the LWX (Light Wimax) model of NS-2 simulator. Through the simulation, we analyzed the network performance for various scenarios.

A Scalable Video Coding (SVC)-Aware Retransmission Scheme for Multimedia Streaming in IEEE 802.11 WLANs (IEEE 802.11 무선랜에서의 멀티미디어 전송을 위한 스케일러블 비디오 코딩 인지형 재전송 기법)

  • Kim, Namyeong;Song, Taewon;Kim, Wonjung;Pack, Sangheon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.2
    • /
    • pp.95-101
    • /
    • 2014
  • Scalable video coding (SVC) encodes multimedia data into a base layer and enhancement layers to cope with variable network conditions in an adaptive manner. In SVC, enhancement layers can be decoded only when the base layer is successively received. However, existing works on SVC transmissions in IEEE 802.11 WLANs do not fully investigate this characteristic and thus their performance can be degraded. In this paper, we propose a SVC-aware retransmission (SAR) scheme in IEEE 802.11 WLANs. The SAR scheme applies different retransmission policies for base and enhancement layers by obtaining the optimal number of frames to be retransmitted. As a result, the SAR scheme can reduce unnecessary retransmissions and minimize the transmission latency. Simulation results demonstrate that the SAR scheme can reduce unnecessary data transmission by 12.6% and the transmission latency by 6.6~19.1% compared to conventional retransmission schemes.

Content Distribution for 5G Systems Based on Distributed Cloud Service Network Architecture

  • Jiang, Lirong;Feng, Gang;Qin, Shuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4268-4290
    • /
    • 2015
  • Future mobile communications face enormous challenges as traditional voice services are replaced with increasing mobile multimedia and data services. To address the vast data traffic volume and the requirement of user Quality of Experience (QoE) in the next generation mobile networks, it is imperative to develop efficient content distribution technique, aiming at significantly reducing redundant data transmissions and improving content delivery performance. On the other hand, in recent years cloud computing as a promising new content-centric paradigm is exploited to fulfil the multimedia requirements by provisioning data and computing resources on demand. In this paper, we propose a cooperative caching framework which implements State based Content Distribution (SCD) algorithm for future mobile networks. In our proposed framework, cloud service providers deploy a plurality of cloudlets in the network forming a Distributed Cloud Service Network (DCSN), and pre-allocate content services in local cloudlets to avoid redundant content transmissions. We use content popularity and content state which is determined by content requests, editorial updates and new arrivals to formulate a content distribution optimization model. Data contents are deployed in local cloudlets according to the optimal solution to achieve the lowest average content delivery latency. We use simulation experiments to validate the effectiveness of our proposed framework. Numerical results show that the proposed framework can significantly improve content cache hit rate, reduce content delivery latency and outbound traffic volume in comparison with known existing caching strategies.