Next: About this document
Up: Designing Computer Networks to
Previous: Conclusions
References
- 1
-
C. Berge.
Graphs and Hypergraphs.
North-Holland/American Elsevier, Amsterdam, 1976.
- 2
-
P. Bernstein, V. Hadzilacos, and N. Goodman.
Concurrency Control and Recovery in Database Systems.
Addison-Wesley, Reading, MA, 1987.
- 3
-
S. Ceri and G. Pelagatti.
Distributed Databases: Principles and Systems.
McGraw-Hill, 1984.
- 4
-
D. Hsu and Y.-D. Lyuu.
A graph-theoretical study of transmission delay and fault tolerance.
In Fourth Int'l Workshop on Parallel and Distributed Computing
and Systems, 1990.
- 5
-
P. O'Neil, K. Baclawski, and F. Hsu.
Designing computer networks to avoid partitioning.
Information Systems, 18:343--348, 1993.
- 6
-
M. Özsu and P. Valduriez.
Principles of Distributed Database Systems.
Prentice-Hall, Englewood Cliffs, NJ, 1991.
- 7
-
D. Skeen.
Nonblocking commit protocols.
In Proc. SIGMOD, pages 133--142, 1981.
- 8
-
D. Skeen and M. Stonebraker.
A formal model of crash recovery in a distributed system.
IEEE Trans. Software Engineering, SE-9:219--228, 1983.
- 9
-
A. Tanenbaum.
Computer Networks.
Prentice-Hall, Englewood Cliffs, NJ, 1989.
Second Edition.

Kenneth Baclawski
Wed Nov 1 21:08:51 EST 1995