Results 1  10
of
765
Stable Priority Disciplines for Multiclass Networks
, 1996
"... It is well known that a multiclass network may not be stable under the usual traffic condition that the arrived nominal workload is less than one. That this instability may happen in many "favorite" disciplines (such as firstinfirstout, shorted expected service times, and shorted exp ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
It is well known that a multiclass network may not be stable under the usual traffic condition that the arrived nominal workload is less than one. That this instability may happen in many "favorite" disciplines (such as firstinfirstout, shorted expected service times, and shorted
Enhancing QoS Metrics Estimation in Multiclass Networks
"... This paper discusses the problematic of QoS monitoring, suggesting the use of online multipurpose active monitoring in multiclass networks as a powerful tool to efficiently assist and enhance the control of multiple service levels. To improve the simultaneous estimation of oneway QoS metrics, we p ..."
Abstract
 Add to MetaCart
This paper discusses the problematic of QoS monitoring, suggesting the use of online multipurpose active monitoring in multiclass networks as a powerful tool to efficiently assist and enhance the control of multiple service levels. To improve the simultaneous estimation of oneway QoS metrics, we
Essential Faces and Stability Conditions of Multiclass Networks With Priorities
, 1996
"... : It is now wellknown that multiclass networks may be unstable even under the "usual conditions" of stability (when the loads are less than one at all queues), but the proofs of transience (in the Markovian case) generally require a complex work based on the dynamics of an associated &quo ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
: It is now wellknown that multiclass networks may be unstable even under the "usual conditions" of stability (when the loads are less than one at all queues), but the proofs of transience (in the Markovian case) generally require a complex work based on the dynamics of an associated
Performance Evaluation and Policy Selection in Multiclass Networks
, 2002
"... This paper concerns modelling and policy synthesis for regulation of multiclass queueing networks. A 2parameter network model is introduced to allow independent modelling of variability and mean processingrates, while maintaining simplicity of the model. Policy synthesis is based on consideration ..."
Abstract

Cited by 46 (26 self)
 Add to MetaCart
This paper concerns modelling and policy synthesis for regulation of multiclass queueing networks. A 2parameter network model is introduced to allow independent modelling of variability and mean processingrates, while maintaining simplicity of the model. Policy synthesis is based on consideration
Stability of Open Multiclass Networks in Adversarial Queueing Theory
, 2000
"... Queueing networks are important models of complex systems, such as packet routing networks, manufacturing systems, and time shared computer systems. In this paper, we investigate the question of stability of multiclass queueing networks within the adversarial queueing theory model, where workload is ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Queueing networks are important models of complex systems, such as packet routing networks, manufacturing systems, and time shared computer systems. In this paper, we investigate the question of stability of multiclass queueing networks within the adversarial queueing theory model, where workload
On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models
 Annals of Applied Probability
, 1995
"... It is now known that the usual traffic condition (the nominal load being less than one at each station) is not sufficient for stability for a multiclass open queueing network. Although there has been some progress in establishing the stability conditions for a multiclass network, there is no unified ..."
Abstract

Cited by 357 (27 self)
 Add to MetaCart
It is now known that the usual traffic condition (the nominal load being less than one at each station) is not sufficient for stability for a multiclass open queueing network. Although there has been some progress in establishing the stability conditions for a multiclass network
Fair endtoend windowbased congestion control
 IEEE/ACM TRANS. ON NETWORKING
, 2000
"... In this paper, we demonstrate the existence of fair endtoend windowbased congestion control protocols for packetswitched networks with first comefirst served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of maxmin fairness. T ..."
Abstract

Cited by 676 (3 self)
 Add to MetaCart
. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the practical implementation
A LEMKELIKE ALGORITHM FOR THE MULTICLASS NETWORK EQUILIBRIUM PROBLEM
, 2013
"... We consider a nonatomic congestion game on a connected graph, with several classes of players. Each player wants to go from its origin vertex to its destination vertex at the minimum cost and all players of a given class share the same characteristics: cost functions on each arc, and origindestin ..."
Abstract
 Add to MetaCart
destination pair. Under some mild conditions, it is known that a Nash equilibrium exists, but the computation of an equilibrium in the multiclass case is an open problem for general functions. We consider the specific case where the cost functions are affine and propose an extension of Lemkeâs algorithm able
A Multiclass Network With NonLinear, NonConvex, NonMonotonic Stability Conditions
 Queueing Systems, Theory and Applications
, 1995
"... We consider a stochastic queueing network with fixed routes and class priorities. The vector of class sizes forms a homogeneous Markov process with countable state space Z 6 + . Its conditions of ergodicity, which are identified with the conditions of stability of the network, depend on the vector ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
We consider a stochastic queueing network with fixed routes and class priorities. The vector of class sizes forms a homogeneous Markov process with countable state space Z 6 + . Its conditions of ergodicity, which are identified with the conditions of stability of the network, depend on the vector
Control of EndtoEnd Delay Tails in a Multiclass Network: LWDF Discipline Optimality
 Annals of Applied Probability
"... We consider a multiclass queueing network with N customer classes, each having an arbitrary fixed route through the network. (Thus, the network is not necessarily feedforward.) We show that the largest weighted delay first (LWDF) discipline is an optimal scheduling discipline in the network in the f ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
We consider a multiclass queueing network with N customer classes, each having an arbitrary fixed route through the network. (Thus, the network is not necessarily feedforward.) We show that the largest weighted delay first (LWDF) discipline is an optimal scheduling discipline in the network
Results 1  10
of
765