• Title/Summary/Keyword: LOW-Latency

Search Result 538, Processing Time 0.023 seconds

A Study on Mobility-Aware Edge Caching and User Association Algorithm (이동성 기반의 엣지 캐싱 및 사용자 연결 알고리즘 연구)

  • TaeYoon, Lee;SuKyoung, Lee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.12 no.2
    • /
    • pp.47-52
    • /
    • 2023
  • Mobile Edge Computing(MEC) is considered as a promising technology to effectively support the explosively increasing traffic demands. It can provide low-latency services and reduce network traffic by caching contents at the edge of networks such as Base Station(BS). Although users may associate with the nearest BSs, it is more beneficial to associate users to the BS where the requested content is cached to reduce content download latency. Therefore, in this paper, we propose a mobility-aware joint caching and user association algorithm to imporve the cache hit ratio. In particular, the proposed algorithm performs caching and user association based on sojourn time and content preferences. Simulation results show that the proposed scheme improves the performance in terms of cache hit ratio and latency as compared with existing schemes.

Real-time simulation on B-spline deformable volume-part III (B-spline volume 변형체의 실시간 시뮬레이션 II)

  • 전성기;조맹효
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.10a
    • /
    • pp.70-77
    • /
    • 2002
  • Since our physical world cannot be modeled as rigid body, deformable object models are important. For real-time simulation of elastic object, it must be guaranteed by its exact solution and low-latency computational cost. In this paper, we describe the boundary integral equation formulation of linear elastic body and related boundary element method(BEM). The deformation of elastic body can be effectively solved with 1ow run-time computational costs, using precomputed Green Function and fast low-rank updates based on Capacitance Matrix Algorithm.

  • PDF

Implementation of Class-Based Low Latency Fair Queueing (CBLLFQ) Packet Scheduling Algorithm for HSDPA Core Network

  • Ahmed, Sohail;Asim, Malik Muhammad;Mehmood, Nadeem Qaisar;Ali, Mubashir;Shahzaad, Babar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.2
    • /
    • pp.473-494
    • /
    • 2020
  • To provide a guaranteed Quality of Service (QoS) to real-time traffic in High-Speed Downlink Packet Access (HSDPA) core network, we proposed an enhanced mechanism. For an enhanced QoS, a Class-Based Low Latency Fair Queueing (CBLLFQ) packet scheduling algorithm is introduced in this work. Packet classification, metering, queuing, and scheduling using differentiated services (DiffServ) environment was the points in focus. To classify different types of real-time voice and multimedia traffic, the QoS provisioning mechanisms use different DiffServ code points (DSCP).The proposed algorithm is based on traffic classes which efficiently require the guarantee of services and specified level of fairness. In CBLLFQ, a mapping criterion and an efficient queuing mechanism for voice, video and other traffic in separate queues are used. It is proved, that the algorithm enhances the throughput and fairness along with a reduction in the delay and packet loss factors for smooth and worst traffic conditions. The results calculated through simulation show that the proposed calculations meet the QoS prerequisites efficiently.

ISRMC-MAC: Implementable Single-Radio, Multi-Channel MAC Protocol for WBANs

  • Cho, Kunryun;Jeon, Seokhee;Cho, Jinsung;Lee, Ben
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1052-1070
    • /
    • 2016
  • Wireless Body Area Networks (WBANs) have received a lot of attention as a promising technology for medical and healthcare applications. A WBAN should guarantee energy efficiency, data reliability, and low data latency because it uses tiny sensors that have limited energy and deals with medical data that needs to be timely and correctly transferred. To satisfy this requirement, many multi-radio multi-channel MAC protocols have been proposed, but these cannot be implemented on current off-the-shelf sensor nodes because they do not support multi-radio transceivers. Thus, recently single-radio multi-channel MAC protocols have been proposed; however, these methods are energy inefficient due to data duplication. This paper proposes a TDMA-based single-radio, multi-channel MAC protocol that uses the Unbalanced Star+Mesh topology to satisfy the requirements of WBANs. Our analytical analysis together experiments using real sensor nodes show that the proposed protocol outperforms existing methods in terms of energy efficiency, reliability, and low data latency.

The Change of Spinal Neuron Excitability by Cranial Electrostimulation(CES) in Rats (백서에서 두개전기자극에 의한 척수신경원 흥분성의 변화)

  • Jung, Dae-In;Lee, Jeong-Woo;Kim, Tae-Youl;Kim, Young-Il
    • Journal of the Korean Academy of Clinical Electrophysiology
    • /
    • v.2 no.3
    • /
    • pp.37-49
    • /
    • 2004
  • The purpose of this study was to determine the effect of spinal motor neuron excitability by cranial electrostimulation(CES). The fifteen Sparague-Dawley adult male rats were assigned to the three groups; GroupI(control), GroupII(low rate CES), GroupIII(high rate CES). Spinal motor neuron excitability was measured to use a computerized H reflex. The results of this study was as follows; M latency, M amplitude and H latency were no significant difference in all groups on repeated measured ANOVA(p>.05) but low rate CES and high rate CES groups were lower than ether group in comparative measurement of H amplitude and Hmax/Mmax ratio(p<.05). These results lead to the conclusion that spinal neuron excitability was influenced by CES. These results suggest that CES had the capability to lower spinal motor neuron excitability used synaptic blockade in spinal segment.

  • PDF

