Distributed Computing

The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification, and implementation of distributed systems. Topics covered by the journal include but are not limited to: design and analysis of distributed algorithms; multiprocessor and multicore architectures and algorithms; synchronization protocols and concurrent programming; distributed operating systems and middleware; fault-tolerance, reliability, and availability; architectures and protocols for communication networks and peer-to-peer systems; security in distributed computing, cryptographic protocols; mobile, sensor, and ad hoc networks; internet applications; concurrency theory; and specification, semantics, verification, and testing of distributed systems. In general, only original papers will be considered. Papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission.

[1]  Béla Bollobás,et al.  The Diameter of a Cycle Plus a Random Matching , 1988, SIAM J. Discret. Math..

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  Yannis C. Stamatiou,et al.  Locating Information with Uncertainty in Fully Interconnected Networks , 2000, DISC.

[4]  Marcos K. Aguilera,et al.  Failure detection and consensus in the crash-recovery model , 1998, Distributed Computing.

[5]  Achour Mostéfaoui,et al.  Leader-Based Consensus , 2001, Parallel Process. Lett..

[6]  Ajoy Kumar Datta,et al.  State-optimal snap-stabilizing PIF in tree networks , 1999, Proceedings 19th IEEE International Conference on Distributed Computing Systems.

[7]  Gadi Taubenfeld,et al.  A Lower Bound on Wait-Free Counting , 1997, J. Algorithms.

[8]  David R. Cheriton,et al.  The synergy between non-blocking synchronization and operating system structure , 1996, OSDI '96.

[9]  G. Cybenko,et al.  The Travelling Agent Problem , 1998 .

[10]  Mary K. Vernon,et al.  Efficient synchronization primitives for large-scale cache-coherent multiprocessors , 1989, ASPLOS III.

[11]  Richard J. Anderson,et al.  Algorithms for the Certified Write-All Problem , 1997, SIAM J. Comput..

[12]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[13]  Claudio Demartini,et al.  dSPIN: A Dynamic Extension of SPIN , 1999, SPIN.

[14]  Joffroy Beauquier,et al.  Probabilistic self-stabilizing mutual exclusion in uniform rings , 1994, PODC '94.

[15]  Maurice Herlihy,et al.  Ordered Multicast and Distributed Swap , 2000, OPSR.

[16]  Pradip K. Srimani,et al.  A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph , 1995 .

[17]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[18]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[19]  Janos Simon,et al.  Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings , 1995, WDAG.

[20]  Jon Ølnes,et al.  Mobile Agent Security - Issues and Directions , 1999, IS&N.

[21]  B. Hayes.  Graph Theory in Practice: Part II , 2000, American Scientist.

[22]  Maurice Herlihy,et al.  A tale of two directories: implementing distributed shared objects in Java , 1999, JAVA '99.

[23]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Spanning Trees , 1991, Inf. Process. Lett..

[24]  Mikel Larrea,et al.  Optimal implementation of the weakest failure detector for solving consensus , 2000, Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000.

[25]  Amos Israeli,et al.  Analyzing Expected Time by Scheduler-Luck Games , 1995, IEEE Trans. Software Eng..

[26]  Ken-ichi Sato,et al.  Broad-band ATM network architecture based on virtual paths , 1990, IEEE Trans. Commun..

[27]  Chun-Wu Roger Leng,et al.  A Novel Mobile Agent Search Algorithm , 2000, Inf. Sci..

[28]  Vincent Park,et al.  Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification , 2001 .

[29]  Paul G. Spirakis,et al.  An efficient communication strategy for ad-hoc mobile networks , 2001, PODC '01.

[30]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[31]  Avishai Wool,et al.  Optimal layouts on a chain ATM network , 1998, Discret. Appl. Math..

[32]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[33]  Luca Becchetti,et al.  On the design of efficient ATM routing schemes , 2002, Theor. Comput. Sci..

[34]  Nir Shavit,et al.  Elimination Trees and the Construction of Pools and Stacks , 1997, Theory of Computing Systems.

[35]  J. Burgin,et al.  Broadband ISDN resource management: the role of virtual paths , 1991, IEEE Communications Magazine.

[36]  Marios Mavronicolas,et al.  Sequentially consistent versus linearizable counting networks , 1999, PODC '99.

[37]  T. Herman,et al.  A stabilizing search tree with availability properties , 2001, Proceedings 5th International Symposium on Autonomous Decentralized Systems.

[38]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[39]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[40]  David R. Cheriton,et al.  Non-blocking synchronization and system design , 1999 .

[41]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[42]  Brian Hayes Source.  GRAPH THEORY IN PRACTICE : PART I , 1999 .

[43]  Nicholas R. Jennings,et al.  On agent-based software engineering , 2000, Artif. Intell..

[44]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[45]  Christian F. Tschudin,et al.  Protecting Mobile Agents Against Malicious Hosts , 1998, Mobile Agents and Security.

[46]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Breadth-First Trees , 1992, Inf. Process. Lett..

[47]  Amos Israeli,et al.  Token management schemes and random walks yield self-stabilizing mutual exclusion , 1990, PODC '90.

[48]  Nancy A. Lynch,et al.  Revisiting the PAXOS algorithm , 1997, Theor. Comput. Sci..

[49]  Paul G. Spirakis,et al.  Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks , 2000, WAE.

[50]  Hirotsugu Kakugawa,et al.  Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon , 1997, IEEE Trans. Parallel Distributed Syst..

[51]  Mikel Larrea,et al.  Eventually consistent failure detectors , 2001, SPAA '01.

[52]  Joseph Y. Halpern,et al.  Performing work efficiently in the presence of faults , 1992, PODC '92.

[53]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[54]  Pradip K. Srimani,et al.  Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction , 1997, Euro-Par.

[55]  Boaz Patt-Shamir,et al.  A Note on Randomized Mutual Search , 1999, Inf. Process. Lett..

[56]  Sam Toueg,et al.  Unreliable Failure Detectors for Asynchronous Systems , 1991 .

[57]  Anthony LaMarca,et al.  A performance evaluation of lock-free synchronization protocols , 1994, PODC '94.

[58]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[59]  Rafael Dueire Lins,et al.  Garbage collection: algorithms for automatic dynamic memory management , 1996 .

[60]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1979, TOPL.

[61]  Ted Herman,et al.  Probabilistic Self-Stabilization , 1990, Information Processing Letters.

[62]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[63]  Marcos K. Aguilera,et al.  On the quality of service of failure detectors , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[64]  David G. Kirkpatrick,et al.  The Bit Complexity of Randomized Leader Election on a Ring , 1989, SIAM J. Comput..

[65]  Pradip K. Srimani,et al.  A Self-Stabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph , 1992, Parallel Process. Lett..

[66]  Maurice Herlihy,et al.  The Aleph Toolkit: Support for Scalable Distributed Shared Objects , 1999, CANPC.

[67]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[68]  John D. Valois.  Lock-free linked lists using compare-and-swap , 1995, PODC '95.

[69]  Shmuel Zaks,et al.  Path layout in ATM networks-A survey , 1997, Networks in Distributed Computing.

[70]  Marcos K. Aguilera,et al.  Using the Heartbeat Failure Detector for Quiescent Reliable Communication and Consensus in Partitionable Networks , 1999, Theor. Comput. Sci..

[71]  Maurice Herlihy,et al.  A methodology for implementing highly concurrent data objects , 1993, TOPL.

[72]  Rainer Händel,et al.  Integrated broadband networks : an introduction to ATM-based networks , 1991 .

[73]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[74]  Shing-Tsaan Huang,et al.  Leader election in uniform rings , 1993, TOPL.

[75]  Maurice Herlihy,et al.  Counting networks , 1994, JACM.

[76]  Shay Kutten,et al.  Time Optimal Self-Stabilizing Spanning Tree Algorithms , 1993, FSTTCS.

[77]  Shmuel Zaks,et al.  A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load , 1998, Parallel Process. Lett..

[78]  Partha Dasgupta,et al.  Parallel processing on networks of workstations: a fault-tolerant, high performance approach , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[79]  C. Greg Plaxton,et al.  Thread Scheduling for Multiprogrammed Multiprocessors , 1998, SPAA '98.

