• Title/Summary/Keyword: Loss Probability

Search Result 636, Processing Time 0.029 seconds

Performance Analysis of Group Scheduling with Look-Ahead Algorithm for Optical Burst Switching Networks (광 버스트 스위칭 네트워크에서 Look-Ahead 알고리즘을 적용한 그룰 스케줄링의 성능 분석)

  • Shin, Jong-Dug;Jang, Won-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12B
    • /
    • pp.1037-1043
    • /
    • 2006
  • There has been proposed an algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks. Since, in this algorithm, look-up tables containing all the void time information in scheduling windows are generated as soon as the primary group scheduling session terminates, it becomes faster to reassign dropped data bursts to proper voids in different data channels by referring to the tables. The group scheduling with this algorithm showed almost the same channel utilization as the one without using the algorithm but performed a little better in both burst loss probability and wavelength conversion rate. On the other hand, per-burst processing time has been reduced dramatically in the load region of higher than 0.8, showing a factor of 2.1 reduction at 0.9.

A Same-Priority Collision-Avoidance Algorithm Using RTS/CTS Frame in IEEE 802.11e EDCA under Network Congested Condition (IEEE 802.11e EDCA 네트워크 혼잡 환경에서 RTS/CTS 프레임을 이용한 동일 우선순위 충돌 회피 알고리즘)

  • Kwon, YongHo;Rhee, Byung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.5
    • /
    • pp.425-432
    • /
    • 2014
  • The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.

A Cooperative ARQ strategy in Ad hoc Cognitive Relays for Mobile Multimedia Communication (이동 멀티미디어 통신을 위한 Ad-hoc Cognitive Relay의 Cooperative ARQ 재전송 기법)

  • An, Mi-Eun;Kang, Hae-Lynn;Kim, Nak-Myeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.3
    • /
    • pp.28-35
    • /
    • 2011
  • Cooperative ARQ scheme is effective for better QoS guarantee for the next generation mobile communication systems where multimedia data transmission highly increases. In this paper, we propose a cooperative ARQ strategy in ad hoc cognitive relays for mobile multimedia communication for supporting instantaneous cooperation in MANET environment. In the proposed strategy, to support real time, delay-sensitive services, whenever a frame is transmitted from the source, each relay actively senses the SINR of the signal transmitted from the source, and determine whether to propose retransmission or not before the destination transmits feedback signal. To minimize the false retransmission decision or needless retransmission, we propose an adaptive sensing threshold optimization algorithm to maintain suboptimal sensing thresholds for each relay. By computer simulation, it is shown that the proposed cooperative ARQ retransmission scheme outperforms the conventional schemes with respect to frame transmission delay and frame loss probability in real time multimedia data transmission system.

Assessment of Fragility Curve for Earthquake in Railway Bridge (기존 철도교량의 지진에 대한 취약도 곡선 산정)

  • Kim, Dae-Ho;Sun, Chang-Ho;Kim, Ick-Hyun
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2008.11a
    • /
    • pp.101-104
    • /
    • 2008
  • Recently, the serious damage by earthquakes is increased around the world. SOC fo city is established to minimize the loss of lives and assets by earthquakes, which an objective standard is required. Generally, bridges damage by earthquakes occurred the inelastic hinge under the column. Nonlinear element model of inelastic hinge have been used to Bilinear model, but Takeda model for material characterization of concrete is a little. In this study, railway bridge was performed seismic fragility analysis for Takeda model and Bilinear model comparatively. This analysis shows that damage probability of Takeda model is larger than Bilinear model. And analysis of Takeda model in longitudinal direction and transverse direction are different. Therefore developed analysis for concrete column of bridge is expected to apply to material characterization.

  • PDF

Statistical Analysis for Path Break-Up Time of Mobile Wireless Networks (이동 무선망의 경로 붕괴시간에 대한 통계적 분석)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.113-118
    • /
    • 2015
  • Mobile wireless networks have received a lot of attention as a future wireless network due to its rapid deployment without communication infrastructure. In these networks communication path between two arbitrary nodes break down because some links in the path are beyond transmission range($r_0$) due to the mobility of the nodes. The set of total path break down time(${\bigcup}T_i$), which is the union of path break down time of every node pair, can be a good measure of the connectivity of the dynamic mobile wireless network. In this paper we show that the distribution of the total path break down time can be approximated as a exponential probability density function and confirms it through experimental data. Statistical knowledge of break down time enables quantitative prediction of delay, packet loss between two nodes, thus provides confidence in the simulation results of mobile wireless networks.

A Performance Analysis of the MAC Protocol Considering the Cell Structures and the QOS in Wireless ATM Networks (무선 ATM 망에서 셀 구조 및 QOS를 고려한 매체 접근 제어 프로토콜의 성능 분석)

  • 안계현;박혁규;이동은;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.8A
    • /
    • pp.1195-1207
    • /
    • 1999
  • Wireless channel has high error rate and limited bandwidth. In order to guarantee the quality of service for multimedia through wireless channel, wireless ATM network requires the cell structure with error control schemes and an efficient medium access control protocol. In this paprt, an efficient medium access control protocol, which is considered of cell structure and the QOS, is proposed for wireless ATM networks. Many kinds of ATM cell structures are analyzed in terms of cell error rate and cell loss rate to choose the proper cell structures for this proposed MAC protocol. And a bandwidth allocation algorithm is also designed to satisfy the priority of services. The performance of proposed MAC protocol are evaluated in terms of channel utilization, call blocking and packet discard probability accotding to different kinds of cell structure through simulation.

  • PDF

