The robustness of stability under link and node failures

[1]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[2]  Allan Borodin,et al.  Adversarial queueing theory , 1996, STOC '96.

[3]  Baruch Awerbuch,et al.  Universal stability results for greedy contention-resolution protocols , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[4]  Lisa Zhang,et al.  Stability results for networks with input and output blocking , 1998, STOC '98.

[5]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[6]  Christian Scheideler,et al.  Simple routing strategies for adversarial systems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[7]  Baruch Awerbuch,et al.  Universal-stability results and performance bounds for greedy contention-resolution protocols , 2001, JACM.

[8]  Allan Borodin,et al.  Stability preserving transformations: packet routing networks with edge capacities and speeds , 2001, SODA '01.

[9]  Paul G. Spirakis,et al.  On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols , 2002, DISC.

[10]  Boaz Patt-Shamir,et al.  New stability results for adversarial queuing , 2002, SPAA '02.

[11]  Jon M. Kleinberg,et al.  Stability of load balancing algorithms in dynamic adversarial systems , 2002, STOC '02.

[12]  A Note on Models for Non-Probabilistic Analysis of Packet-Switching Networks , 2002 .

[13]  Paul G. Spirakis,et al.  Instability of Networks with Quasi-Static Link Capacities , 2003, SIROCCO.

[14]  Lisa Zhang,et al.  Achieving stability in networks of input-queued switches , 2003, TNET.

[15]  Josep Díaz Cort,et al.  The Complexity of deciding stability under FFS in the adversarial model , 2003 .

[16]  Maria J. Serna,et al.  Adversarial Models for Priority-Based Networks , 2003, MFCS.

[17]  Ashish Goel,et al.  Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model , 2004, SIAM J. Comput..

[18]  Maria J. Serna,et al.  The complexity of deciding stability under FFS in the Adversarial Queueing model , 2004, Inf. Process. Lett..

[19]  Maria J. Serna,et al.  A Characterization of Universal Stability in the Adversarial Queuing Model , 2004, SIAM J. Comput..

[20]  Adi Rosén,et al.  On Delivery Times in Packet Networks under Adversarial Traffic , 2004, SPAA '04.

[21]  Maik Weinard.  The Necessity of Timekeeping in Adversarial Queueing , 2005, WEA.

[22]  Maik Weinard.  Deciding the FIFO Stability of Networks in Polynomial Time , 2006, CIAC.

[23]  Juan Martínez-Romo,et al.  Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks , 2007, 2007 12th IEEE Symposium on Computers and Communications.

[24]  Maria J. Serna,et al.  Adversarial Queueing Model for Continuous Network Dynamics , 2007, Theory of Computing Systems.

[25]  Paul G. Spirakis,et al.  Performance and stability bounds for dynamic networks , 2007, J. Parallel Distributed Comput..