• Title/Summary/Keyword: Link recovery

Search Result 162, Processing Time 0.025 seconds

Performance Issues with General Packet Radio Service

  • Chakravorty, Rajiv;Pratt, Ian
    • Journal of Communications and Networks
    • /
    • v.4 no.4
    • /
    • pp.266-281
    • /
    • 2002
  • The General Packet Radio Service (GPRS) is being deployed by GSM network operators world-wide, and promises to provide users with “always-on” data access at bandwidths comparable to that of conventional fixed-wire telephone modems. However, many users have found the reality to be rather different, experiencing very disappointing performance when, for example, browsing the web over GPRS. In this paper, we examine the causes, and show how unfortunate interactions between the GPRS link characteristics and TCP/IP protocols lead to poor performance. A performance characterization of the GPRS link-layer is presented, determined through extensive measurements taken over production networks. We present measurements of packet loss rates, bandwidth availability, link stability, and round-trip time. The effect these characteristics have on TCP behavior are examined, demonstrating how they can result in poor link utilization, excessive packet queueing, and slow recovery from packet losses. Further, we show that the HTTP protocol can compound these issues, leading to dire WWW performance. We go on to show how the use of a transparent proxy interposed near the wired-wireless border can be used to alleviate many of these performance issues without requiring changes to either client or server end systems.

A Study on the High Performance TCP over Various Communication Links (다양한 통신 링크에서 고성능 TCP에 관한 연구)

  • Kim, Sang-Mi;Choe, Seon-Wan;Han, Seon-Yeong
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.197-212
    • /
    • 2002
  • Transmission Control Protocol (TCP) [1] has been tuned as a reliable transfer protocol for traditional networks comprising wired links and stationary hosts with same link characteristics. TCP assumes that congestion in the network be a primary cause for packet losses and unusual delays. TCP performs welt over such networks adapting to end-to-end delays and congestion losses, by standard congestion control mechanisms, such as slow-start, congestion avoidance, fast retransmit and recovery. However, networks with wireless and other lossy links suffer from significant losses due to bit errors and handoffs. An asymmetry network such as ADSL has different bandwidth for both directions. As a result, TCP's standard mechanisms incur end-to-end performance degradation in various links. In this paper, we analyze the TCP problems in wireless, satellite, and asymmetry links, and measure the new TCP mechanisms that are recommended by IETF Performance Implications of Link Characteristics (PILC) WG[2], by using Network Simulator 2 (NS-2).

Fault Management in Multichannel ATM Switches (다중 채널 ATM 스위치에서의 장애 관리)

  • 오민석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8A
    • /
    • pp.569-580
    • /
    • 2003
  • One of the important advantages of multichannel switches is the incorporation of inherent fault tolerance into the switching fabric. For example, if a link which belongs to the multichannel group fails, the remaining links can assume responsibility for some of the traffic on the failed link. On the other hand, if faults occur in the switching elements, it can lead to erroneous routing and sequencing in the multichannel switch. We investigate several fault localization algorithms in multichannel crossbar ATM switches with a view to early fault recovery, The optimal algorithm gives the best performance in terms of time to localization but is computationally complex which makes it difficult to implement. We develop an on-line algorithm which is computationally mote efficient than the optimal algorithm. We evaluate its performance through simulation. The simulation results show that performance of the on line algorithm is only slightly sub-optimal for both random and bursty traffic. Finally a fault recovery algorithm is described which utilizes the information provided by the fault localization algorithm.

Performance Improvement Methods of Multicast using FEC and Local Recovery based on Sever in Mobile Host (이동 호스트에서 FEC와 서버기반 지역복구를 이용한 멀티캐스트 성능 향상 방안)

  • Kim, Hoe-Ok;Yang, Hwan-Seok;Lee, Ung-Gi
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.589-596
    • /
    • 2002
  • Tn the data transmission service of the mobile host, it is needed to reduce the bandwidth and to make a reliable error recovery. there are two appropriate methods in that. One is FEC which retransmits the parity of error recovery, in case of happening of the loss after forming the parity of error recovery by grouping original data. The other is local recovery based on server which can block the implosion of transmission. The use of FEC and local recovery based on server at the same time enables the reliable multicast. This paper suggests algorithm that recovers the loss by FEC and local recovery based on server through the solution of the problems about triangle routing, tunnel convergence by dividing mobile host into two parts-the sender and the receiver. This model about the loss of algorithm tested the efficiency of performance by the homogeneous independent loss, the heterogeneous independent loss, the shared source link loss model. The suggested algorithm confirms effectiveness in the environment where there are much data and many receivers in mobile host.

