Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
A comparison of mechanisms for improving TCP performance over wireless links
IEEE/ACM Transactions on Networking (TON)
ACM SIGMOBILE Mobile Computing and Communications Review
Comparison of TCP Reno and Vegas in wireless mobile ad hoc networks
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Dynamic load balancing without packet reordering
ACM SIGCOMM Computer Communication Review
Improving the efficiency of multipath traffic via opportunistic traffic scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
MIH Based SIP Mobility Management Scheme in Heterogeneous Wireless Networks
UBICOMM '08 Proceedings of the 2008 The Second International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies
An interface management framework for multihomed terminal
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
A review of mobility support paradigms for the internet
IEEE Communications Surveys & Tutorials
TCP performance issues over wireless links
IEEE Communications Magazine
TCP in wireless environments: problems and solutions
IEEE Communications Magazine
Mobility support in IP: a survey of related protocols
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.01 |
In places where mobile users can access multiple wireless networks simultaneously, a multipath scheduling algorithm can benefit the performance of wireless networks and improve the experience of mobile users. However, existing literature shows that it may not be the case, especially for TCP flows. According to early investigations, there are mainly two reasons that result in bad performance of TCP flows in wireless networks. One is the occurrence of out-of-order packets due to different delays in multiple paths. The other is the packet loss which is resulted from the limited bandwidth of wireless networks. To better exploit multipath scheduling for TCP flows, this paper presents a new scheduling algorithm named Adaptive Load Balancing Algorithm (ALBAM) to split traffic across multiple wireless links within the ISP infrastructure. Targeting at solving the two adverse impacts on TCP flows, ALBAM develops two techniques. Firstly, ALBAM takes advantage of the bursty nature of TCP flows and performs scheduling at the flowlet granularity where the packet interval is large enough to compensate for the different path delays. Secondly, ALBAM develops a Packet Number Estimation Algorithm (PNEA) to predict the buffer usage in each path. With PNEA, ALBAM can prevent buffer overflow and schedule the TCP flow to a less congested path before it suffers packet loss. Simulations show that ALBAM can provide better performance to TCP connections than its other counterparts.