ANDREWS, M. 2000. Instability of FIFO in session-oriented networks. In Proceedings of the 11th Annual ACM--SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 9 --11). ACM, New York, pp. 440 -- 447.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Systems General Terms Algorithms, Performance, Theory Keywords Adversarial queuing theory 1. INTRODUCTION Recent years have seen a growing amount of work being concentrated on analyzing packet switching networks under non probabilistic scenarios rather than under probabilistic assumptions [6, 2, 4, 12, 10, 11, 1, 3]. Much of this work makes use of the model of adversarial queuing theory proposed by Borodin et al. 6] The basic model can be briefly described as follows. Time proceeds in discrete steps. In each step, packets are injected into the system with their routes. Each packet traverses its ....

M. Andrews, Instability of FIFO in Session Oriented Networks. In Proc. of the 11th SODA, 2000.

....Foundation through grants ANI 9730103, ECS 9875688 (CAREER) ANI 9903001, DMS 9971493, and ANI 0085955, and by an Alfred P. Sloan research fellowship. that is, finiteness of delays and backlog, in a network where per flow regulation is only performed at the network edge has been studied in [2], 17] and, under a broader set of assumptions, in [4] The authors of [9] derive bounds on the utilization such that end to end delay bounds in a network with FIFO scheduling are finite, when the total number of flows in the network is known and when leakybucket regulators control the traffic ....

M. Andrews. Instability of FIFO in session-oriented networks. In Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2000.

....a few notable exceptions (e.g. 19] While the throughput condition remains necessary for the stability of such networks, it is no longer sufcient. A number of examples given in [16] illustrate this fact. Recent results show that even networks of FIFO queues with ##### sessions may be unstable [1]. It is worth noting that an upper bound on the delay in arbitrary non feed forward networks has recently been derived in [7] Unfortunately, this bound is useful only for very small link utilization. Specically, the maximum achievable link utilization is inversely proportional to the maximum ....

M. Andrews, Instability of FIFO in Session-Oriented Networks, in the proceedings of SODA 2000.

....However, it is not easy to capture the burstiness increase due to FIFO multiplexing, and this does not appear to be done in a general setting. Partial results indicate that, on one hand, in some cases, FIFO multiplexing may lead to instability, even when the maximum utilization is less than 1 [1,12]. On the other hand, under some strict conditions on source rate or on multiplexing architecture, one can find explicit delay and burstiness bounds for a FIFO ATM network [9,10,16] Our problem is to quantify the worst case burstiness increase due to FIFO multiplexing. More precisely, given the ....

M. Andrews, Instability of fifo in session-oriented networks, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000.

....ECS 9875688 (CAREER) ANI 9903001, DMS 9971493, and ANI 0085955, and by an Alfred P. Sloan research fellowship. stability with aggregate scheduling, that is, finiteness of delays and backlog, in a network where per flow regulation is only performed at the network edge has been studied in [2, 17] and under a broader set of assumptions in [4] The authors of [8] derive bounds on the utilization such that end to end delay bounds in a network with FIFO scheduling are finite, when the total number of flows in the network is known and when leaky bucket regulators control the traffic from each ....

M. Andrews. Instability of FIFO in session-oriented networks. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000.

....for stability. It was proven that acyclic and unidirectional ring queueing networks are stable whenever the load condition is met and an arbitrary greedy schedule is implemented [3] 6] 16] Meanwhile certain natural policies were shown to be unstable even if the load condition holds. Andrews [2], Andrews et al. 3] showed that First In First Out (FIFO) and Nearest To Go (NTG) policies can be unstable. Instability of FIFO policies was also shown before by Bramson [7] for non adversarial (stochastic) queueing networks. Borodin et al. 6] showed that NTG policy can be unstable in certain ....

M. Andrews. Instability of FIFO in session-oriented networks. Proc. 11th A CM-SIAM Symposium on Discrete Algorithms, 2000.

....show that this fails to hold when the hot potato constraint is present and the ratio can take a variety of values depending on the structure of the graph. The third line of research is the study adversarial queuing networks initiated by Borodin et al. 8] and followed by several other works [3] [2], 4] 12] 1] 11] 10] Simple stable scheduling policies were constructed in [3] and [10] which achieve stability as long as the arrival rate r 1. We will show in this paper that this fails to hold in most of the networks if hot potato constraint on the schedule needs to be satisfied. 1.3 Our ....

....that the relative congestion is equal to one if and only if the graph is a star tree, i.e. a tree that contains only one node with the degree three or higher, or if the graph is a cycle. We close the section by analyzing relative congestion on trees. We prove that it always lies in the interval [1, 2] by constructing an algorithm which achieves ratio C(algorithm) Lrnax 2. We also provide an example of a tree for which the relative congestion is at least 7 6 1 and conjecture that for certain trees it can be equal to 2. The implications of the results above to adversarial queuing networks ....

