Skip to main content

2004 | OriginalPaper | Buchkapitel

Real-time Sources and Distributed Admission Control

verfasst von : R. Srikant

Erschienen in: The Mathematics of Internet Congestion Control

Verlag: Birkhäuser Boston

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

In the previous chapters, we have considered only elastic users, i.e., those users that are characterized by concave utility functions. In this chapter, we will consider a specific type of inelastic users: those which require an average bandwidth (say, 1 unit) and a QoS guarantee (e.g., an upper bound on the probability of packet loss or the probability that the delay exceeds some threshold) from the network. In other words, these users would not be willing to use the network if the amount of bandwidth available is less than one unit, and further, will not use any excess bandwidth if more than one unit is provided to them. An example of such sources are voice calls, which generate packets at a rate of 8 kbps to 64 kbps, depending on the codec (coding and decoding algorithm) used, and require the delay, jitter and packet loss in the network to be small to ensure good quality of the audio at the receiver.

Metadaten
Titel
Real-time Sources and Distributed Admission Control
verfasst von
R. Srikant
Copyright-Jahr
2004
Verlag
Birkhäuser Boston
DOI
https://doi.org/10.1007/978-0-8176-8216-3_10

Neuer Inhalt