Добавил:
Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:
Burgess M.Principles of network and system administration.2004.pdf
Скачиваний:
181
Добавлен:
23.08.2013
Размер:
5.65 Mб
Скачать

536

CHAPTER 13. ANALYTICAL SYSTEM ADMINISTRATION

f(t ) - signal

Time

Fourier transform

Frequency

Figure 13.16: Fourier analysis is like a prism, showing us the separate frequencies of which a signal is composed. The sharp peaks in this figure illustrate how we can identify periodic behavior which might otherwise be difficult to identify. The two peaks show that the input source conceals two periodic signals.

13.8 Strategic analyses

The use of formal mathematics to analyze system administration has so far been absent from the discussion. There are two reasons why such analyses are of interest: i) a formal description of a subject often reveals expectations and limitations which were invisible prior to the systematic model, and ii) optimal solutions to problems can be explored, avoiding unnecessary prejudice.

The languages of Game Theory [47] and Dynamical Systems [46] will enable us to formulate and model assertions about the behavior of systems under certain administrative strategies. At some level, the development of a computer system is a problem in economics: it is a mixed game of opposition and cooperation between users and the system. The aims of the game are several: to win resources, to produce work, to gain control of the system, and so on. A proper understanding of the issues should lead to better software and better strategies from human administrators. For instance, is greed a good strategy for a user? How could one optimally counter such a strategy? In some cases it might even be possible to solve system administration games, determining the maximum possible ‘win’ available in the conflict between users and administrators. These topics are somewhat beyond the scope of this book.

13.9 Summary

Finding a rigorous experimental and theoretical basis for system administration is not an easy task. It involves many entwined issues, both technological and sociological. A systematic discussion of theoretical ideas may be found in ref. [52]. The sociological factors in system administration cannot be ignored, since the goal of system administration is, amongst other things, user satisfaction. In this respect one is forced to pay attention to heuristic evidence, as rigorous statistical analysis of a specific effect is not always practical or adequately separable from whatever else is going on in the system. The study of computers is a study of complexity.

EXERCISES

537

Exercises

Self-test objectives

1.What is meant by a scientific approach to system administration?

2.What does complexity really mean?

3.Explain the role of observation in making judgments about systems.

4.How can one formulate criteria for the evaluation of system policies?

5.How is reliability defined?

6.What principles contribute to increased reliability?

7.Describe heuristically how you would expect key variables, such as numbers of processes and network transactions, to vary over time. Comment on what this means for the detection of anomalies in these variables.

8.What is a stochastic system? Explain why human–computer systems are stochastic.

9.What is meant by convergence in the context of system administration?

10.What is meant by regulation?

11.Explain how errors of measurement can occur in a computer.

12.Explain how errors of measurement should be dealt with.

Problems

1.Consider the following data which represent a measurement of CPU usage for a process over time:

2.1

2.0

2.1

2.2

2.2

1.9

2.2

2.2

2.1

2.2

2.2

Now answer the following:

(a)To the eye, what appears to be the correct value for the measurement?

(b)Is there a correct value for the measurement?

538

CHAPTER 13. ANALYTICAL SYSTEM ADMINISTRATION

(c)What is the mean value?

(d)What is the standard deviation?

(e)If you were to quote these data as one value, how would you quote the result of the measurement?

2.What is meant by random errors? Explain why computers are not immune to random errors.

3.Explain what is meant by Mean Time Before Failure. How is this quantity measured? Can sufficient measurements be made to make its value credible?

4.If a piece of software has a MTBF of two hours and an average downtime of 15 seconds, does it matter that it is unstable?

5.Explain why one would expect measurements of local SMTP traffic to show a strong daily rhythm, while measurements of incoming traffic would not necessarily have such a pronounced daily rhythm.

6.Discuss whether one would expect to see a daily rhythm in WWW traffic. If such a rhythm were found, what would it tell us about the source of the traffic?

7.Describe a procedure for determining causality in a computer network. Explain any assumptions and limitations which are relevant to this.

8.Explain why problems with quite different causes often lead to the same symptoms.