• Title/Summary/Keyword: Latency

Search Result 2,441, Processing Time 0.033 seconds

Naloxone Reversal of He-Ne Laser Stimulation Induced Analgesia in Rat (헬륨 -네온 레이저자극으로 유발된 흰쥐 진통작용의 날록손 반전)

  • Lee Jae-Hyoung;Song In-Yong;Choi Eun-Yong
    • The Journal of Korean Physical Therapy
    • /
    • v.8 no.1
    • /
    • pp.15-20
    • /
    • 1996
  • The purpose of this study were to 1) determine the analgesic effect of 632.8 nm of helium-neon (He-Ne) laser stimulation on acupuncture point in rat and 2) determine the reversal of analgesic effect by naloxone injection. Eighteen Sprague-Dawley rats were devided into three groups : control (n=6) : laser (n=6), laser stimulation at $3.58\;J/cm^2$ ; and naloxone (n=6), 1 mg/kg of naloxone chloride inject into peritoneum before laser stimulation at $3.63J/cm^2$. Tail-flick latency were measured pretreat and posttreat with hot plate $(55^{\circ}C)$. Data were analyzed using one-way ANOVA and paired t-teat for tail-flick latency. No significant change was noted in the tail-flick latency in either control or naloxone groups. But significant increased in tail-flick latency in taller group. The results suggest that He-Ne laser induced analgesic effect, and endogenous opioids may be involved in He-Ne laser induced analgesia.

  • PDF

Design and Implementation of a Latency Efficient Encoder for LTE Systems

  • Hwang, Soo-Yun;Kim, Dae-Ho;Jhang, Kyoung-Son
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.493-502
    • /
    • 2010
  • The operation time of an encoder is one of the critical implementation issues for satisfying the timing requirements of Long Term Evolution (LTE) systems because the encoder is based on binary operations. In this paper, we propose a design and implementation of a latency efficient encoder for LTE systems. By virtue of 8-bit parallel processing of the cyclic redundancy checking attachment, code block (CB) segmentation, and a parallel processor, we are able to construct engines for turbo codings and rate matchings of each CB in a parallel fashion. Experimental results illustrate that although the total area and clock period of the proposed scheme are 19% and 6% larger than those of a conventional method based on a serial scheme, respectively, our parallel structure decreases the latency by about 32% to 65% compared with a serial structure. In particular, our approach is more latency efficient when the encoder processes a number of CBs. In addition, we apply the proposed scheme to a real system based on LTE, so that the timing requirement for ACK/NACK transmission is met by employing the encoder based on the parallel structure.

An Area Efficient Network Interface Architecture (NoC에서 면적 효율적인 Network Interface 구조에 관한 연구)

  • Lee, Ser-Hoon;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5C
    • /
    • pp.361-370
    • /
    • 2008
  • NoC is adopted for data communication between processors and IPs in MPSoC system. NoC has an advantage of scalability in that system can be easily expanded just by adding switches. However, as the number of switches increases, chip area increases as well as data transfer latency. This paper proposes an architecture that can reduce the number of switches in the system by sharing network interfaces. To reduce NI area, the modules sharing network interface use a common buffer in network interface. Experimental results show that the chip area has been reduced by 46.5% and data transfer latency by 17.1%, respectively, compared to conventional architecture.

Study on Low-Latency overcome of Stock Trading system in Cloud (클라우드 환경에서 주식 체결 시스템의 저지연 극복에 관한 연구)

  • Kim, Keun-Heui;Moon, Seok-Jae;Yoon, Chang-Pyo;Lee, Dae-Sung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2658-2663
    • /
    • 2014
  • To minimize low latency and improve the processing speed of the stock trading system, various technologies have been introduced. However, expensive network equipment has limitation for improving speed of trading system. Also, it is true that there is not much advantage by introducing those kind of systems. In this paper, we propose a low-Latency SPT(Safe Proper Time) scheme for overcoming the stock trading system in a cloud. The proposed method minimizes the CPI in order to reduce the CPU overhead that is based on the understanding of the kernel. and this approach satisfies the data timeliness.

Design of a Vido Storage Server that Maximizes Concurrent Streams and Minimizes Initial Latency (사용자 수 증대와 초기 대기시간 감소를 위한 비디오 저장 서버의 설계)

  • Ma, Pyeong-Su;Jo, Chang-Sik;Jin, Yun-Suk;Sin, Gyu-Sang
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2608-2617
    • /
    • 1999
  • One of the most important functionality that commercial video storage servers should provide is to maximize the number of concurrent streams and to minimize the initial latency of new requests. In this paper, we propose a data placement scheme whose disk read unit size can be twice large than that of conventional striping methods. The proposed scheme can significantly increase the number of concurrent streams, since the ratio of rotational latency time is decreased and the disks are effectively utilized. The disk scheduling scheme we propose guarantees constant initial latency time. We also propose a procedural design method for a storage server by introducing the concept of allowed initial latency. The comparison with previous research shows that the proposed scheme provides better performance.

  • PDF

Real-time Camera and Video Streaming Through Optimized Settings of Ethernet AVB in Vehicle Network System

  • An, Byoungman;Kim, Youngseop
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.8
    • /
    • pp.3025-3047
    • /
    • 2021
  • This paper presents the latest Ethernet standardization of in-vehicle network and the future trends of automotive Ethernet technology. The proposed system provides design and optimization algorithms for automotive networking technology related to AVB (Audio Video Bridge) technology. We present a design of in-vehicle network system as well as the optimization of AVB for automotive. A proposal of Reduced Latency of Machine to Machine (RLMM) plays an outstanding role in reducing the latency among devices. RLMM's approach to real-world experimental cases indicates a reduction in latency of around 41.2%. The setup optimized for the automotive network environment is expected to significantly reduce the time in the development and design process. The results obtained in the study of image transmission latency are trustworthy because average values were collected over a long period of time. It is necessary to analyze a latency between multimedia devices within limited time which will be of considerable benefit to the industry. Furthermore, the proposed reliable camera and video streaming through optimized AVB device settings would provide a high level of support in the real-time comprehension and analysis of images with AI (Artificial Intelligence) algorithms in autonomous driving.

Cross-Talk: D2D Potentiality Based Resource Borrowing Schema for Ultra-Low Latency Transmission in Cellular Network

  • Sun, Guolin;Dingana, Timothy;Adolphe, Sebakara Samuel Rene;Boateng, Gordon Owusu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2258-2276
    • /
    • 2019
  • Resource sharing is one of the main goals achieved by network virtualization technology to enhance network resource utilization and enable resource customization. Though resource sharing can improve network efficiency by accommodating various users in a network, limited infrastructure capacity is still a challenge to ultra-low latency service operators. In this paper, we propose an inter-slice resource borrowing schema based on the device-to-device (D2D) potentiality especially for ultra-low latency transmission in cellular networks. An extended and modified Kuhn-Munkres bipartite matching algorithm is developed to optimally achieve inter-slice resource borrowing. Simulation results show that, proper D2D user matching can be achieved, satisfying ultra-low latency (ULL) users' quality of service (QoS) requirements and resource utilization in various scenarios.

Developing Meta heuristics for the minimum latency problem (대기시간 최소화 문제를 위한 메타 휴리스틱 해법의 개발)

  • Yang, Byoung-Hak
    • Journal of the Korea Safety Management & Science
    • /
    • v.11 no.4
    • /
    • pp.213-220
    • /
    • 2009
  • The minimum latency problem, also known as the traveling repairman problem and the deliveryman problem is to minimize the overall waiting times of customers, not to minimize their routing times. In this research, a genetic algorithm, a clonal selection algorithm and a population management genetic algorithm are introduced. The computational experiment shows the objective value of the clonal selection algorithm is the best among the three algorithms and the calculating time of the population management genetic algorithm is the best among the three algorithms.

A Scenario for Enhanced Network-based Localized Mobility Management

  • Kim, Dong-Il;Kim, Kwang-Deok
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.3
    • /
    • pp.245-248
    • /
    • 2008
  • Everytime a node moves out of its area, the connection to the node encounters a handover which may cause much latency. NetLMM(Network based Localized Mobility Management) supports the mobility management for such nodes and improves handover latency using MIH(Media Independent Handover) function. In this paper, we add some messages to NetLMM procedure to improve handover latency and analyze its effects through a scenario based approach

Slotted Transmission: A New MAC Scheme for Reduced Frame Latency in Ad-hoc Networks

  • Rahman, Md. Mustafizur;Hong, Choong-Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.1294-1296
    • /
    • 2007
  • The IEEE 802.11 DCF forces neighboring nodes of an active transmitter to switch into inactive state. This conservative nature brings frame latency at transmitter neighborhood. This work exploits the IEEE 802.11n Frame Aggregation scheme to allow simultaneous transmissions from nodes that are neighbors to each-other. This is accomplished by the synchronization of control and data transmissions in slots of fixed length. Proposed scheme reduces the frame latency and improves aggregated network throughput.

  • PDF