Sciweavers

1121 search results - page 208 / 225
» Distributed server replication in large scale networks
Sort
View
PODC
2012
ACM
11 years 10 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
ANCS
2005
ACM
14 years 1 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood
IMC
2003
ACM
14 years 29 days ago
A measurement study of available bandwidth estimation tools
Available bandwidth estimation is useful for route selection in overlay networks, QoS verification, and traffic engineering. Recent years have seen a surge in interest in availab...
Jacob Strauss, Dina Katabi, M. Frans Kaashoek
SIGCOMM
2004
ACM
14 years 1 months ago
The feasibility of supporting large-scale live streaming applications with dynamic application end-points
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
Kunwadee Sripanidkulchai, Aditya Ganjam, Bruce M. ...
JSAC
2007
104views more  JSAC 2007»
13 years 7 months ago
Characterizing Peer-to-Peer Streaming Flows
— The fundamental advantage of peer-to-peer (P2P) multimedia streaming applications is to leverage peer upload capacities to minimize bandwidth costs on dedicated streaming serve...
Chuan Wu, Baochun Li, Shuqiao Zhao