Self-Verifying CSFQ

— Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that have plagued stateful architectures such as Intserv and Fair Queueing. However, despite some desirable properties, these solutions still have serious scalability, robustness, and deployment problems. Their scalability, suffers from the fact that the core cannot transcend trust boundaries (such as at ISP-ISP interconnects), and so the high-speed routers on these boundaries must maintain per flow or per aggregate state. The lack of robustness is because a single malfunctioning edge or core router could severely impact the performance of the entire network. The deployability is hampered because the set of routers must be carefully configured with a well-defined set of edge routers surrounding the core. In this paper, we propose an approach to address these limitations. The main idea is to use statistical veri�...

• Type: Conference
• Year: 2002
• Where: INFOCOM
• Authors: Ion Stoica, Hui Zhang, Scott Shenker
• Keywords: Communications, Fair Queueing, INFOCOM 2002, Routers, Trust Boundaries