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]  Rachid Guerraoui,et al.  Early Local Decisions in Distributed Agreement , 2003 .

[2]  Moti Yung,et al.  Resolving message complexity of Byzantine Agreement and beyond , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Yossi Azar,et al.  Management of Multi-Queue Switches in QoS Networks , 2003, STOC '03.

[4]  Nancy A. Lynch,et al.  Reliable communication over unreliable channels , 1994, JACM.

[5]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[6]  Alfred V. Aho,et al.  Bounds on the size and transmission rate of communications protocols , 1982 .

[7]  Boaz Patt-Shamir,et al.  Buffer Overflow Management in QoS Switches , 2004, SIAM J. Comput..

[8]  Moni Naor,et al.  A Simple Fault Tolerant Distributed Hash Table , 2003, IPTPS.

[9]  Silvio Micali,et al.  Secret-Key Agreement without Public-Key Cryptography (Extended Abstract) , 1994 .

[10]  Oded Goldreich,et al.  Source to destination communication in the presence of faults , 1989, PODC '89.

[11]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.

[12]  Idit Keidar,et al.  On the Cost of Fault-Tolerant Consensus When There Are No Faults - A Tutorial , 2003, LADC.

[13]  Prasad Jayanti,et al.  Wait-free Computing , 1995, WDAG.

[14]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[15]  Faith E. Fich.  End to End Communication. , 1998 .

[16]  Rajeev Alur,et al.  Contention—free complexity of shared memory algorithms , 1994, PODC '94.

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

[18]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[19]  Rafail Ostrovsky,et al.  Log-space polynomial end-to-end communication , 1995, STOC '95.

[20]  Michael Merritt,et al.  Speeding Lamport's Fast Mutual Exclusion Algorithm , 1993, Inf. Process. Lett..

[21]  Achour Mostéfaoui,et al.  Efficient Condition-Based Consensus , 2001, SIROCCO.

[22]  Yishay Mansour,et al.  Competitive queueing policies for QoS switches , 2003, SODA '03.

[23]  Moti Yung,et al.  Perfectly Secure Key Distribution for Dynamic Conferences , 1998, Inf. Comput..

[24]  M. Iri.  A NEW METHOD OF SOLVING TRANSPORTATION· NETWORK PROBLEMS , 1960 .

[25]  Carsten Thomassen,et al.  Highly Connected Sets and the Excluded Grid Theorem , 1999, J. Comb. Theory, Ser. B.

[26]  Paul C. Attie,et al.  Synthesis of concurrent systems with many similar processes , 1998, TOPL.

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

[28]  Maurice Herlihy,et al.  On the space complexity of randomized synchronization , 1993, PODC '93.

[29]  Faith Ellen,et al.  Space-optimal multi-writer snapshot objects are slow , 2002, PODC '02.

[30]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[31]  Moti Yung,et al.  Perfectly secure message transmission , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

[33]  Michel Raynal,et al.  Algorithms for mutual exclusion , 1986 .

[34]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[35]  Eric Ruppert.  Determining Consensus Numbers , 2000, SIAM J. Comput..

[36]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[37]  R. Ho.  Algebraic Topology , 2022 .

[38]  Dariusz R. Kowalski,et al.  Bounding Work and Communication in Robust Cooperative Computation , 2002, DISC.

[39]  Baruch Awerbuch,et al.  A quantitative approach to dynamic networks , 1990, PODC '90.

[40]  Gil Neiger,et al.  Failure Detectors and the Wait-Free Hierarchy. , 1995, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[41]  John R. Gilbert,et al.  Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree , 1995, J. Algorithms.

[42]  Adaptive solutions to the mutual exclusion problem , 2005, Distributed Computing.

[43]  Richard E. Ladner,et al.  Counting Protocols for Reliable End-to-End Transmission , 1998, J. Comput. Syst. Sci..

[44]  Nancy A. Lynch,et al.  Bounds on the time to reach agreement in the presence of timing uncertainty , 1991, STOC '91.

