Sciweavers

3319 search results - page 557 / 664
» The topology of dark networks
Sort
View
AHS
2007
IEEE
202views Hardware» more  AHS 2007»
15 years 6 months ago
PERPLEXUS: Pervasive Computing Framework for Modeling Complex Virtually-Unbounded Systems
This paper introduces Perplexus, a European project that aims to develop a scalable hardware platform made of custom reconfigurable devices endowed with bio-inspired capabilities...
Eduardo Sanchez, Andrés Pérez-Uribe,...
DC
2010
15 years 6 months ago
Towards worst-case churn resistant peer-to-peer systems
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
CORR
2007
Springer
86views Education» more  CORR 2007»
15 years 6 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
JUCS
2007
108views more  JUCS 2007»
15 years 6 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani
CAL
2002
15 years 6 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally