Add to ORKGWe suggest the use of maximum allowable delays through a switch as a tool for the control of Quality of Service (QoS) for classes of real-time traffic in ATM. Our proposed admission control (AC) procedure may accept an incoming cell, or decide to drop it at the input to avoid needless congestion when it appears that the cell\u27s delay constraints will not be respected, or when the AC considers that the cell may cause excessive delay for other cells. Simulations show that early cell drop based algorithms provide better overall performance and that they are robust to variations in traffic characteristics
[[abstract]]In this paper, we present an efficient cell multiplexing method, called longest delay be...
We present a method for providing hard real-time guarantees for traffic through an Asynchronous Tran...
We consider policies for deciding which cells will be lost or dropped when losses occur at a finite ...
[[abstract]]This paper concerns with the problem of supporting multiple QOS classes for BISDN servic...
[[abstract]]This paper concerns with the problem of supporting multiple QoS classes for BISDN servic...
An ATM quality of service (QoS) controller which combines perconnection buffer management with a tab...
Abstract—We propose an admission control scheme to guarantee a certain level of QoS to on-going conn...
: This paper studies the behaviour of rate-based traffic control mechanisms for ATM networks, and ev...
The challenge in building an ATM switch, especially in the area of QoS control, lies in the design o...
A CAC algorithm must efficiently determine if a new connection can be admitted by verifying that its...
This paper presents a heuristic approach to the problem of call admission control. The algorithm is ...
The scheduling scheme of a switch affects the delay, throughput and fairness of a network and thus h...
A dynamic call admission control scheme is proposed for ATM networks to support multiple Quality of ...
In this paper, we present an admission control technique for mixed real-time and non-real-time traff...
AbstractIn this paper, we propose a versatile scheduling discipline, called Precedence with Partial ...
[[abstract]]In this paper, we present an efficient cell multiplexing method, called longest delay be...
We present a method for providing hard real-time guarantees for traffic through an Asynchronous Tran...
We consider policies for deciding which cells will be lost or dropped when losses occur at a finite ...
[[abstract]]This paper concerns with the problem of supporting multiple QOS classes for BISDN servic...
[[abstract]]This paper concerns with the problem of supporting multiple QoS classes for BISDN servic...
An ATM quality of service (QoS) controller which combines perconnection buffer management with a tab...
Abstract—We propose an admission control scheme to guarantee a certain level of QoS to on-going conn...
: This paper studies the behaviour of rate-based traffic control mechanisms for ATM networks, and ev...
The challenge in building an ATM switch, especially in the area of QoS control, lies in the design o...
A CAC algorithm must efficiently determine if a new connection can be admitted by verifying that its...
This paper presents a heuristic approach to the problem of call admission control. The algorithm is ...
The scheduling scheme of a switch affects the delay, throughput and fairness of a network and thus h...
A dynamic call admission control scheme is proposed for ATM networks to support multiple Quality of ...
In this paper, we present an admission control technique for mixed real-time and non-real-time traff...
AbstractIn this paper, we propose a versatile scheduling discipline, called Precedence with Partial ...
[[abstract]]In this paper, we present an efficient cell multiplexing method, called longest delay be...
We present a method for providing hard real-time guarantees for traffic through an Asynchronous Tran...
We consider policies for deciding which cells will be lost or dropped when losses occur at a finite ...