• Title/Summary/Keyword: FAST TCP

Search Result 103, Processing Time 0.026 seconds

VIA-Based PC Cluster System for Efficient Information Retrieval (효율적인 정보 검색을 위한 VIA 기반 PC 클러스터 시스템)

  • Kang, Na-Young;Chung, Sang-Hwa;Jang, Han-Kook
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.10
    • /
    • pp.539-549
    • /
    • 2002
  • PC cluster-based Information Retrieval (IR) systems improve their performances by parallel processing of query terms using cluster nodes. However TCP/IP based communication used to exchange data between cluster nodes prevents the performance from being improved further. The user-level communication mechanisms solve the problem by eliminating the time-consuming kernel access in exchanging data between cluster nodes. The Virtual Interface Architecture (VIA) is one of the representative user-level communication mechanisms which provide low latency and high bandwidth. In this paper, we propose a VIA-based parallel IR system on a PC cluster. The IR system is implemented using the following three communication methods: Sealable Coherent Interface (SCI) based VIA, MPI on SCI based VIA, MPI on Fast Ethernet based VIA. Through experiments, the performances of the three methods are analyzed in various aspects.

A Hybrid Active Queue Management for Stability and Fast Adaptation

  • Joo Chang-Hee;Bahk Sae-Woong;Lumetta Steven S.
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.93-105
    • /
    • 2006
  • The domination of the Internet by TCP-based services has spawned many efforts to provide high network utilization with low loss and delay in a simple and scalable manner. Active queue management (AQM) algorithms attempt to achieve these goals by regulating queues at bottleneck links to provide useful feedback to TCP sources. While many AQM algorithms have been proposed, most suffer from instability, require careful configuration of nonintuitive control parameters, or are not practical because of slow response to dynamic traffic changes. In this paper, we propose a new AQM algorithm, hybrid random early detection (HRED), that combines the more effective elements of recent algorithms with a random early detection (RED) core. HRED maps instantaneous queue length to a drop probability, automatically adjusting the slope and intercept of the mapping function to account for changes in traffic load and to keep queue length within the desired operating range. We demonstrate that straightforward selection of HRED parameters results in stable operation under steady load and rapid adaptation to changes in load. Simulation and implementation tests confirm this stability, and indicate that overall performances of HRED are substantially better than those of earlier AQM algorithms. Finally, HRED control parameters provide several intuitive approaches to trading between required memory, queue stability, and response time.

A Multifunctional RFID Reader for Efficient Logistics Information Management (효율적인 물류관리를 위한 다기능 RFID 리더기)

  • Oh Won-Geun;Kim Jin-Soo;Lee Jeong-Goo;Lee Dong-Jin
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.11a
    • /
    • pp.564-567
    • /
    • 2005
  • In this paper, we develop RFID reader with integrated GPS functionality. Most RFID readers only read the Tag data attached on the products then send them to the local servers. However the new reader can get the location data of the products because of the integrated GPS module. One more feature is the TCP/IP port as well as commonly used serial port. We can transfer the Tag data very fast and can access direlectly by internet using web browsers.

  • PDF

A Study on Wireless Home Network Platform for End-to-End Seamless Connection and TCP Performance Improvement (종단간 끊김없는 연결과 TCP 성능의 향상을 위한 무선 홈네트워크 플랫폼에 관한 연구)

  • Kim, Byoung-Hoon;Tak, Sung-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.10
    • /
    • pp.1295-1309
    • /
    • 2007
  • A wireless access point is used for all communications in the infrastructure mode wireless home networking, including communication between mobile nodes in the same service area. When a mobile station in the infrastructure mode wireless home networking moves into a dead zone, the communication between the mobile station and the access point is disconnected. To solve this problem, the existing wireless home network platforms focus on the ad hoc mode wireless home networking. However, the performance of an ad hoc network is poorly decreased when the number of mobile participating in the ad hoc network increases. In addition, although the ad hoc routing technique is necessary to support seamless communication of mobile nodes, the existing routing protocols, such as AODV and DSR, do not consider that a wireless channel state could affect performance significantly. Therefore, we propose a wireless home networking platform based on the ESCOD (End-to-end Seamless multi-hop COnnection based on Dual network mode) technique incorporating the VLR (Virtual Link Routing) scheme that supports end-to-end seamless connections. Extensive experiments show that the proposed wireless home networking platform incorporating the VLR scheme outperforms wireless home networking platforms based on the AODV and the DSR routing protocols respectively in terms of low packet transmission failure rate, fast packet transmission time, high TCP performance, and a wider coverage area of wireless home networks.

  • PDF

A Reputation based Cooperative Routing Scheme for End-to-End Reliable Communications in Multi-hop Wireless Networks (다중 홉 무선 네트워크에서 종단 간 신뢰성 통신을 위한 평판 기반의 협력적 라우팅 기법)

  • Kim, Tae-Hoon;Tak, Sung-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1593-1608
    • /
    • 2009
  • If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

  • PDF

A Comparative Study of Aggregation Schemes for Concurrent Transmission over Multiple WLAN Interfaces (다중 무선랜 인터페이스 전송을 위한 결합 방식의 성능 연구)

  • Saputra, Yuris Mulya;Hwang, Hwanwoong;Yun, Ji-Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.7
    • /
    • pp.18-25
    • /
    • 2014
  • To increase wireless capacity, the concurrent use of multiple wireless interfaces on different frequency bands, called aggregation, can be considered. In this paper, we focus on aggregation of multiple Wi-Fi interfaces with packet-level traffic spreading between the interfaces. Two aggregation schemes, link bonding and multipath TCP (MPTCP), are tested and compared in a dualband Wi-Fi radio system with their Linux implementation. Various test conditions such as traffic types, network delay, locations, interface failures and configuration parameters are considered. Experimental results show that aggregation increases throughput performance significantly over the use of a single interface. Link bonding achieves lower throughput than MPTCP due to duplicate TCP acknowledgements (ACKs) resulting from packet reordering and filtering such duplicate ACKs out is considered as a possible solution. However, link bonding is fast responsive to links' status changes such as a link failure. It is shown that different combinations of interface weights for packet spread in link bonding result in different throughput performance, envisioning a spatio-temporal adaptation of the weights. We also develop a mathematical model of power consumption and compare the power efficiency of the schemes applying different power consumption profiles.

Real-Time Performance Evaluation of Network in Ethernet based Intranet

  • Pae, Duck-Jin;Kim, Dae-Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.133.3-133
    • /
    • 2001
  • This paper analyses the real-time performance of Ethernet based intranet whether it is applicable to the real-time network. Unpredictability of transmission delay by collision-delay-retransmission mechanism in CAMA/CD(Carrier Sense Multiple Access with Collision Detect) of Ethernet is the major reason making hard to apply to real-time system. Both retransmission mechanism of TCP(Transmission Control Protocol) for reliability and sliding windows algorithm for high utilization make hard to predict transmission delay. Because real-time control network require fast responsibility and bustle of short-periodic messages, global-clock for collision avoidance and UDP(User Datagram Protocol) for high utilization of network are used. The mathematical models for time-delay that can be occured between ...

  • PDF

