Sciweavers

944 search results - page 127 / 189
» A Survey on Counting Networks
Sort
View
147
Voted
INFOCOM
2003
IEEE
15 years 11 months ago
Analysis of Routing Characteristics in the Multicast Infrastructure
Abstract— As the multicast-capable part of the Internet continues to evolve, important questions to ask are whether the protocols are operating correctly, the topology is well co...
Prashant Rajvaidya, Kevin C. Almeroth
167
Voted
CONEXT
2007
ACM
15 years 8 months ago
Detecting worm variants using machine learning
Network intrusion detection systems typically detect worms by examining packet or flow logs for known signatures. Not only does this approach mean worms cannot be detected until ...
Oliver Sharma, Mark Girolami, Joseph S. Sventek
CCR
2007
76views more  CCR 2007»
15 years 6 months ago
Reducing the TCP acknowledgment frequency
Delayed acknowledgments were introduced to conserve network and host resources. Further reduction of the acknowledgment frequency can be motivated in the same way. However, reduci...
Sara Landström, Lars-Åke Larzon
MOBICOM
2003
ACM
15 years 11 months ago
A high-throughput path metric for multi-hop wireless routing
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of pac...
Douglas S. J. De Couto, Daniel Aguayo, John C. Bic...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 10 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts