A Data-Scheduling Mechanism for Multi-Homed Mobile Terminals with Disparate Link Latencies
A Data-Scheduling Mechanism for Multi-Homed Mobile Terminals with Disparate Link Latencies
复制标题
DOI：
10.1109/vetecf.2010.5594280
复制
发表时间：
2010-10
期刊：
影响因子：
--
通讯作者：
Farhan H. Mirani;N. Boukhatem;Minh-Anh Tran
中科院分区：
文献类型：
--
作者：
Farhan H. Mirani;N. Boukhatem;Minh-Anh Tran
配备有多个网络接口的移动终端常常处于多个接入网络的覆盖范围内。多宿主使移动终端能够通过多个接口同时通信。面向连接的传输层机制可确保可靠、有序的数据传输，但是多宿主中的并行数据传输面临着由于数据无序接收而导致的快速重传并限制通信吞吐量的问题。在本文中，我们提出了一种基于传输层的机制，该机制可以有效地将一个流的数据跨多个不相交的路径进行条带化，从而减少可能出现的无序数据。我们的机制估计要通过关联中的可用路径发送的数据包的到达时间，并决定要通过每条路径发送哪些数据包。我们将我们的机制与称为 Westwood SCTP 的相对更接近的方法进行了比较。我们借助仿真结果证明我们的机制可以改善多路径通信。
A mobile terminal equipped with multiple network interfaces can often be found under coverage of multiple access networks. Multihoming enables mobile terminals to communicate simultaneously through multiple interfaces. Connection-oriented transport layer mechanisms ensure reliable, in-order delivery of data, however parallel data transfers in multihoming face problems due to out-of-order reception of data which causes fast-retransmissions and limit the communication throughput. In this paper, we propose a transport layer based mechanism which stripes one flow''s data across multiple disjoint paths efficiently, reducing possible occurrence of out-of-order data. Our mechanism estimates arrival times of data packets to be sent through available paths in an association, and decides which packets are to be sent through each path. We compared our mechanism with a relatively closer approach called Westwood SCTP. We illustrate with the help of simulation results that our mechanism proves to improve multipath communication.