UCB DiffServ An Overview Jean Walrand EECS. UCB Outline DiffServ Goal Solution Worst Case Admission Control Measurement-Based Admission Control Bandwidth.

Slides:

Advertisements

Similar presentations

Quality of Service CCDA Quick Reference.

Advertisements

Japan Telecom Information & Communication Labs

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.

© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.

Architectures for Congestion-Sensitive Pricing of Network Services Thesis Defense by Murat Yuksel CS Department, RPI July 3 rd, 2002.

1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.

Designing a New Routing Simulator for DiffServ MPLS Networks Peng Zhang Zhansong Ma Raimo Kantola {pgzhang, zhansong,

CNDS 2001, Phoenix, AZ Simulating the Smart Market Pricing Scheme on Differentiated- Services Architecture Murat Yuksel and Shivkumar Kalyanaraman Rensselaer.

A Flexible Model for Resource Management in Virtual Private Networks Presenter: Huang, Rigao Kang, Yuefang.

DSCP for Admitted Voice Fred Baker, Cisco Martin Dolly, AT&T draft-baker-tsvwg-admitted-voice-dscp.

Dynamic Guard Bandwidth Scheme for Wireless Broadband Networks IEEE INFOCOM 2001.

UCB Tools for Smart Networks Jean Walrand BITS (Berkeley Information Technology & Systems) U.C. Berkeley

CPSC Topics in Multimedia Networking A Mechanism for Equitable Bandwidth Allocation under QoS and Budget Constraints D. Sivakumar IBM Almaden Research.

AHOP Problem and QoS Route Pre-computation Adam Sachitano IAL.

Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.

1 HEURISTICS FOR DYNAMIC SCHEDULING OF MULTI-CLASS BASE-STOCK CONTROLLED SYSTEMS Bora KAT and Zeynep Müge AVŞAR Department of Industrial Engineering Middle.

Comparing flow-oblivious and flow-aware adaptive routing Sara Oueslati and Jim Roberts France Telecom R&D CISS 2006 Princeton March 2006.

Multiple constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path.

UCB Notes on Optical Networks Jean Walrand EECS. UCB Outline Dynamic Configuration? Wavelength Assignment Too Much Bandwidth?

December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.

ASWP – Ad-hoc Routing with Interference Consideration Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya Department of EECS University of California,

1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ

UCB Implementing QoS Jean Walrand EECS. UCB Outline What? Bandwidth, Delay Where? End-to-End, Edge-to-Edge, Edge-to-End, Overlay Mechanisms Access Control.

UCB Routing Jean Walrand U.C. Berkeley

UCB MPLS An Overview Jean Walrand EECS. UCB Outline Objectives Label Switching LSP setup.

Endpoint Admission Control WebTP Presentation 9/26/00 Presented by Ye Xia Reference: L. Breslau, E. W. Knightly, S. Shenkar, I. Stoica, H. Zhang, “Endpoint.

Traffic Engineering and Routing Hansen Bow. Topics Traffic Engineering with MPLS Issues Concerning Voice over IP Features of Netscope QoS Routing for.

EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.

A Strategy for Implementing Smart Market Pricing Scheme on Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY.

Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,

UCB Tools for Smart Networks Jean Walrand BITS (Berkeley Information Technology & Systems) U.C. Berkeley

1 Smart Networks Project Overview Cisco: – David Jaffe, Karl Auerbach, Anna Charny Berkeley: – Venkat Anantharam, David Tse, Pravin Varaiya, Jean Walrand.

Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.

S. Suri, M, Waldvogel, P. Warkhede CS University of Washington Profile-Based Routing: A New Framework for MPLS Traffic Engineering.

10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.

On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.

UCB Switches Jean Walrand U.C. Berkeley

Implement a QoS Algorithm for Real-Time Applications in the DiffServ-aware MPLS Network Zuo-Po Huang, *Ji-Feng Chiu, Wen-Shyang Hwang and *Ce-Kuen Shieh.

Internet Infrastructure and Pricing. Internet Pipelines Technology of the internet enables ecommerce –Issues of congestion and peak-load pricing –Convergence.

Bell Labs Advanced Technologies EMEAAT Proprietary Information © 2004 Lucent Technologies1 Overview contributions for D27 Lucent Netherlands Richa Malhotra.

Cost-Performance Tradeoffs in MPLS and IP Routing Selma Yilmaz Ibrahim Matta Boston University.

COnvergence of fixed and Mobile BrOadband access/aggregation networks Work programme topic: ICT Future Networks Type of project: Large scale integrating.

DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,

An Analytical Approach for the Two-Tier Resource Management Model IPS-MOME March 2004 Y. Rebahi.

Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks Murali Kodialam and T. V. Lakshman Bell Laboratories Lucent Technologies IEEE INFOCOM.

1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.

A Scalable Bandwidth Management Architecture for Supporting VoIP Applications Using Bandwidth Broker Zhenhai Duan, Zhi-Li Zhang University of Minnesota.

MENTER Overview Prepared by Mark Shayman UMIACS Contract Review Laboratory for Telecommunications Science May 31, 2001.

© 2009 IBM Corporation 1 Improving Consolidation of Virtual Machines with Risk-aware Bandwidth Oversubscription in Compute Clouds Amir Epstein Joint work.

Transporting Compressed Video Over ATM Networks with Explicit-Rate Feedback Control IEEE/ACM Transactions on Networking, VOL. 7, No. 5, Oct 1999 T. V.

Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.

Monitoring and Measurement System in EuQoS project dr Andrzej Beben Telecommunication Network Technology Group Warsaw University.

Applicazione del paradigma Diffserv per il controllo della QoS in reti IP: aspetti teorici e sperimentali Stefano Salsano Università di Roma “La Sapienza”

© Jörg Liebeherr, Quality-of-Service Architectures for the Internet Integrated Services (IntServ)

Two-Tier Resource Management Designed after the Internet’s two-tier routing hierarchy Separate packet forwarding from admission and resource allocation.

DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.

The Extended Connection-Dependent Threshold Model for Elastic and Adaptive Traffic V. Vassilakis, I. Moscholios and M. Logothetis Wire Communications Laboratory,

EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.

Research Unit in Networking - University of Liège A Distributed Algorithm for Weighted Max-Min Fairness in MPLS Networks Fabian Skivée

Effects of Call Arrival Rate and Mobility on Network Throughput in Multi-Cell CDMA Manju Hegde, Robert Akl, Paul Min Washington University St. Louis,

NC STATE UNIVERSITY / MCNC Protecting Network Quality of Service Against Denial of Service Attacks Douglas S. Reeves  S. Felix Wu  Fengmin Gong Talk:

2006 QoS Routing and Forwarding Benefits of QoS Routing  Without QoS routing: –must probe path & backtrack; non optimal path, control traffic and processing.

An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.

1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.

Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.

Instructor Materials Chapter 6: Quality of Service

Network and Services Management

© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.

MENTER: Dynamic Traffic Engineering for MPLS Networks

SRPT Applied to Bandwidth Sharing Networks

Presentation transcript:

UCB DiffServ An Overview Jean Walrand EECS

UCB Outline DiffServ Goal Solution Worst Case Admission Control Measurement-Based Admission Control Bandwidth Allocation A Note on CoS Notes on Smart Networks Project

UCB DiffServ Goal: CoS without per-connection state No route-pinning (OSPF-BGP routing) Planning and operations based on aggregate statistics and worst-case routing Peer-to-peer SLAs that specify total rate but not traffic destination Solution:

UCB DiffServ (continued) Cloud 2 Cloud 1 Policing Shaping SLA

UCB DiffServ (continued) Ingress 1 Ingress 3 Ingress 1 Ingress 2 Ingress 3 Typical Case Worst Case Ingress 2 Bottleneck Link DiffServ SLA: Worst Case Admission Control Terribly wasteful!

UCB DiffServ (continued) Example: R 10 R R Worst Case: R  10 Symmetric Case: R  20 Worst Case, 1F: R  5 Symm. Case, 1F: R  10

UCB DiffServ (continued) New Admit if peak(new) < Gap at all times Capacity Mean + 2.4s Gap DiffServ SLA: Measurement-Based Admission Control

UCB Bandwidth Allocation Problems: How to share bandwidth How to renegotiate SLAs Issues: Scalability Efficiency Fairness, Optimality,...

UCB Bandwidth Allocation (cd) Sharing one link: N X Y Number of “calls” [Voice over IP]

UCB Bandwidth Allocation (cd) N X Y Dynamic X Y N N Feasible region

UCB Bandwidth Allocation (cd) N X Y Static N1N1 N2N2 Admission policies SLAs (Committed Access Rates) X Y N N N1N1 N2N2 Feasible region

UCB Bandwidth Allocation (cd) X Y N N Dynamic N1N1 N2N2 Static

UCB Bandwidth Allocation (cd) Closer Look: Assume Poisson demands, i.i.d. holding times... X Y N N For “large links”, the variance is small. => Static  Dynamic However, rates change => must adapt

UCB Bandwidth Allocation (cd) Proposed Adaptation Scheme: Renegotiate “blocks” of permits based on thresholds

UCB Bandwidth Allocation (cd) Economic Model: Cost(rate) Computation Marginal Costs

UCB Bandwidth Allocation (cd) Economic Model (cd) : Recursive calculation of preferred path and its marginal cost.

UCB Note on CoS Model: TCP/DRR p 1 - p C x y x y C pC RTTx >> RTTy Without DRR With DRR

UCB Tools for Smart Networks Project Joint UCB - Cisco Project DARPA Funding + Cisco Combines Measurements Analysis & Simulation Real-time Control Objective: Product

UCB What are Smart Networks? Measure Analyze Modify