Full text
Preview |
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview |
Li, Tonghong and Wang, Jingyu and Liao, Jianxin (2012). OSIA: Out-of-order scheduling for in-order arriving in concurrent multi-path transfer.. "JOURNAL Network and Computer Applications", v. 35 (n. 2); pp. 633-643. ISSN 1084-8045. https://doi.org/10.1016/j.jnca.2011.09.004.
Title: | OSIA: Out-of-order scheduling for in-order arriving in concurrent multi-path transfer. |
---|---|
Author/s: |
|
Item Type: | Article |
Título de Revista/Publicación: | JOURNAL Network and Computer Applications |
Date: | March 2012 |
ISSN: | 1084-8045 |
Volume: | 35 |
Subjects: | |
Freetext Keywords: | Concurrent multi-pathtransfer, Multihoming, Packet reordering, Traffic scheduling, Caminos de transferencia múltiples simultáneos, Reordenación de paquetes, Programación de tránsito. |
Faculty: | Facultad de Informática (UPM) |
Department: | Lenguajes y Sistemas Informáticos e Ingeniería del Software |
Creative Commons Licenses: | Recognition - No derivative works - Non commercial |
Preview |
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview |
One major problem of concurrent multi-path transfer (CMT) scheme in multi-homed mobile networks is that the utilization of different paths with diverse delays may cause packet reordering among packets of the same ?ow. In the case of TCP-like, the reordering exacerbates the problem by bringing more timeouts and unnecessary retransmissions, which eventually degrades the throughput of connections considerably. To address this issue, we ?rst propose an Out-of-order Scheduling for In-order Arriving (OSIA), which exploits the sending time discrepancy to preserve the in-order packet arrival. Then, we formulate the optimal traf?c scheduling as a constrained optimization problem and derive its closedform solution by our proposed progressive water-?lling solution. We also present an implementation to enforce the optimal scheduling scheme using cascaded leaky buckets with multiple faucets, which provides simple guidelines on maximizing the utilization of aggregate bandwidth while decreasing the probability of triggering 3 dupACKs. Compared with previous work, the proposed scheme has lower computation complexity and can also provide the possibility for dynamic network adaptability and ?ner-grain load balancing. Simulation results show that our scheme signi?cantly alleviates reordering and enhances transmission performance.
Item ID: | 16066 |
---|---|
DC Identifier: | https://oa.upm.es/16066/ |
OAI Identifier: | oai:oa.upm.es:16066 |
DOI: | 10.1016/j.jnca.2011.09.004 |
Official URL: | http://www.journals.elsevier.com/journal-of-networ... |
Deposited by: | Memoria Investigacion |
Deposited on: | 27 Jun 2013 16:33 |
Last Modified: | 21 Apr 2016 16:24 |