Sciweavers

3046 search results - page 562 / 610
» Anonymous communications in the Internet
Sort
View
INFOCOM
2005
IEEE
15 years 11 months ago
Design and implementation of network puzzles
Abstract— Client puzzles have been proposed in a number of protocols as a mechanism for mitigating the effects of distributed denial of service (DDoS) attacks. In order to provid...
Wu-chi Feng, Edward C. Kaiser, A. Luu
INFOCOM
2005
IEEE
15 years 11 months ago
Joint optimal scheduling and routing for maximum network throughput
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
INFOCOM
2005
IEEE
15 years 11 months ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang
ISCC
2005
IEEE
107views Communications» more  ISCC 2005»
15 years 11 months ago
FTSE: The FNP-Like TCAM Searching Engine
As the Internet grows at a very rapid pace, so does the incidence of attack events and documented unlawful intrusions. The Network Intrusion Detection Systems (NIDSes) are designe...
Rong-Tai Liu, Chia-Nan Kao, Hung-Shen Wu, Ming-Cha...
SIGCOMM
2005
ACM
15 years 11 months ago
On the predictability of large transfer TCP throughput
Predicting the throughput of large TCP transfers is important for a broad class of applications. This paper focuses on the design, empirical evaluation, and analysis of TCP throug...
Qi He, Constantinos Dovrolis, Mostafa H. Ammar