Files in this item

FilesDescriptionFormat

application/pdf

application/pdf2010-2511_Kim.pdf (250kB)
technical reportPDF

Description

Title:CRAFT: A New Secure Congestion Control Architecture
Author(s):Kim, Dongho; Chiang, Jerry T.; Hu, Yih-Chun; Perrig, Adrian; Kumar, P.R.
Subject(s):network security
network architecture
congestion control
congestion control algorithms
Transmission Control Protocol (TCP)
Abstract:Congestion control algorithms seek to optimally utilize network resources by allocating a certain rate for each user. However, malicious clients can disregard the congestion control algorithms and induce congestion at bottleneck links. Thus, in an adversarial environment, the network must enforce the congestion control algorithm in order to attain the optimal network utilization offered by the algorithm. Prior work protects only a single link incident on the enforcement router, neglecting damage inflicted upon other downstream links. We present CRAFT, a capability-based scheme to secure all downstream links of a deploying router. Our basic approach is to enforce a network-wide congestion control algorithm on all flows. As a reference design, we develop techniques to enforce the TCP congestion control. Our design regulates all flows to share bandwidth resources in a TCP-fair manner by emulating the TCP state machine in a CRAFT router. As a result, once a flow passes a single CRAFT router, it is TCP-fair on all downstream links of that router. Our prototype implementation shows that CRAFT provides strong fairness properties with low overhead.
Issue Date:2010-09
Citation Info:D. Kim, J. T. Chiang, Y.-C. Hu, A. Perrig, and P. R. Kumar, "CRAFT: A new secure congestion control architecture," Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Tech. Rep. UILU-ENG-2010-2511, Sept. 2010
Series/Report:UILU-ENG-2010-2511
Genre:Technical Report
Type:Text
Language:English
URI:http://hdl.handle.net/2142/17099
Publication Status:unpublished
Peer Reviewed:is peer reviewed
Date Available in IDEALS:2010-09-21


This item appears in the following Collection(s)

Item Statistics