Low Latency Synchronization Scheme Using Prediction and Avoidance of Synchronization Failure in Heterochronous Clock Domains

  • Song, Sung-Gun;Park, Seong-Mo;Lee, Jeong-Gun;Oh, Myeong-Hoon
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.15 no.2
    • /
    • pp.208-222
    • /
    • 2015
  • For the performance-efficient integration of IPs on an SoC utilizing heterochronous multi-clock domains, we propose a synchronization scheme that causes low latency overhead when data are crossing clock boundaries. The proposed synchronization scheme is composed of a clock predictor and a synchronizer. The clock predictor of a sender clock domain produces a predicted clock that is used in a receiver clock domain to detect possible synchronization failures in advance. When the possible synchronization failures are detected, a synchronizer at the receiver delays data-capture times to avoid the possible synchronization failures. From the simulation of the proposed scheme through SPICE modeling using a Chartered $0.18{\mu}m$ CMOS process, we verified the functionalities and timing behavior of the clock predictor and the synchronizer. The simulation results show that the clock predictor produces a predicted clock before a synchronization failure, and the synchronizer samples data correctly using the predicted clock.

Efficient Peer Assignment for Low-Latency Transmission of Scalable Coded Images

  • Su, Xiao;Wang, Tao
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.79-88
    • /
    • 2008
  • In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.

An Overview of Mobile Edge Computing: Architecture, Technology and Direction

  • Rasheed, Arslan;Chong, Peter Han Joo;Ho, Ivan Wang-Hei;Li, Xue Jun;Liu, William
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.10
    • /
    • pp.4849-4864
    • /
    • 2019
  • Modern applications such as augmented reality, connected vehicles, video streaming and gaming have stringent requirements on latency, bandwidth and computation resources. The explosion in data generation by mobile devices has further exacerbated the situation. Mobile Edge Computing (MEC) is a recent addition to the edge computing paradigm that amalgamates the cloud computing capabilities with cellular communications. The concept of MEC is to relocate the cloud capabilities to the edge of the network for yielding ultra-low latency, high computation, high bandwidth, low burden on the core network, enhanced quality of experience (QoE), and efficient resource utilization. In this paper, we provide a comprehensive overview on different traits of MEC including its use cases, architecture, computation offloading, security, economic aspects, research challenges, and potential future directions.

Benzodiazepine System is Involved in Hyperalgesia in Rats Induced by the Exposure to Extremely Low Frequency Magnetic Fields

  • Jeong Ji Hoon;Choi Kyung Bum;Moon Nam Ju;Park Eon Sub;Sohn Uy Dong
    • Archives of Pharmacal Research
    • /
    • v.28 no.2
    • /
    • pp.238-242
    • /
    • 2005
  • Many reports demonstrate that extremely low frequency magnetic fields (ELF MFs, 60 Hz) may be involved in hyperalgesia. In a previous investigation, we suggested that MFs may produce hyperalgesia and such a response may be regulated by the benzodiazepine system. In order to further confirm this effect of MFs, we used diazepam and/or flumazenil with MFs exposure. When testing the pain threshold of rats using hot plate tests, MFs or diazepam ($0.5\;{\mu}g$, i.c.v.; a benzodiazepine receptor agonist) induced hyperalgesic effects with the reduction of latency. These effects were blocked by a pretreatment of flumazenil (1.5 mg/kg, i.p.; a benzodiazepine receptor antagonist). When the rats were exposed simultaneously to MFs and diazepam, the latency tended to decrease without statistical significance. The induction of hyperalgesia by co-exposure to MFs and diazepam was also blocked by flumazenil. However, the pretreatment of GABA receptor antagonists such as bicuculline ($0.1\;{\mu}g$, i.c.v.; a $GABA_A$ antagonist) or phaclofen ($10\;{\mu}g$, i.c.v.; a $GABA_B$ antagonist) did not antagonize the hyperalgesic effect of MFs. These results suggest that the benzodiazepine system may be involved in MFs-induced hyperalgesia.

A 256-Radix Crossbar Switch Using Mux-Matrix-Mux Folded-Clos Topology

  • Lee, Sung-Joon;Kim, Jaeha
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.14 no.6
    • /
    • pp.760-767
    • /
    • 2014
  • This paper describes a high-radix crossbar switch design with low latency and power dissipation for Network-on-Chip (NoC) applications. The reduction in latency and power is achieved by employing a folded-clos topology, implementing the switch organized as three stages of low-radix switches connected in cascade. In addition, to facilitate the uniform placement of wires among the sub-switch stages, this paper proposes a Mux-Matrix-Mux structure, which implements the first and third switch stages as multiplexer-based crossbars and the second stage as a matrix-type crossbar. The proposed 256-radix, 8-bit crossbar switch designed in a 65nm CMOS has the simulated power dissipation of 1.92-W and worst-case propagation delay of 0.991-ns while operating at 1.2-V supply and 500-MHz frequency. Compared with the state-of-the-art designs in literature, the proposed crossbar switch achieves the best energy-delay-area efficiency of $0.73-fJ/cycle{\cdot}ns{\cdot}{\lambda}^2$.