4411 search results - page 333 / 883 » Communication Complexity and Its Applications |
171
click to vote
SIGCOMM
1996
ACM
15 years 11 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
177
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
—Owing to the limited requirement for sensor processing in early networked sensor nodes, embedded software was generally built around the communication stack. Modern sensor nodes...
171
click to vote
INFOCOM
2006
IEEE
16 years 23 days ago
2006
IEEE
— Peer-to-Peer (P2P) file sharing applications have witnessed a dramatic increase in popularity during the past few years. To accommodate the rapid growth in user population, de...
206
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—We propose a simple and robust mechanism for detecting SYN flooding attacks. Instead of monitoring the ongoing traffic at the front end (like firewall or proxy) or a ...
175
click to vote
TMC
2008
15 years 6 months ago
2008
Content-based routing (CBR) provides a powerful and flexible foundation for distributed applications. Its communication model, based on implicit addressing, fosters decoupling amon...