Scalability Analysis of MANET IPv6 Address Auto-configuration Protocols based on Link Error Modeling (링크 에러 모델링을 이용한 MANET 환경에서의 IPv6 자동주소 설정 방식의 확장성 분석)

  • Kim, Sang-Chul
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.282-291
    • /
    • 2008
  • This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

Analysis of Link Error Effects in MANET Address Autoconfiguration Protocols

  • Kim, Sang-Chul;Chung, Jong-Moon
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.84-93
    • /
    • 2009
  • This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

A Study on Service Recovery QoS Rerouting Algorithm Based on PFC (PFC 기반의 서비스 복구 QoS 재라우팅 알고리즘에 관한 연구)

  • Han, Jeong-Soo;Chung, Jin-Wook
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.655-664
    • /
    • 2002
  • The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. However upon failure of a node or link on the path, a new path (backup path) satisfying the constraints has to be established. This paper proposed the fault recovery QoS Rerouting algorithms to recovery the service of applications under fault environment of network. For this, we describes the generation method of PFC (Protection Fundamental Cycle) protecting all of network nodes and suggests path selection algorithms using minimization rerouting cost problem and analyzes the performances of these.

A Sensing Radius Intersection Based Coverage Hole Recovery Method in Wireless Sensor Network (센서 네트워크에서 센싱 반경 교차점 기반 홀 복구 기법)

  • Wu, Mary
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.3
    • /
    • pp.431-439
    • /
    • 2021
  • Since the sensor nodes are randomly arranged in the region of interest, it may happen that the sensor network area is separated or there is no sensor node in some area. In addition, after the sensor nodes are deployed in the sensor network, a coverage hole may occur due to the exhaustion of energy or physical destruction of the sensor nodes. The coverage hole can greatly affect the overall performance of the sensor network, such as reducing the data reliability of the sensor network, changing the network topology, disconnecting the data link, and worsening the transmission load. Therefore, sensor network coverage hole recovery has been studied. Existing coverage hole recovery studies present very complex geometric methods and procedures in the two-step process of finding a coverage hole and recovering a coverage hole. This study proposes a method for discovering and recovering a coverage hole in a sensor network, discovering that the sensor node is a boundary node by itself, and determining the location of a mobile node to be added. The proposed method is expected to have better efficiency in terms of complexity and message transmission compared to previous methods.

Performance of Position Based Fast Fault Recovery Protocol for Industrial Bridged Ring Networks (산업용 브리지 망을 위한 위치 기반의 신속한 망 장애 복구 절차의 성능분석)

  • Seo, Ju Sang;Yoon, Chong Ho;Park, Hong Soon;Kim, Jin Uk
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.6 no.3
    • /
    • pp.259-269
    • /
    • 2020
  • With the proposal-agreement procedure, RSTP can reduce the network recovery time to 400 ms or less in the case of 40 bridges. While the legacy RSTP reverts the previous agreement at the bridge with the alternate port role in the ring during the fault recovery, a new position based fast fault recovery procedure is proposed in this paper to guarantee a single proposal-agreement transaction which can provide more faster recovery. By knowing the relative position of the faulty link or bridge in hops, the bridge on the middle of the ring can complete the recovery procedure without revert. The performance of proposed procedure is numerically calculated and verified by simulation and the result shows that the recovery time can be reduced up to 100 ms, which is 1/4 times of the legacy RSTP.

A 60GHz Wireless Cooperative Communication System Based on Switching Beamforming

  • Shi, Wei;Wang, Jingjing;Liu, Yun;Niu, Qiuna;Zhang, Hao;Wu, Chunlei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1590-1610
    • /
    • 2016
  • The challenge of penetrating obstacles along with impact from weak multipath effects makes 60GHz signal very difficult to be transmitted in non-line of sight (NLOS) channel. So 60GHz system is vulnerable to obstructions and thus likely results in link interruption. While the application of cooperative technology to solve link blockage problemin 60GHz system should consider the characteristic of directional transmission for 60GHz signal. Therefore in this paper a system is proposed to solve the link blockage problem in 60GHz NLOS communication environment based on the concept of cooperation and also the beamforming technology, which is the basis of directional transmission for 60GHz communication system. The process of anti-blockage solution with cooperative communication is presented in detail, and the fast switching and recovery schemes are well designed. The theoretical values of symbol error rate (SER) using decode and forward (DF) cooperation and amplify and forward (AF) cooperation are presented respectively when the common channel interference exists. Simulation results demonstrate that the performance based on DF cooperation is better than the performance based on AF cooperation when directional transmission is used.