Results 1  10
of
11
A generalized processor sharing approach to flow control in integrated services networks: The singlenode case
 IEEE/ACM Transactions on Networking
, 1993
"... AbstruetThe problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuiq comectionbased packet network. We show that the use of Generalized processor Sharing (GPS), w ..."
Abstract

Cited by 1666 (4 self)
 Add to MetaCart
AbstruetThe problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuiq comectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when combined with Leaky Bucket admission control, allows the network to make a wide range of worstcase performance guarantees on throughput and delay. The scheme is flexible in that d~erent users may be given widely different performance guarantees, and is efilcient in that each of the servers is work conserving. We present a practicat packetbypacket service discipline, PGPS (first proposed by Deme5 Shenker, and Keshav [7] under the name of Weighted Fair Queueing), that closely approximates GPS. This altows us to relate ressdta for GPS to the packetbypacket scheme in a precise manner. In this paper, the performance of a singleserver GPS system is analyzed exactty from the standpoint of worstcase packet delay and burstiness when the sources are constrained by leaky buckets. The worstcase sewdon backlogs are also determined. In the sequel to this paper, these results are extended to arbitrary topology networks with multiple nodes. I.
Effective Bandwidths for Multiclass Markov Fluids and Other ATM Sources
, 1993
"... We show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely,we show that when such sources share a buffer with deterministic service rate, a constraint on the tail of the buffer occupancy distribution is a l ..."
Abstract

Cited by 187 (14 self)
 Add to MetaCart
We show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely,we show that when such sources share a buffer with deterministic service rate, a constraint on the tail of the buffer occupancy distribution is a linear constraint on the number of sources. That is, for a small loss probability one can assume that each source transmits at a fixed rate called its effective bandwidth. When traffic parameters are known, effective bandwidths can be calculated and may be used to obtain a circuitswitched style call acceptance and routing algorithm for ATM networks. The important feature of the effective bandwidth of a source is that it is a characteristic of that source and the acceptable loss probability only.Thus, the effective bandwidth of a source does not depend on the number of sources sharing the buffer nor on the model parameters of other types of sources sharing the buffer.
Realtime communication in packetswitched networks
 PROC. IEEE
, 1994
"... The dramatically increased bandwidths and processing capabilities of future highspeed networks make possible many distributed realtime applications, such as sensorbased applications and multimedia services. Since these applications will have traffic characteristics and performance requirements th ..."
Abstract

Cited by 102 (5 self)
 Add to MetaCart
The dramatically increased bandwidths and processing capabilities of future highspeed networks make possible many distributed realtime applications, such as sensorbased applications and multimedia services. Since these applications will have traffic characteristics and performance requirements that differ dramatically from those of current dataoriented applications, new communication network architectures and protocols will be required. In this paper we discuss the performance requirements and traffic characteristics of various realtime applications, survey recent developments in the areas of network architecture and protocols for supporting realtime services, and develop frameworks in which these, and future, research efforts can be considered.
Decoupling bandwidths for networks: A decomposition approach to resource management for networks
 In Proceedings of INFOCOM’94, IEEE
, 1994
"... We consider large buffer asymptotics for feedforward networks of discretetime queues with deterministic service rate shared by multiple classes of streams subject to work conserving service policies. First we review the concept of effective bandwidths for traffic streams sharing a common buffer su ..."
Abstract

Cited by 57 (3 self)
 Add to MetaCart
We consider large buffer asymptotics for feedforward networks of discretetime queues with deterministic service rate shared by multiple classes of streams subject to work conserving service policies. First we review the concept of effective bandwidths for traffic streams sharing a common buffer subject to subject to tail constraints on the workload distribution. Next, we obtain the effective bandwidth of the departure process from such a queue, proving that in fact the effective bandwidth of the output is at worst equal to that of the input, and depending on the service rate, strictly less than that of the input. We then define the notion of a decoupling bandwidth and the associated constraints, guaranteeing that asymptotics within the network are decoupled. These results provide a framework for call admission schemes which are sensitive to constraints on the tail distribution of the workload or approximate cell loss probabilities. Our results require relatively weak assumptions on both the traffic streams and service policies. We consider the problem of “optimal ” traffic shaping (via buffering) subject to a loss constraint. Finally, we discuss our results in the context of resource management for ATM networks. 1
A Network Calculus with Effective Bandwidth
, 2003
"... We present a statistical network calculus in a setting where both arrivals and service are specified interms of probabilistic bounds. We provide explicit bounds on delay, backlog, and output burstiness in a network. By formulating wellknown effective bandwidth expressions in terms of envelope func ..."
Abstract

Cited by 39 (10 self)
 Add to MetaCart
We present a statistical network calculus in a setting where both arrivals and service are specified interms of probabilistic bounds. We provide explicit bounds on delay, backlog, and output burstiness in a network. By formulating wellknown effective bandwidth expressions in terms of envelope functions,we are able to apply our calculus to a wide range of traffic source models, including Fractional Brownian Motion. We present probabilistic lower bounds on the service for three scheduling algorithms: Static Priority (SP), Earliest Deadline First (EDF), and Generalized Processor Sharing (GPS).
Providing Quality of Service in Packet Switched Networks
 Performance Evaluation of Computer and Communications Systems
, 1993
"... Increases in bandwidths and processing capabilities of future packet switched networks will give rise to a dramatic increase in the types of applications using them. Many of these applications will require guaranteed quality of service (QOS) such as a bound on the maximum endtoend packet delay and ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
Increases in bandwidths and processing capabilities of future packet switched networks will give rise to a dramatic increase in the types of applications using them. Many of these applications will require guaranteed quality of service (QOS) such as a bound on the maximum endtoend packet delay and/or on the probability of packet loss. This poses exciting challenges to network designers. In this paper we discuss the QOS requirements of different applications and survey recent developments in the areas of call admission, link scheduling, and the interaction between the provision of QOS and call routing and traffic monitoring and policing. We identify what some of the important issues are in these areas and point out important directions for future research efforts. Keywords: quality of service, call admission, realtime services, link scheduling. Appeared in Performance Evaluation of Computer and Communication Systems (ed. L. Donatiello, R. Nelson), pp. 560586, Springer Verlag, 1993. ...
Upper and Lower Bounds for the Multiplexing of Multiclass Markovian On/Off Sources
 Evaluation
, 1996
"... In this paper, we consider a multiplexer with constant output rate and infinite buffer capacity fed by independent Markovian fluid on/off sources. We do not suppose that the model is symmetrical: there is an arbitrary number K of different traffic classes, and for each class k, an arbitrary number N ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
In this paper, we consider a multiplexer with constant output rate and infinite buffer capacity fed by independent Markovian fluid on/off sources. We do not suppose that the model is symmetrical: there is an arbitrary number K of different traffic classes, and for each class k, an arbitrary number N k of sources of this class. We derive lower and upper bounds for the stationary distribution of the backlog X of the form B exp(\Gamma` ? x) P(X ? x) C(`) exp(\Gamma`x), with 0 ` ` ? . When K = 2 or K = 1, we numerically compare our bounds to the exact distribution of X and to other previously known results. Through various examples, we discuss the behavior of P(X ? x) and the tightness of the bounds.
Design and Analysis of a HighPerformance Packet Multiplexer for Multiservice Networks with Delay Guarantees
, 1994
"... A major challenge for the design of multiservice networks with quality of service guarantees is an efficient implementation of a bounded delay service, that is, a service that guarantees maximum endtoend delays for every packet from a single traffic stream. A crucial component of a bounded delay s ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A major challenge for the design of multiservice networks with quality of service guarantees is an efficient implementation of a bounded delay service, that is, a service that guarantees maximum endtoend delays for every packet from a single traffic stream. A crucial component of a bounded delay service is the packet multiplexing technique employed at network switches that must keep the variable statistical multiplexing delays below a predetermined threshold. To achieve a high utilization of network resources, the multiplexing technique must be sufficiently sophisticated to support a variable set of delay bounds for a large number of traffic streams. On the other hand, since multiplexing of packets is to be performed at the data rate of the network links, the complexity of the multiplexer should be strictly limited. A novel packet multiplexing technique, called Rotating Priority Queues (RPQ), is presented which exploits the tradeoff between efficiency, i.e., the ability to support many connections with delay bounds, and low complexity. The operations required by the RPQ multiplexer are similar to those of the simple, but inefficient, Static Priority (SP) multiplexer. The overhead of RPQ, as compared to SP, consists of a periodic rearrangement (rotation) of the priority queues. It is shown that queue rotations can be implemented by updating a set of pointers. The efficiency of RPQ can be made arbitrarily close to the highly efficient, yet complex, Earliest Deadline First (EDF) multiplexer. Exact expressions for the worst case delays in an RPQ multiplexer are derived and compared to expressions for an EDF multiplexer.
STABILITY OF JACKSONTYPE QUEUEING NETWORKS, I
, 1999
"... This paper gives a pathwise construction of Jacksontype queueing networks allowing the derivation of stability and convergence theorems under general probabilistic assumptions on the driving sequences; namely, it is only assumed that the input process, the service sequences and the routing mechanis ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper gives a pathwise construction of Jacksontype queueing networks allowing the derivation of stability and convergence theorems under general probabilistic assumptions on the driving sequences; namely, it is only assumed that the input process, the service sequences and the routing mechanism are jointly stationary and ergodic in a sense that is made precise in the paper. The main tools for these results are the subadditive ergodic theorem, which is used to derive a strong law of large numbers, and basic theorems on monotone stochastic recursive sequences. The techniques which are proposed here apply to other and more general classes of discrete event systems, like Petri nets or GSMP’s. The paper also provides new results on the Jacksontype networks with i.i.d. driving sequences which were studied in the past.
Scaling Properties in the Stochastic Network Calculus
, 2007
"... Modern networks have become increasingly complex over the past years in terms of control algorithms, applications and service expectations. Since classical theories for the analysis of telephone networks were found inadequate to cope with these complexities, new analytical tools have been conceived ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Modern networks have become increasingly complex over the past years in terms of control algorithms, applications and service expectations. Since classical theories for the analysis of telephone networks were found inadequate to cope with these complexities, new analytical tools have been conceived as of late. Among these, the stochastic network calculus has given rise to the optimism that it can emerge as an elegant mathematical tool for assessing network performance. This thesis argues that the stochastic network calculus can provide new analytical insight into the scaling properties of network performance metrics. In this sense it is shown that endtoend delays grow as Θ(H log H) in the number of network nodes H, as opposed to the Θ(H) order of growth predicted by other theories under simplifying assumptions. It is also shown a comparison between delay bounds obtained with the stochastic network calculus and exact results available in some productform queueing networks. The main technical contribution of this thesis is a construction of a statistical network service curve that expresses the service given to a flow by a network as if the flow traversed a single node only. This network service curve enables the proof of the O(H log H) scaling