Satellite Mobility Pattern Scheme for Centrical and Seamless Handover Management in LEO Satellite Networks

  • Tuysuz, Aysegul;Alagoz, Fatih
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.451-460
    • /
    • 2006
  • Since low earth orbit (LEO) satellite constellations have important advantages over geosynchronous earth orbit (GEO) systems such as low propagation delay, low power requirements, and more efficient spectrum allocation due to frequency reuse between satellites and spotbeams, they are considered to be used to complement the existing terrestrial fixed and wireless networks in the evolving global mobile network. However, one of the major problems with LEO satellites is their higher speed relative to the terrestrial mobile terminals, which move at lower speeds but at more random directions. Therefore, handover management in LEO satellite networks becomes a very challenging task for supporting global mobile communication. Efficient and accurate methods are needed for LEO satellite handovers between the moving footprints. In this paper, we propose a new seamless handover management scheme for LEO satellites (SeaHO-LEO), which utilizes the handover management schemes aiming at decreasing latency, data loss, and handover blocking probability. We also present another interesting handover management model called satellite mobility pattern based handover management in LEO satellites (PatHO-LEO) which takes mobility pattern of both satellites and mobile terminals into account to minimize the handover messaging traffic. This is achieved by the newly introduced billboard manager which is used for location updates of mobile users and satellites. The billboard manager makes the proposed handover model much more flexible and easier than the current solutions, since it is a central server and supports the management of the whole system. To show the performance of the proposed algorithms, we run an extensive set of simulations both for the proposed algorithms and well known handover management methods as a baseline model. The simulation results show that the proposed algorithms are very promising for seamless handover in LEO satellites.

Efficient Resource Allocation to Support QoS in a Fixed Relay Based Cellular System (고정 릴레이 기반 셀룰러 시스템에서 QoS를 보장하기 위한 효율적인 자원 할당)

  • Kim, Geun-Bae;Shin, Hee-Young;Park, Sang-Kyu
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.10
    • /
    • pp.1128-1135
    • /
    • 2010
  • The relay based cellular system has been introduced to provide the service to satisfy the user requirement. The main reasons of using relay station are to expand a service coverage and to increase a system throughput with satisfying the service requirement level. This paper proposes a new resource allocation algorithm which supports the users' throughput fairness and service coverage in the Fixed Relay Based Cellular system with OFDMA. The performance of proposed algorithm is compared with the performances of proportional fairness(PF) algorithm. The simulation result shows that the proposed algorithm increases the number of active users in the service coverage while paying small amount of throughput loss.

A new high-order response surface method for structural reliability analysis

  • Li, Hong-Shuang;Lu, Zhen-Zhou;Qiao, Hong-Wei
    • Structural Engineering and Mechanics
    • /
    • v.34 no.6
    • /
    • pp.779-799
    • /
    • 2010
  • In order to consider high-order effects on the actual limit state function, a new response surface method is proposed for structural reliability analysis by the use of high-order approximation concept in this study. Hermite polynomials are used to determine the highest orders of input random variables, and the sampling points for the determination of highest orders are located on Gaussian points of Gauss-Hermite integration. The cross terms between two random variables, only in case that their corresponding percent contributions to the total variation of limit state function are significant, will be added to the response surface function to improve the approximation accuracy. As a result, significant reduction in computational cost is achieved with this strategy. Due to the addition of cross terms, the additional sampling points, laid on two-dimensional Gaussian points off axis on the plane of two significant variables, are required to determine the coefficients of the approximated limit state function. All available sampling points are employed to construct the final response surface function. Then, Monte Carlo Simulation is carried out on the final approximation response surface function to estimate the failure probability. Due to the use of high order polynomial, the proposed method is more accurate than the traditional second-order or linear response surface method. It also provides much more efficient solutions than the available high-order response surface method with less loss in accuracy. The efficiency and the accuracy of the proposed method compared with those of various response surface methods available are illustrated by five numerical examples.

Mobility Management Scheme based on User Mobility QoS and Security-Effective Network in Heterogeneous Mobile Networks (이종의 모바일 네트워크에서 사용자 이동성 QoS와 보안효과적인 네트워크 기반의 이동성관리 기법)

  • Lee, Hyeungwoo;Jeong, Jongpil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.2
    • /
    • pp.87-97
    • /
    • 2015
  • To support the efficient mobility MIPv6v, FMIPv6, HMIPv6 and host-based mobility management protocols have been developed. AAAC (Authentication, Authorization, Accounting and Charging) system is applied in this paper analyzed the the existing IPv6 PMIPv6, FPMIPv6 network security effective and IPv6 MMP (Mobile Management Protocol) Features and performance analysis is performed. And IPv6 MMP seamless transfer performance in terms of packet loss probability, will be analyzed. That can be efficiently used as a method for the integration of QoS and mobility so that you can manage and control the resources presented QoSB usage. Results of evaluation results showed a better overall fast handover structure of mobility management techniques. PMIPv6 and FPMIPv6 in many respects the most efficient structure that can be specifically, a fast handover of the structure of the network-based mobility management scheme showed the best results.