• Title/Summary/Keyword: Delay Guarantee

Search Result 360, Processing Time 0.025 seconds

QoS controlled handoff by SNMP information-based routing in active network (액티브 네트워크에서 SNMP 정보기반 라우팅을 이용한 핸드오프 QoS 향상 기법)

  • Jang, Hani;Park, Soo-Hyun;Baik, Doo-Kwon
    • The KIPS Transactions:PartC
    • /
    • v.9C no.6
    • /
    • pp.883-892
    • /
    • 2002
  • Mobile IP has been designed only to maintain communications as they move from place to place, so it doesn't guarantee Quality of Service (QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile environment, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-based routing. After modeling of suggested method and existing handoff method, simulations are carried out with NS -2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

Propagation Delay Modeling and Implementation of DGPS beacon signal over the Spherical Earth

  • Yu, Dong-Hui;Weon, Sung-Hyun
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.4
    • /
    • pp.295-299
    • /
    • 2007
  • This paper presents the ASF(Additional Secondary Factor) modeling of DGPS beacon signal. In addition to DGPS's original purpose, the feasibility to utilize DGPS system for timing and navigation has been studied. For timing and navigation, the positioning system must know the accurate time delay of signal traveling from the transmitter to receiver. Then the delay can be used to compute the user position. The DGPS beacon signal transmits the data using medium frequency, which travels through the surface and cause the additional delay rather than the speed of light according to conductivities and elevations of the irregular terrain. We introduce the modeling of additional delay(ASF) and present the results of implementation. The similar approach is Locan-C. Loran-C has been widely used as the maritime location system and was enhanced to E-Loran(Enhanced Loran). E-Loran system uses the ASF estimation method and is able to provide the more precise location service. However there was rarely research on this area in Korea. Hence, we introduce the ASF and its estimation model. With the comparison of the same condition and data from the original Monteath model and ASF estimation data of Loran system respectively, we guarantee that the implementation is absolutely perfect. For further works, we're going to apply the ASF estimation model to Korean DGPS beacon system with the Korean terrain data.

Analysis of Delay Distribution and Rate Control over Burst-Error Wireless Channels

  • Lee, Joon-Goo;Lee, Hyung-Keuk;Lee, Sang-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5A
    • /
    • pp.355-362
    • /
    • 2009
  • In real-time communication services, delay constraints are among the most important QoS (Quality of Service) factors. In particular, it is difficult to guarantee the delay requirement over wireless channels, since they exhibit dynamic time-varying behavior and even severe burst-errors during periods of deep fading. Channel throughput may be increased, but at the cost of the additional delays when ARQ (Automatic Repeat Request) schemes are used. For real-time communication services, it is very essential to predict data deliverability. This paper derives the delay distribution and the successful delivery probability within a given delay budget using a priori channel model and a posteriori information from the perspective of queueing theory. The Gilbert-Elliot burst-noise channel is employed as an a Priori channel model, where a two-state Markov-modulated Bernoulli process $(MMBP_2)$ is used. for a posteriori information, the channel parameters, the queue-length and the initial channel state are assumed to be given. The numerical derivation is verified and analyzed via Monte Carlo simulations. This numerical derivation is then applied to a rate control scheme for real-time video transmission, where an optimal encoding rate is determined based on the future channel capacity and the distortion of the reconstructed pictures.

Performance Analysis of Coordinated Cognitive Radio Networks under Fixed-Rate Traffic with Hard Delay Constraints

  • Castellanos-Lopez, S. Lirio;Cruz-Perez, Felipe A.;Rivero-Angeles, Mario E.;Hernandez-Valdez, Genaro
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.130-139
    • /
    • 2014
  • Due to the unpredictable nature of channel availability, carrying delay-sensitive traffic in cognitive radio networks (CRNs) is very challenging. Spectrum leasing of radio resources has been proposed in the so called coordinated CRNs to improve the quality of service (QoS) experienced by secondary users (SUs). In this paper, the performance of coordinated CRNs under fixed-rate with hard-delay-constraints traffic is analyzed. For the adequate and fair performance comparison, call admission control strategies with fractional channel reservation to prioritize ongoing secondary calls over new ones are considered. Maximum Erlang capacity is obtained by optimizing the number of reserved channels. Numerical results reveal that system performance strongly depends on the value of the mean secondary service time relative to the mean primary service time. Additionally, numerical results show that, in CRNs without spectrum leasing, there exists a critical utilization factor of the primary resources from which it is not longer possible to guarantee the required QoS of SUs and, therefore, services with hard delay constraints cannot be even supported in CRNs. Thus, spectrum leasing can be essential for CRN operators to provide the QoS demanded by fixed-rate applications with hard delay constraints. Finally, the cost per capacity Erlang as function of both the utilization factor of the primary resources and the maximum allowed number of simultaneously rented channels is evaluated.

Reinforcement Learning Approach for Resource Allocation in Cloud Computing (클라우드 컴퓨팅 환경에서 강화학습기반 자원할당 기법)

  • Choi, Yeongho;Lim, Yujin;Park, Jaesung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.4
    • /
    • pp.653-658
    • /
    • 2015
  • Cloud service is one of major challenges in IT industries. In cloud environment, service providers predict dynamic user demands and provision resources to guarantee the QoS to cloud users. The conventional prediction models guarantee the QoS to cloud user, but don't guarantee profit of service providers. In this paper, we propose a new resource allocation mechanism using Q-learning algorithm to provide the QoS to cloud user and guarantee profit of service providers. To evaluate the performance of our mechanism, we compare the total expense and the VM provisioning delay with the conventional techniques with real data.

Bandwidth Allocation Under Multi-Level Service Guarantees of Downlink in the VLC-OFDM System

  • Liu, Shuangxing;Chi, Xuefen;Zhao, Linlin
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.6
    • /
    • pp.704-715
    • /
    • 2016
  • In this paper, we explore a low-complex bandwidth allocation (BA) scheme with multi-level service guarantees in VLC-OFDM systems. Effective capacity theory, which evaluates wireless channel capacity from a novel view, is utilized to model the system capacity under delay QoS constraints of the link layer. Since intensity modulation of light is used in the system, problems caused by frequency selectivity can be neglected. Then, the BA problem can be formulated as an integer programming problem and it is further relaxed and transformed into a concave one. Lagrangian formulation is used to reformulate the concave problem. Considering the inefficiency of traditional gradient-based schemes and the demand for distributed implementation in local area networks, we localize the global parameters and propose a quasi-distributed quadratic allocation algorithm to provide two-level service guarantees, the first level is QoS oriented, and the second level is QoE oriented. Simulations have shown the efficient performance of the proposed algorithm. The users with more stringent QoS requirements require more subcarriers to guarantee their statistical delay QoS requirements. We also analyze the effect of subcarrier granularity on the aggregate effective capacity via simulations.

H Filtering for a Class of Nonlinear Systems with Interval Time-varying Delay (구간시변 지연을 가지는 비선형시스템의 H 필터링)

  • Lee, Sangmoon;Liu, Yajuan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.63 no.4
    • /
    • pp.502-508
    • /
    • 2014
  • In this paper, a delay-dependent $H_{\infty}$ filtering problem is investigated for discrete-time delayed nonlinear systems which include a more general sector nonlinear function instead of employing the commonly used Lipschitz-type function. By using the Lyapunov-Krasovskii functional approach, a less conservative sufficient condition is established for the existence of the desired filter, and then, the corresponding solvability condition guarantee the stability of the filter with a prescribed $H_{\infty}$ performance level. Finally, two simulation examples are given to show the effectiveness of the proposed filtering scheme.

Robust Stability of Uncertain Linear Large-scale Systems with Time-delay via LMI Approach (LMI 기법을 이용한 시간지연 대규모 불확정성 선형 시스템의 강인 안정성)

  • Lee, Hee-Song;Kim, Jin-Hoon
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.10
    • /
    • pp.1287-1292
    • /
    • 1999
  • In large-scale systems, we frequently encounter the time-delay and the uncertainty, and these should be considered in the design of controller because these are the source of the degradation of the system performance and instability of system. In this paper, we consider the robust stability of the linear large scale systems with the uncertainties and the time-delays. The considered uncertainties are both structured uncertainty and the unstructured uncertainty. Also, the considered time-delays are time-varying having finite time derivative limits. Based on the Lyapunov theorem and the linear matrix inequality(LMI) technique, we present two sufficient conditions that guarantee the robust stability of the system. The conditions are expressed as the LMI forms which can be easily checked their feasibility by using the well-known LMI control toolbox. Finally, we show by two examples that our results are less conservative than the previous results.

  • PDF

Design of a Synchronous Control Unit for a Datapath with Variable Delay Arithmetic Units (가변지연시간 연산기를 가진 데이터 경로에 대한 동기식 제어기의 설계)

  • 김의석;이정근;이동익
    • Proceedings of the IEEK Conference
    • /
    • 2002.06b
    • /
    • pp.321-324
    • /
    • 2002
  • Nowadays variable delay arithmetic units have been used for implementing a datapath of\ulcorner target system in pursuit of performance improvement. However. adoption of variable delay arithmetic units requires modification of a typical synchronous control units design methodology. There is a representative approach, which is called a monolithic approach. Although its results are good, its proposed methodology may cause critical problems in the aspects of area and performance with the size increase of initial system specifications. In order to solve this problems, a distributed approach is suggested. Experimental results show that the Proposed method can guarantee original performance of an initial system specification with minimized additional area increase.

  • PDF