Self-verifying CSFQ
Proceedings - IEEE INFOCOM - Tập 1 - Trang 21-30 vol.1
Tóm tắt
Previously, 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 verification to identify and contain the flows whose packets carry incorrect information. To demonstrate the applicability of this approach we develop an extension of CSFQ, called self-verifying CSFQ (SV-CSFQ). With SV-CSFQ, rate estimation is performed by sending hosts, and all routers statistically verify these rate estimates. Statistical verification allows routers to identify misbehaving flows and routers, and thereby protect other flows. This makes our approach robust and highly scalable as it eliminates the need for stateful routers at trust boundaries, and for the core-edge distinction. We present simulations and analysis of the performance of this approach, and discuss its general applicability to provide other scalable and robust network services.
Từ khóa
#Scalability #Diffserv networks #Robustness #Aggregates #Traffic control #Protection #Analytical models #Performance analysis #Electronic mail #InternetTài liệu tham khảo
srinivasan, 0, Fast scalable algorithms for level four switching, Proceedings of ACM SIGCOMM'98 Vancouver Canada Sept 1998, 191
lakshman, 0, High speed policy-based packet forwarding using efficient multi-dimensional range matching, Proceedings of ACM SIGCOMM'98 Vancouver Canada Sept 1998, 203
srinivasan, 0, Packet classification using tuple space search, Proceedings of ACM SIGCOMM'99 Cambridge MA Sept 1999, 135
10.1109/INFCOM.2002.1019242
gupta, 0, Packet classification on multiple fields, Proceedings of ACM SIGCOMM'99 Cambridge MA Sept 1999, 147
fraleigh, 2000, Architecture for a passive monitoring system for backbone ip networks
10.1109/ICNP.2001.992899
jacobson, 1999, An expedited forwarding PHB, 10.17487/rfc2598
venkitaraman, 2000, Stateless prioritized fair queuing
blake, 1998, An architecture for differentiated services, 10.17487/rfc2475
0, Ucb/lbnl/vint network simulator - ns (version 2)
shenker, 1994, Integrated services in the internet architecture: An overview
demers, 1990, Analysis and simulation of a fair queueing algorithm, Journal of Internetworking Research and Experience, 3
nichols, 1998, Definition of the differentiated services field (DS field) in the IPv4 and IPv6 headers, 10.17487/rfc2474
stoica, 0, Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks, Proceedings ACM SIGCOMM'98 Vancouver Sept 1998, 118
clerget, 0, Tag-based fair bandwidth sharing for responsive and unresponsive flows, Proceedings of INFOCOM'01 Anchorage AK Apr 2001
cao, 0, Rainbow fair queueing: Fair bandwidth sharing without per-flow state, Proceedings of INFOCOM'99 Tel-Aviv Israel Mar 2000, 922
heinanen, 1999, Assured forwarding PHB group, 10.17487/rfc2597
clark, 1997, An approach to service allocation in the internet
stoica, 0, Providing guaranteed services without per flow management, Proceedings of ACM SIGCOMM'99 Cambridge MA Sept 1999, 81