M. Andrews. Instability of FIFO in session-oriented networks. Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 2000.

....a few notable exceptions (e.g. 19] While the throughput condition remains necessary for the stability of such networks, it is no longer sufficient. A number of examples given in [16] illustrate this fact. Recent results show that even networks of FIFO queues with (#, #) sessions may be unstable [1]. It is worth noting that an upper bound on the delay in arbitrary non feed forward networks has recently been derived in [7] Unfortunately, this bound is useful only for very small link utilization. Specifically, the maximum achievable link utilization is inversely proportional to the maximum ....

M. Andrews, "Instability of FIFO in Session-Oriented Networks," in the proceedings of SODA

....a few notable exceptions (e.g. 17] While the throughput condition remains necessary for the stability of such networks, it is no longer sufficient. A number of examples given in [14] illustrate this fact. Recent results show that even networks of FIFO queues with ( sessions may be unstable [1]. An upper bound on the delay in arbitrary non feed forward networks has recently been derived in [7] Unfortunately, this bound is useful only for very small link utilization. Specifically, the maximum achievable link utilization is inversely proportional to the maximum route length of any flow ....

M. Andrews, "Instability of FIFO in Session-Oriented Networks," in the proceedings of SODA

....a few notable exceptions (e.g. 18] While the throughput condition remains necessary for the stability of such networks, it is no longer sufficient. A number of examples given in [15] illustrate this fact. Recent results show that even networks of FIFO queues with (#, #) sessions may be unstable [1]. An upper bound on the delay in arbitrary non feed forward networks has recently been derived in [7] Unfortunately, this bound is useful only for very small link utilization. Specifically, the maximum achievable link utilization is inversely proportional to the maximum route length of any flow ....

M. Andrews, "Instability of FIFO in Session-Oriented Networks," in the proceedings of SODA

....shown that a uni directional ring is stable for any utilization factor less than 1, assuming that there is only one type of traffic and links are dedicated. The proof does not hold, even for a ring, for a GPS scheduler, therefore it does not hold for the definition we are proposing for EF. Andrews [14] has exhibited an unstable, session oriented network, with utilization factor # (a critical network) and claims that this also holds for some sub critical networks, but the proof is not conclusive. In addition, Andrews [14] describes a startling fact referred to as the non monotone property ....

....it does not hold for the definition we are proposing for EF. Andrews [14] has exhibited an unstable, session oriented network, with utilization factor # (a critical network) and claims that this also holds for some sub critical networks, but the proof is not conclusive. In addition, Andrews [14] describes a startling fact referred to as the non monotone property of FIFO networks, where it is shown that a network that is stable with a set of sessions with given rates may become unstable if the rates of some of these sessions are reduced for a period of time. On the other side of the ....

M. Andrews, "Instability of fifo in session-oriented networks," in Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), January 2000.

No context found.

M. Andrews, "Instability of FIFO in session-oriented networks," Journal of Algorithms, vol. 50, no. 2, pp. 232--245, 2004.

No context found.

M. Andrews, "Instability of FIFO in session-oriented networks," Journal of Algorithms, vol. 50, no. 2, pp. 232--245, 2004.

No context found.

M. Andrews, "Instability of FIFO in session-oriented networks," Journal of Algorithms, vol. 50, no. 2, 2004.

No context found.

M. Andrews, "Instability of FIFO in session-oriented networks," Journal of Algorithms, vol. 50, no. 2, pp. 232--245, 2004.

No context found.

ANDREWS, M. 2000. Instability of FIFO in session-oriented networks. In Proceedings of the 11th Annual ACM--SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 9 --11). ACM, New York, pp. 440 -- 447.

No context found.

M. Andrews, Instability of FIFO in Session Oriented Networks. In Proc. of the 11th SODA, 2000.

No context found.

M. Andrews, Instability of FIFO in session oriented networks, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2000, pp. 440--447.

No context found.

M. Andrews, Instability of FIFO in Session Oriented Networks. In Proc. of the 11th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.440-447, 2000.

No context found.

M. Andrews. Instability of fifo in session-oriented networks. In Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000.

No context found.

M. Andrews. Instability of fifo in session-oriented networks. In Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000.

No context found.

M. Andrews. Instability of fifo in session-oriented networks. In Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000.

No context found.

M. Andrews. Instability of FIFO in session-oriented networks. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 440--447, 2000.

No context found.

Matthew Andrews, "Instability of FIFO in session-oriented networks," in Proceedings of the Symposium on Disscrete Algorithms (SODA), 2000, To appear.

No context found.

Matthew Andrews. Instability of fifo in session-oriented networks. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 440--447, 2000.

No context found.

M. Andrews. Instability of FIFO in session-oriented networks. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000.

No context found.

M. Andrews, Instability of FIFO in Session Oriented Networks. In Proc. of the 11th SODA, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC