Sciweavers

350 search results - page 57 / 70
» Probabilistic delay guarantees using delay distribution meas...
Sort
View
CORR
2011
Springer
152views Education» more  CORR 2011»
13 years 3 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
MOBIHOC
2008
ACM
14 years 8 months ago
Delegation forwarding
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
Vijay Erramilli, Mark Crovella, Augustin Chaintrea...
CCR
2006
122views more  CCR 2006»
13 years 8 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
MWCN
2004
Springer
14 years 2 months ago
Short-Term Fairness of 802.11 Networks with Several Hosts
Previously, we have analyzed the short-term fairness of the 802.11 DCF (Distributed Coordination Function) access method in the case of a network with two hosts. In this paper we e...
Gilles Berger-Sabbatel, Andrzej Duda, Martin Heuss...
ENTCS
2006
140views more  ENTCS 2006»
13 years 8 months ago
Stochastic Ambient Calculus
Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We pres...
Maria Grazia Vigliotti, Peter G. Harrison