• Title/Summary/Keyword: Exponential Scheme

Search Result 156, Processing Time 0.03 seconds

Efficient Logical Topology Design Considering Multiperiod Traffic in IP-over-WDM Networks

  • Li, Bingbing;Kim, Young-Chon
    • Journal of the Optical Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.13-21
    • /
    • 2015
  • In recent years energy consumption has become a main concern for network development, due to the exponential increase of network traffic. Potential energy savings can be obtained from a load-adaptive scheme, in which a day can be divided into multiple time periods according to the variation of daily traffic patterns. The energy consumption of the network can be reduced by selectively turning off network components during the time periods with light traffic. However, the time segmentation of daily traffic patterns affects the energy savings when designing multiperiod logical topology in optical wavelength routed networks. In addition, turning network components on or off may increase the overhead of logical topology reconfiguration (LTR). In this paper, we propose two mixed integer linear programming (MILP) models to design the optimal logical topology for multiple periods in IP-over-WDM networks. First, we formulate the time-segmentation problem as an MILP model to optimally determine the boundaries for each period, with the objective to minimize total network energy consumption. Second, another MILP formulation is proposed to minimize both the overall power consumption (PC) and the reconfiguration overhead (RO). The proposed models are evaluated and compared to conventional schemes, in view of PC and RO, through case studies.

Handover Authentication Protocol in VANET Supporting the Fast Mobility (빠른 이동성을 지원하는 VANET 환경의 핸드오버 인증 프로토콜)

  • Choi, Jae-Duck;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.5
    • /
    • pp.30-39
    • /
    • 2008
  • This paper proposes a secure and efficient handover authentication protocol in VANET supporting fast mobility. Although the existing schemes commonly use the hash function or XOR operation to be suitable for a light-weight mobile, it does not support the security feature such as PBS. To solve this security problem, another protocol utilizing the CGA technology is proposed but it is vulnerable to the DoS attack due to a number of exponent operations. The proposed protocol using a light-weight Diffie-Hellman provides security features and performs a reduced number of exponential operation at the MN than the existing scheme.

Analysis of generalized progressive hybrid censored competing risks data

  • Lee, Kyeong-Jun;Lee, Jae-Ik;Park, Chan-Keun
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.2
    • /
    • pp.131-137
    • /
    • 2016
  • In reliability analysis, it is quite common for the failure of any individual or item to be attributable to more than one cause. Moreover, observed data are often censored. Recently, progressive hybrid censoring schemes have become quite popular in life-testing problems and reliability analysis. However, a limitation of the progressive hybrid censoring scheme is that it cannot be applied when few failures occur before time T. Therefore, generalized progressive hybrid censoring schemes have been introduced. In this article, we derive the likelihood inference of the unknown parameters under the assumptions that the lifetime distributions of different causes are independent and exponentially distributed. We obtain the maximum likelihood estimators of the unknown parameters in exact forms. Asymptotic confidence intervals are also proposed. Bayes estimates and credible intervals of the unknown parameters are obtained under the assumption of gamma priors on the unknown parameters. Different methods are compared using Monte Carlo simulations. One real data set is analyzed for illustrative purposes.

