Loading...
Please wait, while we are loading the content...
Similar Documents
A Measurement-Based Loss Scheduling Scheme - INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. 'Networking the Nex
| Content Provider | Semantic Scholar |
|---|---|
| Author | Yang, Tao |
| Copyright Year | 2004 |
| Abstract | In this paper, we consider a measurement-based loss scheduling scheme, termed the QoS-scheme, for highspeed packet networks. We show that the QoS-scheme is optimal in terms of bandwidth utilization among all stationary, space conserving loss scheduling schemes, and that it is also optimal among all stationary loss schemes when all traffic streams are equally demanding. We examine the properties of the QoS-scheme and how these properties may be used to compute the minimum bandwidth required for a given traffk scenario. We also discuss implications of these properties and compare the QoS-scheme with other loss scheduling schemes such as the last-in-first-out, partial buffer sharing, and push-out scheme through simulation studies. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://csdl.computer.org/csdl/proceedings/infocom/1996/7292/03/00493049.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
