Show simple item record

dc.contributor.authorChristianson, B.
dc.date.accessioned2010-06-21T14:24:06Z
dc.date.available2010-06-21T14:24:06Z
dc.date.issued1990
dc.identifier.citationChristianson , B 1990 , Optimizing real-time transport protocols . UH Computer Science Technical Report , vol. 115 , University of Hertfordshire .
dc.identifier.otherPURE: 91484
dc.identifier.otherPURE UUID: 366f618f-5a2b-468b-a250-ed7335b21631
dc.identifier.otherdspace: 2299/4588
dc.identifier.urihttp://hdl.handle.net/2299/4588
dc.description.abstractA real-time transport protocol must trade delay against loss. Here we consider the problem of minimizing the mean transport delay subject to a given maximum acceptable loss rate. This form of the trade-off is appropriate for many voice, video and graphics applications. Yechiam Yemini has shown that for this problem, and for a particular model of the transport mechanism, the optimal protocol is a combination of send and wait for ack with send and discard, where the decision to wait for ack or to discard is made by comparing the number of packets currently awaiting ack with a threshold value, which is itself calculated from the arrival and permitted loss rates. In this paper we generalize Yemini's result, and give an elementary proof.en
dc.language.isoeng
dc.publisherUniversity of Hertfordshire
dc.relation.ispartofseriesUH Computer Science Technical Report
dc.titleOptimizing real-time transport protocolsen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionCentre for Computer Science and Informatics Research
rioxxterms.typeOther
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record