• Title/Summary/Keyword: Timeout

Search Result 85, Processing Time 0.021 seconds

Interaction Between TCP and MAC-layer to Improve TCP Flow Performance over WLANs (유무선랜 환경에서 TCP Flow의 성능향상을 위한 MAC 계층과 TCP 계층의 연동기법)

  • Kim, Jae-Hoon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.2
    • /
    • pp.99-111
    • /
    • 2008
  • In recent years, the needs for WLANs(Wireless Local Area Networks) technology which can access to Internet anywhere have been dramatically increased particularly in SOHO(Small Office Home Office) and Hot Spot. However, unlike wired networks, there are some unique characteristics of wireless networks. These characteristics include the burst packet losses due to unreliable wireless channel. Note that burst packet losses, which occur when the distance between the wireless station and the AP(Access Point) increase or when obstacles move temporarily between the station and AP, are very frequent in 802.11 networks. Conversely, due to burst packet losses, the performance of 802.11 networks are not always as sufficient as the current application require, particularly when they use TCP at the transport layer. The high packet loss rate over wireless links can trigger unnecessary execution of TCP congestion control algorithm, resulting in performance degradation. In order to overcome the limitations of WLANs environment, MAC-layer LDA(Loss Differentiation Algorithm)has been proposed. MAC-layer LDA prevents TCP's timeout by increasing CRD(Consecutive Retry Duration) higher than burst packet loss duration. However, in the wireless channel with high packet loss rate, MAC-layer LDA does not work well because of two reason: (a) If the CRD is lower than burst packet loss duration due to the limited increase of retry limit, end-to-end performance is degraded. (b) energy of mobile device and bandwidth utilization in the wireless link are wasted unnecessarily by Reducing the drainage speed of the network buffer due to the increase of CRD. In this paper, we propose a new retransmission module based on Cross-layer approach, called BLD(Burst Loss Detection) module, to solve the limitation of previous link layer retransmission schemes. BLD module's algorithm is retransmission mechanism at IEEE 802.11 networks and performs retransmission based on the interaction between retransmission mechanisms of the MAC layer and TCP. From the simulation by using ns-2(Network Simulator), we could see more improved TCP throughput and energy efficiency with the proposed scheme than previous mechanisms.

DOVE : A Distributed Object System for Virtual Computing Environment (DOVE : 가상 계산 환경을 위한 분산 객체 시스템)

  • Kim, Hyeong-Do;Woo, Young-Je;Ryu, So-Hyun;Jeong, Chang-Sung
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.120-134
    • /
    • 2000
  • In this paper we present a Distributed Object oriented Virtual computing Environment, called DOVE which consists of autonomous distributed objects interacting with one another via method invocations based on a distributed object model. DOVE appears to a user logically as a single virtual computer for a set of heterogeneous hosts connected by a network as if objects in remote site reside in one virtual computer. By supporting efficient parallelism, heterogeneity, group communication, single global name service and fault-tolerance, it provides a transparent and easy-to-use programming environment for parallel applications. Efficient parallelism is supported by diverse remote method invocation, multiple method invocation for object group, multi-threaded architecture and synchronization schemes. Heterogeneity is achieved by automatic data arshalling and unmarshalling, and an easy-to-use and transparent programming environment is provided by stub and skeleton objects generated by DOVE IDL compiler, object life control and naming service of object manager. Autonomy of distributed objects, multi-layered architecture and decentralized approaches in hierarchical naming service and object management make DOVE more extensible and scalable. Also,fault tolerance is provided by fault detection in object using a timeout mechanism, and fault notification using asynchronous exception handling methods

  • PDF

TCP Performance Improvement Scheme on Dynamic Wireless Environment over UMTS System (UMTS 시스템에서 동적 무선 환경 변화에 따른 TCP 성능 향상 기법)

  • Kim, Nam-Ki;Park, In-Yong;Yoon, Hyun-Soo
    • The KIPS Transactions:PartC
    • /
    • v.10C no.7
    • /
    • pp.943-954
    • /
    • 2003
  • The mobile telecommunication system has been growing exponentially after 1990s due to the high population in a city and the growth of mobile user. In this time, the current mobile system mainly concentrates on the voice communication. However, in the next generation, mobile users want to get very diverse services via mobile terminal such as the Internet access, web access, multimedia communication, and etc. For this reason, the next generation system, such as the UMTS (Universal Mobile Telecommunication Services) system, has to support the packet data service and it will play the major role in the system. By the way, since the Web service is based on TCP, most of the Internet traffic TCP traffic. Therefore, efficient transmission of TCP traffic will take very important role in the performance of packet data service. There are many researches about improving TCP performance over wireless network. In those schemes, the UMTS system adapts the link layer retransmission scheme. However, there are rarely studies about the exact performance of the link layer retransmission scheme in the face of dynamic changes of wireless environment over the UMTS system. The dynamic changes of wireless environment, such as wireless bandwidth, can degrade TCP performance directly. So, in this paper, we simulate and analyze the TCP performance in the UMTS system with dynamic wireless environments. Then, we propose a simple scheme for minimizing TCP performance degradation. As a result of simulation, we can find that when wireless environment is changed dynamically, the probability of TCP timeout is increased, and the TCP performance is degraded very much. In this situation, the proposed simple scheme shows good performance. It saves wireless resources and reduces the degradation of TCP performance without large overhead of the base station.

An Algorithm for Efficient use of Label Space over MPLS Network with Multiple Disconnent Timers (MPLS 망에서 복수 연결해제 타이머를 이용한 레이블 공간의 효율적 사용방법)

  • Lee, Sun-Woo;Byun, Tae-Young;Han, Ki-Jun;Jeong, Youn-Kwae
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.24-30
    • /
    • 2002
  • Label switching technology is currently emerging as a solution for the rapidly growing of Internet traffic demand. Multiprotocol label switching(MPLS) is one of the standards made by the Internet Engineering Task Force(IETE) intended to enhance speed, scalability, and inter-opearability between label switching technologies. In MPLS, utilization of label space is a very important factor of network performance because labels are basic unit in packet switching. We propose a algorithm to effectively use label space by a multiple disconnect timer at the label switching router. Our algorithm is based on multiple utilization of the connection release timer over the MPLS network with multiple domains. In our algorithm, a relatively linger timeout interval is assigned to the traffic with higher class by the aid of the packet classifier. This reduces delay for making a new connection and also reduces the amount of packets which will be routed to the layer 3. Simulation results shows that reduction of required label number in MPLS network and this indicate our algorithm offers better performance than the existing ones in term of utilization of label space.

Visual Representation of Temporal Properties in Formal Specification and Analysis using a Spatial Process Algebra (공간 프로세스 대수를 이용한 정형 명세와 분석에서의 시간속성의 시각화)

  • On, Jin-Ho;Choi, Jung-Rhan;Lee, Moon-Kun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.339-352
    • /
    • 2009
  • There are a number of formal methods for distributed real-time systems in ubiquitous computing to analyze and verify the behavioral, temporal and the spatial properties of the systems. However most of the methods reveal structural and fundamental limitations of complexity due to mixture of spatial and behavioral representations. Further temporal specification makes the complexity more complicate. In order to overcome the limitations, this paper presents a new formal method, called Timed Calculus of Abstract Real-Time Distribution, Mobility and Interaction(t-CARDMI). t-CARDMI separates spatial representation from behavioral representation to simplify the complexity. Further temporal specification is permitted only in the behavioral representation to make the complexity less complicate. The distinctive features of the temporal properties in t-CARDMI include waiting time, execution time, deadline, timeout action, periodic action, etc. both in movement and interaction behaviors. For analysis and verification of spatial and temporal properties of the systems in specification, t-CARDMI presents Timed Action Graph (TAG), where the spatial and temporal properties are visually represented in a two-dimensional diagram with the pictorial distribution of movements and interactions. t-CARDMI can be considered to be one of the most innovative formal methods in distributed real-time systems in ubiquitous computing to specify, analyze and verify the spatial, behavioral and the temporal properties of the systems very efficiently and effectively. The paper presents the formal syntax and semantics of t-CARDMI with a tool, called SAVE, for a ubiquitous healthcare application.