The integrated services in the Internet: state of the art

SUMMARYAdmission controls are required to determine whether new connections should be admitted to networks. These controls ensure the quality of service (QoS) for data transmission. This paper introduces three measurement-based admission control algorithms called Measured Sum, Hoe!ding Bound, and Adaptive Weight Factor. The unfairness of these algorithms in a heterogeneous environment is investigated. Simulation results indicate that the fairness of the Measured Sum exceeds that of the other methods. Admission of connections with large peak rates or travelling many hops can be di$cult.

show abstract

“…Three classes of QoS have been de"ned for Integrated Services in RFC [1]. The "rst is &Best-e!ort service'.…”

Section: Introductionmentioning

confidence: 99%

Unfairness of measurement‐based admission controls in a heterogeneous environment

Lai

Tsai

2001

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Furthermore, data connections should share the available capacity fairly, that is each such connection should get an equal share, see for instance The ATM Forum (1). Also in IP (Internet Protocol) networks it is thought to be useful to make a distinction between real-time and non real-time (best-effort) connections to provide Quality of Service guarantees, see for instance Van der Wal et al (2) and White (3).…”

Section: Introductionmentioning

confidence: 99%

Sojourn Times in Non-Homogeneous QBD Processes With Processor Sharing

Núñez-Queija¹

2001

Stochastic Models

View full text Add to dashboard Cite

We study sojourn times of customers in a processor sharing queue with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace-Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is paid to the conditional mean sojourn time of a customer as a function of his required amount of work, and we establish the existence of an asymptote as the amount of work tends to infinity. The method of random time change is then extended to include the possibility of a varying service rate. By means of this method, we explain the well-established proportionality between the conditional mean sojourn time and required amount of work in processor sharing queues without random environment. Based on numerical experiments, we propose an approximation for the conditional mean sojourn time. Although first presented for exponentially distributed service requirements, the analysis is shown to extend to phase-type services. The service discipline of discriminatory processor sharing is also shown to fall within the framework.

show abstract

“…One solution for these real-time applications is to reserve some bandwidth for the respective flows traversing the network. IntServ architectures [3] (e.g. RSVP) achieve this goal at expense of transmitting and maintaining per-flow state information along the reservation path, which is a complex and not scalable approach.…”

Section: Introductionmentioning

confidence: 99%