메뉴 건너뛰기




Volumn , Issue , 2004, Pages 39-42

Packet filtering to defend flooding-based DDoS attacks

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL; DISTRIBUTED DENIAL-OF-SERVICE (DDOS) ATTACKS; IP NETWORKS; PACKET FILTERING;

EID: 4143100281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (12)
  • 2
    • 0027612043 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services network: The single-node case
    • June
    • A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services network: The single-node case," IEEE/ACM Trans. on Networking, vol. 1, No. 3, June, 1993.
    • (1993) IEEE/ACM Trans. on Networking , vol.1 , Issue.3
    • Parekh, A.K.1    Gallager, R.G.2
  • 3
    • 0030609305 scopus 로고    scopus 로고
    • Dynamics of random early detection
    • Cannes, France, Oct.
    • D. Lin and R. Morris, "Dynamics of random early detection," Proc. ACM SIGCOMM, Cannes, France, Oct. 1997, pp. 127-137.
    • (1997) Proc. ACM SIGCOMM , pp. 127-137
    • Lin, D.1    Morris, R.2
  • 4
    • 0032594135 scopus 로고    scopus 로고
    • Promoting the use of end-to-end congestion control in the internet
    • S. Floyd and K. Fall, "Promoting the use of end-to-end congestion control in the internet," IEEE/ACM Trans. Networking, vol. 7, pp. 458-472.
    • IEEE/ACM Trans. Networking , vol.7 , pp. 458-472
    • Floyd, S.1    Fall, K.2
  • 6
    • 85013295511 scopus 로고    scopus 로고
    • Efficient fair queueing using deficit round robin
    • Cambridge, MA, USA
    • M. Shreedhar and G. Varghese, "Efficient fair queueing using deficit round robin," in Proc. of SIGCOMM '95, Cambridge, MA, USA.
    • Proc. of SIGCOMM '95
    • Shreedhar, M.1    Varghese, G.2
  • 8
    • 0030609305 scopus 로고    scopus 로고
    • Dynamics of random early detection
    • Cannes, France, Oct.
    • D. Lin and R. Morris, "Dynamics of random early detection," in Proc. ACM SIGCOMM, Cannes, France, Oct. 1997, pp. 127-137.
    • (1997) Proc. ACM SIGCOMM , pp. 127-137
    • Lin, D.1    Morris, R.2
  • 9
    • 0027647490 scopus 로고    scopus 로고
    • Random early detection gateways for congestion avoidance
    • Aug.
    • S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. on Networking, 1(4), Aug. 1997.
    • (1997) IEEE/ACM Trans. on Networking , vol.1 , Issue.4
    • Floyd, S.1    Jacobson, V.2
  • 11
    • 0032141929 scopus 로고    scopus 로고
    • Expliciit ALlocation of best effort packet delivery service
    • AUgust
    • D. D. Clark and W. Fang, "Expliciit ALlocation of Best Effort Packet Delivery Service," IEEE/ACM Trans. Networking, vol. 6, no. 4, AUgust 1998.
    • (1998) IEEE/ACM Trans. Networking , vol.6 , Issue.4
    • Clark, D.D.1    Fang, W.2
  • 12
    • 0037295811 scopus 로고    scopus 로고
    • Core-stateless fair queueing: A scalable architecture to approximate fair bandwidth allocations in high-speed networks
    • Feb.
    • I. Stoica, S. Shenker, and H. Zhang, "Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks," IEEE/ACM Trans. Networking, vol. 11, no. 1, Feb. 2003.
    • (2003) IEEE/ACM Trans. Networking , vol.11 , Issue.1
    • Stoica, I.1    Shenker, S.2    Zhang, H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.