1 / 17

QoS Venues: First there was one …

Post-Internet QoS Research Jorg Liebeherr Department of Computer Science University of Virginia IWQoS 2004 Panel. QoS Venues: First there was one …. IWQoS 96 Paris. IWQoS 95 Brisbane. IWQoS 97 New York. IWQoS 94 Aachen. IWQoS 98 Napa. QoS-IP 2005 Catania. .. now there are several.

rohrbaugh
Download Presentation

QoS Venues: First there was one …

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Post-InternetQoS ResearchJorg LiebeherrDepartment of Computer ScienceUniversity of VirginiaIWQoS 2004 Panel

  2. QoS Venues: First there was one … IWQoS 96 Paris IWQoS 95 Brisbane IWQoS 97 New York IWQoS 94 Aachen IWQoS 98Napa QoS-IP 2005Catania .. now there are several IWQoS 94 Montreal IWQoS 04 Montreal QofIS’04Barcelona COQODS 04Singapore QShine 2004Dallas IWQoS 99London QofIS’03Stockholm QoS-IP 2003Milan IWQoS 03 Monterey QofIS’02Coibmra IWQoS 02 Miami Beach QoS-IP 2001 Rome IWQoS 00 Pittsburgh QofIS’01 Berlin IWQoS 01 Karlsruhe

  3. While QoS research has thrived … • Many fundamental advances: • Much improved understanding of packet scheduling • A new theory: network calculus • Numerous proof-of-concept implementations of even the most difficult systems problems

  4. … QoS deployment has failed • No QoS approach seems to be able to take hold: • Connection-oriented (ATM) • Flow-based reservation (IntServ) • Class-based differentiation (DiffServ) • Overlay approach (Service overlays)

  5. Possible Reasons for Lack of QoS Deployment • No applications/business cases • VoD used to be the driver • Botched standardization efforts • Ignored analytical aspects of QoS service • Problems in control path addressed late (e.g, policy) • Naive implementations • Software-only realization of QoS scheduling in core routers • No need for QoS • E.g., in backbone networks, most applications are elastic and enough capacity is available

  6. Lack of deployed QoS infrastructure in the Internet does not make QoS research less important However, QoS research needs to take into account that there is no deployed infrastructure QoS deployment≠ QoS research

  7. Apply QoS principles to different contexts: • QoS in wireless LANs • QoS in sensor networks • QoS in wireless ad-hoc • QoS in P2P networks • QoS in access networks • QoS in VoIP • QoS in MPLS • QoS in QoS • Fundamentals: • Provide new insights into fundamentals of packet networking • Develop system design principles for QoS systems • Develop new analytical tools Frontiers of QoS Research after the Internet

  8. Fundamentals: Statistical Multiplexing • QoS research knows a lot about complex scheduling • However, often it takes a worst-case view of the network and ignores statistical multiplexing • Opportunity: QoS research that considers statistical characteristics of traffic can provide insights into fundamental properties of packet networks (Note: Statmux is the reason d’être of packet networks) • Example problems: • What is the impact of scheduling compared to statmux? • How does this vary with type of traffic? (e.g., self-similar traffic)

  9. Expected case Probable worst-case Worst-case

  10. Statistical multiplexing makes a big difference Scheduling has small impact Impact of Statistical Multiplexing vs. Scheduling Example: MPEG videos with delay constraints at C= 622 Mbps Deterministic service vs. statistical service (e = 10-6) Thick lines: EDF SchedulingDashed lines: SP scheduling Data from: IEEE SAC. 18(12):2651–2664, Dec. 2000

  11. Impact of traffic type on statistical multiplexing Comparisons of statistical service guarantees for different schedulers and traffic types Schedulers: SP- Static PriorityEDF – Earliest Deadline FirstGPS – Generalized Processor Sharing Traffic: Regulated – leaky bucketOn-Off – On-off sourceFBM – Fractional Brownian Motion Data from: Technical Report, Univ. of Virginia, CS Dept., No. CS-20-2003, 2003 C= 100 Mbps, e = 10-6

  12. Design principles: QoS systems • Systems with QoS have separate design components: • Admission control • Traffic conditioning • Scheduling • Signaling • Policy and Accounting • Numerous trade-offs: • Edge vs. endsystem vs. core implementations • Soft state vs. hard-state signaling • Centralized, distributed, user-based, or no admission control • Opportunity: Exploit available know-how to develop guidelines for choices in QoS design space for any given networking context

  13. Search for “Toy Models” • Learn from physics: • Wide use of toy models that capture key characteristics of studied system (without being an exact characterization) • Look for models that permit back-of-the-envelope calculations • Toy models are usable by non-theorists Early days of networking used toy models: M/M/1 Queue • Kleinrock’s PhD Dissertation (cited as laying the foundation for packet networks) heavily uses M/M/1 type models Today: ns-2 culture • M/M/1 has lost appeal as toy model, and was replaced with ns-2 • Simulations are good to evaluate incremental changes to existing systems, but not to evaluate radically different designs • ns-2 may be partially responsible for incremental thinking in networking

  14. My proposal:Develop network calculus into new“Toy Model” Today, fundamental progress in networking is hampered by the lack of methods to evaluate how radically new designs will perform. • Opportunity: Simple (`toy') models that permit fast (`back-of-the-envelope') evaluations can become an enabling factor for breakthrough changes in networking research • Approach: Probabilistic version of min-plus network calculus (stochastic network calculus) is a candidate for a new class of toy models for networking

  15. Snet Network Calculus (Cruz, Chang, LeBoudec) S3 S1 Receiver S2 Sender • Network Calculus: • Arrivals are described by envelopes and service by “service curves”. • If S1, S2 and S3 are service curves that describe the service to a flow then Snet = S1 * S2 * S3 • Many similarly elegant results

  16. Stochastic Network Calculus • State of the art: • Effective bandwidth theory is integrated • Envelope derived for numerous traffic models • Various Snet formulations exist (some wrong) • What is open: • A lot of technical issues (but problems are difficult) • No simple computational algorithms exist • Relationship to other theories (queueing theory, control theory) not clear • How to reduce learning curve and complexity, to make it attractive for non-theorists? • Suitability of model to real problems (ie., “non toy problems”) is untested

  17. QoS is like World Peace • It is a worthy goal, • It is difficult to achieve, • And progress is made in small steps

More Related