Sciweavers

635 search results - page 116 / 127
» Performance evaluation of a new scheduling algorithm for dis...
Sort
View
CCS
2007
ACM
13 years 12 months ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
SIGCOMM
2003
ACM
14 years 1 months ago
Scaling internet routers using optics
Routers built around a single-stage crossbar and a centralized scheduler do not scale, and (in practice) do not provide the throughput guarantees that network operators need to ma...
Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu, Da...
SIGCOMM
2004
ACM
14 years 1 months ago
Vivaldi: a decentralized network coordinate system
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often un...
Frank Dabek, Russ Cox, M. Frans Kaashoek, Robert M...
TDP
2010
189views more  TDP 2010»
13 years 2 months ago
The PROBE Framework for the Personalized Cloaking of Private Locations
The widespread adoption of location-based services (LBS) raises increasing concerns for the protection of personal location information. A common strategy, referred to as obfuscati...
Maria Luisa Damiani, Elisa Bertino, Claudio Silves...
ATAL
2011
Springer
12 years 8 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee