eprintid: 37
rev_number: 4
eprint_status: archive
userid: 4
dir: disk0/00/00/00/37
datestamp: 2005-05-26
lastmod: 2015-05-29 19:45:50
status_changed: 2009-04-08 16:52:17
type: report
metadata_visibility: show
item_issues_count: 0
creators_name: Allwright, David
creators_id: allwrigh@maths.ox.ac.uk
contributors_name: Dellar, Paul
contributors_name: Leese, Robert
contributors_name: Luczak, Malwina
contributors_name: Noble, Steven
contributors_name: Salazar, Domingo
title: Data packet loss in a queue with limited buffer
ispublished: pub
subjects: telecom
studygroups: esgi49
companyname: Motorola Research
full_text_status: public
abstract: 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, 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, and for packet discard using either drop-tail or random early discard policies.
date: 2005-01-11
date_type: published
pages: 15
official_url: http://www.smithinst.ac.uk/Projects/ESGI49/ESGI49-Motorola/Report/LimitedBuffers.pdf
citation:   Allwright, David  (2005) Data packet loss in a queue with limited buffer.  [Study Group Report]     
document_url: http://miis.maths.ox.ac.uk/miis/37/1/LimitedBuffers.pdf