On identifying stable ways to configure systems

Proceedings - International Conference on Autonomic Computing

Volumn , Issue , 2004, Pages 148-153

  Aggarwal, Gagan ^a   Datar, Mayur ^b   Mishra, Nina ^c   Motwani, Rajeev ^a  

^a Stanford University   (United States)

^b GOOGLE INC   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ONLINE ALGORITHMS; STABLE SYSTEMS; SYSTEM CONFIGURATION; SYSTEM FAILURES;

ALGORITHMS; AUTOMATION; COMPUTER HARDWARE; COMPUTER SIMULATION; COMPUTER SOFTWARE; DATA ACQUISITION; INTERNET; PROBABILITY;

COMPUTER SYSTEMS;

EID: 4544226786     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICAC.2004.1301358     Document Type: Conference Paper

References (14)

1. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
2. A. Borodin, N. Linial, and M. Saks. An optimal on-line algorithm for metrical task system, Journal of the ACM, 39(4):745-763, Oct. 1992.
3. S. Chen and K. Nahrstedt. On finding multi-constrained paths. In Proc. of the IEEE International Conference on Communications, pages 874-879, 1998.
4. P. Enriquez, A. Brown, and D. Patterson. Lessons from the pstn for dependable computing. Workshop on Self-Healing, Adaptive, and Self-Managed systems, 2002.
5. A. Fox and D. Patterson, Self-repairing computers. Scientific American, June 2003.
6. A. Goel, K. G. Ramakrishnan, D. Kataria, and D. Logothetis, Efficient computation of delay-sensitive routes from one source to all destinations. In INFOCOM, pages 854-858, 2001.
7. I. Gray. Why do computers stop and what can be done about it? Proc. of the 5th Symposium on Reliablity in Distributed Software and Database systems, Jan. 1986.
8. R. Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17:36-42, 1992.
9. T. Korkmaz and M. Krunz. Multi-constrained optimal path selection. In INFOCOM, pages 834-843, 2001.
10. T. Korkmaz, M. Krunz, and S. Tragoudas. An efficient algorithm for finding a path subject to two additive constraints. In Measurement and Modeling of Computer Systems, pages 318-327, 2000.
11. M. Manasse, L. McGeoch, and D. Sleator, Competitive algorithms for server problems. Journal of Algorithms, 11(2):208-230, June 1990.
12. D. Oppenheimer, A. Ganapathi, and D. Patterson. Why do internet services fail, and what can be done about it? 4th USENIX Symposium on Internet Technologies and Systems, Mar. 2003.
13. P. Paul and S. Raghavan. Survey of qos routing. In Proc. of the 15th Intl Conference on Computer Communication, 2002.
14. X. Yuan and X. Liu. Heuristic algorithms for multiconstrained quality of service routing. In INFOCOM, pages 844-853, 2001.