Stateless Core: A Scalable Approach for Quality of Service in the Internet: Winning Thesis of the 2001 ACM Doctoral Dissertation CompetitionThe fundamental aspect of the Internet architecture that distinguishes it from other network technologies (such as X. 25 and ATM) is that it is c- nectionless (vs. connection-oriented) and stateless (vs. stateful). The heated debateofwhetherconnection-orientedorconnectionlessarchitectureisbetter has lasted for several decades. Proponents of the connectionless architecture point out the great robustness and scalability properties of the architecture, as demonstratedby the Internet. Onewell-knownarticulationofthis philo- phy is the "End-to-End Arguments". Opponents argue, rightfully, that there is no known solution that can provide quantitative performance assurances or guaranteed QoS in a connectionless network. It has been widely rec- nized that QoS is a must-have feature as the Internet technology evolves to the next stage. However, all existing solutions that provide guaranteed QoS require routers to maintain per ?ow (another name for connection used by the Internet community) state, which is the fundamental element of a connection-oriented architecture. The apparent con?icting goals of having a stateless network and supporting QoS have presented a great dilemma for Internet architects. As an example, Dave Clark, one of the most respected Internet architects and the author of the famous "End-to-End Arguments" paper, wasalsoakeydesigneroftheInternetIntegratedServicesArchitecture that requires routers to maintain per ?ow state. Dr. Ion Stoica's dissertation addresses this most pressing and di?cult problem facing the Internet community today: how to enhance the Internet to support rich functionalities (such as QoS and tra?c management) while still maintaining the scalability and robustness properties embodied in the original Internet architecture. Inhisdissertation, Dr. |
Contents
Introduction | 1 |
Background 13 | 12 |
Overview | 35 |
Providing Flow Protection in SCORE 53 | 52 |
Providing Guaranteed Services in SCORE | 77 |
Providing Relative Service Differentiation in SCORE | 103 |
Making SCORE More Robust and Scalable 129 | 128 |
Prototype Implementation Description | 153 |
Conclusions and Future Work 173 | 172 |
A Performance Bounds for CSFQ | 185 |
References | 213 |
Other editions - View all
Stateless Core: A Scalable Approach for Quality of Service in the Internet ... Ion Stoica Limited preview - 2004 |
Stateless Core: A Scalable Approach for Quality of Service in the Internet ... Ion Stoica No preview available - 2004 |
Common terms and phrases
achieve addition admission control aggregate algorithm allocation allows approach architecture arrival assume bandwidth bound buffer called capacity carried chapter classification complexity computed congestion consider consistent core routers cost CSFQ delay described destination different differentiation discuss distributed dropping edge egress encoding estimate example experiment fact fair Fair Queueing Figure Finally first flow follows forwarding function guaranteed guaranteed services identification implement increase ingress node Internet interval label larger limitations LIRA maintain Mbps misbehaving monitoring node operations output packet packet headers parameters particular path perform period possible present probability problem profile proposed protection protocol queue received reduce represents require reservation resource respectively result robustness routing scalability scheduling scheme SCORE share simulation solutions stateless Table throughput traffic traverse updated