A Study on CSMA/CA for IEEE 802.11 WLAN Environment

  • Moon Il-Young;Cho Sung-Joon
    • Journal of information and communication convergence engineering
    • /
    • v.4 no.2
    • /
    • pp.71-74
    • /
    • 2006
  • A basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size Also, a time of packet transmission delay increases and efficienty is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (A WGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.

Scheduling of Real-time and Nonreal-time Traffics in IEEE 802.11 Wireless LAN (무선랜에서의 실시간 및 비실시간 트래픽 스케줄링)

  • Lee, Ju-Hee;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.2
    • /
    • pp.75-89
    • /
    • 2003
  • Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

A Reusable Secure Mobile e-Coupon Protocol (다회 사용가능한 안전한 모바일 쿠폰 프로토콜)

  • Yong, Seunglim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.10
    • /
    • pp.81-88
    • /
    • 2013
  • Since nowadays mobile phone messages are flourishing, the application of electronic coupon (e-coupon) will become a trend for mobile users. E-coupon for mobile commerce can provide mobility for users and distribution flexibility for issuers. In this paper, we propose a mobile e-coupon system that just applies some simple cryptographic techniques, such as one-way hash function and XOR operation. In our system, the customer can control the number of issued e-coupons and the issuer can prevent them from double-redeeming. The customer does not need to perform any exponential computation in redeeming and transferring the coupons. Our scheme uses one-way hash chains for preventing from double-spending.

Adaptive Image Coding Technique using HVS in Biorthogonal Wavelet Transform Domain (Biorthogonal 웨이브릿 변환영역에서 HVS를 이용한 적응 영상 부호화 기법)

  • 김응태;김형명
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.10
    • /
    • pp.1469-1482
    • /
    • 1993
  • A new image coding technique has been proposed based on the wavelet transform. To achieve lower ceding rates and good qualities in reconstructed images, some of wavelet coefficients were removed by thresholding and quantized in accordance with the sensitivity of the human visual system(HVS). For each block of subimages in wavelet transform domain, block thresholding scheme has been used to remove the unimportant wavelet coefficients according to the frequency characteristic and statistical property of wavelet coefficients. The location information of quantized blocks and removed blocks were encoded using run-length coder which is effective for the exponential distribution. Quantized coefficients were encoded using variable length coder which matches well to their distribution. Simulation results show that the reconstructed images maintain high quality with the low bit rate, below 1.0 bits per pel.

  • PDF

A Study on CSMA/CA for WLAN Environment

  • Moon Il-Young;Cho Sung-Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.530-533
    • /
    • 2006
  • Recently, a basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size. Also, a time of packet transmission delay increases and efficiency is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (AWGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.

  • PDF

Fast Detection Scheme for Broadband Network Using Traffic Analysis (트래픽 분석에 의한 광대역 네트워크 조기 경보 기법)

  • 권기훈;한영구;정석봉;김세헌;이수형;나중찬
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.4
    • /
    • pp.111-121
    • /
    • 2004
  • With rapid growth of the Internet, network intrusions have greatly increased and damage of attacks has become more serious. Recently some kinds of Internet attacks cause significant damage to overall network performance. Current Intrusion Detection Systems are not capable of performing the real-time detection on the backbone network In this paper, we propose the broadband network intrusion detection system using the exponential smoothing method. We made an experiment with real backbone traffic data for 8 days. The results show that our proposed system detects big jumps of traffic volume well.

SEMICLASSICAL ASYMPTOTICS OF INFINITELY MANY SOLUTIONS FOR THE INFINITE CASE OF A NONLINEAR SCHRÖDINGER EQUATION WITH CRITICAL FREQUENCY

  • Aguas-Barreno, Ariel;Cevallos-Chavez, Jordy;Mayorga-Zambrano, Juan;Medina-Espinosa, Leonardo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.1
    • /
    • pp.241-263
    • /
    • 2022
  • We consider a nonlinear Schrödinger equation with critical frequency, (P𝜀) : 𝜀2∆v(x) - V(x)v(x) + |v(x)|p-1v(x) = 0, x ∈ ℝN, and v(x) → 0 as |x| → +∞, for the infinite case as described by Byeon and Wang. Critical means that 0 ≤ V ∈ C(ℝN) verifies Ƶ = {V = 0} ≠ ∅. Infinite means that Ƶ = {x0} and that, grossly speaking, the potential V decays at an exponential rate as x → x0. For the semiclassical limit, 𝜀 → 0, the infinite case has a characteristic limit problem, (Pinf) : ∆u(x)-P(x)u(x) + |u(x)|p-1u(x) = 0, x ∈ Ω, with u(x) = 0 as x ∈ Ω, where Ω ⊆ ℝN is a smooth bounded strictly star-shaped region related to the potential V. We prove the existence of an infinite number of solutions for both the original and the limit problem via a Ljusternik-Schnirelman scheme for even functionals. Fixed a topological level k we show that vk,𝜀, a solution of (P𝜀), subconverges, up to a scaling, to a corresponding solution of (Pinf ), and that vk,𝜀 exponentially decays out of Ω. Finally, uniform estimates on ∂Ω for scaled solutions of (P𝜀) are obtained.