Distributed computing: Principles, algorithms, and systems

Distributed Computing: Principles, Algorithms, and Systems

Volumn 9780521876346, Issue , 2008, Pages 1-736

  Kshemkalyani, Ajay D ^a   Singhal, Mukesh ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; COMPUTATION THEORY; ENGINEERING EDUCATION; NETWORK SECURITY; PEER TO PEER NETWORKS; SENSOR NETWORKS; STUDENTS; TEXTBOOKS;

COMPLEX PROCESSES; DEADLOCK DETECTION; DISTRIBUTED COMPUTING SYSTEMS; ELECTRICAL AND COMPUTER ENGINEERING; FUNDAMENTAL PRINCIPLES; GRADUATE STUDENTS; MUTUAL EXCLUSIONS; PRACTICAL SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84923939174     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511805318     Document Type: Book

References (584)

1. A. Ananda, B. Tay, and E. Koh, A survey of asynchronous remore procedure calls, ACM SIGOPS Operating Systems Review, 26(2), 1992, 92-109.
2. H. Attiya and J. Welch, Distributed Computing Fundamentals, Simulations, and Advanced Topics, 2nd edn, Hoboken, NJ, Wiley Inter-Science, 2004.
3. V. Barbosa, An Introduction to Distributed Algorithms, Cambridge, MA, MIT Press, 1996.
4. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic, New York, Academic Press, 1965.
5. T. Berners-Lee, R. Cailliau, A. Luotonen, H. Nielsen, and A. Secret, The World-Wide Web, Communications of the ACM, 37(8), 1994, 76-82.
6. A. Birrell and B. Nelson, Implementing remote procedure calls, ACM Transactions on Computer Systems, 2(1), 1984, 39-59.
7. A. Campbell, G. Coulson, and M. Counavis, Managing complexity: middleware explained, IT Professional Magazine, October 1999, 22-28.
8. R. Chow and D. Johnson, Distributed Operating Systems and Algorithms, Reading, MA, Harlow, UK, Addison-Wesley, 1997.
9. C. Clos, A study of non-blocking switching networks, Bell Systems Technical Journal, 32, 1953, 406-424.
10. J. M. Cooley and J. W. Tukey, An algorithm for the machine calculation of complete Fourier series, Mathematical Computations, 19, 1965, 297-301.
11. G. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems Concepts and Design, Harlow, UK, 3rd edn, Addison-Wesley, 2001.
12. R. Cypher and E. Leu, The semantics of blocking and non-blocking send and receive primitives, Proceedings of the 8th International Symposium on Parallel Processing, 1994, 729-735.
13. T. Y. Feng, A survey of interconnection networks, IEEE Computer, 14, 1981, 12-27.
14. M. Flynn, Some computer organizations and their effectiveness, IEEE Transactions on Computers, C-21, 1972, 94.
15. I. Foster and C. Kesselman, Globus: a metacomputing infrastructure toolkit, International Journal of Supercomputer Applications, 11(2), 1997, 115-128.
16. I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure, San Francisco, CA, Morgan Kaufmann, 1998.
17. I. Foster, The Grid: a new infrastructure for 21st century science, Physics Today, 55(2), 2002, 42-47.
18. V. Garg, Elements of Distributed Computing, New York, John Wiley, 2002.
19. A. Goscinski, Distributed Operating Systems: The Logical Design, Reading, MA, Addison-Wesley, 1991.
20. W. Gropp, E. Lusk, and A. Skjellum, Using MPI: Portable Parallel Programming with the Message-passing Interface, Cambridge, MA, MIT Press, 1994.
21. F. Harary, J.P. Hayes, and H. Wu, A survey of the theory of hypercube graphs, Computational Mathematical Applications, 15(4), 1988, 277-289.
22. V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing, 2nd edn, Harlow, UK, Pearson Education 2003.
23. L. Lamport, Distribution email, May 28, 1987, available at: http://research. microsoft.com/users/lamport/pubs/distributed_systems.txt.
24. D. Lea, S. Vinoski, and W. Vogels, Guest editors’ introduction: asynchronous middleware and services, IEEE Internet Computing, 10(1), 2006, 14-17.
25. N. Lynch, Distributed Algorithms, San Francisco, CA, Morgan Kaufmann, 1996.
26. S. Mullender, Distributed Systems, 2nd edn, New York, ACM Press, 1993.
27. M. Raynal, Distributed Algorithms and Protocols, New York, John Wiley, 1988.
28. J. Shirley, W. Hu, and D. Magid, Guide to Writing DCE Applications, O’Reilly and Associates, Inc., 1992.
29. M. Singhal and N. Shivaratri, Advanced Concepts in Operating Systems, New York, McGraw Hill, 1994.
30. M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra, MPI: The Complete Reference, Cambridge, MA, MIT Press, 1996.
31. V. Sunderam, PVM: A framework for parallel distributed computing, Concurrency - Practice and Experience, 2(4): 315-339, 1990.
32. A. Tanenbaum, Computer Networks, 3rd edn, New Jersey, Prentice-Hall PTR, 1996.
33. A. Tanenbaum and M. Van Steen, Distributed Systems: Principles and Paradigms, Upper Saddle River, NJ, Prentice-Hall, 2003.
34. G. Tel, Introduction to Distributed Algorithms, Cambridge, Cambridge University Press, 1994.
35. M. van Steen, P. Homburg, and A. Tanenbaum, Globe: a wide-area distributed system, IEEE Concurrency, 1999, 70-78.
36. S. Vinoski, CORBA: integrating diverse applications within heterogeneous distributed environments, IEEE Communications Magazine, 35(2), 1997, 46-55.
37. C. L. Wu and T.-Y. Feng, On a class of multistage interconnection networks, IEEE Transactions on Computers, C-29 1980, 694-702.
38. K. Birman and T. Joseph, Reliable communication in presence of failures, ACM Transactions on Computer Systems, 3, 1987, 47-76.
39. K. M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, 3(1), 1985, 63-75.
40. A. Kshemkalyani, M. Raynal and M. Singhal, Global snapshots of a distributed system, Distributed Systems Engineering Journal, 2(4), 1995, 224-233.
41. L. Lamport, Time, clocks and the ordering of events in a distributed system, Communications of the ACM, 21, 1978, 558-564.
42. A. Lynch, Distributed processing solves main-frame problems, Data Communications, 1976, 17-22.
43. F. Mattern, Virtual time and global states of distributed systems, Proceedings of the Parallel and Distributed Algorithms Conference, 1988, 215-226.
44. P. Panengaden and K. Taylor, Concurrent common knowledge: a new definition of agreement for asynchronous events, Proceedings of the 5th Symposium on Principles of Distributed Computing, 1988, 197-209.
45. S. M. Shatz, Communication mechanisms for programming distributed systems, IEEE Computer, 1984, 21-28.
46. B. R. Preiss, The Yaddes distributed discrete event simulation specification language and execution environments, Proceedings of the SCS Multiconference on Distributed Simulation, 1989, 139-144.
47. B. Charron-Bost, Concerning the size of logical clocks in distributed systems, Information Processing Letters, 39, 1991, 11-16.
48. F. Cristian, Probabilistic clock synchronization, Distributed Computing, 3, 1989, 146-158.
49. C. Fidge, Logical time in distributed computing systems, IEEE Computer, August, 1991, 28-33.
50. M. J. Fischer and A. Michael, Sacrifying serializability to attain hight availability of data in an unreliable network, Proceedings of the ACM Symposium on Principles of Database Systems, 1982, 70-75.
51. J. Fowler and W. Zwaenepoel, Causal distributed breakpoints, Proceedings of the 10th International Conference on Distributed Computing Systems, 1990, 134-141.
52. D. Jefferson, Virtual time, ACM Toplas, 7(3), 1985, 404-425.
53. C. Jard and G.-C. Jourdan, Dependency tracking and filtering in distributed computations, Brief Announcements of the ACM Symposium on PODC, 1994. (A full presentation appeared as IRISA Technical Report No. 851, 1994.)
54. L. Lamport, Time, clocks and the ordering of events in a distributed system, Communications of the ACM, 21, 1978, 558-564.
55. B. Liskov, Practical uses of synchronized clocks in distributed systems, Proceedings of Tenth Annual ACM Symposium on Principles of Distributed Computing, August 1991, pp. 1-9.
56. B. Liskov and R. Ladin, Highly available distributed services and fault-tolerant distributed garbage collection, Proceedings of the 5th ACM Symposium on PODC, 1986, 29-39.
57. F. Mattern, Virtual time and global states of distributed systems, in Cosnard, Q and Raynal, R. (eds) Proceedings of the Parallel and Distributed Algorithms Conference, North-Holland, 1988, 215-226.
58. D. L. Mills, Network Time Protocol (version 3): Specification, Implementation, and Analysis, Technical Report, Network Information Center, SRI International, Menlo Park, CA, March, 1992.
59. D. L. Mills, Modelling and Analysis of Computer Network Clocks, Technical Report, 92-5-2, Electrical Engineering Department, University of Delaware, May, 1992.
60. D. L. Mills, Internet time synchronization: the network time protocol, IEEE Transactions on Communications, 39(10), 1991, 1482-1493.
61. J. Misra, Distributed discrete event simulation, ACM Computing Surveys, 18(1), 1986, 39-65.
62. D. S. Parker et al., Detection of mutual inconsistency in distributed systems, IEEE Transactions on Software Engineeing, 9(3), 1983, 240-246.
63. M. Raynal, A distributed algorithm to prevent mutual drift between n logical clocks, Information Processing Letters, 24, 1987, 199-202.
64. M. Raynal and M. Singhal, Logical time: capturing causality in distributed systems, IEEE Computer, 30(2), 1996, 49-56.
65. G. Ricart, and A. K. Agrawala, An optimal algorithm for mutual exclusion in computer networks, Communications of the ACM, 24(1), 1981, 9-17
66. R. Righter and J. C. Walrand, Distributed simulation of discrete event systems, Proceedings of the IEEE, 1988, and 99-113.
67. S. K. Sarin and L. Lynch, Discarding obsolete information in a replicated data base system, IEEE Transactions on Software Engineering, 13(1), 1987, 39-46.
68. F. Schmuck, The Use of Efficient Broadcast in Asynchronous Distributed Systems, Ph. D. Thesis, Cornell University, TR88-928, 1988.
69. M. Singhal, A heuristically-aided mutual exclusion algorithm for distributed systems, IEEE Transactions on Computers, 38(5), 1989, 651-662.
70. M. Singhal and A. Kshemkalyani, An efficient implementation of vector clocks, Information Processing Letters, 43, August, 1992, 47-52.
71. R. E. Strom and S. Yemini, Optimistic recovery in distributed systems, ACM Transactions on Computer Systems, 3(3), 1985, 204-226.
72. B. Sundararaman, U. Buy, and A. D. Kshemkalyani, Clock synchronization in wireless sensor networks: a survey, Ad-Hoc Networks, 3(3), 2005, 281-323.
73. G. T. J. Wuu and A. J. Bernstein, Efficient solutions to the replicated log and dictionary problems, Proceedings of 3rd ACM Symposium on PODC, 1984, 233-242.
74. A. Acharya and B. R. Badrinath, Recording distributed snapshots based on causal order of message delivery, Information Processing Letters, 44, 1992, 317-321.
75. S. Alagar, and S. Venkatesan, An optimal algorithm for distributed snapshots with causal message ordering, Information Processing Letters, 50, 1994, 311-316.
76. O. Babaoglu and K. Marzullo, Consistent global states of distributed systems: fundamental concepts and mechanisms, in Mullender, S.J. (ed.) Distributed Systems, ACM Press 1993.
77. O. Babaoglu and M. Raynal, Specification and verification of dynamic properties in distributed computations, Journal of Parallel and Distributed Systems, 28(2), 1995, 173-185.
78. K. Birman and T. Joseph, Reliable communication in presence of failures, ACM Transactions on Computer Systems, 3, 1987, 47-76.
79. K. Birman, A. Schiper, and P. Stephenson, Lightweight causal and atomic group multicast, ACM Transactions on Computer Systems, 9(3), 1991, 272-314.
80. K. M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, 3(1), 1985, 63-75.
81. R. Cooper and K. Marzullo, Consistent detection of global predicates, Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, May 1991, 163-173.
82. E. Fromentin, N. Plouzeau, and M. Raynal, An introduction to the analysis and debug of distributed computations, Proceedings of the 1st IEEE International Conference on Algorithms and Architectures for Parallel Processing, Brisbane, Australia, April 1995, 545-554.
83. K. Geihs and M. Seifert, Automated validation of a cooperation protocol for distributed systems, Proceedings of the 6th International Conference on Distributed Computing Systems, 1986, 436-443.
84. O. Gerstel, M. Hurfin, N. Plouzeau, M. Raynal, and S. Zaks, On-the-fly replay: a practical paradigm and its implementation for distributed debugging, Proceedings of the 6th IEEE International Symposium on Parallel and Distributed Debugging, Dallas, TX, October 1995, 266-272.
85. J.-M. Helary, Observing global states of asynchronous distributed applications, Proceedings of the 3rd International Workshop on Distributed Algorithms, LNCS 392 1989, 124-134.
86. M. Hurfin, N. Plouzeau and M. Raynal, A debugging tool for distribted Estelle programs, Journal of Computer Communications, 16(5), 1993, 328-333.
87. J. Kamal and M. Singhal, Specification and Verification of Distributed Mutual Exclusion Algorithms, Technical Report, Department of Computer and Information Science, The Ohio State University, Columbus, OH, 1992.
88. R. Koo and S. Toueg, Checkpointing and rollback-recovery in distributed systems, IEEE Transactions on Software Engineering, January, 1987, 23-31.
89. A. Kshemkalyani, M. Raynal, and M. Singhal, ‘Global snapshots of a distributed system’, Distributed Systems Engineering Journal, 2(4), 1995, 224-233.
90. A. Kshemkalyani and M. Singhal, Efficient detection and resolution of generalized distributed deadlocks, IEEE Transactions on Software Engineering, 20(1), 1994, 43-54.
91. T. H. Lai and T. H. Yang, On distributed snapshots, Information Processing Letters, 25, 1987, 153-158.
92. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, 21(7), 1978, 558-565.
93. H. F. Li, T. Radhakrishnan, and K. Venkatesh, Global state detection in non-FIFO networks, Proceedings of the 7th International Conference on Distributed Computing Systems, 1987, 364-370.
94. D. Manivannan, R. H. B. Netzer, and M. Singhal, Finding consistent global checkpoints in a distributed computation, IEEE Transactions of Parallel and Distributed Systems, June, 1997, 623-627.
95. F. Mattern, Algorithms for distributed termination detection, Distributed Computing, 2(3), 1987, 161-175.
96. F. Mattern, Efficient algorithms for distributed snapshots and global virtual time approximation, Journal of Parallel and Distributed Computing, 18, 1993, 423-434.
97. B. Miller and J. Choi, Breakpoints and halting in distributed programs, Proceedings of the 8th International Conference on Distributed Computing Systems, 1988, 316-323.
98. H. B. Robert and J. Xu. Netzer, Necessary and sufficient conditions for consistent global snapshots, IEEE Transactions on Parallel and Distributed Systems, 6(2), 1995, 165-169.
99. M. Raynal, A. Schiper, and S. Toueg, Causal ordering abstraction and a simple way to implement it, Information Processing Letters, 39(6), 1991, 343-350.
100. S. Sarin and N. Lynch, Discarding obsolete information in a replicated database system, IEEE Transactions on Software Engineering, 13(1), 1987, 39-47.
101. A. Schiper, J. Eggli, and A. Sandoz, A new algorithm to implement causal ordering, Proceedings of the 3rd International Workshop on Distributed Algorithms, LNCS 392, Springer Verlag, 1989, pp. 219-232.
102. M. Spezialetti and P. Kearns, Efficient distributed snapshots, Proceedings of the 6th International Conference on Distributed Computing Systems, 1986, 382-388.
103. M. Spezialetti and P. Kearns, Simultaneous regions: a framework for the consistent monitoring of distributed systems, Proceedings of the 9th International Conference on Distributed Computing Systems, 1989, 61-68.
104. K. Taylor, The role of inhibition in consistent cut protocols, Proceedings of the 3rd International Workshop on Distributed Algorithms, LNCS 392, 1989, 124-134.
105. S. Venkatesan, Message-optimal incremental snapshots, Journal of Computer and Software Engineering, 1(3), 1993, 211-231.
106. Yi-Min Wang, Maximum and minimum consistent global checkpoints and their applications, Proceedings of the 14th IEEE Symposium on Reliable Distributed Systems, Bad Neuenahr, Germany, September 1995, 86-95.
107. Yi-Min Wang, Consistent global checkpoints that contain a given set of local checkpoints, IEEE Transactions on Computers, 46(4), 1997, 456-468.
108. D. Angluin, Local and global properties in networks of processors, Proceedings of the 12th ACM Symposium on Theory of Computing, 1980, 82-93.
109. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, Proceedings of 19th ACM Symposium on Principles of Theory of Computing (STOC), 1987, 230-240.
110. B. Awerbuch, Complexity of network synchronization, Journal of the ACM, 32(4), 1985, 804-823.
111. R. Bellman, Dynamic Programming, Princeton, NJ, Princeton University Press, 1957.
112. K. M. Chandy and J. Misra, Distributed computations on graphs: shortest path algorithms, Communications of the ACM, 25(11), 1982, 833-838.
113. E. Chang and R. Roberts, An improved algorithm for decentralized extremafinding in circular configurations of processes, Communications of the ACM, 22(5), 1979, 281-283.
114. T.-Y. Cheung, Graph traversal techniques and the maximum flow problem in distributed computation, IEEE Transactions on Software Engineering, 9(4), 1983, 504-512.
115. F. Christian, H. Aghili, H. Strong, and D. Dolev, Atomic broadcast: from simple message diffusion to Byzantine agreement, Proceedings of the 15th International Symposium on Fault-Tolerant Computing, 1985, 200-206.
116. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, An Introduction to Algorithms, 2nd edn, Cambridge, MA, MIT Press, 2001.
117. C. Critchlow and K. Taylor, The inhibition spectrum and the achievement of causal consistency, Distributed Computing, 10(1), 1996, 11-27.
118. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons, Proceedings of the 14th Annual Symposium on Discrete Algorithms, 2003, 717-724.
119. L. Ford and D. Fulkerson, Flows in Networks, Princeton, NJ, Princeton University Press, 1962.
120. E. Gafni, Perspectives on distributed network protocols: a case for building blocks, Proceedings of the IEEE MILCOM, Monterey, CA, 1986.
121. R. Gallagher, P. Humblet, and P. Spira, A distributed algorithm for minimumweight spanning trees, ACM Transactions on Programming Languages and Systems, 5(1), 1983, 66-77.
122. C. Gavoille, A survey on interval routing, Theoretical Computer Science, 245(2), 2000, 217-253.
123. V. Hadzilacos, Issues of Fault Tolerance in Concurrent Computations, Ph.D. dissertation, Harvard University, Computer Science Technical Report, 11-84, 1984.
124. V. Hadzilacos and S. Toueg, Fault-tolerant broadcasts and related problems, in Mullender, S. (ed.) Distributed Systems, Addison-Wesley, 1993, 97-146.
125. M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, 15(5), 1991, 745-770.
126. D. Hirschberg and J. Sinclair, Decentralized extrema-finding in circular configurations of processors, Communications of the ACM, 23(11), 1980, 627-628.
127. L. Lamport, Concurrent reading and writing, Communications of the ACM, 20(11), 1977, 806-811.
128. L. Lamport and M. Fischer, Byzantine Generals and Transaction Commit Protocols, SRI International, Technical Report 62, 1982.
129. L. Lamport, R. Shostak, and M. Pease, The Byzantine generals problem, ACM Transactions on Programming Languages and Systems, 4(3), 1982, 382-401.
130. G. LeLann, Distributed systems, towards a formal approach, IFIP Congress Proceedings, 1977, 155-160.
131. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM Journal of Computing, 15(4), 1986, 1036-1053.
132. N. Lynch, Distributed Algorithms, San Francisco, CA, Morgan Kaufmann, 1996.
133. S. Mullender, Distributed Systems, 2nd edn, Addison-Wesley, 1993.
134. K. Perry and S. Toueg, Distributed agreement in the presence of processor and communication faults, IEEE Transactions on Software Engineering, 12(3), 1986, 477-482.
135. G. Peterson and M. Fischer, Economical solutions for the critical section problem in a distributed system, Proceedings of the 9th ACM Symposium on Theory of Computing, Boulder, CO, May, 1977, 91-97.
136. N. Santoro and R. Khatib, Labelling and implicit routing in networks, The Computer Journal, 28, 1985, 5-8.
137. R. Schlichting and F. Schneider, Fail-stop processors: an approach to designing fault-tolerant computing systems, ACM Transactions on Computer Systems, 1(3), 1983, 222-238.
138. F. B. Schneider, Byzantine generals in action: implementing fail-stop processors, ACM Transactions on Computer Systems, 2(2), 1984, 145-154.
139. A. Segall, Distributed network protocols, IEEE Transactions on Information Theory, 29(1), 1983, 23-35.
140. A. Tanenbaum, Computer Networks, 3rd edn, NJ, Prentice-Hall PTR, 1996.
141. S. Toueg, An All-pairs Shortest Path Distributed Algorithm, IBM Technical Report RC 8327, 1980.
142. J. van Leeuwen and R. Tan, Interval routing, The Computer Journal, 30, 1987, 298-307.
143. P. Wan, K. Alzoubi, and O. Frieder, Distributed construction of connected dominating set in wireless ad-hoc networks, Proceedings of the IEEE Infocom, New York, June 2002, 1597-1604.
144. O. Wolfson, S. Jajodia, and Y. Huang, An adaptive data replication algorithm, ACM Transactions on Database Systems, 22(2), 1997, 255-314.
145. R. Bagrodia, Synchronization of asynchronous processes in CSP, ACM Transactions in Programming Languages and Systems, 11(4), 1989, 585-597.
146. T. Ballardie, P. Francis, and J. Crowcroft, Core based trees (CBT), ACM SIGCOMM Computer Communication Review, 23(4), 1993, 85-95.
147. K. Bharath-Kumar and J. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications, 31(3) 1983, 343-351.
148. K. Birman and T. Joseph, Reliable communication in the presence of failures, ACM Transactions on Computer Systems, 5(1), 1987, 47-76.
149. K. Birman, A. Schiper, and P. Stephenson, Lightweight causal and atomic group multicast, ACM Transactions on Computer Systems, 9(3), 1991, 272-314.
150. P. Chandra, P. Gambhire, and A. D. Kshemkalyani, Performance of the optimal causal multicast algorithm: a statistical analysis, IEEE Transactions on Parallel and Distributed Systems, 15(1), 2004, 40-52.
151. B. Charron-Bost, G. Tel, and F. Mattern, Synchronous, asynchronous, and causally ordered communication, Distributed Computing, 9(4), 1996, 173-191.
152. J.-M. Chang and N. Maxemchuk, Reliable broadcast protocols, ACM Transactions on Computer Systems, 2(3), 1984, 251-273.
153. G.-M. Chiu and C.-M. Hsiao, A note on total ordering multicast using propagation trees, IEEE Transactions on Parallel and Distributed Systems, 9(2), 1998, 217-223.
154. G. Chockler, I. Keidar, and R. Vitenberg, Group communication specifications: a comprehensive study, ACM Computing Surveys, 33(4), 2001, 1-43.
155. X. Defago, A. Schiper, and P. Urban, Total order broadcast and multicast algorithms: taxonomy and survey, ACM Computing Surveys, 36(4), 2004, 372-421.
156. P. Ezhilchelvan, R. Macdo, and S. Shrivastava, Newtop: a fault-tolerant group communication protocol, Proceedings of the 15th IEEE International Conference on Distributed Computing Systems, Vancouver, Canada, May, 1995, 296-306.
157. H. Garcia-Molina and A. Spauster, Ordered and reliable multicast communication, ACM Transactions on Computer Systems, 9(3), 1991, 242-271.
158. E. Gilbert and H. Pollack, Steiner minimal trees, SIAM Journal of Applied Mathematics, 16(1), 1968, 1-29.
159. V. Hadzilacos and S. Toueg, Fault-tolerant broadcasts and related problems in Mullender, S. (ed.), Distributed Systems, New York, Addison-Wesley, 1993, 97-146.
160. C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, 21(8), 1978, 666-677.
161. X. Jia, A total ordering multicast protocol using propagation trees, IEEE Transactions on Parallel and Distributed Systems, 6(6), 1995, 617-627.
162. V. Kompella, J. Pasquale, and G. Polyzos, Multcast routing for multimedia communication, IEEE/ACM Transactions on Networking, 1(3), 1993, 86-92.
163. L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Informatica, 15, 1981, 141-145.
164. A. D. Kshemkalyani and M. Singhal, An optimal algorithm for generalized causal message ordering, Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, May 1996, 87.
165. A. D. Kshemkalyani and M. Singhal, Necessary and sufficient conditions on information for causal message ordering and their optimal implementation, Distributed Computing, 11(2), 1998, 91-111.
166. M. Raynal, A. Schiper, and S. Toueg, The causal ordering abstraction and a simple way to implement it, Information Processing Letters, 39, 1991, 343-350.
167. J. Brzezinski, J. M. Helary, and M. Raynal, Termination detection in a very general distributed computing model, Proceedings of the International Conference on Distributed Computing Systems, Poland, 1993, 374-381.
168. S. Chandrasekaran and S. Venkatesan, A message-optimal algorithm for distributed termination detection. Journal of Parallel and Distributed Computing, 1990, 245-252.
169. E. W. Dijikstra, W. H. J. Feijen, and A. J. M. van Gasteren, Derivations of a termination detection algorithm for distributed computations, Information Processing Letters, 16(5), 1983, 217-219.
170. E. W. Dijkstra and C. S. Scholten, Termination detection for distributed computations, Information Processing Letters, 11(1), 1980, 1-4.
171. N. Francez, Distributed termination, ACM Transactions on Programming Langauges, 2(1), 1980, 42-55.
172. N. Francez and M. Rodeh, Achieving distributed termination without freezing, IEEE Transaction on Software Engineering, May, 1982, 287-292.
173. R. G. Gallager, P. Humblet, and P. Spira, A distributed algorithm for minimum weight spanning trees, ACM Transactions on Programming Langauges and Systems, January, 1983, 66-77.
174. Shing-Tsaan Huang, Termination detection by using distributed snapshots, Information Processing Letters, 32, 1989, 113-119.
175. S. T. Huang, Detecting termination of distributed computations by external agents, Proceedings of the 9th International Conference on Distributed Computing Systems, 1989, 79-84.
176. D. Kumar, A class of termination detection algorithms for distributed computations, Proceedings of the 5th Conference on Foundation of Software Technology and Theoretical Computer Science, New Delhi, LNCS 206, 1985, 73-100.
177. T. H. Lai, Termination detection for dynamically distributed systems with nonfirst-in-first-out communication, Journal of Parallel and Distributed Computing, December, 1986, 577-599.
178. F. Mattern, Algorithms for distributed termination detection, Distributed Computing, 2, 1987, 161-175.
179. F. Mattern, Global quiescence detection based on credit distribution and recovery, Information Processing Letters, 30(4), 1989, 195-200.
180. J. Mayo and P. Kearns, Distributed termination detection with roughly synchronized clocks, Information Processing Letters, 52(2), 1994, 105-108.
181. J. Mayo and P. Kearns, Efficient distributed termination detection with roughly synchronized clocks, Parallel and Distributed Computing and Systems, 1995, 305-307.
182. J. Misra and K. M. Chandy, Termination detection of diffusing computations in communication sequential processes, ACM Transactions on Programming Languages and Systems, January, 1982, 37-42.
183. S. P. Rana, A distributed solution of the distributed termination problem, Information Processing Letters, 17(1), 43-46.
184. S. Ronn and H. Saikkonen, Distributed termination detection with counters, Information Processing Letters, 34(5), 1990, 223-227.
185. R. W. Topor, Termination detection for distributed computations, Information Processing Letters, 18(1), 1984, 33-36.
186. Yu-Chee Tseng, Detecting termination by weight-throwing in a faulty distributed system, Journal of Parallel Distributed Computing, 25(1), 1995, 7-15.
187. Yu-Chee Tseng and Cheng-Chung Tan, On termination detection protocols in a mobile distributed computing environment, Proceedings of ICPADS, 1998, 156-163.
188. K. M. Chandy and J. Misra, How processes learn, Distributed Computing, 1, 1986, 40-52.
189. C. Critchlow and K. Taylor, The inhibition spectrum and the achievement of causal consistency, Distributed Computing, 10(1), 1996, 11-27.
190. R. Fagin, J. Halpern, Y. Moses, and M. Vardi, Reasoning about Knowledge, Cambridge, MA, MIT Press, 1995.
191. J. Halpern and R. Fagin, Modeling knowledge and action in distributed systems, Distributed Computing, 3(4), 1989, 139-179.
192. J. Halpern and Y. Moses, Knowledge and common knowledge in a distributed environment, Journal of the ACM, 37(3), 1990, 549-587.
193. A. Krishnakumar and A. Bernstein, Bounded ignorance: a technique for increasing concurrency in a replicated system, ACM Transactions on Database Systems, 19(4), 1994, 586-625.
194. A. Kshemkalyani, The power of logical clock abstractions, Distributed Computing, 17(2), 2004, 131-151.
195. A. Kshemkalyani, Concurrent knowledge and logical clock abstractions, Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, 1974, Springer-Verlag, 2000, 489-502.
196. P. Panangaden and K. Taylor, Concurrent common knowledge: defining agreement for asynchronous systems, Distributed Computing, 6(2), 1992, 73-94.
197. F. Ruget, Cheaper matrix clocks, Proceedings of the 8th Workshop on Distributed Algorithms, 1994, 355-369.
198. S. Sarin and N. Lynch, Discarding obsolete information in a distributed database system, IEEE Transactions on Software Engineering, 13(1), 1987, 39-46.
199. G. Wuu and A. Bernstein, Efficient solutions to the replicated log and dictionary problems, Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, 1984, 232-242.
200. D. Agrawal and A. E. Abbadi, An efficient and fault-tolerant solution for distributed mutual exclusion, ACM Transactions on Computer Systems, 9(1), 1991, 1-20.
201. J. M. Bernabeu-Auban and M. Ahamad, Applying a path-compression technique to obtain an effective distributed mutual exclusion algorithm, Proceedings of the 3rd International Workshop on Distributed Algorithms, September 1989, 33-44.
202. G. Buckley and A. Silberschatz, A failure tolerant centralized mutual exclusion algorithm, Proceedings of the 4th International Conference on Distributed Computing Systems, May 1984, 347-356.
203. O. S. F. Carvalho and G. Roucairol, On mutual exclusion in real-time distributed computing systems, technical Correspondence, Communications of the ACM, 26(2), 1983, 146-147.
204. G. Cao and M. Singhal, A delay-optimal quorum-based mutual exclusion algorithm for distributed systems, IEEE Transactions on Parallel and Distributed Systems, 12(12), 2001, 1256-1268.
205. Y. Chang, M. Singhal, and M. Liu, A dynamic token-based distributed mutual exclusion algorithm, Proceedings of the 10th IEEE International Phoenix Conference on Computer and Communications, March 1991, 240-246.
206. Y. Chang, M. Singhal, and M. Liu, A fault-tolerant mutual exclusion algorithm for distributed systems, Proceedings of the 9th Symposium on Reliable Distributed Software and Systems, October 1990, 146-154.
207. A. Goscinski, Two algorithms for mutual exclusion in real-time distributed computing systems, Journal of Parallel and Distributed Computing, 9(1), 1990, 77-82.
208. H. Garcia-Molina and D. Barbara, How to assign votes in a distributed system, Journal of the ACM, 1985.
209. M. Helary, N. Plouzeau, and M. Raynal A distributed algorithm for mutual exclusion in an arbitrary network, Computing Journal, 31(4), 1988, 289-295.
210. T. Ibaraki and T. Kameda, Theory of Coteries, Technical Report, CSS/LCCR TR90-09, University of Kyoto, Kyoto, Japan, 1990.
211. L. Lamport Time, clocks and ordering of events in distributed systems, Communications of the ACM, 21(7), 1978, 558-565.
212. S. Lodha and A. Kshemkalyani, A fair distributed mutual exclusion algorithm, IEEE Transactions on Parallel and Distributed Systems, 11(6), 2000, 537-549.
213. M. Maekawa, A √N algorithm for mutual exclusion in decentralized systems, ACM Transactions on Computer Systems, 3(2), 1995, 145-159.
214. M. Naimi and M. Trehel, An improvement of the logN distributed algorithm for mutual exclusion, Proceedings of the 7th International Conference on Distributed Computing Systems, September 23-25, 1987, 371-377.
215. M. L. Neilsen and M. Mizuno, A DAG-based algorithm for distributed mutual exclusion, Proceedings of the 11th International Conference on Distributed Computing Systems, May 21-23, 1991, 354-360.
216. M. Nesterenko and M. Mizuno, A quorum-based self-stabilizing distributed mutual exclusion algorithm, Journal of Parallel and Distributed Computing, 62(2), 2002, 284-305.
217. S. Nishio, K. F. Li, and E. G. Manning, A resilient mutual exclusion algorithm for computer networks, IEEE Transactions on Parallel and Distributed Systems, 1(3), 1990, 344-356.
218. K. Raymond, Tree-based algorithm for distributed mutual exclusion, ACM Transactions on Computer Systems, 7, 1989, 61-77.
219. M. Raynal, A simple taxonomy of distributed mutual exclusion algorithms, Operating Systems Review, 25(2), 1991, 47-50.
220. G. Ricart and A. K. Agrawala, An optimal algorithm for mutual exclusion in computer networks, Communications of the ACM, 24(1), 1981, 9-17.
221. B. Sanders, The information structure of distributed mutual exclusion algorithms, ACM Transactions on Computer Systems, 5(3), 1987, 284-299.
222. P. C. Saxena and J. Rai, A survey of permission-based distributed mutual exclusion algorithms, Computer Standards and Interfaces, 25(2), 2003, 159-181.
223. M. Singhal, A taxonomy of distributed mutual exclusion, Journal of Parallel and Distributed Computing, 18(1), 1993, 94-101.
224. M. Singhal, “A class of deadlock-free Maekawa type mutual exclusion algorithms for distributed systems”, Distributed Computing, 4(3), 1991, 131-138.
225. M. Singhal, A heuristically-aided algorithm for mutual exclusion in distributed systems, IEEE Transactions on Computers, 38(5), 1989, 651-662.
226. M. Singhal, A dynamic information structure mutual exclusion algorithm for distributed systems, Proceedings of the 9th International Conference on Distributed Computing Systems, June 5-9, 1989, Newport Beach, CA, 70-78.
227. M. Singhal, A dynamic information-structure mutual exclusion algorithm for distributed systems, IEEE Transactions on Parallel and Distributed Systems, 3(1), 1992, 121-125.
228. I. Suzuki and T. Kasami, A distributed mutual exclusion algorithm, ACM Transactions on Computer Systems, 3(4), 1985, 344-349.
229. J. L. A. Vas de Snepscheut, Fair mutual exclusion on a graph of processes, Distributed Computing, 2, 1987, 113-115.
230. B. Awerbuch and S. Micali, Dynamic deadlock resolution protocols, in Proceedings of the Foundations of Computer Science, Toronto, Canada, 1986, 196-207.
231. G. Bracha and S. Toueg, Distributed deadlock detection, Distributed Computing, 2(3), 1987, 127-138.
232. J. Brezezinski, J. M. Helary, M. Raynal, and M. Singhal, Deadlock models and generalized algorithm for distributed deadlock detection, Journal of Parallel and Distributed Computing, 31(2), 1995, 112-125.
233. K. M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Programming Language Systems, 3(1), 1985, 63-75.
234. K. M. Chandy and J. Misra, A distributed algorithm for detecting resource deadlocks in distributed systems, Proceedings of the ACM Symposium on Principles of Distributed Computing, Ottawa, Canada, August 1982, 157-164.
235. K. M. Chandy, J. Misra, and L. M. Haas, Distributed deadlock detection, ACM Transactions on Computer Systems, 1(2), 1983, 144-156.
236. A. Choudhary, W. Kohler, J. Stankovic, and D. Towsley, A modified priority based probe algorithm for distributed deadlock detection and resolution, IEEE Transactions on Software Engineering, 15(1) 1989, 10-17.
237. J. R. G. de Mendivil, F. Farina, J. Garitagoitia, C. F. Alastruey, and J. M. Bernabeu-Auban, A distributed deadlock resolution algorithm for the AND model, IEEE Transactions on Parallel and Distributed Systems, 10(5), 1999, 433-447.
238. A. K. Elmagarmid, N. Soundararajan, and M. T. Liu, A distributed deadlock detection and resolution algorithm and its correctness proof, IEEE Transactions on Software Engineering, 14(10), 1988, 1443-1452.
239. M. Flatebo and A. K. Datta, Self-stabilizing deadlock detection algorithms, Proceedings of the 1992 ACM Annual Conference on Communications, Kansas City, Missouri, March 1992, 117-122.
240. V. Gligor and S. Shattuck, On deadlock detection in distributed databases, IEEE Transactions on Software Engineering, SE-6(5), 1980, 435-440.
241. J. N. Gray, P. Homan, H. F. Korth, and R. L. Obermarck, A straw man analysis of the probability of waiting and deadlock in a database system, Technical Report RJ 3066, IBM Research Laboratory, San Jose, CA, 1981.
242. L. M. Haas, Two approaches to deadlock detection in distributed systems. Ph.D. dissertation, Department of Computer Sciences, University of Texas, Austin, TX, 1981.
243. L. M. Haas and C. Mohan, A distributed deadlock detection algorithm for a resource-based system, Research Report RJ 3765, IBM Research Laboratory, San Jose, CA, 1983.
244. J. Helary, C. Jard, N. Plouzeau, and M. Raynal, Detection of stable properties in distributed applications, Proceedings of the ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, August 1987, 125-136.
245. T. Herman and K. M. Chandy, A Distributed Procedure to Detect AND/OR Deadlock, Technical Report TR LCS-8301, Department of Computer Sciences, University of Texas, Austin, TX, 1983.
246. B. A. Sanders and P. A. Heuberger, Distributed deadlock detection and resolution with probes, Proceedings of the 3rd International Workshop on Distributed Algorithms, September 26-28, 1989, 207-218.
247. G. S. Ho and C. V. Ramamoorthy, Protocols for deadlock detection in distributed database systems, IEEE Transactions on Software Engineering, 8(6), 1982, 554-557.
248. R. C. Holt, Some deadlock properties on computersystems, ACM Computing Surveys, 4(3), 1972, 179-196.
249. S.-T. Huang, Detecting termination of distributed computations by external agents, ICDCS, 1989, 79-84.
250. J. R. Jagannathan and R. Vasudevan, A distributed deadlock detection and resolution scheme; performance study, Proceedings of the 3rd International Conference on Distributed Computing Systems, Miami, Florida, 1982, 496-501.
251. E. Knapp, Deadlock detection in distributed databases, ACM Computing Surveys, 19(4), 1987, 303-328.
252. M. Krishnamurthi, A. Basavatia, and S. Thallikar, Deadlock detection and resolution in simulation models, Proceedings of the 26th conference on Winter simulation, p.708-715, December 11-14, 1994, Orlando, Florida.
253. A. Kshemkalyani and M. Singhal, A one-phase algorithm to detect distributed deadlocks in replicated databases, IEEE Transactions on Knowledge and Data Engineering, 11(6), 1999, 880-895.
254. A. Kshemkalyani and M. Singhal, On characterization and correctness of distributed deadlocks, Journal of Parallel and Distributed Computing, 22(1), 1994, 44-59.
255. A. Kshemkalyani and M. Singhal, Efficient detection and resolution of generalized distributed deadlocks, IEEE Transactions on Software Engineering, 20(1), 1994, 43-54.
256. A. Kshemkalyani and M. Singhal, An invariant-based verification of a probe algorithm for distributed deadlock detection and resolution, IEEE Transactions on Software Engineering, 17(8) 1991, 789-799.
257. N. Krivokapic, A. Kemper, and E. Gudes, Deadlock detection in distributed database systems: a new algorithm and a comparative performance analysis, VLDB Journal: Very Large Data Bases, 8(2), 1999, 79-100.
258. L. Lamport, Time, clocks, and the ordering of events in distributed systems, Communications of the ACM 21(7), 1978, 558-565.
259. S. Lee and J. L. Kim, Performance analysis of distributed deadlock detection algorithms, IEEE Transactions on Knowledge and Data Engineering, 13(4), 2001, 623-636.
260. D. Manivannan and M. Singhal, An efficient distributed algorithm for detection of knots and cycles in a distributed graph, IEEE Transactions on Parallel and Distributed Systems, 14(10), 2003, 961-972.
261. J. Mayo and P. Kearns, Distributed deadlock detection and resolution based on hardware clocks, ICDCS 1999, 208-215.
262. D. E. Menasce and R. Muntz, Locking and deadlock detection in distributed databases, IEEE Transactions on Software Engineering, 5(3), 1979, 195-202.
263. J. Misra and K. M. Chandy, A distributed graph algorithm: knot detection, ACM Transactions on Programming Language Systems, 4(4), 1982, 678-686.
264. D. P. Mitchell and M. J Merritt, A distributed algorithm for deadlock detection and resolution, Proceedings of the ACM Symposium on Principles of Distributed Computing, 1984, 282-284.
265. N. Natarajan, A distributed scheme for detecting communication deadlock, IEEE Transactions on Software Engineering SE-12(4), 1986, 531-537.
266. R. Obermarck, Deadlock detection for all resourse classes, Research Report RJ2955, IBM Research Laboratory, San Jose, CA, 1980.
267. R. Obermarck, Distributed deadlock detection algorithm, ACM Transactions on Database Systems, 7(2), 1982, 187-208.
268. Y. C. Park, P. Scheuermann, and H. L. Tung, A distributed deadlock detection and resolution algorithm based on a hybrid wait-for graph and probe generation scheme, Proceedings of the 4th International Conference on Information and Knowledge Management, Baltimore, MD 1995, 378-386.
269. Y. C. Park, P. Scheuermann, and S. H. Lee, A periodic deadlock detection and resolution algorithm with a new graph model for sequential transaction processing, Proceedings of the 8th International Conference on Data Engineering, 1992, 202-209.
270. M. Roesler and W. A. Burkhard, Resolution of deadlocks in object-oriented distributed systems, IEEE Transactions on Computers, 38(8), 1989, 1212-1224.
271. M. K. Sinha and N. Natarajan, A distributed deadlock detection algorithm based on timestamps, Proceedings of the 4th International Conference on Distributed Computing Systems, 1984, 546-556.
272. M. Singhal, Deadlock detection in distributed systems, IEEE Computer, November, 1989, 37-48.
273. J. Villadangos, F. Farina, J. R. G. de Mendivil, J. Garitagoitia, and A. Cordoba, A safe algorithm for resolving OR deadlocks, IEEE Transactions on Software Engineering, 29(7), 2003, 608-622.
274. J. Wang, S. Huang, and N. Chen, A distributed algorithm for detecting generalized deadlocks, Technical Report, Department of Computer Science, National Tsing-Hua University, 1990.
275. H. Wu, W.-N. Chin, and J. Jaffar, An efficient distributed deadlock avoidance algorithm for the AND model, IEEE Transactions on Software Engineering, 28(1), 2002, 18-29.
276. S. Alagar and S. Venkatesan, Techniques to tackle state explosion in global predicate detection, IEEE Transactions Software Engineering, 27(8), 2001, 704-714.
277. P. Chandra and A. D. Kshemkalyani, Algorithms for detecting global predicates under fine-grained modalities, Proceedings of ASIAN 2003, December 2003, LNCS, 91-109.
278. P. Chandra and A. D. Kshemkalyani, Distributed algorithm to detect strong conjunctive predicates, Information Processing Letters, 87(5), 2003, 243-249.
279. P. Chandra and A. D. Kshemkalyani, Detection of orthogonal interval relations, Proceedings of the High-Performance Computing Conference, LNCS 2552, 2002, 323-333.
280. P. Chandra and A. D. Kshemkalyani, Causality-based predicate detection across space and time, IEEE Transactions on Computers, 54(11), 2005, 1438-1453.
281. K. M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, 3(1), 1985, 63-75.
282. B. Charron-Bost, C. Deloprte-Gallet and H. Fauconnier, Local and temporal predicates in distributed systems, ACM Transactions on Programming Languages and Systems, 17(1), 1995, 157-179.
283. R. Cooper and K. Marzullo, Consistent detection of global predicates, Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, May 1991, 163-173.
284. C. J. Fidge, Timestamps in message-passing systems that preserve partial ordering, Australian Computer Science Communications, 10(1), 1988, 56-66.
285. V. K. Garg and C. Chase, Distributed algorithms for detecting conjunctive predicates, Proceedings of the 15th IEEE International Conference on Distributed Computing Systems, 1995, 423-430.
286. V. K. Garg and B. Waldecker, Detection of weak unstable predicates in distributed programs, IEEE Transactions on Parallel and Distributed Systems, 5(3), 1994, 299-307.
287. V. K. Garg, and B. Waldecker, Detection of strong unstable predicates in distributed programs, IEEE Transactions on Parallel and Distributed Systems, 7(12), 1996, 1323-1333.
288. G. Ho and C. Ramamoorthy, Protocols for deadlock detection in distributed database systems, IEEE Transactions on Software Engineering, 8(6), 1982, 554-557.
289. M. Hurfin, M. Mizuno, M. Raynal and M. Singhal, Efficient distributed detection of conjunctions of local predicates, IEEE Transactions on Software Engineering, 24(8), 1998, 664-677.
290. A. D. Kshemkalyani, Temporal interactions of intervals in distributed systems, Journal of Computer and System Sciences, 52(2), 1996, 287-298.
291. A. D. Kshemkalyani, A fine-grained modality classification for global predicates, IEEE Transactions on Parallel and Distributed Systems, 14(8), 2003, 807-816.
292. A. D. Kshemkalyani and M. Singhal, Correct two-phase and one-phase deadlock detection algorithms for distributed systems, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, December 1990, 126-129.
293. K. Marzullo and G. Neiger, Detection of global state predicates, Proceedings of the 5th Workshop on Distributed Algorithms, LNCS 579, October 1991, 254-272.
294. F. Mattern, Virtual time and global states of distributed systems, Proceedings of the International Workshop on Parallel and Distributed Algorithms, October 1998, 215-226.
295. F. Mattern, Algorithms for distributed termination detection, Distributed Computing, 2, 1987, 161-175.
296. A. Pnueli, The temporal logic of programs, Proceedings of the IEEE Symposium on Foundations of Computer Science, 1977, 46-57.
297. S. Venkatesan and B. Dathan, Testing and debugging distributed programs using global predicates, IEEE Transactions on Software Engineering, 21(2), 1995, 163-177.
298. S. Adve and K. Gharachorloo, Shared memory consistency models: a tutorial, IEEE Computer Magazine, 29(12), 1996, 66-76.
299. S. Adve and M. Hill, A unified formalization of four shared-memory models, IEEE Transactions on Parallel and Distributed Systems, 4(6), 1993, 613-624.
300. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, Atomic snapshots of shared memory, Journal of the ACM, 40(4), 1993, 873-890.
301. M. Ahamad, G. Neiger, J. Burns, P. Kohli, and P. Hutto, Causal memory: definitions, implementation, and programming, Distributed Computing, 9(1), 1995, 37-49.
302. J. Anderson, Multi-writer composite registers, Distributed Computing, 7(4), 1994, 175-196.
303. H. Attiya and J. Welch, Sequential consistency versus linearizability, ACM Transactions on Computer Systems, 12(2), 1994, 91-122.
304. H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, Chichester, Wiley, 2004.
305. H. Bal, F. Kaashoek and A. Tanenbaum, Orca: a language for parallel programming of distributed systems, IEEE Transactions on Software Engineering, 18(3), 1992, 180-205.
306. B. Bershad, M. Zekauskas, and W. Sawdon, The Midway Distributed Shared Memory System, CMU Technical Report CMU-CS-93-119. (Also in Proceedings of COMPCON 1993.)
307. J. Burns and N. Lynch, Bounds on shared memory for mutual exclusion, Information and Computation, 107(2), 1993, 171-184.
308. M. Dubois and C. Scheurich, Memory access dependencies in shared-memory multiprocessors, IEEE Transactions on Software Engineering, 16(6), 1990, 660-673.
309. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. L. Hennessy, Memory consistency and event ordering in scalable shared-memory multiprocessors, Proceedings of the 17th International Symposium on Computer Architecture, Seattle, WA, May 1990, 15-26.
310. M. Herlihy and J. Wing, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, 12(3), 1990, 463-492.
311. P. Hutto and M. Ahamad, Slow memory: weakening consistency to enchance concurrency in distributed shared memories, Proceedings of the IEEE International Conference on Distributed Computing Systems, 1990, 302-311.
312. M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, 13(1), 1991, 124-149.
313. A. Israeli and M. Li, Bounded timestamps, Distributed Computing, 6(4), 1993, 205-209.
314. C. Kruskal, L. Rudolf, and M. Snir, Efficient synchronization of multiprocessors with shared memory, Proceedings of the ACM Conference on Principles of Distributed Computing, 1986.
315. L. Lamport, A new solution of Dijkstra’s concurrent programming problem, Communications of the ACM, 17(8), 1974, 453-455.
316. L. Lamport, How to make a multiprocessor that correctly executes multiprocess programs, IEEE Transactions on Computers, 28(9), 1979, 690-691.
317. L. Lamport, On interprocess communication, part I: basic formalism, Distributed Computing, 1(2), 1986, 77-85.
318. L. Lamport, On interprocess communication, part II: algorithms, Distributed Computing, 1(2), 1986, 86-101.
319. L. Lamport, The mutual exclusion problem, part II: statement and solutions, Journal of the ACM, 33(2), 1986, 327-348.
320. L. Lamport, A fast mutual exclusion algorithm, ACM Transactions on Computer Systems, 5(1), 1987, 1-11.
321. L. Lamport, Concurrent reading and writing, Communications of the ACM, 20(11), 1977, 806-811.
322. R. Lipton and J. Sandberg, PRAM: a Scalable Shared Memory, Technical Report CS-TR-180-88, Princeton University, Department of Computer Science, September 1988.
323. G. L. Peterson, Myths about the mutual exclusion problem, Information Processing Letters, 12, 1981, 115-116.
324. G. L. Peterson and M. Fischer, Economical solutions for the mutual exclusion problem in a distributed system, Proceedings of the 9th ACM Symposium on Theory of Computing, 1977, 91-97.
325. J. Protic, M. Tomasevic, and V. Milutinovic, Distributed shared memory: concepts and systems, IEEE Concurrency, 4(2), 1996, 63-79.
326. A. Tanenbaum, Distributed Operating Systems, Harlow, Pearson Education, 1995.
327. K. Vidyasankar, Converting Lamport’s regular register to atomic register, Information Processing Letters, 28, 1988, 287-290.
328. P. Vitanyi and B. Awerbuch, Atomic shared register access by asynchronous hardware, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, 233-243.
329. L. Alvisi and K. Marzullo, Message logging: pessimistic, optimistic, causal, and optimal, IEEE Transactions on Software Engineering, 24(2), 1998, 149-159.
330. R. Baldoni, J. M. Helary, A. Mostefaoui and M. Raynal, A communicationinduced checkpointing protocol that ensures rollback-dependency trackability, Symposium on Fault-Tolerant Computing, 1997, 68-77.
331. R. Baldoni, A communication-induced checkpointing protocol that ensures rollback-dependency trackability, Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS’97), June 25-27, 1997, p. 68.
332. B. Bhargava and P. Leu, Concurrent robust checkpointing and recovery in distributed systems, Proceedings of the IEEE International Conference on Data Engineering, February 1988, 154-163.
333. D. Briatico, A. Ciuffoletti, and L. Simoncini, A distributed domino-effect free recovery algorithm, Proceedings of the Symposium on Reliability in Distributed Software and Database Systems, Silver Spring, MD, October 1984, 207-215.
334. G. Cao and M. Singhal, Mutable checkpoints: a new checkpointing approach for mobile computing systems, IEEE Transactions on Parallel and Distributed Systems, 12(2), 2001, 157-172. Available online at: www.cse.psu.edu/gcao/paper/gcao/TPDS01.pdf.
335. G. Cao and M. Singhal, On the impossibility of min-process non-blocking checkpointing and an efficient checkpointing algorithm for mobile computing systems, Proceedings of the 1998 International Conference on Parallel Processing, 1998, 37-44.
336. G. Cao and M. Singhal, Checkpointing with mutable checkpoints, Theoretical Computer Science, 290(2), 2003, 1127-1148. Available online at: www.cse.psu.edu/gcao/paper/gcao/TCS03.pdf.
337. K. M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems 3(1), 1985, 63-75.
338. M. Chandy and C. V. Ramamoorthy, Rollback and recovery strategies for computer programs, IEEE Transactions Computing 21(6), 1972, 546-556.
339. O. P. Damani, Yi-Min Wang, and V. K. Garg, Distributed recovery with Koptimistic logging, Journal of Parallel and Distributed Computing, 63(12), 2003, 1193-1218.
340. E. N. Elnozahy and W. Zwaenepoel, Manetho: transparent rollback-recovery with low overhead, limited rollback, and fast output commit, available online at: www.cs.utexas.edu/users/mootaz/cs372/Projects/paper2.pdf.
341. E. N. Elnozahy, L. Alvisi, Y.-M. Wang, and D. B. Johnson, A survey of rollbackrecovery protocols in message-passing systems, ACM Computing Surveys, 34(3), 2002, 375-408. Available online at: www.cs.utexas.edu/users/lorenzo/papers/SurveyFinal.pdf.
342. E. N. Elnozahy and J. S. Plank, Checkpointing for peta-scale systems: a look into the future of practical rollback-recovery, IEEE Transactions on Dependable and Secure Computing, 1(2), 2004, 97-108.
343. J. M. Helary, A. MosteFaul, R. H. Netzer, and M. Raynal, Communicationbased prevention of useless checkpoints in distributed computations, Distributed Computing, 13(1), 2000, 183-190.
344. J.-M. Helary and A. Mostefaoui, and M. Raynal, Preventing useless checkpoints in distributed computations, Proceedings of the 16th Symposium on Reliable Distributed Systems (SRDS’97), October 22-24, 1997, 183-190.
345. J.-M. Helary, A. Mostefaoui, and M. Raynal, Communication-induced determination of consistent snapshots, IEEE Transactions on Parallel and Distributed Systems, 10(9), 1999, 865-877.
346. T. T.-Y. Juang and S. Venkatesan, Crash recovery with little overhead, Proceedings of the 11th International Conference on Distributed Computer Systems, 1991, 454-461.
347. K. H. Kim, Programmer-transparent coordination of recovering concurrent processes: philosophy and rules for efficient implementation, IEEE Transactions on Software Engineering, 14(6), 1988, 810-821.
348. K. H. Kim, Approach to mechanization of the conversation scheme based on monitor, IEEE Transactions on Software Engineering, 8(3), 1982, 189-197.
349. K. H. Kim, Software fault tolerance, in C. R. Vick and C. V. Ramamoorthy (eds), Handbook of Software Engineering, New York, Van Nostrand Reinhold, 1984.
350. R. Koo and S. Toueg, Checkpointing and rollback-recovery for distributed systems, IEEE Transactions on Software Engineering, 13(1) 1987, 23-31.
351. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, 21(7), 1978, 558-565.
352. D. Manivannan and M. Singhal, Asynchronous recovery without using vector timestamps, Journal of Parallel and Distributed Computing, 62(12), 2002, 1695-1728.
353. D. Manivannan and M. Singhal, A low overhead recovery technique using quasisynchronous checkpointing, Proceedings of the 16th International Conference on Distributed Computing Systems, 1996, 100-107.
354. D. Manivannan, R. H. B. Netzer, and M. Singhal, Finding consistent global checkpoints in a distributed computation, IEEE Transactions on Parallel and Distributed Systems, 8(6), 1997, 623-627.
355. R. H. B. Netzer and J. Xu, Necessary and sufficient conditions for consistent global snapshots, IEEE Transactions on Parallel and Distributed Systems, 6(2), 1995, 165-169.
356. S. L. Peterson and P. Kearns, Rollback based on vector time, Proceedings of the Symposium on Reliable Distributed Systems, 1993, 68-77.
357. R. Prakash and M. Singhal, Maximal global snapshot with concurrent initiators, Proceedings of the 6th IEEE Symposium on Parallel Distributed Processing, Dallas, TX, 1994, 344-351.
358. R. Prakash and M. Singhal, Low-cost checkpointing and failure recovery in mobile computing systems, IEEE Transactions on Parallel and Distributed Systems, 7(10), 1996, 1035-1048.
359. P. Ramanathan and K. G. Shin, Use of common time base for checkpointing and rollback recovery in a distributed system, IEEE Transactions on Software Engineering, 19(6), 1993, 571-583.
360. B. Randell, System structure for software fault tolerance, IEEE Transactions on Software Engineering, 1(2), 1975, 220-232.
361. G. G. Richard III and M. Singhal, Complete process recovery: using vector time to handle multiple failures in distributed systems, IEEE Parallel and Distributed Technology: Systems and Technology, 5(2), 1997, 50-59.
362. D. L. Russell, State restoration in systems of communicating processes, IEEE Transactions of Software Engineering, 6(2), 1980, 183-194.
363. A. P. Sistla and J. L. Welch, Efficient distributed recovery using message logging, Proceedings of the 8th annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, 1989, 223-238.
364. R. Strom and S. Yemini, Optimistic recovery in distributed systems ACM Transactions on Computer Systems, 3(3), 1985, 204-226.
365. Z. Tong, R. Y. Kain, and W. T. Tsai, Rollback recovery in distributed systems using loosely synchronized clocks, IEEE Transactions on Parallel and Distributed Systems, 3(2), 1992, 246-251.
366. S. Venkatesan, T. T.-Y. Juang and S. Alagar, Optimistic crash recovery without changing application messages, IEEE Transactions on Parallel and Distributed Systems, 8(3), 1997, 263-271.
367. Y.-M. Wang and W. K. Fuchs, Lazy checkpoint coordination for bounding rollback propagation, IEEE Symposium on Reliable Distributed Systems, 1993.
368. Y.-M. Wang, P.-Y. Chung, I.-J. Lin, and W. K. Fuchs, Checkpoint space reclamation for uncoordinated checkpointing in message-passing systems, IEEE Transactions on Parallel and Distributed Systems, 6(5), 1995, 546-554.
369. Y.-M. Wang, Consistent global checkpoints that contain a given set of local checkpoints, IEEE Transactions on Computers, 46(4), 1997, 456-468.
370. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk, Renaming in an asynchronous environment, Journal of the ACM, 41(1), 1990, 524-548.
371. H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd edn, Hoboken, NJ, Wiley Interscience, 2004.
372. A. Bar-Noy, D. Dolev, C. Dwork, and H. R. Strong, Shifting gears: changing algorithms on the fly to expedite Byzantine agreement, Information and Computation, 92(2), 1992, 205-233.
373. P. Berman and J. Garay, Closure votes: n/4-resilient distributed consensus in (t+1) rounds, Mathematical Systems Theory, 26(1), 1993, 3-19.
374. E. Borowski and E. Gafni, Generalized FLP impossibility result for t-resilient asynchronous computations, Proceedings of the 25th IEEE Symposium on Theory of Computing, 1993, 91-100.
375. S. Chaudhuri, More choices allow more faults: set consensus problems in totally asynchronous systems, Information and Computation, 105(1), 1993, 132-158.
376. D. Dolev, N. Lynch, S. Pinter, E. Stark, and W. Weihl, Reaching approximate agreements in the presence of faults, Journal of the ACM, 33(3), 1986, 499-516.
377. D. Dolev and H. R. Strong, Authenticated algorithms for Byzantine agreement, SIAM Journal of Computing, 12(4), 1983, 656-666.
378. M. Fischer, The consensus problem in unreliable distributed systems (a brief survey), 1983 Conference on Fault-Tolerant Computing, 1983.
379. M. Fischer and N. Lynch, A lower bound for the time to assure interactive consistency, Information Processing Letters, 14(4), 1982, 183-186.
380. M. Fischer, N. Lynch, and M. Merritt, Easy impossibility proofs for distributed consensus problems, Distributed Computing, 1(1), 1986, 26-39.
381. M. Fischer, N. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty processor, Journal of the ACM, 32(2), 1985, 374-382.
382. J. Garey and Y. Moses, Fully polynomial Byzantine agreement for n > 3t processors in t+1 rounds, SIAM Journal of Computing, 27(1), 1998, 247-290.
383. M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, 11(1), 1991, 124-149.
384. M. Herlihy and N. Shavit, The asynchronous computability theorem for t-resilient tasks, Proceedings of the 25th IEEE Symposium on Theory of Computing, 1993, 111-120.
385. M. Herlihy and N. Shavit, The topological structure of asynchronous computability, Journal of the ACM, 46(6), 1999, 858-923.
386. C. Kruskal, L. Rudolph, and M. Snir, Efficient synchronization of multiprocessors with shared memory, Proceedings of ACM Principles of Distributed Computing, August 1986, 218-228.
387. L. Lamport, Concurrent reading and writing, Communications of the ACM, 20(11), 1977, 806-811.
388. L. Lamport, A fast mutual exclusion algorithm, ACM Transactions on Computer Systems, 5(1), 1987, 1-11.
389. L. Lamport, R. Shostak, and M. Pease, The Byzantine generals problem, ACM Transactions on Programming Languages and Systems, 4(3), 1982, 382-401.
390. M. C. Loui and H. H. Abu-Amara, Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research, Vol. 4: Parallel and Distributed Computing, Greenwich, CT, JAI Press, 1987, 163-183.
391. N. Lynch, Distributed Algorithms, MIT Press and Morgan Kaufmann, 1996
392. M. Moir and J. Anderson, Wait-free algorithms for fast long-lived renaming, Science of Computer Programming, 25(1), 1995, 1-39.
393. S. Moran, Using approximate agreement to obtain complete disagreement: the output structure of input free asynchronous computations, Proceedings of the 3rd Israeli Symposium on Theory of Computing and Systems, 1995, 251-257.
394. M. Pease, R. Shostak, and L. Lamport, Reaching agreement in the presence of faults, Journal of the ACM, 27(2), 1980, 228-234.
395. G. Peterson, Concurrent reading while writing, ACM Transactions on Programming Languages and Systems, 5(1), 1983, 46-55.
396. M. Saks and F. Zaharoglou, Wait-free k-set agreement is impossible: the topology of public knowledge, Proceedings of the 25th IEEE Symposium on Theory of Computing, 1993, 101-110.
397. M. Aguilera, W. Chen, and S. Toueg, Heartbeat: a timeout-free failure detector for quiescent reliable communication, Workshop on Distributed Algorithms, 1997, 126-140.
398. M. Aguilera, W. Chen, and S. Toueg, Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks, Theoretical Computer Science, 220(1), 1999, 3-30.
399. T. D. Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, 43(2), 1996, 225-267. (First version published in Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, 1991.)
400. T. D. Chandra, V. Hadzilacos, and S. Toueg, The weakest failure detector for solving consensus, Journal of the ACM, 43(4), 1996, 685-722.
401. C. Delporte-Gallet, H. Fauconnier, and R. Guerraoui, A realistic look at failure detectors, Proceedings IEEE International Conference on Dependable Systems and Networks (DSN’02), Washington DC, 2002, 345-352.
402. C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, and P. Kouznetsov, Mutual exclusion in asynchronous systems with failure detectors, Journal of Parallel and Distributed Computing, 65(4), 2005, 492-505.
403. C. Delporte-Gallet, H. Fauconnier, and R. Guerraoui, Failure detection lower bounds on registers and consensus, Proceedings of the 16th Symposium on Distributed Computing (DISC’02), 2002, 237-251.
404. C. Fetzer, M. Raynal, and F. Tronel, An adaptive failure detection protocol, Proceedings of the 8th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC’01), Seoul, Korea, 2001, 146-153.
405. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process, Journal of the ACM, 32(3), 1985, 374-382.
406. R. Friedman, A. Mostefaoui, and M. Raynal, A weakest failure detector based asynchronous consensus protocol for f < n, Information Processing Letters, 90(1), 2004, 39-46.
407. V. K. Garg and J. R. Mitchell, Implementable Failure Detectors in Asynchronous Systems, Berlin/Heidelberg, Springer, 1998, 158-170.
408. R. Guerraoui, Nonblocking atomic commit in asynchronous distributed systems with failure detectors, Distributed Computing, 15, 2002, 17-25.
409. R. Guerraoui, Indulgent algorithms, Proceedings of the 19th ACM Symposium on Principles of Distributed Computing, (PODC’00), Portland, OR, 2000, 289-298.
410. I. Gupta, T. D. Chandra, and G. S. Goldszmidt, On scalable and efficient distributed failure detectors, Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, Newport, RI, August 2001, 170-179.
411. M. Hurfin, A. Mostefaoui, and M. Raynal, A versatile family of consensus protocols based on Chandra-Toueg’s unreliable failure detectors, IEEE Transactions on Computers, 51(4), 2002, 395-408.
412. M. Hurfin and M. Raynal, A simple and fast asynchronous consensus protocol based on a weak failure detector, Distributed Computing, 12(4), 1999, 209-223.
413. M. Larrea, S. Arevalo, and A. Fernandez, Efficient algorithms to implement unreliable failure detectors in partially synchronous systems, Proceedings of the 13th International Symposium on Distributed Computing, September 27-29, 1999, 34-48.
414. M. Larrea, A. Fernandez, and S. Arevalo, Optimal implementation of the weakest failure detector for solving consensus, Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems (SRDS’00), October 16-18, 2000, 52.
415. G. Le Lann and U. Schmid, How to Implement a Time-Free Perfect Failure Detector in Partially Synchronous Systems, Technical University of Vienna, Institute for Technische Informatik, Research Report, Number 28/2005, 2005.
416. A. Mostefaoui, E. Mourgaya, and M. Raynal, Asynchronous implementation of failure detectors, Proceedings of the International IEEE Conference on Dependable Systems and Networks (DSN’03), San Francisco, CA, 2003, 351-360.
417. A. Mostefaoui, E. Mourgaya, and M. Raynal, An introduction to oracles for asynchronous distributed systems, Future Generation Computer Systems, 18(6), 2002, 757-767.
418. M. Raynal, A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, 36(1), 2005, 53-70.
419. A. Schiper, Early consensus in an asynchronous system with a weak failure detector, Distributed Computing, 10(3), 1997, 149-157.
420. L. Temal and D. Conan, Failure, connectivity and disconnection detectors, Proceedings of the 1st French-speaking Conference on Mobility and Ubiquity Computing, Nice, France, June 1-3, 2004.
421. J. M. Arfman and P. Roden, Project Athena: Supporting distributed computing at MIT, IBM Systems Journal, 31(3), 1992, 550-563.
422. M. Abadi and R. Needham, Prudent engineering practices for cryptographic protocols, Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy, May 1994, 122-136.
423. M. Abadi, M. Burrows, C. Kaufman, and B.W. Lampson, Authentication and delegation with smart-cards, Science of Computer Programming, 21(2), 1993, 93-113.
424. R. Anderson and R. Needham, Robustness principles for public key protocols, in D. Coppersmith (ed.), Advances in Cryptology - CRYPTO’95, New York, Springer-Verlag, 1995, 236-247.
425. S. M. Bellovin and M. Merritt, Limitations of the Kerberos authentication system, Proceedings of USENIX Winter Conference, Dallas, TX, January 1991, 253-267.
426. S. M. Bellovin and M. Merritt, Encrypted key exchange: password-based protocol secure against dictionary attacks, Proceedings of the IEEE Symposium on Security and Privacy, Oakland, CA, 1992, 72-84.
427. M. Burrows, M. Abadi, and R. M. Needham, A logic of authentication, ACM Transactions on Computer Systems, 8(1), 1990, 18-36.
428. S. Chakrabarti and M. Singhal, Password-based authentication: preventing dictionary attacks, IEEE Computer, 40(6), 2007, 68-74.
429. CCITT Recommendation X.509, The Directory - Authentication Framework, 1988. See also ISO/IEC 9594-8, 1989.
430. A. Conklin, G. Dietrich, and D. Walz, Password-based authentication: a system perspective, Proceedings of the 37th Hawaii International Conference on System Sciences, January 2004.
431. D. E. Denning, Cryptography and Data Security, Addison-Wesley, 1982.
432. D. Dolev and A. C. Yao, On the security of public key protocols, IEEE Transactions on Information Theory, IT-29(2), 1983, 198-208.
433. M. Gasser, A. Goldstein, C. Kaufman, and B. W. Lampson, The Digital distributed system security architecture, Proceedings of the 12th National Computer Security Conference, Baltimore, MD, October 1989, 305-319.
434. M. Gasser and E. McDermott, An architecture for practical delegation in a distributed system, Proceedings of the 11th IEEE Symposium on Research in Security and Privacy, Oakland, CA, May 7-9, 1990, 20-30.
435. L. O’Gorman, Practical systems for personal fingerprint authentication, IEEE Computer, 33(2), 2000, 58-60.
436. A. Jain, L. Hong, and S. Pankanti, Biometrics identification, Communications of the ACM, 43(2), 2000, 91-98.
437. M. Indovina, U. Uludag, R. Snelick, A. Mink, and A. Jain, Multimodal biometric authentication methods: a COTS approach, Proceedings of MMUA 2003, Workshop on Multimodal User Authentication, Santa Barbara, CA, December 11-12, 2003, 99-106.
438. M. Kaminsky, G. Saviddes, D. Mazieres, and M. F. Kaashoek, Decentralized user authentication in a global file system, Symposium on Operating System Principles, 2003, 60-73.
439. C. Kaufman, DASS Distributed Authentication Security Service, September 1993, RFC 1507.
440. J. T. Kohl, B. C. Neuman, and T. Y. Tso, The evolution of the Kerberos authentication system, in F. Brazier and D. Johansen (eds), Distributed Open Systems, New York, IEEE Computer Society Press, 1994, 78-94.
441. Kerberos Frequently Asked Questions, available online at: www.nrl.navy. mil/CCS/people/kenh/kerberos-faq.html.
442. J. King and A. dos Santos, A user-friendly approach to human authentication of messages, Proceedings of the 9th International Conference on Financial Cryptography and Data Security, Roseau, Dominica, 2005, 225-239.
443. B. Lampson, M. Abadi, and M. Burrows, Authentication in distributed systems: theory and practice, ACM Transactions on Computer Systems, 1992.
444. M.-H. Lin and C.-C. Chang, A secure one-time password authentication scheme with low-computation for mobile communications, ACM SIGOPS Operating Systems Review, 38(2), 2004, 76-84.
445. G. Lowe, An attack on the Needham-Schroeder public-key authentication protocol, Information Processing Letters, 56(3) 1995, 131-133.
446. J. Linn, Practical authentication for distributed computing, Proceedings of the 11th IEEE Symposium on Research in Security and Privacy, Oakland, CA, May 7-9 1990, 31-40.
447. C.-C. Lee, M.-S. Hwang, and L.-H. Li, A new key authentication scheme based on discrete logarithms, Applied Mathematics and Computation, 139(2-3), 2003.
448. A. Menezes, P. van Oorschot, and S. Vanstone, Key establishment protocols, Chapter 12 in Handbook of Applied Crytography, New York, CRC Press, 1996.
449. R. M. Needham and M. D. Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM, 21(12), 1978, 993-999.
450. B. C. Neuman and T. Y. Ts’o, An authentication service for computer networks, IEEE Communications Magazine, 32(9), 1994, 33-38.
451. N. K. Ratha, J. H. Connell, and R. M. Bolle, Enhancing security and privacy in biometrics-based authentication systems, IBM Systems Journal, 40(3), 2001, 614-634.
452. J. G. Steiner, C. Neuman, and J. I. Schiller, Kerberos: an authentication service for open network systems, Proceedings of USENIX Winter Conference, Dallas, TX, February 1988, 191-202.
453. B. Schneier, Applied Cryptography, New York, John Wiley & Sons, Inc., 1996.
454. B. Schneier, The uses and abuses of biometrics, Communications of the ACM, 42(8), 1999, 136.
455. W. Stallings, Cryptography and Network Security: Principles and Practice, 4th edn., Englewood Cliffs, NJ, Prentice-Hall, 2005.
456. P. Syverson and I. Cervesato, The Logic of Authentication Protocols, New York, Springer-Velag, 2001.
457. The Secure Socket Layer, available online at: http://publib.boulder.ibm. com/infocenter/wmqv6/v6r0/index.jsp?topic=/com.ibm.mq.csqzas.doc/cssauthentication.htm.
458. J. J. Tardo and K. Alagappan, SPX: global authentication using public key certificates, in Proceedings of the 12th IEEE Symposium on Research in Security and Privacy, Oakland, CA, May 20-22, 1991, 232-244.
459. T. Y. C. Woo and S. S. Lam, Authentication for distributed systems, Computer, 25(1), 1992, 39-52.
460. Authentication revisited, Computer, 25(3), 1992, 10.
461. T. Y. C. Woo and S. S. Lam, A lesson on authentication protocol design, ACM Operating Systems Review, 28(3), 1994, 24-37.
462. T. Y. C. Woo and S. Lam, Authentication for distributed systems, D. Denning and P. Denning (eds), in Internet Besieged: Countering Cyberspace Scofflaws, Addison-Wesley and ACM Press, 1998.
463. T. Y. C.Woo and S. S. Lam, Design, verification, and implementation of an authentication protocol, Proceedings of International Conference on Network Protocols, Boston, MA, October 25-28, 1994. (Also available online at: www.cs.utexas.edu/users/lam/NRL/.)
464. T. Y. C. Woo, R. Bindignavle, S. Su, and S. S. Lam, SNP: an interface for secure network programming, Proceedings of USENIX Summer Technical Conference, Boston, MA, June 6-10, 1994. (Also available online at: www.cs.utexas.edu/users/lam/NRL/.)
465. T. D. Wu, The secure remote password protocol, Proceedings of the Network and Distributed Systems Security, NDSS 1998, San Diego, CA, 1998, 97-111.
466. M. S. Abadir and M. G. Gouda The stabilizing computer, Proceedings of the 1992 International Conference on Parallel and Distributed Systems, December, 1992.
467. Y. Afek and G. Brown, Self-stabilization of the alternating-bit protocol, Proceedings of the 8th Symposium on Reliable Distributed Systems, 1989, 80-83.
468. Y. Afek, S. Kutten, and M. Yung, Memory efficient self-stabilizing protocols for general networks, Proceedings of the 4th International Workshop on Distributed Algorithms, 1991, 15-28.
469. Y. Afek, S. Kutten, and M. Yung, The local detection paradigm and its applications to self-stabilization, Theoretical Computer Science, 186(1-2), 1997, 199-229.
470. Y. Afek and A. Bremler, Self-stabilizing unidirectional network algorithms by power supply, Chicago Journal of Theoretical Computer Science, 1998(3), 1998.
471. S. Aggarwal, Time Optimal Self-stabilizing Spanning Tree Algorithms, Technical Report MIT-LCS/MIT/LCS/TR-632, Massachusetts Institute of Technology, Laboratory for Computer Science, August 1994.
472. S. Aggarwal and S. Kutten, Time optimal self-stabilizing spanning tree algorithms, in R. K. Shyamasundar (ed.). Proceedings of Foundations of Software Technology and Theoretical Computer Science, Berlin, Germany, December 1993, 400-410.
473. G. Antonoiu and P. K. Srimani, A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph, Computers and Mathematics with Applications, 30, 1995, 1-7.
474. G. Antonoiu and P. K. Srimani, Distributed self-stabilizing algorithm for minimum spanning tree construction, Proceedings of Euro-Par ’97 Parallel Processing, 1997, 480-487.
475. G. Antonoiu and P. K. Srimani, A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph, Computers and Mathematics with Applications, 35(10), 1998, 15-23.
476. A. Arora and M. G. Gouda, Closure and convergence: a foundation for faulttolerant computing, Proceedings of the 22nd International Conference on Fault-Tolerant Computing Systems, 1992, 396-403.
477. A. Arora and M. G. Gouda, Distributed reset, IEEE Transactions on Computers, 43(9), 1994, 1026-1038.
478. B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, and G. Varghese, Time optimal self-stabilizing synchronization, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, CA, May 16-18, 1993, 652-661.
479. B. Awerbuch and R. Ostrovsky, Memory-efficient and self-stabilizing network reset, Symposium on Principles of Distributed Computing (PODC ’94), New York, August 1994, 254-263.
480. B. Awerbuch, B. Patt-Shamir, and G. Varghese, Self-stabilization by local checking and correction, Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, FOCS91, 1991, 268-277.
481. B. Awerbuch and G. Varghese, Distributed program checking: a paradigm for building self-stabilizing distributed protocols, Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, October 1991, 268-277.
482. P. Awerbuch and G. Varghese, Self-stabilization by local checking and correction, Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, October 1991.
483. Y. Bastani and Y. Zhao, On self-stabilization, non-determinism, and inherent fault tolerance, Proceedings of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report STP-379-89, 1989.
484. J. C. Browne, A. Emerson, M. Gouda, D. Miranker, A. Mok, and L. Rosier, Bounded time fault-tolerant rule-based systems, Telematics Information, 7(3/4), 1990, 441-454.
485. G. M. Brown, M. G. Gouda, and C.-L. Wu, Token systems that self stabilize, IEEE Transactions on Computers, 38(6), 1989, 845-852.
486. J. E. Burns and J. K. Pachl, Uniform self-stabilizing rings, ACM Transactions on Programming Languages and Systems (TOPLAS), 11(2), 1989, 330-344.
487. J. E. Burns, Self-stabilizing Rings Without Demons, Technical Report GITICS-87/36, Georgia Institute of Technology, 1987.
488. J. E. Burns, M. G. Gouda, and R. E. Miller, Stabilization and pseudo-stabilization, Distributed Computing archive, 7(1), 1993.
489. J. E. Burns, M. G. Gouda, and R. E. Miller, On relaxing interleaving assumptions, Proceedings of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report STP-379-89, 1989.
490. R. W. Buskens and R. P. Bianchini, Jr., Self-stabilizing mutual exclusion in the presence of faulty nodes, Proceedings of the 25th International Symposium on Fault Tolerant Computing 1995, 144-153.
491. F. Butelle, C. Lavault, and M. Bui, A uniform self-stabilizing minimum diameter tree algorithm (extended abstract), in J.-M. Hélary and M. Raynal, (eds), Distributed Algorithms, 9th International Workshop, WDAG ’95, Le Mont-Saint-Michel, France, September 13-15, 1995, 25-272.
492. E. J. H. Chang, G. H. Gonnet, and D. Rotem, On the costs of self-stabilization, Information Processing Letters, 24(5), 1987, 311-316.
493. K. M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, 1985, 63-75.
494. N. S. Chen, H.-P. Yu, and S.-T. Huang, A self-stabilizing algorithm for constructing spanning trees, Information Processing Letters, 39, 1991, 147-151.
495. Cisco Systems Inc, Using Vlan Director, system documentation, 1998, available online at: www.cisco.com/univercd/cc/td/doc/product/rtrmgmt/swntman/cwsimain/cwsi2/cwsiug2/vlan2/index.htm.
496. Z. Collin and S. Dolev, Self-stabilizing depth first search, Information Processing Letters, 49, 1994, 297-301.
497. N. F. Couvreur and M. G. Gouda, Asynchronous unison, Proceedings of the 12th International Conference on Distributed Computing Systems, Yokohama, Japan, June 1992.
498. E. W. Dijkstra, A belated proof of self-stabilization, Distributed Computing, 1, 1986, 5-6.
499. E. W. Dijkstra, Self stabilizing systems in spite of distributed control, Communications of the ACM, 17(11), 1974, 643-644.
500. S. Dolev, A. Israeli, and S. Moran, Uniform dynamic self-stabilizing leader election, IEEE Transactions on Parallel and Distributed Systems, 8(4), 1997, 424-440.
501. S. Dolev, Optimal time self-stabilization in dynamic systems (preliminary version), in André Schiper (ed.), Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG93), Lausanne, Switzerland, September 27-29, 1993, 160-173.
502. S. Dolev, Self-Stabilization, MIT Press, 2000.
503. S. Dolev, M. G. Gouda, and M. Schneider, Memory requirements for silent stabilization, Acta Informatica, 36(6), 1999, 447-462.
504. S. Dolev, A. Israeli, and S. Moran, Self stabilization of dynamic systems, Proceedings of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report STP-379-89, 1989.
505. S. Dolev, A. Israeli, and S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Canada, August 22-24, 1990, 103-117.
506. M. Flatebo and A. Datta, Two-state self-stabilizing algorithms, Proceedings of the 6th International Parallel Processing Symposium, Beverly Hills, CA, March 1992, 198-203.
507. M. Flatebo, A. K. Datta, and S. Ghosh, Self-stabilization in distributed systems, in T. L. Casavant and M. Singhal (eds), Readings in Distributed Computer Systems, New York, IEEE Computer Society Press, 1994, 100-114.
508. F. C. Gartner, A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms, EPFL Technical Report, 2003. Available online at: icwww.epfl.ch/publications/documents/IC_TECH_REPORT_200338.pdf.
509. F. C. Gartner and H. Pagnia, Time-efficient self-stabilizing algorithms through hierarchical structures, Proceedings of the 6th Symposium on Self-Stabilizing Systems, San Francisco, June 2003, Springer-Verlag.
510. C. Genolini and S. Tixeuil, A lower bound on dynamic k-stabilization in asynchronous systems, SRDS 2002 21st Symposium on Reliable Distributed Systems, 2002, 211-221.
511. S. Ghosh, Binary self-stabilization in distributed systems, Information Processing Letters, 40(3), 1991, 153-159.
512. S. Ghosh, Self-stabilizing distributed systems with binary machines, Proceedings of the 28th Annual Allerton Conference, 1990, 988-997.
513. S. Ghosh, A. Gupta, T. Herman, and S. V. Pemmaraju, Fault-containing selfstabilizing algorithms, Proceedings of the 15th Annual ACM Symposium on Principles of distributed computing, Philadelphia, 1996, 45-54.
514. S. Ghosh, Understanding Self-stabilization in Distributed Systems, Technical Report TR-90-02, Department of Computer Science, University of Iowa, 1990.
515. S. Ghosh, A. Gupta, and S. Pemmaraju, A fault-containing self-stabilizing algorithm for spanning trees, Journal of Computing and Information, 2, 1996, 322-338.
516. S. Ghosh, A. Gupta, M. Karaata, and S. Pemmaraju, Self-stabilizing dynamic programming algorithms on trees, Proceedings of the 2nd Workshop on Self-Stabilizing Systems, 1995, 11.1-11.15.
517. M. G. Gouda, The Stabilizing Philosopher: Asymmetry by Memory and by Action, Technical Report TR-87-12, Department of Computer Sciences, University of Texas at Austin, 1987.
518. M. G. Gouda and M. Evangelist, Convergence/response tradeoffs in concurrent systems, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, December 1990, 288-292.
519. M. G. Gouda and T. Herman, Stabilizing unison, Information Processing Letters, 35, 1990, 171-175.
520. M. G. Gouda and N. Multari, Stabilizing communication protocols, IEEE Transactions on Computers, 40(4), 1991, 448-458.
521. M. G. Gouda, R. R. Howell, and L. E. Rosier, The instability of self-stabilization, Acta Informatica, 27, 1990, 697-724.
522. F. F. Haddix, Stabilization of Bounded Token Rings, Technical Report ARL-TR-91-31, Applied Research Laboratory, University of Texas at Austin, 1991.
523. S. M. Hedetniemi, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani, Selfstabilizing algorithms for minimal dominating sets and maximal independent sets, Computers, Mathematics and Applications, 46(5-6), 2003, 805-811.
524. T. Herman, Probabilistic self-stabilization, Information Processing Letters, 35(2), 1990, 63-67.
525. T. Herman, Self-stabilization: randomness to reduce space, Distributed Computing, 6, 1992, 95-98.
526. L. Higham and Z. Liang, Self-stabilizing minimum spanning tree construction on message-passing networks, Proceedings of the 15th International Symposium on Distributed Computing (DISC), Lisbon, Portugal, October 2001.
527. S.-C. Hsu and S.-T. Huang, A self-stabilizing algorithm for maximal matching, Information Processing Letters, 43(2), 1992, 77-81.
528. S. Huang and N. Chen, A self-stabilizing algorithm for constructing breadth-first trees, Information Processing Letters, 41, 1992, 109-117.
529. A. Israeli and M. Jaflon, Token management schemes and random walks yield self-stabilizing mutual exclusion, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Quebec, Canada, August, 22-24, 1990, 119-131.
530. G. Itkis and L. Levin, Fast and lean self-stabilizing asynchronous protocols, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, November 20-22, 1994, 226-239.
531. C. Johnen, Memory efficient, self-stabilizing algorithm to construct BFS spanning trees, Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC ’97), August 1997, 288.
532. H. Kakugawa and M. Yamashita, A Universal Self-Stabilizing Mutual Exclusion Algorithm, Dagstuhl Seminor 00431: SelfStabilization, Dagstuhl, Germany, 2000. Available online at http://citeseer.ist.psu.edu/yamashita00universal.html.
533. R. Kat, Self-stabilizing replication file system, September 2002 available online at: www.cs.bgu.ac.il/srfs/.
534. S. Katz and K. J. Perry, Self-stabilizing extensions for message-passing systems, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Canada, August 1990, 22-24, 91-101.
535. H. S. M. Kruijer, Self-stabilization (in spite of distributed control) in treestructured systems, Information Processing Letters, 8(2), 1979, 2-79.
536. D. Lehman and M. Rabin, On the advantages of free choice: a symmetric and fully distributed solution of the dining philosopher’s problem, Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, 1981.
537. X. Lin and S. Ghosh, Self-stabilizing maxima finding, Proceedings of the 28th Annual Allerton Conference, 1991, 662-671.
538. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM Journal on Computing, 15(4), 1986, 1036-1055.
539. M. Mizuno, M. Nesterenko, and H. Kakugawa, Lock based self-stabilizing distributed mutual exclusion algorithms, International Conference on Distributed Computing Systems, 1996, 708-716.
540. R.-C. Pan, J.-Z. Wang, and L. R. Chow. A self-stabilizing distributed spanning tree construction algorithm with a distributed demon, Tamsui Oxford Journal of Mathematical Sciences, 15, 1999, 23-32.
541. M. Schneider, Self-Stabilization - A Unified Approach to Fault Tolerance in the Face Transient Errors, TechReport TR-91-18, Department of Computer Science, University of Texas at Austin, TX, 1991.
542. M. Schneider, Compiling Self-Stabilization into Sequential Programs, Department of Computer Science, University of Texas at Austin, TX, 1992.
543. M. Schneider, Lecture notes on Self-Stabilization, The University of Texas at Austin, available online at: www.cs.utexas.edu/users/plaxton/c/395t/slides/Schneider.pdf.
544. M. Schneider, Self stabilization, ACM Computing Surveys, 25(1), 1993.
545. S. Shukla, D. Rosenkrantz, and S. Ravi, Observations on self-stabilizing graph algorithms for anonymous networks, Proceedings of the Second Workshop on Self-Stabilizing Systems, 1995, 7.1-7.15.
546. Z. Shi, W. Goddard, and S. T. Hedetniemi, An anonymous self-stabilizing algorithm for 1-maximal independent set in trees, Information Processing Letters, 91(2), 2004, 77-83.
547. S. Sur and P. K. Srimani, A self-stabilizing distributed algorithm to construct BFS spanning trees of a symmetric graph, Parallel Processing Letters, 2(2-3), 1992, 171-179.
548. M.-S. Tsai and S.-T. Huang, A self-stabilizing algorithm for the shortest paths problem with a fully distributed demon, Parallel Processing Letters, 4(1-2), 1994, 65-72.
549. K. Aberer and Z. Despotovic, Managing trust in a peer-to-peer information system, Proceedings of the 10th International Conference on Information and Knowledge Management, Atlanta, Georgia, USA, November 2001, 310-317.
550. L. Adamic, Zipf, Power-Laws, and Pareto - A Ranking Tutorial, available online at: www.hpl.hp.com/research/idl/papers/ranking/ranking.html.
551. R. Albert and A.-L. Barabasi, Topology of evolving networks: local events and universality, Physical Review Letters, 85(24), 2000, 5234-5237.
552. R. Albert and A.-L. Barabasi, Statistical mechanics of complex networks, Review of Modern Physics, 74(1), 2002, 47-97.
553. R. Albert, H. Jeong, and A. Barabasi, Error and attack tolerance of complex networks, Nature, 406, 2000, 378-381.
554. S. Androutsellis-Theotokis and D. Spinellis, A survey of peer-to-peer content distribution technologies, ACM Computing Surveys, 36(4), 2004, 335-371.
555. A.-L. Barabasi and R. Albert, Emergence of scaling in random networks, Science, 286, 1999, 509-512.
556. B. Bollobas, Degree sequences of random graphs, Discrete Math, 33, 1981, 1-9.
557. B. Bollobas, Random Graphs, London, Academic Press, 1985.
558. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, Freenet: a distributed anonymous information storage and retrieval system, Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July 2000, 46-66.
559. B. Cohen, Incentives Build Robustness in BitTorrent, available online at: www.bittorrent.com/bittorrentecon.pdf.
560. E. Cohen and S. Shenker, Replication strategies in unstructured peer-to-peer networks, ACM SIGCOMM, 2002, 177-190.
561. S. Dogorotsev, J. Mendes, and A. Samukhin, Structure of growing networks: exact solution of the Barabasi-Albert model, Physical Review Letters, 85, 2000, 4633-4636.
562. P. Erdos and A. Renyi, Random graphs. 6, 1959, 290-.
563. K. Goh, E. Oh, H. Jeong, B. Kahng, and D. Kim, Classification of scale-free networks, Proceedings of the National Academy of Sciences, 2002.
564. Gnutella, www.gnutella.com/.
565. The Gnutella protocol specification, available online at: www9.limewire. com/developer/gnutella_protocol_0.4.pdf.
566. M. Gupta, P. Judge, and M. Ammar, A reputation system for peer-to-peer networks, Proceedings of the 13th International Workshop on Network and Operating Systems Support for Digital Audio and Video, Monterey, CA, June 2003, 144-152.
567. M. Gupta, M. H. Ammar, and M. Ahamad, Trade-offs between reliability and overheads in peer-to-peer reputation tracking, Computer Networks, 50(4), 2006, 501-522.
568. K. Hildrum, J. Kubiatowicz, S. Rao, and B. Y. Zhao, Distributed object location in a dynamic network, Proceedings of ACM SPAA 2002, 41-52.
569. K. Hildrum, J. Kubiatowicz, S. Rao, and B. Y. Zhao, Distributed object location in a dynamic network, Theory of Computing Systems, 37, 2004, 405-440.
570. P. Krapivsky, S. Redner, and F. Leyvraz, Connectivity of growing random networks, Physical Review Letters, 85, 2000, 4629-4632.
571. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and replication in unstructured peer-to-peer networks, International Conference on Supercomputing, 2002, 84-95.
572. S. Milgram, The small world problem, Psychology Today, 1(2), 1967, 60-67.
573. Napster, www.napster.com/.
574. C. G. Plaxton, R. Rajaraman, and A. W. Richa, Accessing nearby copies of replicated objects in a distributed environment, Proceedings of ACM SPAA 1997, 311-320.
575. S. Ratnasamy, P. Francis, M. Handley, R.M. Karp, and S. Shenker, A scalable content-addressable network, Proceedings of ACM SIGCOMM 2001, 161-172.
576. S. Ratnasamy, I. Stoica, and S. Shenker, Routing algorithms for DHTs: some open questions, Proceedings of IPTPS 2002, 45-52.
577. J. Risson and T. Moors, Survey of research towards robust peer-to-peer networks: search methods, Computer Networks, 50(17), 2006, 3485-3521.
578. A. Rowstron and P. Druschel, Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems, Proceedings of the IFIP/ACM Middleware 2001, Heidelberg, Germany, November 2001, 329-350.
579. G. Siganos, M. Faloutsos, P. Faloutsos, and C. Faloutsos, Power laws and the ASlevel internet topology, IEEE/ACM Transactions on Networking, 11(4), 2003, 514-524.
580. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for internet applications, IEEE Transactions on Networking, 11(1), 2003, 17-31.
581. D. J. Watts and S. H. Strogatz, Collective dynamics of “Small World” networks, Nature, No. 393, 1998, 440-442.
582. J. Xu, A. Kumar, and X. Yu, On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks, IEEE Journal on Selected Areas in Communications, 22(1), 2004, 151-163.
583. B. Y. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz, Tapestry: a resilient global-scale overlay for service deployment, IEEE Journal on Selected Areas in Communications, 22(1), 2004, 41-53.
584. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing, Technical Report UC Berkeley, CSD-01-1141, University of California at Berkeley, Berkeley, CA, 2001.