Modeling and simulation of distributed systems

Modeling and Simulation of Distributed Systems

Volumn , Issue , 2010, Pages 1-419

  Kostin, Alexander ^a   Ilushechkina, Ljudmila ^b  

^a EASTERN MEDITERRANEAN UNIVERSITY   (Turkey)

^b NATIONAL RESEARCH UNIVERSITY OF ELECTRONIC TECHNOLOGY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EDUCATION; ENGINEERING EDUCATION; PETRI NETS; STUDENTS;

COMPUTER ENGINEERING; COMPUTER ENGINEERING COURSE; DESIGN AND IMPLEMENTATIONS; DISTRIBUTED SYSTEMS; EXTENDED PETRI NET; MODEL AND SIMULATION; MODELING AND SIMULATION TECHNIQUES; SYSTEM ARCHITECTS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84967367149     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/7562     Document Type: Book

References (231)

1. AMDAHL, G. [1967], Validity of the Single processor Approach to Achieving Large Scale Computing Capabilities, AFIPS Conference Proceedings, Vol. 30, Thompson Books, Washington, DC, pp. 483-485.
2. ARJOMANDI, E., FISCHER, M.J., and LYNCH, N.A. [1983], Efficiency of Synchronous Versus Asynchronous Distributed Systems, Journal of the ACM, Vol. 30, No. 3, pp. 449-456.
3. ATTIYA, H. and WELCH, J. [1998], Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, London.
4. BIRMAN, K.P. [2005], Reliable Distributed Systems: Technologies, Web Services, and Applications, Springer.
5. CHOY, M. and SINGH, A.K. [1995], Efficient Implementation of Synchronous Communication Over Asynchronous Networks, Journal of Parallel and Distributed Computing, Vol. 26, No. 2, pp. 166-180.
6. COHEN, A. and WOODRING, M. [1998], Win32 Multithrea.ded Programming, O’Reilly & Associates, Inc.
7. COMER, D.E. [2006], Internetworking with TCP/IP, Vol. 1: Principles, Protocols, and Architecture, 5th ed., Prentice Hall, Upper Saddle River, NJ.
8. COULOURIS, G., DOLLIMORE, J., and KINDBERG, T. [2005], Distributed Systems: Concepts and Design, 4th ed., Addison-Wesley, Reading, MA.
9. CRISTIAN, F. [1996], Synchronous and Asynchronous Group Communication, Communications of the ACM, Vol. 39, No. 4, pp. 88-97.
10. CRISTIAN, F. and FETZER, C. [1999], The Timed Asynchronous Distributed System Model, IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 6, pp. 642-657.
11. CURRY, D.A. [1996], UNIX System Programming for SVR4, O’Reilly & Associates, Inc.
12. FOKKINK, W. [2007], Modelling Distributed, Systems, Springer.
13. HADZILACOS, V. and TOUEG, S. [1993], Fault-Tolerant Broadcasts and Related Problems. In: Mullender, S. (Ed.), Distributed Systems, 2nd ed., Addison-Wesley, Reading, MA.
14. HAVILAND, K., GRAY, D., and SALAMA, B. [1999], UNIX System Programming, Addison-Wesley, Reading, MA.
15. JOGALEKAR, P. and WOODSIDE, M. [2000], Evaluating the Scalability of Distributed Systems, IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 6, pp. 589-603.
16. KSHEMKALYANI, A.D. and SINGHAL, M. [2008], Distributed, Computing: Principles, Algorithms, and Systems, Cambridge University Press.
17. LAMPORT, L., SHOSTAK, R., and PEASE, M. [1982], The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3, pp. 382-401.
18. LYNCH, N. [1996], Distributed Algorithms, Morgan Kaufmann.
19. MULLENDER, S. (Ed.) [1993], Distributed, Systems, 2nd ed., Addison-Wesley, Reading, MA.
20. NICHOLS, B., BUTTLAR, D., and FARELL, J.D. [1996], Phreads Programming: A POSIX Standard for Better Multiprocessing, O’Reilly Media, Inc.
21. ABBAS, A. [2003], Grid Computing: A Practical Guide to Technology and Applications, Charles River Media, Inc., MA.
22. ALMEROTH, K.C. [2000], The Evolution of Multicast: From the MBone to Interdomain Multicast to Internet2 Deployment, IEEE Network, Vol. 14, No. 1, pp. 10-20.
23. ATWOOD, J.W. [2004], A Classification of Reliable Multicast Protocols, IEEE Network, May/June, pp. 24-34.
24. BIRMAN, K. [1999], A Review of Experiences with Reliable Multicast, Software — Practice and Experience, Vol. 29, No. 9, pp. 741-774.
25. BLOOMER, J. [1992], Power Programming with RPC, O’Reilly & Associates, Inc.
26. CHANG, J. and MAXEMCHUK, N. [1984], Reliable Broadcast Protocols, ACM Transactions on Computer Systems, Vol. 2, No. 3, pp. 251-275.
27. CHU, Y.-H., RAO, S.G., SESHAN, S., and ZHANG, H. [2002], A Case for End System Multicast, IEEE Journal on Selected Areas in Communications, Vol. 20, No. 8, pp. 1456-1471.
28. COHEN, A. and WOODRING, M. [1998], Win32 Multithreaded Programming, O’Reilly & Associates, Inc.
29. COULOURIS, G., DOLLIMORE, J., and KINDBERG, T. [2005], Distributed Systems: Concepts and Design, 4th ed., Addison-Wesley, Reading, MA.
30. DEERING, S. [1989], Host Extensions for IP Multicast, RFC 1112, August.
31. DEERING, S. and HINDEN, R. [1998], Internet Protocol Version 6 (IPv6) Specification, RFC 2460, December.
32. DIOT, C., DABBOUS, W., and CROWFORT, J. [1997], Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms, IEEE Journal on Selected Areas in Communications, Vol. 15, No. 3, pp. 277-290.
33. ERIKSSON, H. [1994], MBone: The Multicast Backbone, Communications of the ACM, Vol. 37, August, pp. 54-60.
34. GARCIA-MOLINA, H. and SPAUSTER, A. [1991], Ordered and Reliable Multicast Communication, ACM Transactions on Computer Systems, Vol. 9, No. 3, pp. 242-271.
35. GRAY, J.S. [1997], Interprocess Communication in UNIX: The Nooks and Crannies, 2nd ed., Prentice Hall, Upper Saddle River, NJ.
36. HADZILACOS, V. and TOUEG, S. [1993], Fault-Tolerant Broadcasts and Related Problems. In: Mullender, S. (Ed.), Distributed Systems, 2nd ed., Addison-Wesley, pp. 97-145.
37. LAMPORT, L. [1986], On Interprocess Communication, Distributed Computing, Vol. 1, No. 2, pp. 77-101.
38. MELLIAR-SMITH, P., MOSER, L., and AGRAVALA, V. [1990], Broadcast Protocols for Distributed Systems, IEEE Transactions on Parallel and Distributed Systems, Vol. 1, No. 1, pp. 17-25.
39. MILLER, C.K. [1999], Multicast Networking and Applications, Addison-Wesley, Reading, MA.
40. MIURA, H. and YAMAMOTO, M. [2001], Server Selection Policy in Active Anycast, IEICE Trans. Commun., Vol. E84-B, No. 10, October, pp. 1-4.
41. OBRACZKA, K. [1998], Multicast Transport Protocols: A Survey and Taxonomy, IEEE Communications Magazine, Vol. 36, No. 1, pp. 94-102.
42. PARTRIDGE, C., MENDEZ, T., and MILLIKEN, W. [1993] Host Anycasting Service, RFC 1546, November.
43. PAUL, S., SABNANI, K.K., LIN, J.C.-H., and BHATTACHARYYA, S. [1997], Reliable Multicast Transport Protocol (RMTP), IEEE Journal on Selected Areas in Communications, Vol. 15, No. 3, pp. 407-421.
44. QUINN, B. and SHUTE, D. [1996], Windows Sockets Network Programming, Addison-Wesley, Reading, MA.
45. SAHASRABUDDHE, L.H. and MUKHERJEE, B. [2000], Multicast Routing Algorithms and Protocols: A Tutorial, IEEE Network, Vol. 14, No. 1, pp. 90-102.
46. SINHA, A.K. [1996], Network Programming in Windows NT, Addison-Wesley, Reading, MA.
47. SKIENA, S.S. [1997], The Algorithm Design Manual, Springer Verlag, New York.
48. STEVENS, W.R. [1999], UNIX Network Programming, Vol. 2: Interprocess Communication, 2nd ed., Prentice Hall, Upper Saddle River, NJ.
49. SUBRAMANIAN, R. (Ed.) [2005], Peer-to-Peer Computing: The Evolution of a Distruptive Technology, Idea Group Publishing, Hershey, PA.
50. WEBER, S. and CHENG, L. [2004], A Survey of Anycast in IPv6 Networks, IEEE Communications Magazine, January, pp. 127-132.
51. WINTER, P. [1987], Steiner Problem in Networks: A Survey, Networks, Vol. 17, pp. 129-167.
52. YEO, C.K., LEE, B.S., and ER, M.H. [2004], A Survey of Application Level Multicast Techniques, Computer Communications, Vol. 27, pp. 1547-1568.
53. YU, S., ZHOU, W., and WU, Y. [2002], Research on Network Anycast, Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing (ICAPP’02), October 23-25, pp. 154-161.
54. ZEGURA, E.W., AMMAR, M.H., FEI, Z., and BHATTACHARJEE, S. [2000], Application-Layer Anycasting: A Server Selection Architecture and Use in a Replicated Web Service, IEEE/ACM Trans. on Networking, Vol. 8, No. 4, pp. 455-466.
55. ZHANG, B., WANG, W., JAMIN, S., MASSEY, D., and ZHANG, L. [2006], Universal IP Multicast Delivery, Computer Networks, Vol. 50, pp. 781-806.
56. BENTHEM, Van J. [1995] Temporal Logic. In: Gabbay, D.M., Hogger, C.J., and Robinson, J.A. (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 4, Clarendon Press, Oxford, pp. 241-350.
57. DESROCHERS, A.A. and AL-JAAR, R.Y. [1995], Application of Petri Nets in Manufacturing Systems: Modeling, Control and Performance Analysis, IEEE Press.
58. GENRICH, H.J. and LAUTENBACH, K. [1981], System Modelling with High Level Petri Nets, Theoretical Computer Science, Vol. 13, No. 1, pp. 109-136.
59. GILL, A. [1962], Introduction to the Theory of Finite-State Machines, Mc-Graw Hill, Inc.
60. HAILPERN, B.T. [1982], Verifying Concurrent Processes Using Temporal Logic, Springer, Berlin.
61. HOARE, C.A.R. [1985], Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, Inc., NJ.
62. JENSEN, K. [1987], Colored Petri Nets, Lecture Notes in Computer Science, Vol. 254, pp. 248-299.
63. JENSEN, K. [1998], An Introduction to the Practical Use of Colored Petri Nets, Lecture Notes in Computer Science, Vol. 340, Springer-Verlag, pp. 237-292.
64. KOSTIN, A.E. [2003], Reachability Analysis in T-Invariant-less Petri Nets. IEEE Trans. on Automatic Control, Vol. 48, No. 6, pp. 1019-1024.
65. KOSTIN, A.E. [2006], A Reachability Algorithm for General Petri Nets Based on Transition Invariants, Lecture Notes in Computer Science, Vol. 4162, pp. 608-621.
66. LIPTON, R.J. [1976], The Reachability Problem Requires Exponential Space, Res. Rep. 62, Yale University, Dept. of Computer Science, New Haven, CT.
67. MARSAN, M.A. and CHIOLA, G. [1987], On Petri Nets with Deterministic and Exponential Transition Firing Times, Lecture Notes in Computer Science, Vol. 226, pp. 132-145.
68. MARSAN, M.A., BALBO, G., CONTE, G., DONATELLI, S., and FRANCESCHINIS, G. [1995], Modelling with Generalized Stochastic Petri Nets, John Wiley, 1995.
69. MEMMI, G. and ROUCAIROL, G. [1980], Linear Algebra in Net Theory. In: Brauer, W. (Ed.), Net Theory and Applications, Lecture Notes in Computer Science, Vol. 84, Springer-Verlag, pp. 213-223.
70. MILNER, R. [1980], A Calculus of Communicating Systems, Springer, Berlin.
71. MILNER, R. [1989], Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ.
72. MURATA, T. [1989], Petri Nets: Properties, Analysis and Applications, Proc. IEEE, Vol. 77, No. 4, pp. 541-580.
73. PELED, D. [1993], All from One, One to All, Lecture Notes in Computer Science, Vol. 697, Springer-Verlag, pp. 409-423.
74. PETERSON, J.L. [1981], Petri Net Theory and the Modeling of Systems, Prentice- Hall, Inc., Englewood Cliffs, NJ.
75. PETRI, C.A. [1962], Communication with Automata, Doctoral Dissertation, University of Bonn, Bonn, West Germany.
76. PETRI NETS DB, http://www.informatik.uni-hamburg.de/TGI/PetriNets/.
77. PNUELI, A. [1977], The Temporal Logic of Programs, Proceedings of the 18th Symposium on the Foundation of Computer Science, pp. 46-57.
78. REISIG, W. [1983], Petri Nets with Individual Tokens, Informatik-Fachberichte, Vol. 61, No. 21, pp. 229-249.
79. SAUER, C.H. and CHANDY, K.M. [1981], Computer Systems Performance Modeling, Prentice-Hall, Englewood Cliffs, Inc, NJ.
80. SCHMIDT, K. [1999], Stubborn Sets for Standard Properties, Lecture Notes in Computer Science, Vol. 1639, Springer-Verlag, pp. 46-65.
81. VARPAANIEMI, K. [1998], On the Stubborn Set Method in Reduced State Space Generation, PhD Thesis, Dept. of Computer Science and Engineering, Helsinki University of Technology.
82. YU, S., ZHOU, W., and WU, Y. [2002], Research on Network Anycast, Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing (ICAPP’02), October 23-25, pp. 154-161.
83. BOHM, C. and JACOPINI, G. [1966], Flow-Diagrams, Turing Macines and Languages with only Two Formation Rules, Communications of the ACM, Vol. 9, No. 5, pp. 366-371.
84. BRAUNL, T. [1993], Parallel Programming: An Introduction, Prentice-Hall.
85. DAHL, O.-J., DIJKSTRA, E.W., and HOARE, C.A.R. [1972], Structured Programming, Academic Press, London.
86. KOSTIN, A.E. and SAVTSCHENKO, L.V. [1988], Modified E-nets for Investigation of Distributed Data Processing Systems, Automatic Control and Computer Sciences, Vol. 22, No. 6, pp. 26-34.
87. KUZMUK, V.V. [1986], Construction and Optimization of Concurrent Algorithms Using Control Nets. In: Ruschitzka, M. (Ed.), Computer Systems: Performance and Simulation, Elsevier, Amsterdam, pp. 119-125.
88. MARSAN, M.A., BALBO, G., CONTE, G., DONATELLI, S., and FRANCESCHINIS, G. [1995], Modelling with Generalized Stochastic Petri Nets, John Wiley & Sons.
89. MCCARTHY, J. [1963], A Basis for a Mathematical Theory of Computations. In: Braffort, P., and Hirschberg, D. (Eds.), Computer Programming and Formal Systems, North-Holland, Amsterdam, pp. 33-70.
90. MURATA, T. [1989], Petri Nets: Properties, Analysis and Application, Proceedings of the IEEE, Vol. 77, No. 4, pp. 541-580.
91. NUTT, G.J. [1972], Evaluation Nets for Computer System Performance Analysis, AFIPS FJCC, Vol. 41, Pt. 1, pp. 279-286.
92. SYMMONS, F.J.W. [1980], Introduction to Numerical Petri Nets, a General Graphical Model of Concurrent Processing Systems, Australian Telecommunication Research, Vol. 14, No. 1, pp. 28-33.
93. DEWITZ, S.D. [1996], Systems Analysis and Design and the Transition to Objects, McGraw-Hill.
94. KARIAN, Z.A. and DUDEWICZ, E.J. [1999], Modern Statistical Systems and GPSS Simulation, 2nd ed., CRS Press.
95. LAW, A.M. and KELTON, W.D. [2000], Simulation Modeling and Analysis, 3rd ed., McGraw-Hill, New York.
96. RUSSELL, E.C. [1983], Building Simulation Models with SIMSCRIPT II. 5, CACI Products Company.
97. BANKS, J., CARSON, J.S., NELSON, B.L., and NICOL, D.M. [2005], Discrete- Event System Simulation, 4th ed., Pearson Education, Inc., Upper Saddle River, NJ.
98. BUNDAY, B.D. [1986], Basic Queuing Theory, Edward Arnold Publishers, Ltd.
99. CHISMAN, J.A. [1992], Introduction to Simulation Modelling Using GPSS/PC, Simon & Schuster.
100. DENNING, P.J. and BUZEN, J.P. [1978], The Operational Analysis of Queuing Network Models, ACM Computing Surweys, Vol. 10, No. 3, pp. 225-261.
101. FELLER, W. [1968], An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed., Wiley, New York.
102. KLEINROCK, L. [1976], Queuing Systems, Vol. 2: Computer Applications, Wiley, NY.
103. KOSTIN, A. and ILUSHECHKINA, L. [2004], Winsim: A Tool for Performance Evaluation of Parallel and Distributed Systems, Lecture Notes in Computer Science, Vol. 3261, Springer, pp. 312-321.
104. LAW, A.M. and KELTON, W.D. [2000], Simulation Modeling and Analysis, 3rd ed., McGraw-Hill, New York.
105. SAUER, C.H. and CHANDY, K.M. [1981], Computer Systems Performance Modeling, Prentice-Hall, Inc., Englewood Cliffs, NJ.
106. TANENBAUM, A.S. [2007], Modern Operating Systems, 3rd ed., Prentice-Hall, Inc., Englewood Cliffs, NJ.
107. BUX, W. [1981], Local Area Subnetworks: A Performance Comparison, IEEE Trans. on Communication, Vol. COM-29, No. 10, pp. 1465-1473.
108. DAVIES, D.W. [1979], Computer Networks and their Protocols, John Wiley and Sons.
109. DENG, X.T., LIU, H.N., LONG, J.S., and XIAO, B. [1997], Competitive Analysis of Network Load Balancing, Journal of Parallel and Distributed Computing, Vol. 40, No. 2, pp. 162-172.
110. DIERKES, S. [1997], Load Balancing with a Fuzzy-Decision Algorithm, Information Sciences, Vol. 97, No. 1-2, pp. 159-177.
111. GARCIA-MOLINA, H. and SPAUSTER, A. [1991], Ordered and Reliable Multicast Communication, ACM Transactions on Computer Systems, Vol. 9, No. 3, August, pp. 242-271.
112. HELD, G. [1994], Local Area Network Performance: Issues and Answers, John Wiley & Sons.
113. JAIN, R. [1991], The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling, John Wiley & Sons.
114. JARDOSH, A., BELDING-ROYER, E.M., ALMEROH, K.C., and SURI, S. [2003], Towards Realistic Mobility Models for Mobile Ad Hoc Networks, Proc. of the 9th Annual International Conference MobilCom’03, pp. 217-229.
115. KAASHOEK, M.F., TANENBAUM, A.S., HUMMEL, S., and BAL, H.E. [1989], An Efficient Reliable Broadcast Protocol, Operating Systems Review, Vol. 23, No. 4, October, pp. 5-19.
116. KIESS, W. and MAUVE, M. [2007], A Survey on Real World Implementations of Mobile Ad-Hoc Networks, Ad Hoc Networks, Vol. 5, pp. 324-339.
117. KLEINROCK, L. [1976], Queuing Systems, Vol. 2: Computer Applications, John Wiley & Sons.
118. KOSTIN, A.E., AYBAY, I., and OZ, G. [2000], A Randomized Contention-Based Load-Balancing Protocol for a Distributed Multiserver Queuing System, IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 12, pp. 1252-1273.
119. KOSTIN, A. and ILUSHECKINA, L. [2004], Winsim: A Tool for Performance Evaluation of Parallel and Distributed Systems, Lecture Notes in Computer Science, Vol. 3261, pp. 312-321.
120. KOSTIN, A. and OZ, G. [2003], A Fault-Tolerant Load-Balancing Protocol for Distributed Multiserver Queuing Systems, Proceedings of the Eight IEEE Symposium on Computers and Communication, (ISCC 2003), Antalya, Turkey, 30 June-3 July, pp. 1201-1206.
121. KUROSE, J.F. and ROSS, K.W. [2008], Computer Networking: A Top-Down Approach, Pearson Addison-Wesley.
122. LAM, S.S. [1980], A Carrier Sense Multiple Access Protocol for Local Networks, Computer Networks, Vol. 4, No. 1, pp. 21-32.
123. LAYUAN, L., CHUNLIN, L., and PEYAN, Y. [2007], Performance Evaluation and Simulations of Routing Protocols in Ad Hoc Networks, ACM Computer Communication, Vol. 30, pp. 1890-1898.
124. MADRON, T.W. [1989], LANs: Application of IEEE/ANSI 802 Standards, John Wiley and Sons, New York.
125. MEHARA, P. and WAH, B.W. [1997], Automated Learning of Load-Balancing Strategies in Multiprogrammed Distributed Systems, International Journal of Systems Science, Vol. 28, No. 11, November, pp. 1077-1099.
126. MOSER, L.E., MELIAR-SMITH, P.M., AGRWAL, D.A., BUDHIA, R.K., and LINGLEY-PAPADOPOULIS, C.A. [1996], Totem: A Fault-Tolerant Multicast Group Communication System, Communications of the ACM, Vol. 39, No. 4, April, pp. 54-63.
127. MURTHY, C.S.R. and MANOY, B.S. [2004], Ad Hoc Wireless Networks: Architecture and Protocols, Prentice Hall.
128. NICOLAOU, C.N. and RICHTER, L. [1997], Special Issue on Load Balancing in Distributed Systems — Introduction, Information Sciences, Vol. 97, No. 1-2, pp. 1-3.
129. RENESSE van, R., BIRMAN, K.P., and MAFFEIS, S. [1996], Horus: A Flexible Group Communication System, Communications of the ACM, Vol. 39, No. 4, April, pp. 76-83.
130. SCHIEMANN, B. [1997], Exploiting Interface Definition Languages for Load Balancing, Information Sciences, Vol. 97, No. 1-2, pp. 221-231.
131. TANENBAUM, A.S. [2003], Computer Networks, 4th ed., Pearson Education International.
132. VENTCEL, E.S. and OVCHAROV, L.A. [1969], Probability Theory, Moscow, Nauka Publ.
133. AIMEROCH, K.C. [2000], The Evolution of Multicast: From the MBone to Interdomain Multicast to Internet2 Deployment, IEEE Network, Vol. 14, No. 1, January/February, pp. 10-20.
134. BABAOGLU, O. and TOUEG, S. [1993], Non-blocking Atomic Commitment. In: S. Mullender (Ed.), Distributed Systems, 2nd ed., Addison-Wesley.
135. BANKS, J., CARSON, J.S., NELSON, B.L., and NICOL, D.M. [2005], Discrete- Event System Simulation, 4th ed., Prentice-Hall.
136. BIRMAN, K.P. [1999], A Review of Experiences with Reliable Multicast, Software — Practice and Experience, Vol. 29, No. 4, pp. 741-774.
137. CHANG, Y.-I. [1996], A Simulation Study on Distributed Mutual Exclusion, Journal of Parallel and Distributed Computing, Vol. 33, No. 2, March, pp. 107-121.
138. CHANG, J.M. and MAXEMCHUK, N.F. [1984], Reliable Broadcast Protocols, ACM Transactions on Computer Systems, Vol. 2, No. 3, pp. 251-273.
139. CHOCKLER, G. and MALKHI, D. [2001], Backoff Protocols for Distributed Mutual Exclusion and Ordering, Proc. of the 21st Int’l Conf. on Distributed, Computing Systems (ICDCS’01), 16-19 April, pp. 11-20.
140. COULOURIS, G., DOLLIMORE, J., and KINDBERG, K. [2005], Distributed Systems: Concepts and Design, 4th ed., Addison Wesley.
141. FINEBERG, V. [2002], A Practical Architecture for Implementing End-to-End QoS in an IP Network, IEEE Communications Magazine, Vol. 40, No. 1, January, pp. 122-130.
142. FLOYD, S., JACOBSON, V., LIU, C., MCCANNE, S., and ZHANG, L. [1997], A Reliable Multicast Framework for Light-Weight Sessions and Application Level Framing, IEEE/ACM Transactions on Networking, Vol. 5, No. 6, December, pp. 784-803.
143. FU, S.S., TZENG, N.-F., and LI, Z. [1997], Empirical Evaluation of Distributed Mutual Exclusion Algorithms, Proc. of the 11th Int’l Parallel Processing Symposium (IPPS’97), 1-5 April, pp. 255-259.
144. GARCIA-LUNA-ACEVES, J.J. and LEVINE, B.N. [1998], End-to-End Reliable Multicast. In: F. Kuo, W.E. Effelsberg, and J.J. Garcia-Luna-Aceves (Eds.), Multimedia Communications: Protocols and Applications, Prentice-Hall, pp. 169-191.
145. GARCIA-MOLINA, H. and SPAUSTER, A. [1991], Ordered and Reliable Multicast Communication, ACM Transactions on Computer Systems, Vol. 9, No. 3, August, pp. 242-271.
146. HAMAD, A.M. and KAMAL, A.E. [2002], A survey of Multicasting Protocols for Broadcast-and-Select Single-Hop Networks, IEEE Network, Vol. 16, No. 4, July/August, pp. 36-48.
147. HASTAD, J., LEGHTON, T., and ROGOFF, B. [1995], Analysis of Backoff Protocols for Multiple Access Channels, SIAM Journal on Computing, October.
148. HELARY, J.-M., MOSTEFAOUI, A., and RAYNAL, M. [1994], A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms, IEEE Trans. on Parallel and Distributed Systems, Vol. 5, No. 11, November, pp. 1185-1196.
149. KLEINROCK, L. [1976], Queuing Systems, Vol. 2: Computer Applications, John Wiley & Sons.
150. KOSTIN, A., AYBAY, I., and OZ, G. [2000], A Randomized Contention-Based Load-Balancing Protocol for a Distributed Multiserver Queuing System, IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 12, December, pp. 1252-1273.
151. KOSTIN, A. and BASRI, E. [2005], Fault Tolerant and Robust Mutual Exclusion Protocol for Synchronous Distributed Systems, Lecture Notes in Computer Science, Vol. 3733, pp. 162-172.
152. KOSTIN, A., ILUSHECHKINA, L., and BASRI, E. [2005], A Comparative Study of Distributed Mutual Exclusion Algorithms with a Class of Extended Petri Nets, Lecture Notes in Computer Science, Vol. 3719, pp. 11-22.
153. LAMPORT, L. [1978], Time, Clocks, and Ordering of Events in a Distributed System, CACM, Vol. 21, No. 7, pp. 558-565.
154. MAEKAWA, M.A. [1985], N Algorithm for Mutual Exclusion in Decentralized Systems, ACM Transactions on Computer Systems, Vol. 3, No. 2, May, pp. 145-159.
155. MAKKI, K., BEEN, K., and PISSINOU, P. [1994], A Simulation Study of Token-Based Mutual Exclusion Algorithms in Distributed Systems, Int’l Journal in Computer Simulation, Vol. 4, No. 1, April, pp. 65-88.
156. NAIMI, M., TREHEL, M., and ARNOLD, A. [1996], A Log (N) Distributed Mutual Exclusion Algorithm Based on the Path Reversal, Journal of Parallel and Distributed Computing, Vol. 34, No. 1, pp. 1-13.
157. NISHIO, S., LI, K.F., and MANNING, E.G. [1990], A Resilient Mutual Exclusion Algorithm for Computer Network, IEEE Trans. on Parallel and Distributed Systems, Vol. 1, No. 3, July, pp. 344-355.
158. RAYMOND, K. [1989], A Tree-based Algorithm for Distributed Mutual Exclusion, ACM Transactions on Computer Systems, Vol. 7, No. 1, February, pp. 61-77.
159. RAYNAL, M. [1991], A Simple Taxonomy for Distributed Mutual Exclusion, ACM Operating Systems Review, Vol. 25, No. 2, pp. 47-51.
160. RICART, G. and AGRAWALA, A.K. [1981], An Optimal Algorithm for Mutual Exclusion in Computer Networks, Communications of the ACM, Vol. 24, No. 1, pp. 9-17, January.
161. RODRIGUES, L. and RAYNAL, M. [2000], Atomic Broadcast in Asynchronous Crash-Recovery Distributed Systems, Proc. of the 20th International Conference on Distributed Computing Systems ICDCS'00, April, pp. 288-297.
162. SANDERS, B.A. [1987], The Information Structure of Distributed Mutual Exclusion Algorithms, ACM Transactions on Computer System, Vol. 5, No. 3, August, pp. 284-299.
163. SCHMIDT, D.C., LEVINE, D.L., and MUNGEE, S. [1998], The Design of the TAO Real-Time Object Request Broker, Computer Communications Journal, Vol. 21, No. 4, pp. 294-324.
164. SINGHAL, M. [1992], A Dynamic Information Structure Mutual Exclusion Algorithm for Distributed Systems, IEEE Trans. on Parallel and Distributed Systems, Vol. 3, No. 1, January, pp. 121-125.
165. SINGHAL, M. [1993], A Taxonomy of Distributed Mutual Exclusion, Journal of Parallel and Distributed Computing, Vol. 18, No. 1, pp. 94-101.
166. STIEGEL, A. and MANIMARAN, G. [2002], A Survey of QoS Multicasting Issues, IEEE Communications Magazine, Vol. 40, No. 6, June, pp. 82-87.
167. SUZUKI, I. and KASAMI, T. [1985], A Distributed Mutual Exclusion Algorithm, ACM Transactions on Computer Systems, Vol. 3, No. 4, November, pp. 344-349.
168. TOBAGI, F.A. and HUNT, V.B. [1980], Performance Analysis of Carrier Sense Multiple Access with Collision Detection, Computer Networks, Vol. 4, No. 5, October/November, pp. 245-259.
169. AIMEROCH, K.C. [2000], The Evolution of Multicast: From the MBone to Interdomain Multicast to Internet2 Deployment, IEEE Network, Vol. 14, No. 1, January/February, pp. 10-20.
170. BANKS, J., CARSON, J.S., NELSON, B.L., and NICOL, D.M. [2005], Discrete- Event System Simulation, 4th ed., Prentice-Hall.
171. BHATTACHARJEE, S., AMMAR, M.H., ZEGURA, E.W., SHAH, V., and FEI, Z. [1997], Application-Layer Anycasting, Proc. of the 16th Annual Joint Conf. of the IEEE Computer and Communications Societies INFOCOM 1997, Vol. 3, 7-11 April, pp. 1388-1396.
172. CRISTIAN, F. [1996], Synchronous and Asynchronous Group Communication, Communications of the ACM, Vol. 39, No. 4, April, pp. 88-97.
173. DEERING, S. and HINDEN, R. [1998], Internet Protocol Version 6 (IPv6) Specification, RFC 2460, December.
174. DOI, S., ATA, S., KITAMURA, H., and MURATA, M. [2004], IPv6 Anycast for Simple and Effective Service-Oriented Communications, IEEE Communications Magazine, May, pp. 163-171.
175. FLOYD, S., JACOBSON, V., LIU, C., MCCANNE, S., and ZHANG, L. [1997], A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing, IEEE/ACM Transactions on Networking, Vol. 5, No. 6, December, pp. 784-803.
176. HAMAD, A.M. and KAMAL, A.E. [2002], A survey of Multicasting Protocols for Broadcast-and-Select Single-Hop Networks, IEEE Network, Vol. 16, No. 4, July/August, pp. 36-48.
177. HANNA, K.M., NATARAJAN, N., and LEVINE, B.N. [2001], Evaluation of a Novel Two-Step Server Selection Metric, Proc. of the Ninth Intl. Conf. on Network Protocols, 11-14 November, pp. 290-300.
178. HAO, F., ZEGURA, E.W., and AMMAR, M.H. [2002], QoS Routing for Anycast Communications: Motivation and an Architecture for DiffServ Networks, IEEE Communications Magazine, June, pp. 48-56.
179. KOSTIN, A. [2006], An Anycasting Protocol for Anonymous Access to a Group of Contents-Equivalent Servers in a Distributed System, Lecture Notes in Computer Science, Vol. 4243, pp. 377-386.
180. LAO, L., CUI, J.-H., and GERLA, M. [2005], TOMA: A Viable Solution for Large-Scale Multicast Service Support, Lecture Notes in Computer Science, Vol. 3462, pp. 906-915.
181. MAXEMCHUK, N.F. [2002], Reliable Multicast with Delay Guarantees, IEEE Communications Magazine, September, pp. 96-102.
182. MIURA, H. and YAMAMOTO, M. [2001], Server Selection Policy in Active Anycast, IEICE Trans. Commun., Vol. E84-B, No. 10, October, pp. 1-4.
183. PARTRIDGE, C., MENDEZ, T., and MILLIKEN, W. [1993], Host Anycasting Service, RFC 1546, November.
184. WEBER, S. and CHENG, L. [2004], A Survey of Anycast in IPv6 Networks, IEEE Communications Magazine, January, pp. 127-132.
185. XUAN, D., JIA, W., ZHAO, W., and ZHU, H. [2000], A Routing Protocol for Anycast Messages, IEEE Trans. on PDS, Vol. 11, No. 6, June, pp. 571-588.
186. YU, S., ZHOU, W., and WU, Y. [2002], Research on Network Anycast, Proc. of the Fifth Int’l. Conf. on Algorithms and Architectures for Parallel Processing (ICA3PP’02), 23-25 October, pp. 154-161.
187. ZEGURA, E.W., AMMAR, M.H., FEI, Z., and BHATTACHARJEE, S. [2000], Application-Layer Anycasting: A Server Selection Architecture and Use in a Replicated Web Service, IEEE/ACM Trans. on Networking, Vol. 8, No. 4, August, pp. 455-466.
188. AMINTABAR, A., KOSTIN, A., and ILUSHECHKINA, L. [2005], Simulation of a Novel Leader Election Protocol with the Use of Petri Nets, 9th International Symposium on Distributed Simulation and Real-Time Applications (DS-RT), Canada, pp. 283-289.
189. AMINTABAR, A., KOSTIN, A., and ILUSHECHKINA, L. [2006], A Leader Election Protocol for Timed Asynchronous Distributed Systems, Lecture Notes in Computer Science, Vol. 4263, pp. 877-886.
190. BANKS, J., CARSON, J.S., NELSON, B.L., and NICOL, D.M. [2005], Discrete-Event System Simulation, 4th ed., Prentice-Hall.
191. CRISTIAN, F. and FETZER, C. [1999], The Timed Asynchronous Distributed System Model, IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 6, June, pp. 642-657.
192. DONAHOO, M.J. and AINAPURE, S.R. [2001], Scalable Multicast Representative Member Selection, Proceedings of Infocom, March, pp. 259-268.
193. FETZER, C. and CRISTIAN, F. [1999], A Highly Available Local Leader Election Service, IEEE Transactions on Software Engineering, Vol. 25, No. 5, Sept-Oct, pp. 603-618.
194. GARCIA-MOLINA, H. [1982], Elections in a Distributed Computing System, IEEE Transactions on Computers, Vol. 31, No. 1, January, pp. 47-59.
195. ITAI, A., KUTTEN, S., WOLFSTAHL, Y., and ZAKS, S. [1990], Optimal Distributed t-Resilient Election in Complete Networks, IEEE Transactions on Software Engineering, Vol. 16, No. 4, pp. 415-420.
196. LE LANN, G. [1977], Distributed Systems — Toward a Formal Approach, Information Processing 77, pp. 155-160.
197. MURALI, R., FERREIRA, R., SURESH, J., GRAMA, A., and SZPANKOWSKI, W. [2007], Randomized Leader Election, Distributed Computing, Vol. 19, No. 5-6, pp. 403-408.
198. NAKANO, K. and OLARIU, S. [2002], A Survey on Leader Election Protocols for Radio Networks, International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN ’02), May, pp. 71-76.
199. RAHMAN, M.M., ABDULLAU-AL-WADUD, M., and CHAE, O. [2008], Performance Analysis of Leader Election Algorithms in Mobile Ad Hoc Networks, International Journal of Computer Science and Network Security. Vol. 8, No. 2, February, pp. 257-263.
200. RAZ, D., SHAVITT, Y., and ZHANG, L. [2004], Distributed Council Election, IEEE/ACM Transactions on Networking, Vol. 12, No. 3, June, pp. 483-492.
201. SINGH, G. [1996], Leader Election in the Presence of Link Failures, IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 3, pp. 231-236.
202. STOLLER, S.D. [2000], Leader Election in Asynchronous Distributed Systems, IEEE Transactions on Computers, Vol. 49, No. 3, March, pp. 283-284.
203. STONEBRAKER, M. [1979], Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES, IEEE Transactions on Software Engineering, Vol. 5, May, pp. 188-194.
204. VASUDEVAN, S., DECLEENE, B., IMMERMAN, N., KUROSE, J., and TOWSLEY, D. [2003], Leader Election Algorithms for Wireless Ad Hoc Networks, Proceedings of the DARPA Information Survivability Conference and Exposition (DISCEX’03), Vol. 1, pp. 261-273.
205. YAMASHITA, M. and KAMEDA, T. [1999], Leader Election Problem on Networks in Which Processor Identity Numbers Are Not Distinct, IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 9, pp. 878-887.
206. Van Der Aalst, W.M.P. [1992], Timed Coloured Petri Nets and Their Application to Logistics, PhD Thesis, Eindhoven Univ. of Technology, Eindhoven, Netherlands.
207. BALLOU, R.H. [1992], Business Logistics Management, 3rd ed., Prentice-Hall: Englewood-Cliffs.
208. BANKS, J., CARSON, J.S., NELSON, B.L., and NICOL, D.M. [2005], Discrete- Event System Simulation, 4th ed., Prentice-Hall.
209. BLANCHARD, B.S. [2003], Logistics Engineering and Management, 6th edition, Prentice-Hall.
210. BOWERSOX, D.J. and CLOSS, D.J. [1996], Logistical Management: The Integrated Supply Chain Process, McGraw-Hill, New York.
211. COYLE, J.J., BARDI, E.J., and LANGLEY, C.J. [2002], Management of Business Logistics: A Supply Chain Perspective, 7th ed., South-Western College Pub.
212. GREEN, L.L. [1991], Logistics Engineering, Wiley.
213. HESKETT, J.L., GLASKOWSKY, N.A., and IVIE, R.M. [1973], Business Logistics, 2nd ed., Ronald Press.
214. HUTCHISON, N.E. [1987], An Integrated Approach to Logistics Management, Prentice-Hall.
215. LANGFORD, J.W. [1995], Logistics Principles and Practices, McGraw-Hill.
216. MACIAS, E.J. and PARTE, DE LA, M.P. [2004], Simulation and Optimization of Logistic and Production Systems Using Discrete and Continuous Petri Nets, Simulation, Vol. 80, No. 3, pp. 143-152.
217. MAGEE, J.F., CAPACINO, W.F., and ROSENFIELD, D.B. [1985], Modern Logistics Management: Integrating Marketing, Manufacturing and Physical Distribution, Wiley.
218. PATTON, J.D. [1986], Logistics Technology and Management — The New Approach, The Solomon Press.
219. PIERA, M.A., NARCISCO, M., GUASH, A., and RIERA, D. [2004], Optimization of Logistic and Manufacturing Systems Through Simulation: A Colored Petri Net-Based Methodology, Simulation, Vol. 80, No. 3, pp. 121-129.
220. TAHA, H.A. [2006], Operations Research: An Introduction, 8th ed., Prentice-Hall.
221. BANKS, J., CARSON, J.S., NELSON, B.L., and NICOL, D.M. [2005], Discrete- Event System Simulation, 4th ed., Pearson Education, Inc., Upper Saddle River, NJ.
222. CHIOLA, G., FRANCESCHINIS, G., GAETA, R., and RIBAUDO, M. [1995], Greatspn 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets, Performance Evaluation, Vol. 24, No. 1 & 2, pp. 47-68.
223. CHISMAN, J.A. [1992], Introduction to Simulation Modelling Using GPSS/PC, Simon & Schuster.
224. GUSTAVSON, F. and TORN, A. [1994], X Sim Net, A Tool in C++ for Executing Simulation Nets, Proceedings of1994 European Simulation Multiconference, Barcelona, Spain, 1-3 June, 1994, pp. 146-150.
225. HART, J.M. [1997], Win32 System Programming, Addison-Wesley Developers Press.
226. KOSTIN, A. and ILUSHECHKINA, L. [2004], Winsim: A Tool for Performance Evaluation of Parallel and Distributed Systems, Lecture Notes in Computer Science, Vol. 3261, Springer, pp. 312-321.
227. LISHNER, R. [2000], Delphi in a Nutshell, O’Reilly Media Inc.
228. OBAIDAT, M.S. and PAPADIMITROU, G.I. (Eds.) [2003], Applied System Simulation: Methodologies and Applications, Springer.
229. PETRI NETS DB, http://www.informatik.uni-hamburg.de/TGI/Petri Nets/.
230. RACHELE, W. [2000], Learn Object Pascal with Delphi, Wordware Publ.
231. RICART, G. and AGRAWALA, A.K. [1981], An Optimal Algorithm for Mutual Exclusion in Computer Networks, Communications of the ACM, Vol. 24, No. 1, January, pp. 9-17.