[45]  Alexander A. Shvartsman,et al.  Graceful quorum reconfiguration in a robust emulation of shared memory , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

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

[47]  Petr Kolman,et al.  Short length Menger's theorem and reliable optical routing , 2005, Theor. Comput. Sci..

[48]  Achour Mostéfaoui,et al.  k-set agreement with limited accuracy failure detectors , 2000, PODC '00.

[49]  Stefan Saroiu,et al.  Dynamically Fault-Tolerant Content Addressable Networks , 2002, IPTPS.

[50]  Da-Wei Wang,et al.  Tight bounds for the sequence transmission problem , 1989, PODC '89.

[51]  Achour Mostéfaoui,et al.  Using Conditions to Expedite Consensus in Synchronous Distributed Systems , 2003, DISC.

[52]  Vassos Hadzilacos,et al.  Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract) , 1994, WDAG.

[53]  Nir Shavit,et al.  Optimal time randomized consensus—making resilient algorithms fast in practice , 1991, SODA '91.

[54]  Baruch Awerbuch,et al.  Reliable broadcast protocols in unreliable networks , 1986, Networks.

[55]  Zvi Galil,et al.  Short length versions of Menger's theorem , 1995, STOC '95.

[56]  Alexander Russell,et al.  The Complexity of Synchronous Iterative Do-All with Crashes , 2001, DISC.

[57]  Bogdan S. Chlebus,et al.  Performing tasks on synchronous restartable message-passing processors , 2001, Distributed Computing.

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

[59]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[60]  K. Srinathan,et al.  On perfectly secure communication over arbitrary networks , 2002, PODC '02.

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

[62]  Robert Tappan Morris,et al.  Ivy: a read/write peer-to-peer file system , 2002, OSDI '02.

[63]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

[64]  Yoram Moses,et al.  A Layered Analysis of Consensus , 2002, SIAM J. Comput..

[65]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[66]  Nancy A. Lynch,et al.  The impossibility of implementing reliable communication in the face of crashes , 1993, JACM.

[67]  Amos Israeli,et al.  On processor coordination using asynchronous hardware , 1987, PODC '87.

[68]  André Schiper,et al.  Uniform consensus is harder than consensus , 2004, J. Algorithms.

[69]  Yishay Mansour,et al.  Improved Competitive Guarantees for QoS Buffering , 2003, Algorithmica.

[70]  Yishay Mansour,et al.  Loss-bounded analysis for differentiated services , 2001, SODA '01.

[71]  Roy Friedman,et al.  Distributed Agreement and Its Relation with Error-Correcting Codes , 2002, DISC.

[72]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[73]  Rachid Guerraoui,et al.  The inherent price of indulgence , 2002, PODC '02.

[74]  Sam Toueg,et al.  Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract) , 1994, PODC '94.

[75]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

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

[77]  Dieter Kratsch,et al.  On treewidth approximations , 2004, Discret. Appl. Math..

[78]  Yuval Rabani,et al.  Path coloring on the mesh , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[79]  Nir Shavit,et al.  Polynomial end-to-end communication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[80]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

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

[82]  James Aspnes,et al.  Wait-free consensus with infinite arrivals , 2002, STOC '02.

[83]  Eli Gafni,et al.  Structured derivations of consensus algorithms for failure detectors , 1998, PODC '98.

[84]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[85]  N. Tomizawa,et al.  On some techniques useful for solution of transportation network problems , 1971, Networks.

[86]  Ben Y. Zhao,et al.  Distributed Object Location in a Dynamic Network , 2004, Theory of Computing Systems.

[87]  Clifford Stein,et al.  Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .

[88]  Amos Fiat,et al.  Censorship resistant peer-to-peer content addressable networks , 2002, SODA '02.

[89]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[90]  Boaz Patt-Shamir,et al.  Nearly optimal FIFO buffer management for DiffServ , 2002, PODC '02.

[91]  Haifeng Yu,et al.  Overcoming the Majority Barrier in Large-Scale Systems , 2003, DISC.

