Search

This paper proposes an efficient network mobility management scheme for mobile networks such as trains and buses moving on the predetermined path. In this scheme, each mobile router maintains a database about the list of access routers, their network prefixes, and cell radii on the moving path. The mobile router therefore knows in advance network prefixes and its care-of addresses of all subnets without beacon signals. Using this database and current location information, the mobile router can prepare network layer hand-over with predictive binding update before link layer handover occurs, thereby the service disruption time due to handover will be reduced to the link layer handover latency. [ABSTRACT FROM AUTHOR]

Current TCP congestion control can be inefficient and unstable in high-speed wide area networks due to its slow response with a large congestion window. Several congestion control proposals have already been suggested to solve these problems and two properties have been considered: TCP friendliness and scalability, to ensure that a protocol does not take away too much bandwidth from TCP, while utilizing a bandwidth of high speed networks efficiently. In this paper, we propose a new variant of TCP for a high-speed network which combines delay-based congestion control with loss-based congestion control. Our simulation results show that proposed scheme performs better than the existing high-speed TCP protocols in terms of fairness, stability and scalability, while providing friendliness at the same time. [ABSTRACT FROM AUTHOR]

The congestion control mechanisms of the current standard TCP can encounter problems in high-speed wide area networks due to its slow response with a large congestion window. Several congestion control proposals have already been suggested to solve this problem and mainly consider two properties: TCP friendliness and bandwidth scalability, to ensure that a protocol does not take away too much bandwidth from TCP, while utilizing the full bandwidth of high speed networks. However, further studies on the TCP friendliness of high-speed TCP are still needed. Recent studies have pointed out that existing schemes have a severe RTT unfairness problem, where competing flows with different RTTs can consume considerable unfair bandwidth shares. Burstiness is one of the main reasons behind such problems. As the congestion window achieved by a high-speed TCP connection can be quite large, there is a strong possibility that the sender will transmit a large burst of packets. As such, the current congestion control mechanisms of high-speed TCP can lead to bursty traffic flows in high speed networks, with a negative impact on both TCP friendliness and RTT unfairness. The proposed solution to these problems is to evenly space, or pace packets sent into the network over an entire round-trip time, so that packets are not sent in a burst. Accordingly, the current paper evaluates this approach with a high bandwidth-delay product network and shows that pacing offers better TCP friendliness and RTT fairness without degrading the bandwidth scalability. [ABSTRACT FROM AUTHOR]