Sciweavers

2092 search results - page 100 / 419
» A Theory of Non-Deterministic Networks
Sort
View
DEDS
2008
108views more  DEDS 2008»
14 years 11 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry
IJNSEC
2006
205views more  IJNSEC 2006»
14 years 11 months ago
A Game Theoretic Formulation for Intrusion Detection in Mobile Ad Hoc Networks
Nodes in a mobile ad hoc network need to thwart various attacks and malicious activities. This is especially true for the ad hoc environment where there is a total lack of central...
Animesh Patcha, Jung-Min Park
CCR
2004
62views more  CCR 2004»
14 years 11 months ago
Methodological frameworks for large-scale network analysis and design
This paper emphasizes the need for methodological frameworks for analysis and design of large scale networks which are independent of specific design innovations and their advocac...
Antonis Papachristodoulou, Lun Li, John C. Doyle
SENSYS
2009
ACM
15 years 6 months ago
Optimal clock synchronization in networks
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
Christoph Lenzen, Philipp Sommer, Roger Wattenhofe...
TON
2002
76views more  TON 2002»
14 years 11 months ago
Some properties of variable length packet shapers
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
Jean-Yves Le Boudec