[92]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[93]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

[94]  Chandramohan A. Thekkath,et al.  Petal: distributed virtual disks , 1996, ASPLOS VII.

[95]  Peter Druschel,et al.  Exploiting network proximity in peer-to-peer overlay networks , 2002 .

[96]  Robert Tappan Morris,et al.  Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.

[97]  Ben Y. Zhao,et al.  Locality Aware Mechanisms for Large-scale Networks , 2002 .

[98]  Nancy A. Lynch,et al.  Mutual exclusion using indivisible reads and writes , 1980 .

[99]  Alexander Russell,et al.  Distributed Cooperation During the Absence of Communication , 2000, DISC.

[100]  Rolf Blom,et al.  An Optimal Class of Symmetric Key Generation Systems , 1985, EUROCRYPT.

[101]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[102]  Maurice Herlihy,et al.  On the existence of booster types , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[103]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[104]  Rachid Guerraoui,et al.  A generic framework for indulgent consensus , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[105]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

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

[107]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[108]  Hagit Attiya,et al.  An adaptive collect algorithm with applications , 2002, Distributed Computing.

[109]  Amir Herzberg.  Connection-based communication in dynamic networks , 1992, PODC '92.

[110]  Jennifer L. Welch,et al.  Crash Resilient Communication in Dynamic Networks , 1997, IEEE Trans. Computers.

[111]  Moni Naor,et al.  Novel architectures for P2P applications: the continuous-discrete approach , 2003, SPAA '03.

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

[113]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[114]  Toshimitsu Masuzawa,et al.  Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps , 2001, DISC.

[115]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[116]  Kazuo Iwama,et al.  Compact Routing with Stretch Factor of Less Than Three , 2005, IEICE Trans. Inf. Syst..

[117]  Hector Garcia-Molina,et al.  The vulnerability of vote assignments , 1986, TOCS.

[118]  Miguel Castro,et al.  Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.

[119]  Yehuda Afek,et al.  Consensus power makes (some) sense! (extended abstract) , 1994, PODC '94.

[120]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[121]  Amin Vahdat,et al.  The costs and limits of availability for replicated services , 2001, TOCS.

[122]  Vassos Hadzilacos,et al.  On the Relationship Between the Atomic Commitment and Consensus Problems , 1990, Fault-Tolerant Distributed Computing.

[123]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[124]  Michael K. Reiter,et al.  Probabilistic quorum systems , 1997, PODC '97.

[125]  Eli Gafni,et al.  Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). , 1998, PODC 1998.

[126]  Michael Dahlin,et al.  End-to-end WAN service availability , 2001, TNET.

[127]  Indranil Gupta,et al.  A Probabilistically Correct Leader Election Protocol for Large Groups , 2000, DISC.

[128]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[129]  Dariusz R. Kowalski,et al.  Gossiping to reach consensus , 2002, SPAA '02.

[130]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.

[131]  Nir Shavit,et al.  Slide-The Key to Polynomial End-to-End Communication , 1997, J. Algorithms.

[132]  Matthew K. Franklin,et al.  Secure Communication in Minimal Connectivity Models , 1998, Journal of Cryptology.

[133]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.

[134]  Marcos K. Aguilera,et al.  On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems , 2002, DISC.

[135]  Prasad Jayanti,et al.  Robust wait-free hierarchies , 1997, JACM.

[136]  Danny Dolev,et al.  Early stopping in Byzantine agreement , 1990, JACM.

[137]  Achour Mostéfaoui,et al.  Conditions on input vectors for consensus solvability in asynchronous distributed systems , 2003, J. ACM.

[138]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[139]  Eyal Amir,et al.  Efficient Approximation for Triangulation of Minimum Treewidth , 2001, UAI.

[140]  Achour Mostéfaoui,et al.  Condition-Based Protocols for Set Agreement Problems , 2002, DISC.

[141]  Vic Stenning,et al.  A Data Transfer Protocol , 1976, Comput. Networks.

