Mostrar el registro sencillo

dc.contributor.authorGarrido Ortiz, Pablo
dc.contributor.authorLeith, Douglas J.
dc.contributor.authorAgüero Calvo, Ramón 
dc.contributor.otherUniversidad de Cantabriaes_ES
dc.date.accessioned2020-01-28T13:23:00Z
dc.date.available2020-01-28T13:23:00Z
dc.date.issued2019-10
dc.identifier.issn1063-6692
dc.identifier.issn1558-2566
dc.identifier.otherTEC2015-71329-C2-1-Res_ES
dc.identifier.urihttp://hdl.handle.net/10902/17934
dc.description.abstractWe consider the transmission of packets across a lossy end-to-end network path so as to achieve low in-order delivery delay. This can be formulated as a decision problem, namely deciding whether the next packet to send should be an information packet or a coded packet. Importantly, this decision is made based on delayed feedback from the receiver. While an exact solution to this decision problem is challenging, we exploit ideas from queueing theory to derive scheduling policies based on prediction of a receiver queue length that, while suboptimal, can be efficiently implemented and offer substantially better performance than state of the art approaches. We obtain a number of useful analytic bounds that help characterise design trade-offs and our analysis highlights that the use of prediction plays a key role in achieving good performance in the presence of significant feedback delay. Our approach readily generalises to networks of paths and we illustrate this by application to multipath trans port scheduler design.es_ES
dc.description.sponsorshipThis work has been supported by the Spanish Government (Ministerio de Economía y Competitividad, Fondo Europeo de Desarrollo Regional, FEDER) by means of the project ADVICE (TEC2015-71329-C2-1-R).es_ES
dc.format.extent14 p.es_ES
dc.language.isoenges_ES
dc.publisherInstitute of Electrical and Electronics Engineers Inc.es_ES
dc.rights© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.es_ES
dc.sourceIEEE/ACM Transactions on Networking, 2019, 27(5), 1987-2000es_ES
dc.subject.otherOptimal schedulinges_ES
dc.subject.otherForward error correctiones_ES
dc.subject.otherRandom linear codinges_ES
dc.subject.otherLow delay codinges_ES
dc.subject.otherARQes_ES
dc.subject.otherMulti-pathes_ES
dc.titleJoint scheduling and coding for low in-order delivery delay over lossy paths with delayed feedbackes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.relation.publisherVersionhttps://doi.org/10.1109/TNET.2019.2934522es_ES
dc.rights.accessRightsopenAccesses_ES
dc.identifier.DOI10.1109/TNET.2019.2934522
dc.type.versionacceptedVersiones_ES


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo