Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller

First Page		Document Content
Date: 2014-09-26 08:28:47 Analysis of algorithms Bellman–Ford algorithm Time complexity Search algorithms Routing algorithms Koorde Randomized algorithm Theoretical computer science Computational complexity theory Applied mathematics		Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller Add to Reading List Source URL: dcg.ethz.ch Download Document from Source Website File Size: 245,46 KB Share Document on Facebook

	The Architecture of PIER: an Internet-Scale Query Processor Ryan Huebsch, Brent Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, Scott Shenker, Ion Stoica and Aydan R. Yumerefendi UC Berkeley DocID: 1r0TY - View Document
	Flexible Routing Tables: Designing Routing Algorithms for Overlays Based on a Total Order on a Routing Table Set Hiroya Nagao, Kazuyuki Shudo Tokyo Institute of Technology, Tokyo, Japan Email: {hiroya.nagao, shudo}@is.ti DocID: 1qDGD - View Document
	arXiv:1402.2701v1 [cs.DS] 12 Feb 2014 DocID: 1qcDs - View Document
	Modeling the Performance of Ring Based DHTs in the Presence of Network Address Translators John Ardelius1 and Boris Mej´ıas2 1 Swedish Institute of Computer Science DocID: 1pp2H - View Document
	Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan DocID: 1pitm - View Document