The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Yoshifumi NISHIDA(3hit)

1-3hit
  • Performance Enhancement of Transport Layer Handover on Single-Homed Mobile Nodes

    Michio HONDA  Yoshifumi NISHIDA  Jin NAKAZAWA  Hideyuki TOKUDA  

     
    PAPER

      Vol:
    E90-B No:10
      Page(s):
    2683-2692

    Many handover techniques in the Internet have been introduced with the development of mobile computing technologies. Although many proposed handover schemes utilize multiple wireless interfaces, having multiple wireless interfaces in a mobile device increases its power consumption, device installation space, and hardware costs. We have been studying handover schemes for mobile nodes with a single wireless interface. To achieve seamless and efficient handover, we focus on Stream Control Transmission Protocol (SCTP) that offers a message-oriented, reliable and connection-oriented delivery transport service. Unlike other transport protocols like TCP, SCTP can provide an end-to-end handover mechanism with multi-homing feature. However, the handover mechanism in the current SCTP causes large handover latency particularly when a mobile node has only one single wireless interface. This paper investigates the current issues of the SCTP handover mechanism, and proposes a new efficient handover scheme based on SCTP, which identifies a communication path as a pair of source and destination address. Additionally, we modified SCTP behavior when an SCTP endpoint received a SET PRIMARY message to change primary destination of peer endpoint. This paper shows that our scheme can reduce the handover latency by two to thirty seconds.

  • AMS: An Adaptive TCP Bandwidth Aggregation Mechanism for Multi-homed Mobile Hosts

    Shunsuke SAITO  Yasuyuki TANAKA  Mitsunobu KUNISHI  Yoshifumi NISHIDA  Fumio TERAOKA  

     
    PAPER

      Vol:
    E89-D No:12
      Page(s):
    2838-2847

    Recently, the number of multi-homed hosts is getting large, which are equipped with multiple network interfaces to support multiple IP addresses. Although there are several proposals that aim at bandwidth aggregation for multi-homed hosts, few of them support mobility. This paper proposes a new framework called AMS: Aggregate-bandwidth Multi-homing Support. AMS provides functions of not only bandwidth aggregation but also mobility by responding to the changes of the number of connections during communication without the support of underlying infrastructure. To achieve efficient data transmission, AMS introduces a function called address pairs selection to select an optimal combination of addresses of the peer nodes. We implemented AMS in the kernel of NetBSD and evaluated it in our test network, in which dummynet was used to control bandwidth and delay. The measured results showed that AMS achieved ideal bandwidth aggregation in three TCP connections by selecting optimal address pairs.

  • Congestion Control Mechanism for TCP with Packet Pair Scheme

    Yoshifumi NISHIDA  Osamu NAKAMURA  Jun MURAI  

     
    PAPER

      Vol:
    E82-D No:4
      Page(s):
    854-862

    Congestion Control Scheme of TCP/IP protocol suite is established by Transmission Control Protocol (TCP). Using the self-clocking scheme, TCP is able to maintain a quick optimum connection status for the network path, unless it is given an excessive load to carry to the network. However, in wide area networks, there are some obstructive factors for the self-clocking scheme of TCP. In this paper, we describe the obstructive factors for the self-clocking scheme. We propose a new congestion control scheme using a packet pair scheme and a traffic-shaping scheme. In combining these schemes with TCP, new TCP options and a modification for TCP congestion control algorithms are added. Using our scheme, TCP is able to maintain smooth self-clocking. We implemented this scheme on a network simulator for evaluation. Compared with normal TCP, this scheme was demonstrated to be over 20% more efficient in symmetric communication and over 40% more efficient in asymmetric communication.