Results 1  10
of
13
E.: Tight performance bounds in the worstcase analysis of feedforward networks
"... feedforward networks ..."
(Show Context)
Optimal routing for endtoend guarantees: the price of multiplexing
, 2007
"... ..."
(Show Context)
Oscillations with TCPlike Flow Control in Networks of Queues
 In Proceedings of IEEE INFOCOM ’06
, 2006
"... Abstract — We consider a set of flows passing through a set of servers. The injection rate into each flow is governed by a flow control that increases the injection rate when all the servers on the flow’s path are empty and decreases the injection rate when some server is congested. We show that if ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract — We consider a set of flows passing through a set of servers. The injection rate into each flow is governed by a flow control that increases the injection rate when all the servers on the flow’s path are empty and decreases the injection rate when some server is congested. We show that if each server’s congestion is governed by the arriving traffic at the server then the system can oscillate. This is in contrast to previous work on flow control where congestion was modeled as a function of the flow injection rates and the system was shown to converge to a steady state that maximizes an overall network utility.
Computation of a (min,+) multidimensional convolution for endtoend performance analysis
 In Proceedings of Valuetools’2008
, 2008
"... performance analysis. ..."
(Show Context)
Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers
"... Abstract—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing sufficient conditions for stability (the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing sufficient conditions for stability (the possibility to derive bounds to delay and backlog at each node) are of little practical utility, as they are either relative to specific topologies, or based on strong ATMlike assumptions on the network (the socalled ”RIN ” result), or they imply an extremely low node utilization. We use a deterministic approach to this problem. We identify a nonlinear operator on a vector space of finite (but large) dimension, and we derive a first sufficient condition for stability, based on the superadditive closure of this operator. Second, we use different upper bounds of this operator to obtain practical results. We find new sufficient conditions for stability, valid in an heterogeneous environment and without any of the restrictions of existing results. We present a polynomial time algorithm to test our sufficient conditions for stability. We show that with leaky bucket constrained flows the inner bound to the stability region derived with our algorithm is always larger than the one determined by all existing results. We prove that all the main existing results can be derived as special cases of our results. We also present a method to compute delay bounds in practical cases.
Packet Forwarding Algorithms in a Line Network
"... Abstract. We initiate a competitive analysis of packet forwarding policies for maximum and average flow in a line network. We show that the policies Earliest Arrival and FurthestToGo are scalable, but not constant competitive, for maximum flow. We show that there is no constant competitive algor ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We initiate a competitive analysis of packet forwarding policies for maximum and average flow in a line network. We show that the policies Earliest Arrival and FurthestToGo are scalable, but not constant competitive, for maximum flow. We show that there is no constant competitive algorithm for average flow. 1
synchronized clocks
"... of scheduling policies in adversarial networks with non ..."
(Show Context)