A scalable and robust solution for bandwidth allocation

摘要: We propose a novel architecture for providing bandwidth allocation and reservation that is both scalable robust. Scalability achieved by not requiring routers to maintain per-flow state on either the data or control planes. To achieve robustness, we develop two key techniques. First, use an admission mechanism based lightweight certificates random sampling prevent malicious users from claiming reservations were never allocated them. Second, recursive monitoring algorithm detect misbehaving flows exceed their reservations. randomly divide traffic into large aggregates, then compare arrival rate of each aggregate its reservation. If misbehaves, i.e., greater than reservation, split monitor recursively until flow(s). These are policed separately. conduct extensive simulations evaluate our solutions. The results show proposed solution very effective in protecting well-behaved when fraction limited.