-
1
-
-
0034206002
-
Summary cache: A scalable wide-area Web cache sharing protocol
-
June
-
L. Fan, P. Cao, J. Almeida, and A.Z. Broder, "Summary cache: A scalable wide-area Web cache sharing protocol," IEEE/ACM Trans. on Networking, vol. 8, no. 3, pp. 281-293, June 2000.
-
(2000)
IEEE/ACM Trans. on Networking
, vol.8
, Issue.3
, pp. 281-293
-
-
Fan, L.1
Cao, P.2
Almeida, J.3
Broder, A.Z.4
-
2
-
-
84860029293
-
-
Technical Report TR-04-02, School of Computer Science, Carleton Univ., June [Accessed: January 4 2005]
-
M. Vargas Martin, J.-M. Robert, P.C. Van Oorschot, "A monitoring system for detecting repeated packets with applications to computer worms," Technical Report TR-04-02, School of Computer Science, Carleton Univ., June 2004. URL: http://www.scs.carleton.ca/research/tech_reports/2004/TR-04-02.1.pdf [Accessed: January 4 2005].
-
(2004)
A Monitoring System for Detecting Repeated Packets with Applications to Computer Worms
-
-
Vargas Martin, M.1
Robert, J.-M.2
Van Oorschot, P.C.3
-
3
-
-
3543102829
-
-
Technical Report SSC/1998/037, EPFL, November [Accessed: February 12, 2004]
-
W. Almesberger, "Linux traffic control - implementation overview," Technical Report SSC/1998/037, EPFL, November 1998.URL: ftp://lroftp.epfl.ch/pub/people/_almesber/pub/tcio-current.ps.gz [Accessed: February 12, 2004].
-
(1998)
Linux Traffic Control - Implementation Overview
-
-
Almesberger, W.1
-
5
-
-
0005933497
-
On packet switches with infinite storage
-
J. Nagle, "On packet switches with infinite storage," IETF RFC 970, 1985.
-
(1985)
IETF RFC
, vol.970
-
-
Nagle, J.1
-
6
-
-
0023329886
-
On packet switches with infinite storage
-
J. Nagle, "On packet switches with infinite storage," IEEE Trans. on Communications, vol. 35, pp. 435-438, 1987.
-
(1987)
IEEE Trans. on Communications
, vol.35
, pp. 435-438
-
-
Nagle, J.1
-
7
-
-
0024889726
-
Analysis and simulation of a fair queuing algorithm
-
Austin, USA, September 19-22
-
A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queuing algorithm," Proc. Special Interest Group on Data Communication (SIGCOMM), Austin, USA, September 19-22 1989.
-
(1989)
Proc. Special Interest Group on Data Communication (SIGCOMM)
-
-
Demers, A.1
Keshav, S.2
Shenker, S.3
-
8
-
-
0027647490
-
Random early detection gateways for congestion avoidance
-
S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. on Networking, vol. 1, no. 4, pp. 397-413, 1993.
-
(1993)
IEEE/ACM Trans. on Networking
, vol.1
, Issue.4
, pp. 397-413
-
-
Floyd, S.1
Jacobson, V.2
-
9
-
-
0030609305
-
Dynamics of random early detection
-
Cannes, France, September 14-18
-
D. Lin and R. Morris, "Dynamics of Random Early Detection," Proc. Special Interest Group on Data Communication (SIGCOMM), pages 127-137, Cannes, France, September 14-181997.
-
(1997)
Proc. Special Interest Group on Data Communication (SIGCOMM)
, pp. 127-137
-
-
Lin, D.1
Morris, R.2
-
10
-
-
0035699161
-
Using dynamic buffer limiting to protect against belligerent flows in high-speed networks
-
Riverside, USA, November 11-14
-
F. Ertemalp, D.R. Cheriton, and A. Bechtolsheim, "Using dynamic buffer limiting to protect against belligerent flows in high-speed networks," Int 7 Conf. on Network Protocols (ICNP), pages 230-240, Riverside, USA, November 11-14 2001.
-
(2001)
Int 7 Conf. on Network Protocols (ICNP)
, pp. 230-240
-
-
Ertemalp, F.1
Cheriton, D.R.2
Bechtolsheim, A.3
-
11
-
-
0038404196
-
Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles
-
Miami Beach, USA, May
-
D.K.Y. Yau, J.C.S. Lui, and F. Liang, "Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles," Proc. of the IEEE Int'l Workshop on Quality of Service, Miami Beach, USA, May 2002.
-
(2002)
Proc. of the IEEE Int'l Workshop on Quality of Service
-
-
Yau, D.K.Y.1
Lui, J.C.S.2
Liang, F.3
-
12
-
-
4544272175
-
Controlling high-bandwidth aggregates in the network
-
R. Mahajan, S.M. Bellovin, S. Floyd, J. Ioannidis, V. Paxson, and S. Shenker, "Controlling high-bandwidth aggregates in the network," ACM SIGCOMM Computer Communication Review, vol. 32, no. 3, pp. 62-73, 2002.
-
(2002)
ACM SIGCOMM Computer Communication Review
, vol.32
, Issue.3
, pp. 62-73
-
-
Mahajan, R.1
Bellovin, S.M.2
Floyd, S.3
Ioannidis, J.4
Paxson, V.5
Shenker, S.6
-
14
-
-
1242287724
-
A framework for classifying denial of service attacks
-
Karlsruhe, Germany, August 25-29
-
A. Hussain, J. Heidemann and C. Papadopoulos, "A framework for classifying denial of service attacks," Proc. of the Special Interest Group on Data Communication (SIGCOMM), pages 99-110, Karlsruhe, Germany, August 25-29 2003.
-
(2003)
Proc. of the Special Interest Group on Data Communication (SIGCOMM)
, pp. 99-110
-
-
Hussain, A.1
Heidemann, J.2
Papadopoulos, C.3
-
15
-
-
0142039747
-
Transport-aware IP routers: A built-in protection mechanism to counter DDoS attacks
-
September
-
H. Wang and K.G. Shin, "Transport-aware IP routers: A built-in protection mechanism to counter DDoS attacks," IEEE Trans. on Parallel and Distributed Systems, vol. 14, no. 9, pp. 873-884, September 2003.
-
(2003)
IEEE Trans. on Parallel and Distributed Systems
, vol.14
, Issue.9
, pp. 873-884
-
-
Wang, H.1
Shin, K.G.2
-
18
-
-
77953077374
-
Flash crowds and denial of service attacks: Characterization and implications for CDNs and web sites
-
Honolulu, USA, May 7-11
-
th Int'l World Wide Web Conf., pages 293-304, Honolulu, USA, May 7-11 2002.
-
(2002)
th Int'l World Wide Web Conf.
, pp. 293-304
-
-
Jung, J.1
Krishnamurthy, B.2
Rabinovich, M.3
-
20
-
-
0014814325
-
Space/time trade-offs in hash coding with allowable errors
-
July
-
B.H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Comm. of the ACM, vol. 13, no. 17, pp. 422-426 , July 1970.
-
(1970)
Comm. of the ACM
, vol.13
, Issue.17
, pp. 422-426
-
-
Bloom, B.H.1
-
21
-
-
1242332554
-
Longest prefix matching using Bloom filters
-
Karlsruhe, Germany, August 25-29
-
S. Dharmapurikar, P. Krishnamurthy, and D. Taylor, "Longest prefix matching using Bloom filters," Proc. of the Special Interest Group on Data Communication (SIGCOMM), pages 201-212, Karlsruhe, Germany, August 25-29 2003.
-
(2003)
Proc. of the Special Interest Group on Data Communication (SIGCOMM)
, pp. 201-212
-
-
Dharmapurikar, S.1
Krishnamurthy, P.2
Taylor, D.3
-
22
-
-
84944030124
-
Deep packet inspection using parallel Bloom filters
-
Stanford, USA, August
-
S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood, "Deep packet inspection using parallel Bloom filters," Symp. on High Performance Interconnects (HotI), pages 44-51, Stanford, USA, August 2003.
-
(2003)
Symp. on High Performance Interconnects (HotI)
, pp. 44-51
-
-
Dharmapurikar, S.1
Krishnamurthy, P.2
Sproull, T.3
Lockwood, J.4
-
23
-
-
33244488406
-
Secure indexes
-
Report 2003/216, [Accessed: January 7, 2004]
-
E.-J. Goh, "Secure indexes," Cryptology ePrint Archive, Report 2003/216, 2003. URL:http://eprint.iacr.org/2003/216 / [Accessed: January 7, 2004].
-
(2003)
Cryptology EPrint Archive
-
-
Goh, E.-J.1
-
24
-
-
3543118019
-
Space-code Bloom filter for efficient traffic flow measurement
-
Miami Beach, USA, October 27-29
-
A. Kumar, J. Xu, L. Li, and J. Wang, "Space-code Bloom filter for efficient traffic flow measurement," Proc. of IMC, Miami Beach, USA, October 27-29 2003.
-
(2003)
Proc. of IMC
-
-
Kumar, A.1
Xu, J.2
Li, L.3
Wang, J.4
-
25
-
-
0001887844
-
Hash-based IP traceback
-
San Diego, USA, August 27-31
-
A.C. Snoeren, C. Partridge, L.A. Sanchez, C.E. Jones, F. Tchakountio, S.T. Kent, and W.T. Strayer, "Hash-based IP traceback," Proc. of the Special Interest Group on Data Communication (SIGCOMM), San Diego, USA, August 27-31 2001.
-
(2001)
Proc. of the Special Interest Group on Data Communication (SIGCOMM)
-
-
Snoeren, A.C.1
Partridge, C.2
Sanchez, L.A.3
Jones, C.E.4
Tchakountio, F.5
Kent, S.T.6
Strayer, W.T.7
-
26
-
-
0030736223
-
Computer virus-antivirus coevolution
-
January
-
C. Nachenberg, "Computer virus-antivirus coevolution," Comm. of the ACM, 40(1):46-51, January 1997.
-
(1997)
Comm. of the ACM
, vol.40
, Issue.1
, pp. 46-51
-
-
Nachenberg, C.1
|