Name
Abstract | ||
|---|---|---|
This paper proposes a detection mechanism called DCAP for a network provider to monitor incoming traffic and identify misbehaving flows without having to keep per-flow accounting at any of its routers. Misbehaving flows refer to flows that exceed their stipulated bandwidth limit. Through collaborative aggregate policing at both ingress and egress nodes, DCAP is able to quickly narrow the search to a candidate group that contains the misbehaving flows, and eventually identify the individual culprits. In comparison to per-flow policing, the amount of state maintained at an edge router is reduced from O(n) to O(√n), where n is the number of admitted flows. Simulation results show that DCAP can successfully detect a majority (64--83%) of the misbehaving flows with almost zero false alarms. Packet losses suffered by innocent flows due to undetected misbehaving activity are insignificant (0.02--0.9%). We also successfully build a prototype that demonstrates how DCAP can be deployed with minimal processing overhead in a soft-QoS architecture. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1145/963985.963987 | Computer Communication Review |
Keywords | Field | DocType |
flow-level accounting,edge router,misbehaving flow detection,misbehaving flow,candidate group,bandwidth limit,undetected misbehaving activity,collaborative aggregate,traffic policing,egress node,detection mechanism,incoming traffic,per-flow accounting,packet loss | Computer security,Computer science,Network packet,Network providers,Computer network,Router,Bandwidth cap,Traffic policing,Distributed computing | Journal |
Volume | Issue | ISSN |
33 | 5 | 0146-4833 |
Citations | PageRank | References |
2 | 0.40 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chen-Nee Chuah | 1 | 2006 | 161.34 |
| Lakshminarayanan Subramanian | 2 | 1540 | 163.14 |
| Randy H. Katz | 3 | 16819 | 3018.89 |