Time, clocks, and the ordering of events in a distributed system. (English) Zbl 0378.68027


68W99 Algorithms in computer science
68N01 General topics in the theory of software
Full Text: DOI Link


[1] ipoque, http://www.ipoque.com/
[2] Gil T, Kaashoek F, Li J, et al. p2psim: A simulator for peer-to-peer protocols, 2005, http://www.pdos.lcs.mit.edu/p2psim/
[3] Jelasity M, Montresor A, Jesi G P. Peersim Peer-to-Peer Simulator, 2004, http://peersim.sourceforge.net/
[4] Garcia P, Pairot C, Mondejar R, et al. PlanetSim: a new overlay network simulation framework In: Proceedings of SEM 2004, LNCS 3437. Berlin: Springer-Verlag, 2005
[5] Yang W S, Abu-Ghazaleh N. GPS: a general peer-to-peer simulator and its use for modeling BitTorrent. In: Proceedings of MASCOTS 2005, Atlanta, Georgia, 2005
[6] Rodriguez A, Killian C, Bhat S, et al. MACEDON: Methodology for automatically creating, evaluating, and designing overlay networks. In: Proceedings of NSDI 2004, San Francisco, CA, 2004
[7] Lin S D, Pan A M, Guo R, et al. Simulating large scale P2P systems with the WiDS toolkit. In: Proceedings of MASCOTS 2005, Atlanta, Georgia, 2005
[8] Tuan T, Dinh A, Lees M, et al. Large scale distributed simulation of P2P networks. In: Proceedings of PDP 2008, Toulouse, France, 2008
[9] Lamport L. Time, clocks, and the ordering of events in a distributed system. Commun ACM, 1978, 21: 558-565 · Zbl 0378.68027
[10] Fujimoto R M. Distributed simulation systems. In: Proceedings of the 2003 Winter Simulation Conference, New Orleans, LA, USA, 2003
[11] Qiu D, Srikant R. Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In: Proceedings of SIGCOMM 2004, Portland, Oregon, USA, 2004
[12] Bharambe A, Herley C, Padmanabhan V. Analyzing and improving a BitTorrent networks performance mechanisms. In: Proceedings of INFOCOM 2006, Barcelona, Spain, 2006
[13] Nicoll J, Bateman M, Ruddle A, et al. Challenges in measurement and analysis of the BitTorrent content distribution model. In: Proceedings of PGNet 2004, Liverpool, UK, 2004
[14] Piatek M, Isdal T, Anderson T, et al. Do incentives build robustness in BitTorrent? In: Proceedings of NSDI 2007 Cambridge, MA, USA, 2007
[15] Cohen B. Incentives build robustness in BitTorrent. In: Proceedings of IPTPS 2003, Berkeley, CA, USA, 2003
[16] Hales D, Patarin S. How to cheat BitTorrent and why nobody does. Technical Report UBLCS 2005-12, Computer Science, University of Bologna, 2005
[17] Thommes R, Coates M. BitTorrent fairness: analysis and improvements. In: Proceedings of WITZSP 2005, Noosa Heads, Australia, 2005
[18] Sen S, Wang J. Analyzing peer-to-peer traffic across large networks. ACM/IEEE Trans Netw, 2004, 12: 219-232
[19] Zegura E, Calvert K, Donahoo M. A quantitative comparison of graph-based models for Internet topology. IEEE/ACM Trans Netw 1997, 5: 770-783
[20] China Internet Network Information Center, http://www.cnnic.net.cn/en/index/
[21] Carothers C D, LaFortune R, Smith W D, et al. A case study in modeling large-scale peer-to-peer file-sharing networks using discrete-event simulation. In: Proceeding of the International Mediterranean Modeling Multiconference, Barcelona, Spain, 2006
[22] Bindal R, Cao P, Chan W, et al. Improving traffic locality in BitTorrent via biased neighbor selection. In: Proceedings of IEEE ICDCS 2006, Lisboa, Portugal, 2006
[23] Legout A, Urvoy-Keller G, Michiardi P. Understanding bittorrent: An experimental perspective. Technical Report, INRIA Sophia Antipolis, France, 2005
[24] Naicken S, Livingston B, Basu A, et al. The state of peer-to-peer simulators and simulations. ACM SIGCOMM Comput Commun Rev, 2007, 37: 95-98
[25] Vahdat A, Yocum K, Walsh K, et al. Scalability and accuracy in a LargeScale Network Emulator. In: Proceedings of OSDI 2002, Boston, MA, USA, 2002
[26] Kato D,
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.