1-Bit Schemes for Service Discrimination in the Internet: Analysis and Evaluation

Abstract : Schemes using a single-bit priority field in IP packets have recently been proposed as a low-cost (both in terms of implementation and architectural changes from the current Internet architecture) way to augment the single class best effort service model of the current Internet to include some kind of service discrimination. Such schemes appear attractive, however it is not clear yet what kind of service model they would provide to applications. We examine this in the paper. Specifically, we describe and solve analytic models of two 1-bit schemes recently proposed by Clark and Crowcroft; we obtain expression for performance measures that characterize the service provided to tagged packets, the service provided to non-tagged packets, and the prevalence of denial of service (i.e. the percentage of tagged packets that do not get the better service). We use these expressions, as well as simulations and experiments from actual implementations on a testbed at INRIA, to illustrate the benefits and shortcomings of the schemes. We also discuss implications of our results such as how these schemes can be used to transmit layered data, and how they would interact with tariffing schemes.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073451
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:50:34 PM
Last modification on : Tuesday, November 13, 2018 - 2:38:01 AM
Long-term archiving on : Sunday, April 4, 2010 - 9:56:54 PM

Identifiers

  • HAL Id : inria-00073451, version 1

Collections

Citation

Martin May, Jean-Chrysostome Bolot, Christophe Diot, Alain Jean-Marie. 1-Bit Schemes for Service Discrimination in the Internet: Analysis and Evaluation. RR-3238, INRIA. 1997. ⟨inria-00073451⟩

Share

Metrics

Record views

302

Files downloads

114