[80]  Baruch Awerbuch,et al.  Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..

[81]  Krzysztof Diks,et al.  Reliable Token Despersal with Random Faults , 1994, Parallel Process. Lett..

[82]  Marina Papatriantafilou,et al.  Self-Stabilization of Wait-Free Shared Memory Objects , 1995, WDAG.

[83]  George Varghese,et al.  Self-stabilization by counter flushing , 1994, PODC '94.

[84]  Michael A. Bender,et al.  The power of team exploration: two robots can learn unlabeled directed graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[85]  Ken-ichi Sato,et al.  Virtual Path and Link Capacity Design for ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[86]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[87]  Maged M. Michael,et al.  Correction of a Memory Management Method for Lock-Free Data Structures , 1995 .

[88]  Sam Toueg,et al.  Fault-tolerant broadcasts and related problems , 1993 .

[89]  Prabhakar Ragde,et al.  Parallel Algorithms with Processor Failures and Delays , 1996, J. Algorithms.

[90]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[91]  Reuven Cohen,et al.  Connection management and rerouting in ATM networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[92]  Ted Herman,et al.  Superstabilizing mutual exclusion , 2000, Distributed Computing.

[93]  Ori Gerstel,et al.  The layout of virtual paths in ATM networks , 1996, TNET.

[94]  Bogdan S. Chlebus,et al.  Performing Tasks on Restartable Message-Passing Processors , 1997, WDAG.

[95]  Richard M. Karp,et al.  Probabilistic recurrence relations , 1994, JACM.

[96]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[97]  Krzysztof Diks,et al.  Token Transfer in a Faulty Network , 1995, RAIRO Theor. Informatics Appl..

[98]  Fritz Hohl,et al.  A framework to protect mobile agents by using reference states , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[99]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[100]  Kwang-Ting Cheng,et al.  Virtual path assignment and virtual circuit routing in ATM networks , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[101]  Ajoy Kumar Datta,et al.  Self-Stabilizing Local Mutual Exclusion and Daemon Refinement , 2000, Chic. J. Theor. Comput. Sci..

[102]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[103]  Boaz Patt-Shamir,et al.  Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[104]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[105]  Toshimitsu Masuzawa,et al.  Available stabilizing heaps , 2001, Inf. Process. Lett..

[106]  Shlomi Dolev,et al.  Dynamic load balancing with group communication , 2006, Theor. Comput. Sci..

[107]  Maurice Herlihy,et al.  The Arrow Distributed Directory Protocol , 1998, DISC.

[108]  Boaz Patt-Shamir,et al.  Stabilizing Time-Adaptive Protocols , 1999, Theor. Comput. Sci..

[109]  Maurice Herlihy,et al.  Supporting Increment and Decrement Operations in Balancing Networks , 1999, Chic. J. Theor. Comput. Sci..

[110]  Larry Rudolph,et al.  Efficient synchronization of multiprocessors with shared memory , 1988, TOPL.

[111]  Mohamed G. Gouda,et al.  Stabilizing Communication Protocols , 1991, IEEE Trans. Computers.

[112]  Amos Israeli,et al.  Uniform Self-Stabilizing Ring Orientation , 1993, Inf. Comput..

[113]  Marcos K. Aguilera,et al.  Stable Leader Election , 2001, DISC.

[114]  Y. Aumann,et al.  Clock construction in fully asynchronous parallel systems and PRAM simulation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[115]  Mikel Larrea,et al.  Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems , 1999, DISC.

[116]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[117]  Ori Gerstel,et al.  A Scalable Approach to Routing in ATM Networks , 1994, WDAG.

[118]  Hagit Attiya,et al.  The Combinatorial Structure of Wait-Free Solvable Tasks , 2002, SIAM J. Comput..

[119]  Sanghyun Ahn,et al.  Virtual path layout design on ATM networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[120]  David S. Greenberg,et al.  Computing with faulty shared objects , 1995, JACM.

[121]  Mohamed G. Gouda,et al.  The Stabilizing Token Ring in Three Bits , 1996, J. Parallel Distributed Comput..

