?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F37%2F&rft.title=Data+packet+loss+in+a+queue+with+limited+buffer&rft.creator=Allwright%2C+David&rft.subject=Information+and+communication+technology&rft.description=When+channels+with+limited+buffer+space+are+shared+by+multiple+bursty+data+sources+then+some+fraction+of+submitted+packets+is+lost+when+the+buffer+becomes+full.+Feedback+signals+enable+the+sources+to+reduce+their+burst+sizes+when+the+buffer+becomes+congested.+On+the+other+hand%2C+if+there+is+plenty+of+free+space+in+the+buffer+then+burst+sizes+are+allowed+to+increase.+Such+systems+may+be+designed+with+a+variety+of+queueing+disciplines+and+packet+discard+policies.+The+Study+Group+was+asked+to+analyse+the+packet-loss+process+for+packet+submission+using+either+first-in-first-out+or+weighted+fair+queueing%2C+and+for+packet+discard+using+either+drop-tail+or+random+early+discard+policies.&rft.date=2005-01-11&rft.type=Study+Group+Report&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F37%2F1%2FLimitedBuffers.pdf&rft.identifier=++Allwright%2C+David++(2005)+Data+packet+loss+in+a+queue+with+limited+buffer.++%5BStudy+Group+Report%5D+++++&rft.relation=http%3A%2F%2Fwww.smithinst.ac.uk%2FProjects%2FESGI49%2FESGI49-Motorola%2FReport%2FLimitedBuffers.pdf