[142]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[143]  Michael J. Fischer,et al.  Economical solutions for the critical section problem in a distributed system (Extended Abstract) , 1977, STOC '77.

[144]  Leslie Lamport,et al.  Disk Paxos , 2003, Distributed Computing.

[145]  John L. Hennessy,et al.  The Future of Systems Research , 1999, Computer.

[146]  Rachid Guerraoui,et al.  On Failure Detectors and Type Boosters , 2003, DISC.

[147]  Alex A. Shvartsmanz.  Rambo: A Reconfigurable Atomic Memory Service for Dynamic Networks , 2002 .

[148]  Vassos Hadzilacos,et al.  All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust , 2000, SIAM J. Comput..

[149]  David Peleg,et al.  The Availability of Quorum Systems , 1995, Inf. Comput..

[150]  Alon Itai,et al.  Symmetry breaking in distributed networks , 1990, Inf. Comput..

[151]  Hagit Attiya,et al.  Wait-Free n-Set Consensus When Inputs Are Restricted , 2002, DISC.

[152]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[153]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[154]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[155]  Yehuda Afek,et al.  End-to-end communication in unreliable networks , 1988, PODC '88.

[156]  Maurice Herlihy,et al.  Unifying synchronous and asynchronous message-passing models , 1998, PODC '98.

[157]  Idit Keidar,et al.  A simple proof of the uniform consensus synchronous lower bound , 2003, Inf. Process. Lett..

[158]  Achour Mostéfaoui,et al.  A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors , 2002, IEEE Trans. Computers.

[159]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[160]  Richard E. Ladner,et al.  Recoverable sequence transmission protocols , 1995, JACM.

[161]  Michel Raynal.  Consensus in synchronous systems: a concise guided tour , 2002, 2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings..

[162]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[163]  Eli Gafni.  A simple algorithmic characterization of uniform solvability , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[164]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[165]  Da-Wei Wang,et al.  Real-time sequence transmission problem , 1991, PODC '91.

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

[167]  Bruce A. Reed,et al.  Finding approximate separators and computing tree width quickly , 1992, STOC '92.

[168]  Nancy A. Lynch,et al.  A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..

[169]  David Clark,et al.  An Approach to Service Allocation in the Internet , 1997 .

[170]  Baruch Schieber,et al.  The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels , 1992, JACM.

[171]  Yuh-Jzer Joung,et al.  Asynchronous group mutual exclusion (extended abstract) , 1998, PODC '98.

[172]  Christian Scheideler,et al.  Improved bounds for the unsplittable flow problem , 2002, SODA '02.

[173]  Mark Moir,et al.  Wait-Free Algorithms for Fast, Long-Lived Renaming , 1995, Sci. Comput. Program..

[174]  Andrzej Pelc.  Fault-tolerant broadcasting and gossiping in communication networks , 1996, Networks.

[175]  Yuval Rabani,et al.  Improved bounds for all optical routing , 1995, SODA '95.

[176]  Chryssis Georgiou,et al.  Efficient Gossip and Robust Distributed Computation , 2003, DISC.

[177]  Alexander A. Shvartsman,et al.  Efficient parallel algorithms can be made robust , 1989, PODC '89.

[178]  Li Gong,et al.  Increasing Availability and Security of an Authentication Service , 1993, IEEE J. Sel. Areas Commun..

[179]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[180]  Stephan Merz,et al.  Model Checking , 2000 .

[181]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[182]  Achour Mostéfaoui,et al.  Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus , 1999, FSTTCS.

[183]  Christian Scheideler,et al.  Algorithms for fault-tolerant routing in circuit switched networks , 2002, SPAA '02.

[184]  Yishay Mansour,et al.  Harmonic buffer management policy for shared memory switches , 2004, Theor. Comput. Sci..

[185]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[186]  Faith Ellen,et al.  Short Headers Suffice for Communication in a DAG with Link Failures , 2000, DISC.

[187]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.