Sciweavers

4052 search results - page 339 / 811
» Using RDF to describe networks
Sort
View
AMC
2005
117views more  AMC 2005»
15 years 6 months ago
Teleonomic entropy: measuring the phase-space of end-directed systems
We introduce a novel way of measuring the entropy of a set of values undergoing changes. Such a measure becomes useful when analyzing the temporal development of an algorithm desi...
Alexander Pudmenzky
SOSP
2005
ACM
16 years 3 months ago
Implementing declarative overlays
Overlay networks are used today in a variety of distributed systems ranging from file-sharing and storage systems to communication infrastructures. However, designing, building a...
Boon Thau Loo, Tyson Condie, Joseph M. Hellerstein...
MOBICOM
2003
ACM
16 years 1 days ago
A high-throughput path metric for multi-hop wireless routing
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of pac...
Douglas S. J. De Couto, Daniel Aguayo, John C. Bic...
CCR
2006
118views more  CCR 2006»
15 years 6 months ago
Tmix: a tool for generating realistic TCP application workloads in ns-2
In order to perform realistic network simulations, one needs a traffic generator that is capable of generating realistic synthetic traffic in a closed-loop fashion that "look...
Michele C. Weigle, Prashanth Adurthi, Félix...
CORR
2007
Springer
134views Education» more  CORR 2007»
15 years 6 months ago
An Analytical Study of a Structured Overlay in the presence of Dynamic Membership
— In this paper, we present a complete analytical study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a master-equation-based approach, which is u...
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurel...