Loading…

Joint Scheduling and Coding for Low In-Order Delivery Delay Over Lossy Paths With Delayed Feedback

We 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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2019-10, Vol.27 (5), p.1987-2000
Main Authors: Garrido, Pablo, Leith, Douglas J., Aguero, Ramon
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c336t-f586e704ff0d6975c32386e2845649c3bfc62bb1537ea5ea6fac19b97aec5a6f3
cites cdi_FETCH-LOGICAL-c336t-f586e704ff0d6975c32386e2845649c3bfc62bb1537ea5ea6fac19b97aec5a6f3
container_end_page 2000
container_issue 5
container_start_page 1987
container_title IEEE/ACM transactions on networking
container_volume 27
creator Garrido, Pablo
Leith, Douglas J.
Aguero, Ramon
description We 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.
doi_str_mv 10.1109/TNET.2019.2934522
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2307213976</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8820059</ieee_id><sourcerecordid>2307213976</sourcerecordid><originalsourceid>FETCH-LOGICAL-c336t-f586e704ff0d6975c32386e2845649c3bfc62bb1537ea5ea6fac19b97aec5a6f3</originalsourceid><addsrcrecordid>eNo9kMtOwzAQRS0EEqXwAYiNJdYpfsROvESFQlFFkShiaTnOmKaUpNgpKH-Po1Ss5s7MnYcOQpeUTCgl6mb1fL-aMELVhCmeCsaO0IgKkSdMSHkcNZE8kVKxU3QWwoYQygmTI1Q8NVXd4le7hnK_reoPbOoST5uyl67xeNH84nmdLH0JHt_BtvoB3_XCdHgZdTSE0OEX064Dfq_a9dCDEs8AysLYz3N04sw2wMUhjtHb7H41fUwWy4f59HaRWM5lmziRS8hI6hwppcqE5YzHCstTIVNleeGsZEVBBc_ACDDSGUtVoTIDVsSMj9H1sHfnm-89hFZvmr2v40nNOMkY5SqT0UUHl_XxcQ9O73z1ZXynKdE9St2j1D1KfUAZZ66GmQoA_v15zggRiv8BzadvGQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2307213976</pqid></control><display><type>article</type><title>Joint Scheduling and Coding for Low In-Order Delivery Delay Over Lossy Paths With Delayed Feedback</title><source>IEEE Electronic Library (IEL) Journals</source><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Garrido, Pablo ; Leith, Douglas J. ; Aguero, Ramon</creator><creatorcontrib>Garrido, Pablo ; Leith, Douglas J. ; Aguero, Ramon</creatorcontrib><description>We 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.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2019.2934522</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>ARQ ; Block codes ; Decision theory ; Delay ; Delays ; Feedback ; forward error correction ; IEEE transactions ; low delay coding ; multi-path ; Optimal scheduling ; Packet transmission ; Queues ; Queuing theory ; random linear coding ; Receivers ; Scheduling ; Servers ; Windows</subject><ispartof>IEEE/ACM transactions on networking, 2019-10, Vol.27 (5), p.1987-2000</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c336t-f586e704ff0d6975c32386e2845649c3bfc62bb1537ea5ea6fac19b97aec5a6f3</citedby><cites>FETCH-LOGICAL-c336t-f586e704ff0d6975c32386e2845649c3bfc62bb1537ea5ea6fac19b97aec5a6f3</cites><orcidid>0000-0002-9620-3990 ; 0000-0001-7943-0422 ; 0000-0003-4056-4014</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8820059$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,54774</link.rule.ids></links><search><creatorcontrib>Garrido, Pablo</creatorcontrib><creatorcontrib>Leith, Douglas J.</creatorcontrib><creatorcontrib>Aguero, Ramon</creatorcontrib><title>Joint Scheduling and Coding for Low In-Order Delivery Delay Over Lossy Paths With Delayed Feedback</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>We 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.</description><subject>ARQ</subject><subject>Block codes</subject><subject>Decision theory</subject><subject>Delay</subject><subject>Delays</subject><subject>Feedback</subject><subject>forward error correction</subject><subject>IEEE transactions</subject><subject>low delay coding</subject><subject>multi-path</subject><subject>Optimal scheduling</subject><subject>Packet transmission</subject><subject>Queues</subject><subject>Queuing theory</subject><subject>random linear coding</subject><subject>Receivers</subject><subject>Scheduling</subject><subject>Servers</subject><subject>Windows</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNo9kMtOwzAQRS0EEqXwAYiNJdYpfsROvESFQlFFkShiaTnOmKaUpNgpKH-Po1Ss5s7MnYcOQpeUTCgl6mb1fL-aMELVhCmeCsaO0IgKkSdMSHkcNZE8kVKxU3QWwoYQygmTI1Q8NVXd4le7hnK_reoPbOoST5uyl67xeNH84nmdLH0JHt_BtvoB3_XCdHgZdTSE0OEX064Dfq_a9dCDEs8AysLYz3N04sw2wMUhjtHb7H41fUwWy4f59HaRWM5lmziRS8hI6hwppcqE5YzHCstTIVNleeGsZEVBBc_ACDDSGUtVoTIDVsSMj9H1sHfnm-89hFZvmr2v40nNOMkY5SqT0UUHl_XxcQ9O73z1ZXynKdE9St2j1D1KfUAZZ66GmQoA_v15zggRiv8BzadvGQ</recordid><startdate>201910</startdate><enddate>201910</enddate><creator>Garrido, Pablo</creator><creator>Leith, Douglas J.</creator><creator>Aguero, Ramon</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-9620-3990</orcidid><orcidid>https://orcid.org/0000-0001-7943-0422</orcidid><orcidid>https://orcid.org/0000-0003-4056-4014</orcidid></search><sort><creationdate>201910</creationdate><title>Joint Scheduling and Coding for Low In-Order Delivery Delay Over Lossy Paths With Delayed Feedback</title><author>Garrido, Pablo ; Leith, Douglas J. ; Aguero, Ramon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c336t-f586e704ff0d6975c32386e2845649c3bfc62bb1537ea5ea6fac19b97aec5a6f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>ARQ</topic><topic>Block codes</topic><topic>Decision theory</topic><topic>Delay</topic><topic>Delays</topic><topic>Feedback</topic><topic>forward error correction</topic><topic>IEEE transactions</topic><topic>low delay coding</topic><topic>multi-path</topic><topic>Optimal scheduling</topic><topic>Packet transmission</topic><topic>Queues</topic><topic>Queuing theory</topic><topic>random linear coding</topic><topic>Receivers</topic><topic>Scheduling</topic><topic>Servers</topic><topic>Windows</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Garrido, Pablo</creatorcontrib><creatorcontrib>Leith, Douglas J.</creatorcontrib><creatorcontrib>Aguero, Ramon</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Garrido, Pablo</au><au>Leith, Douglas J.</au><au>Aguero, Ramon</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Joint Scheduling and Coding for Low In-Order Delivery Delay Over Lossy Paths With Delayed Feedback</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2019-10</date><risdate>2019</risdate><volume>27</volume><issue>5</issue><spage>1987</spage><epage>2000</epage><pages>1987-2000</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>We 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.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2019.2934522</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-9620-3990</orcidid><orcidid>https://orcid.org/0000-0001-7943-0422</orcidid><orcidid>https://orcid.org/0000-0003-4056-4014</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1063-6692
ispartof IEEE/ACM transactions on networking, 2019-10, Vol.27 (5), p.1987-2000
issn 1063-6692
1558-2566
language eng
recordid cdi_proquest_journals_2307213976
source IEEE Electronic Library (IEL) Journals; Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
subjects ARQ
Block codes
Decision theory
Delay
Delays
Feedback
forward error correction
IEEE transactions
low delay coding
multi-path
Optimal scheduling
Packet transmission
Queues
Queuing theory
random linear coding
Receivers
Scheduling
Servers
Windows
title Joint Scheduling and Coding for Low In-Order Delivery Delay Over Lossy Paths With Delayed Feedback
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T00%3A23%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Joint%20Scheduling%20and%20Coding%20for%20Low%20In-Order%20Delivery%20Delay%20Over%20Lossy%20Paths%20With%20Delayed%20Feedback&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Garrido,%20Pablo&rft.date=2019-10&rft.volume=27&rft.issue=5&rft.spage=1987&rft.epage=2000&rft.pages=1987-2000&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2019.2934522&rft_dat=%3Cproquest_cross%3E2307213976%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c336t-f586e704ff0d6975c32386e2845649c3bfc62bb1537ea5ea6fac19b97aec5a6f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2307213976&rft_id=info:pmid/&rft_ieee_id=8820059&rfr_iscdi=true