• Title/Summary/Keyword: Optimal latency

Search Result 97, Processing Time 0.023 seconds

A Carrier Preference-based Routing Scheme(CPR) for Multi-Layered Maritime Data Communications Networks (다층 해상데이터통신망을 위한 캐리어선호도기반 경로배정방식)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.35 no.8
    • /
    • pp.1098-1104
    • /
    • 2011
  • Data communications networks at sea can be modelled by multi-layered networks with traditional carriers (RF, satellites), and BWA (wireless LAN, WiBro, LTE), which partially makes it possible the high speed communication services (WWW, VoIP) at sea. In this paper, a novel routing scheme (CPR) is proposed which selects an optimal carrier for each hop in routes based on carrier preferences (CP). The carrier preferences are measured proactively depending on the feasibility of transmission characteristics (transmission rate, cost, and latency time) of the carriers for each application. Performance was compared with that of the OMH-MW (Optimal Medium per Hop based on Max-Win) routing scheme.

Gamma Knife Radiosurgery for Vestibular Schwannomas

  • Lim, Young-Jin;Choi, Seok-Keun
    • Journal of Korean Neurosurgical Society
    • /
    • v.42 no.3
    • /
    • pp.159-167
    • /
    • 2007
  • Vestibular schwannoma (VS) is a benign tumor typically originated in the schwann cell of vestibular nerve and usually accompany hearing symptom. Microsurgical removal and radiosurgery have a great role for the treatment of VS. Recently radiosurgery has been considered as an alternative or primary treatment for VS with the tremendous increase of patients who were treated with gamma knife radiosurgery (GKS) though microsurgery still takes the premier. By many published results, it is proved that GKS is a effective and noninvasive technique for VS, especially small sized tumors with satisfactory tumor control rate. The authors assumed that GKS can be expected to achieve satisfactory tumor control rate for small VS under 5cc in volume. A major interest regarding radiosurgery nowadays is to determine the optimal radiation dose for hearing preservation to improve the quality of life of patients. The more high radiation dose are used for effective tumor growth control, the more radiation-related complications like as hearing deficit, the impairment of other cranial nerve function are increased. Since 1990's the mean radiation dose for tumor margin was more than 18 Gy, but there were high complication rate in spite of good tumor growth control. After the year of 2000, under the influence of advanced neuro-imaging techniques and radiosurgical planning system which enable clinicians to do more precise planning, marginal dose for VS has been decreased to 12-13 Gy and the radiation-related complications has been reduced. But because there may be a unexpected radiation induced complications as time goes by after the latency period, optimal radiation dose for VS should be established on the basis of more long term follow-up observation.

The Performance Comparison of the Unicast Routing Protocol and the Broadcast Routing Protocol in the Small-sized Ad hoc Network (소규모 애드혹 네트워크에서의 유니캐스트와 브로드캐스트 라우팅 프로토콜의 성능비교)

  • Kim, Dong-Hee;Park, Jun-Hee;Moon, Kyeong-Deok;Lim, Kyung-Shik
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.685-690
    • /
    • 2006
  • This paper compares the performance of the unicast routing protocol and the broadcast routing protocol in a small-sized wireless multi-hop network, such as home network. Normally, ad-hoc routing protocols are designed for general wireless multi-hop networks, not being said to be optimized for the small-sized ad hoc network. This paper compares some unicast routing protocols and optimal broadcast routing protocol, and shows the result. The result of the simulation says the broadcast routing protocol shows better performance than the ad-hoc routing protocols in the small-sired wireless multi-hop network. Especially, the result shows that the broadcast protocol has higher packet delivery ratio and lower packet latency than unicast routing protocols

Determination of Optimal Checkpoint Intervals for Real-Time Tasks Using Distributed Fault Detection (분산 고장 탐지 방식을 이용한 실시간 태스크에서의 최적 체크포인터 구간 선정)

  • Kwak, Seong Woo;Yang, Jung-Min
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.3
    • /
    • pp.202-207
    • /
    • 2016
  • Checkpoint placement is an effective fault tolerance technique against transient faults in which the task is re-executed from the latest checkpoint when a fault is detected. In this paper, we propose a new checkpoint placement strategy separating data saving and fault detection processes that are performed together in conventional checkpoints. Several fault detection processes are performed in one checkpoint interval in order to decrease the latency between the occurrence and detection of faults. We address the placement method of fault detection processes to maximize the probability of successful execution of a task within the given deadline. We develop the Markov chain model for a real-time task having the proposed checkpoints, and derive the optimal fault detection and checkpoint interval.

Energy-Efficient Resource Allocation for Application Including Dependent Tasks in Mobile Edge Computing

  • Li, Yang;Xu, Gaochao;Ge, Jiaqi;Liu, Peng;Fu, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2422-2443
    • /
    • 2020
  • This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

PMIP-based Distributed Mobility Management for Tactical Network (전술 기동망의 이동성 지원을 위한 PMIP기반 분산 이동성 관리 적용방안)

  • Sun, Kyoungjae;Kim, Younghan;Noh, Hongjun;Park, Hyungwon;Han, Myounghun;Kwon, Daehoon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.22 no.5
    • /
    • pp.654-666
    • /
    • 2019
  • The tactical network has several different characteristics compared with commercial internet network such as hierarchical topology, dynamic topology changing and wireless link based connectivity. For considering IP mobility management in the tactical network, current mobility management using Mobile IP(MIP) is not suitable with some reasons such as non-optimal routing paths and single point of failure. Proxy Mobile IP(PMIP) which supporting network-based mobility in hierarchical manner can provide optimal routing path in the tactical network environment, but centralized anchor is still remained a threat to the stability of the tactical network which changes its topology dynamically. In this paper, we propose PMIP-based distributed mobility management for the tactical network environment. From our design, routing paths are always configured in optimized way, as well as path is recovered quickly when the mobility anchor of user is failed. From numerical analysis, comparing to other mobility scheme, result shows that the proposed scheme can reduce packet transmission cost and latency in tactical network model.

Partial Offloading System of Multi-branch Structures in Fog/Edge Computing Environment (FEC 환경에서 다중 분기구조의 부분 오프로딩 시스템)

  • Lee, YonSik;Ding, Wei;Nam, KwangWoo;Jang, MinSeok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.10
    • /
    • pp.1551-1558
    • /
    • 2022
  • We propose a two-tier cooperative computing system comprised of a mobile device and an edge server for partial offloading of multi-branch structures in Fog/Edge Computing environments in this paper. The proposed system includes an algorithm for splitting up application service processing by using reconstructive linearization techniques for multi-branch structures, as well as an optimal collaboration algorithm based on partial offloading between mobile device and edge server. Furthermore, we formulate computation offloading and CNN layer scheduling as latency minimization problems and simulate the effectiveness of the proposed system. As a result of the experiment, the proposed algorithm is suitable for both DAG and chain topology, adapts well to different network conditions, and provides efficient task processing strategies and processing time when compared to local or edge-only executions. Furthermore, the proposed system can be used to conduct research on the optimization of the model for the optimal execution of application services on mobile devices and the efficient distribution of edge resource workloads.

An Efficient Parallel Algorithm for Merging in the Postal Model

  • Park, Hae-Kyeong;Chi, Dong-Hae;Lee, Dong-Kyoo;Ryu, Kwan-Woo
    • ETRI Journal
    • /
    • v.21 no.2
    • /
    • pp.31-39
    • /
    • 1999
  • Given two sorted lists A=(a0, a1, ${\cdots}$,a${\ell}$-1}) and B=(b0, b1, ${\cdots}$, bm-1), we are to merge these two lists into a sorted list C=(c0,c1, ${\cdots}$, cn-1), where n=${\ell}$+m. Since this is a fundamental problem useful to solve many problems such as sorting and graph problems, there have been many efficient parallel algorithms for this problem. But these algorithms cannot be performed efficiently in the postal model since the communication latency ${\lambda}$, which is of prime importance in this model, is not needed to be considered for those algorithms. Hence, in this paper we propose an efficient merge algorithm in this model that runs in $$2{\lambda}{\frac{{\log}n}{{\log}({\lambda}+1)}}+{\lambda}-1$$ time by using a new property of the bitonic sequence which is crucial to our algorithm. We also show that our algorithm is near-optimal by proving that the lower bound of this problem in the postal model is $f_{\lambda}({\frac{n}{2}})$, where $${\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}{\le}f_{\lambda}({\frac{n}{2}}){\le}2{\lambda}+2{\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}}$$.

  • PDF

Development of Electrical Stimulator for Auditory Stimulation (청각 자극용 전기자극기 개발)

  • Heo, Seung-Deok;Jung, Dong-Keun;Kim, Lee-Suk;Kim, Gwang-Nyeon;Kang, Myung-Koo;Kim, Jae-Ryong;Kim, Gi-Ryon
    • Speech Sciences
    • /
    • v.11 no.3
    • /
    • pp.201-211
    • /
    • 2004
  • This paper introduces a development of an electrical stimulator for auditory stimulation. The electrical stimulator is useful in neurotological diagnosis, audiological evaluation, candidate selection for cochlear implantation, optimal device selection and decision making of MAP strategy for severe-to-profound hearing impaired persons. The development was based on sound parameters of auditory brainstem responses and auditory electrophysiological characteristic such as effective firing of auditory nerve and recording evoked potentials during refractory period of neuron. Besides pulse parameter could adjustable by programming for more varied electrical stimulation evoked response audiometry. Using the electrical stimulator, electrical square pulse was applied to promontory, and electrically evoked auditory brainstem response and electrically middle latency response were successfully recorded in cats.

  • PDF

An Asynchronous Burst Time Plan Generation Method for Broadband Satellite Multimedia System

  • Feng, Shaodong;Wang, Fan;Lin, Yuan;Gou, Liang;Li, Guangxia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.2
    • /
    • pp.386-404
    • /
    • 2013
  • In broadband satellite multimedia (BSM) system, burst time plan (BTP) is always periodically generated. We find that this method can have a great effect on the system response ability to bandwidth requests. A general analysis model of BTP generation method is given. An optimized BTP generation (O-BTPG) method is presented by deducing the optimal bandwidth allocation period (BAP) and bandwidth allocation latency (BAL) without considering the signaling overhead caused by BTP. Then a novel asynchronous BTP generation (A-BTPG) method in which the BTP is generated asynchronously according to the traffic load from users' bandwidth requests is proposed. Simulation results show that A-BTPG can flexibly realize a trade-off between the system response ability and BTP signaling overhead. What's more, it can be widely used in various regenerative onboard switching BSM systems.