Fast transmission algorithm using ATM in broadcasting production environment (방송 제작 환경에서의 ATM을 이용한 고속 전송 알고리즘)

  • 김태현;김경수
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1998.06a
    • /
    • pp.25-31
    • /
    • 1998
  • 본 논문에서는 ATM 네트워크 상에서 방송 제작 품질로 압축된 동영상을 TCP (Transport Control Protocol) 기반으로 전송하는 경우에 대하여 연구하였다. 데이터의 송수신시에는 잡음으로 인한 ATM 셀의 손실이 발생하게 되는데, ATM 셀의 손실로 인한 패킷의 손실은 송신측의 재전송과 타임 아웃을 유발하므로, 전송 성능에 지대한 영향을 미치게 된다. 이 문제를 해결하기 위하여, 본 논문에서는 재전송 시간을 줄이고 송신측의 타임 아웃을 제거하여 고속으로 손실을 복구하는 알고리듬을 제안하였고, 그 성능을 기존의 알고리듬과 비교하였다. 또한, 본 논문에서는 영상을 전송하는 과정에서 데이터 수신 버퍼의 오버플로우가 발생하지 않도록 충분한 버퍼 크기를 계산하는 방법에 관해서도 고찰하였다. 특히, 방송 제작 품질의 화질을 처리하는 경우에 대한 시스템 모델링을 하였고, 이 모델에 대하여 오버플로우를 일정 수준 이하로 낮추기 위한 수신 버퍼의 크기를 결정하였다.

  • PDF

Fast Transmission Algorithm over ATM for Broadcasting Production Nework (방송 제작 네트워크를 위한 ATM 상의 고속 전송 알고리즘)

  • 김태현;김경수
    • Journal of Broadcast Engineering
    • /
    • v.3 no.2
    • /
    • pp.138-145
    • /
    • 1998
  • 최근 ATM(Asynchronous Transfer Mode) 네트워크를 비롯한 많은 데이터 전송 기술이 등장하였고, 이를 이용하여 동영상을 전달하는 연구가 진행되고 있다. 그러나 이러한 연구들은 대부분 동영상 데이터의 스트리밍에 주안점을 두고 있기 때문에, ATM 네트워크 기반으로 손실없는 방송 제작 환경을 구축하기 위해서는 에러가 발생하더라도 고속으로 복원할 수 있는 알고리즘이 필요하다. 본 논문에서는 ATM 네트워크 상에서 방송 제작 품질로 압축된 동영상을 TCP(Transport Control Protocol) 기반으로 전송하는 경우에 대하여 연구하였다. 실제 데이터의 송수신에는 잡음으로 인한 ATM 셀의 손실이 발생하게되는데, ATM 셀의 손실로 인한 패킷의 손실은 송신측의 재전송과 재전송 타임 아웃을 유발하므로 전송 성능에 지대한 영향을 미친다. 본 논문에서는 손실된 패킷의 연속적인 재전송을 통하여, 재전송 시간의 단축과 송신측 재전송 타임 아웃의 제거된 고속의 손실 복구 알고리즘을 제안하였고, 그 성능을 기존의 알고리즘과 비교하였다. 또한, 본 논문에서는 영상을 전송하는 과정에서 데이터 수신 버퍼의 오버플로우가 발생하지 않도록 충분한 버퍼 크기를 계산하는 방법에 관해서도 고찰하였다. 특히, 방송 제작 품질의 화질을 처리하는 경우에 대한 시스템 모델링을 하였고, 이 모델에 대하여 오버플로우를 일정 수준 이하로 낮추기 위한 수신 버퍼의 크기를 결정하였다.

  • PDF

Interaction Protocol on the COLAB Platform (원격공동연구 플랫품의 상호작용 프로토콜)

  • Kwon, Daniel D.;Suh, Young-Ho;Kim, Yong;Hwang, Dae-Joon
    • Proceedings of the Korean Society for Emotion and Sensibility Conference
    • /
    • 1998.04a
    • /
    • pp.304-308
    • /
    • 1998
  • Technical advances in computer networks and the Internet bring a new communication era and provide effective solutions for cooperative works and research. These technological advances introduced the concept of cyberspace that many people involve reseach and a project at different locations at the same time. In this paper, we present a fast and effective interaction protocol that is aeapted to the COLAB(COIIaborative LABoratory) Systems which use a high-speed ATM Network. The CCOLAB systems is developed for researchers those who are doing a large project on the collaborative research environment. The interaction protocol that we developed supports multi-session and multi-channel on the TCP/IP Network and provides more flexible solution to control multimedia data on the network.

  • PDF