Simple Performance

Models of Differentiated

Services Schemes for the Internet Martin

May

Jean-Chrysostome

Bolot

Alain

Jean-Marie

Christopher

Diet

INRIA 2004 route

des Lucioles

- BP 93

06902 Sophia-Antipolis France {mmay,bolot,ajm,

f~bstract— recently

Schemes

based on the tagging

been proposed

single class best effort net by including schemes

as a low-cost service

cdiot}@sophia.inria.fr

of packets

have

way to augment of the current

Inter-

some kind of service discrimination.

Such

have a number

is not clear exactly

model

the

of attractive

tee services is a worthy goal. However, reaching that goal is difficult. For example, many services turn out to require

different

complex associated admission control and scheduling mech-

schemes

sch(eme (for example issues (e.g.

and of the

how much RIO

they

mechanisms

contributes

and to tackle key performance

the difference

would

ranging from the best effort to the deterministic guaran-

pro-

sur