Learn More
We consider the following queuing system which arises as a model of a wireless link shared by multiple users+ There is a finite number N of input flows served by a server+ The system operates in discrete time t ϭ 0,1,2, + + + + Each input flow can be described as an irreducible countable Markov chain; waiting customers of each flow are placed in a queue+(More)
— Generalized Processor Sharing (GPS) is a scheduling discipline which provides minimum service guarantees as well as fair resource sharing. The performance of GPS is governed by the scheduling weights associated with individual connections. We address the design of the GPS weights, along with the related Connection Admission Control (CAC). Our main goal is(More)
—The main network solutions for supporting QoS rely on traffic policing (conditioning, shaping). In particular, for IP networks the IETF has developed Intserv (individual flows regulated) and Diffserv (only aggregates regulated). The regulator proposed could be based on the (dual) leaky-bucket mechanism. This explains the interest in network element(More)
We consider a switching system that has multiple ports that share a common buffer, in which there is a FIFO logical queue for each port. Each port may support a large number of flows or connections, which are approximately homogeneous in their statistical characteristics, with common QoS requirements in cell loss and maximum delay. Heterogeneity may exist(More)
—We address the problem of estimating the spectrum required in a wireless network for a given demand and interference pattern. This problem can be abstracted as a generalization of the graph coloring problem, which typically presents additional degree of hardness compared to the standard coloring problem. It is worthwhile to note that the question of(More)