1-4hit |
Yi-Cheng CHAN Chia-Liang LIN Cheng-Yuan HO
An important issue in designing a TCP congestion control algorithm is that it should allow the protocol to quickly adjust the end-to-end communication rate to the bandwidth on the bottleneck link. However, the TCP congestion control may function poorly in high bandwidth-delay product networks because of its slow response with large congestion windows. In this paper, we propose an enhanced version of TCP Vegas called Quick Vegas, in which we present an efficient congestion window control algorithm for a TCP source. Our algorithm improves the slow-start and congestion avoidance techniques of original Vegas. Simulation results show that Quick Vegas significantly improves the performance of connections as well as remaining fair when the bandwidth-delay product increases.
Chen-Hua SHIH Jun-Li KUO Cheng-Yuan HO Yaw-Chung CHEN
As we are moving toward next generation wireless networks, we are facing the integration of heterogeneous access networks. The main challenge is to provide mobile users moving freely across different radio access technologies with satisfactory quality of services for a variety of applications. Consequently, the seamless roaming over heterogeneous networks is an important concern. To minimize the disruption to the ongoing session when a mobile user is moving from one access network to another, we propose a framework that integrates IEEE 802.11 WLANs and IEEE 802.16 WMANs based on the IEEE 802.21, so-called Media Independent Handover (MIH), to facilitate both homogeneous and heterogeneous handovers. Both numerical analysis and simulation results show that seamless roaming between WLAN and WMAN can be achieved and much better performance can be obtained compared with the IEEE 802.21 standard approach.
Jun-Li KUO Chen-Hua SHIH Cheng-Yuan HO Ming-Ching WANG Yaw-Chung CHEN
In the infrastructure-less disaster environment, the application of the peer-to-peer (P2P) group conference over mobile ad hoc network (MANET) can be used to communicate with each other when the rescue crews search the survivors but work separately. However, there still are several problems of in-time multimedia delivery in P2P-MANET: (1) MANET mobility influences the maintenance of P2P overlay. (2) P2P overlay is not proximal to MANET topology, this leads to the inefficient streaming delivery. (3) The unreliable wireless connection leads to the difficulty of multi-source P2P group conferencing. Therefore, P2P conferencing cannot work well on MANET. To overcome the above disadvantages, in this paper, we present a cross-layer P2P group conferencing mechanism over MANET, called RING (Real-time Intercommunication Network Gossip). The RING uses the ring overlay to manage peers and utilizes the cross-layer mechanism to force the ring overlay to be proximal to MANET topology. Therefore, RING can lead efficient in-time multimedia streaming delivery. On the other hand, the ring overlay can deal with peer joining/leaving fast and simply, and improves the delivery efficiency with the minimum signaling overhead. Through mathematical theory and a series of experiments, we demonstrate that RING is workable and it can shorten the source-to-end delay with minimal signaling overhead.
Cheng-Yuan HO Yi-Cheng CHAN Yaw-Chung CHEN
A critical design issue of Transmission Control Protocol (TCP) is its congestion control that allows the protocol to adjust the end-to-end communication rate based on the detection of packet loss. However, TCP congestion control may function poorly during its slow start and congestion avoidance phases. This is because TCP sends bursts of packets with the fast window increase and the ACK-clock based transmission in slow start, and respond slowly with large congestion windows especially in high bandwidth-delay product (BDP) networks during congestion avoidance. In this article, we propose an improved version of TCP, TCP-Ho, that uses an efficient congestion window control algorithm for a TCP source. According to the estimated available bandwidth and measured round-trip times (RTTs), the proposed algorithm adjusts the congestion window size with a rate between exponential growth and linear growth intelligently. Our extensive simulation results show that TCP-Ho significantly improves the performance of connections as well as remaining fair and stable when the BDP increases. Furthermore, it is feasible to implement because only sending part needs to be modified.