[122]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[123]  Michael J. Fischer,et al.  The wakeup problem , 1990, STOC '90.

[124]  Hagit Attiya,et al.  Counting networks with arbitrary fan-out , 1992, SODA '92.

[125]  George Cybenko,et al.  Mobile agents in distributed information retrieval , 1999 .

[126]  George Varghese,et al.  Self-Stabilization by Tree Correction , 1997, Chic. J. Theor. Comput. Sci..

[127]  Lisa Higham,et al.  Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks , 2001, DISC.

[128]  Yehuda Afek,et al.  Local stabilizer , 1997, PODC '97.

[129]  David Kotz,et al.  Autonomous and Adaptive Agents that Gather Information , 1996 .

[130]  Maurice Herlihy,et al.  Competitive concurrent distributed queuing , 2001, PODC '01.

[131]  Jan K. Pachl,et al.  Uniform Self-Stabilizing Rings , 1988, AWOC.

[132]  Baruch Awerbuch,et al.  Compact distributed data structures for adaptive routing , 1989, STOC '89.

[133]  Fan Chung Graham,et al.  Diameter bounds for altered graphs , 1984, J. Graph Theory.

[134]  Nancy M. Amato,et al.  Distributed reconfiguration of metamorphic robot chains , 2004, PODC '00.

[135]  Krzysztof Diks,et al.  Fault-Tolerant Linear Broadcasting , 1996, Nord. J. Comput..

[136]  Maria Gradinariu Potop-Butucaru,et al.  Cross-Over Composition - Enforcement of Fairness under Unfair Adversary , 2001, WSS.

[137]  Kerry Raymond,et al.  A tree-based algorithm for distributed mutual exclusion , 1989, TOCS.

[138]  Francis C. Chu.  Reducing &Ω to ◊ W , 1998 .

[139]  Calton Pu,et al.  A Lock-Free Multiprocessor OS Kernel , 1992, OPSR.

[140]  Arobinda Gupta,et al.  Fault-containing self-stabilizing algorithms , 1996, PODC '96.

[141]  Moti Yung,et al.  Time-optimal message-efficient work performance in the presence of faults , 1994, PODC '94.

[142]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[143]  Paul G. Spirakis,et al.  An efficient routing protocol for hierarchical ad-hoc mobile networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[144]  Anish Arora,et al.  Stabilization-Preserving Atomicity Refinement , 2002, J. Parallel Distributed Comput..

[145]  Ajoy Kumar Datta,et al.  Two-State Self-Stabilizing Algorithms for Token Rings , 1994, IEEE Trans. Software Eng..

[146]  Shlomi Dolev,et al.  Memory requirements for silent stabilization , 1999, Acta Informatica.

[147]  Ori Gerstel,et al.  The virtual path layout problem in fast networks (extended abstract) , 1994, PODC '94.

[148]  Shmuel Zaks,et al.  Duality in Chain ATM Virtual Path Layouts , 1997, SIROCCO.

[149]  Paul G. Spirakis,et al.  Fundamental control algorithms in mobile networks , 1999, SPAA '99.

[150]  C. Greg Plaxton,et al.  Small-depth counting networks , 1992, STOC '92.

[151]  Yoshiaki Katayama,et al.  A latency-optimal superstabilizing mutual exclusion protocol , 1997, WSS.

[152]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[153]  Jon M. Kleinberg,et al.  The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.

[154]  Lisa Higham,et al.  SelfStabilizing Token Circulation on Anonymous Message Passing , 1998, OPODIS.

[155]  Roger Wattenhofer,et al.  An Inherent Bottleneck in Distributed Counting , 1998, J. Parallel Distributed Comput..

[156]  Maria Gradinariu Potop-Butucaru,et al.  Memory space requirements for self-stabilizing leader election protocols , 1999, PODC '99.

[157]  Marcos K. Aguilera,et al.  A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds , 1998, Inf. Process. Lett..

[158]  Shlomi Dolev,et al.  SuperStabilizing protocols for dynamic distributed systems , 1995, PODC '95.