Sciweavers

661 search results - page 77 / 133
» Robustness Guarantees for Anonymity
Sort
View
SIGMETRICS
2008
ACM
15 years 6 months ago
An SLA perspective on the router buffer sizing problem
In this paper, we discuss recent work on buffer sizing in the context of an ISP's need to offer and guarantee competitive Service Level Agreements (SLAs) to its customers. Si...
Joel Sommers, Paul Barford, Albert G. Greenberg, W...
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
15 years 6 months ago
Enlarging the domain of attraction of MPC controllers
This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add...
Daniel Limón, T. Alamo, Eduardo F. Camacho
TON
2010
158views more  TON 2010»
15 years 4 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
AIRWEB
2007
Springer
16 years 9 days ago
Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks
Peer-to-peer (P2P) networks have received great attention for sharing and searching information in large user communities. The open and anonymous nature of P2P networks is one of ...
Josiane Xavier Parreira, Debora Donato, Carlos Cas...
SP
2006
IEEE
121views Security Privacy» more  SP 2006»
16 years 3 days ago
On the Secrecy of Timing-Based Active Watermarking Trace-Back Techniques
Timing-based active watermarking schemes are developed to trace back attackers through stepping stone connections or anonymizing networks. By slightly changing packet timing, thes...
Pai Peng, Peng Ning, Douglas S. Reeves