OSIA: Out-of-order scheduling for in-order arriving in concurrent multi-path transfer.

Li, Tonghong; Wang, Jingyu y 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.

Descripción

Título: OSIA: Out-of-order scheduling for in-order arriving in concurrent multi-path transfer.
Autor/es:
  • Li, Tonghong
  • Wang, Jingyu
  • Liao, Jianxin
Tipo de Documento: Artículo
Título de Revista/Publicación: JOURNAL Network and Computer Applications
Fecha: Marzo 2012
Volumen: 35
Materias:
Palabras Clave Informales: Concurrent multi-pathtransfer, Multihoming, Packet reordering, Traffic scheduling, Caminos de transferencia múltiples simultáneos, Reordenación de paquetes, Programación de tránsito.
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Lenguajes y Sistemas Informáticos e Ingeniería del Software
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 16066
Identificador DC: http://oa.upm.es/16066/
Identificador OAI: oai:oa.upm.es:16066
Identificador DOI: 10.1016/j.jnca.2011.09.004
URL Oficial: http://www.journals.elsevier.com/journal-of-network-and-computer-applications/
Depositado por: Memoria Investigacion
Depositado el: 27 Jun 2013 16:33
Ultima Modificación: 21 Abr 2016 16:24
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM