Overload Design Team Status Jonathan Rosenberg Cisco.

Slides:



Advertisements
Similar presentations
Fall VoN 2000 SIP for IP Communications Jonathan Rosenberg Chief Scientist.
Advertisements

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Quality of Service CS 457 Presentation Xue Gu Nov 15, 2001.
Travel Time Estimation on Arterial Streets By Heng Wang, Transportation Analyst Houston-Galveston Area Council Dr. Antoine G Hobeika, Professor Virginia.
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
Playback-buffer Equalization for Streaming Media using Stateless Transport Prioritization Dan Tan, HPL, Palo Alto Weidong Cui, UC Berkeley John Apostolopoulos,
Doc.: IEEE /0604r1 Submission May 2014 Slide 1 Modeling and Evaluating Variable Bit rate Video Steaming for ax Date: Authors:
CS 4700 / CS 5700 Network Fundamentals Lecture 12: Router-Aided Congestion Control (Drop it like it’s hot) Revised 3/18/13.
What’s the Problem Web Server 1 Web Server N Web system played an essential role in Proving and Retrieve information. Cause Overloaded Status and Longer.
1 Core Stateless Fair Queueing Ion Stoica Hui Zhang Scott Shenker CMU CMU Xerox PARC CMU CMU Xerox PARC.
Dynamic Internet Congestion with Bursts Stefan Schmid Roger Wattenhofer Distributed Computing Group, ETH Zurich 13th International Conference On High Performance.
Adaptive Sampling for Sensor Networks Ankur Jain ٭ and Edward Y. Chang University of California, Santa Barbara DMSN 2004.
Fairness in Dead Reckoning Based Distributed Multi-Player Games Sudhir Aggarwal, Hemant Banavar, Sarit Mukherjee, and Sampath Rangarajan presented by Christopher.
Proportional Bandwidth Allocation in DiffServ Networks Usman Raza Chohan
© nCode 2000 Title of Presentation goes here - go to Master Slide to edit - Slide 1 Reliable Communication for Highly Mobile Agents ECE 7995: Term Paper.
ACN: IntServ and DiffServ1 Integrated Service (IntServ) versus Differentiated Service (Diffserv) Information taken from Kurose and Ross textbook “ Computer.
Analysis and Simulation of a Fair Queuing Algorithm
1 Efficient Retrieval of User Contents in MANETs Marco Fiore, Claudio Casetti, Carla-Fabiana Chiasserini Dipartimento di Elettronica, Politecnico di Torino,
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Cs238 CPU Scheduling Dr. Alan R. Davis. CPU Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU.
Design, Implementation, and Evaluation of Differentiated Caching Services Ying Lu, Tarek F. Abdelzaher, Avneesh Saxena IEEE TRASACTION ON PARALLEL AND.
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Dynamic routing – QoS routing Load sensitive routing QoS routing.
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
On Scaling Time Dependent Shortest Path Computations for Dynamic Traffic Assignment Amit Gupta, Weijia Xu Texas Advanced Computing Center Kenneth Perrine,
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
2001/09/12Chin-Kai Wu, CS, NTHU1 Dynamic Resource Management Considering the Real Behavior of Aggregate Traffic José R. Gallardo, Dimitrios Makrakis, and.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.
Adaptive Traffic Light Control For Traffic Network.
Overload in SIP Jonathan Rosenberg Cisco Systems.
* Power distribution becomes an important issue when power demand exceeds power supply. * As electric vehicles get more popular, for a period of time,
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
TURN draft-ietf-behave-turn-07 Philip Matthews, Avaya Jonathan Rosenberg, Cisco Rohan Mahy, Plantronics.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
SIP working group status Keith Drage, Dean Willis.
Volker Hilt Bell Labs/Alcatel-Lucent SIP Overload Control IETF Design Team Status.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
This document is for informational purposes only, and Tekelec reserves the right to change any aspect of the products, features or functionality described.
CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.
Multimedia Support for Wireless W-CDMA with Dynamic Spreading By Ju Wang Mehmet Ali Elicin And Jonathan C.L. Liu Lecture by Seth Caplan.
Advance Computer Networking L-5 TCP & Routers Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan.
GridIS: an Incentive-based Grid Scheduling Lijuan Xiao, Yanmin Zhu, Lionel M. Ni, Zhiwei Xu 19th International Parallel and Distributed Processing Symposium.
Software Performance Testing Based on Workload Characterization Elaine Weyuker Alberto Avritzer Joe Kondek Danielle Liu AT&T Labs.
Budget-based Control for Interactive Services with Partial Execution 1 Yuxiong He, Zihao Ye, Qiang Fu, Sameh Elnikety Microsoft Research.
Department of Information Engineering University of Padova, ITALY A Soft QoS scheduling algorithm for Bluetooth piconets {andrea.zanella, daniele.miorandi,
1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO
Florida State UniversityZhenhai Duan1 BCSQ: Bin-based Core Stateless Queueing for Scalable Support of Guaranteed Services Zhenhai Duan Karthik Parsha Department.
Vishal Jain, AntNet Agent Based Strategy for CMDR “Agent Based Multiple Destination Routing ”
All Rights Reserved © Alcatel-Lucent 2006, ##### Volker Hilt Bell-Labs/Alcatel-Lucent SIP Overload Control Report from the IETF Design.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
SIP Overload Design Team Status Jonathan Rosenberg Cisco.
Interactive Connectivity Establishment : ICE
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
SIP Overload Control draft-hilt-sipping-overload-00 Volker Hilt Daryl Malas Indra Widjaja
Univ. of TehranIntroduction to Computer Network1 An Introduction Computer Networks An Introduction to Computer Networks University of Tehran Dept. of EE.
Volker Hilt Bell Labs/Alcatel-Lucent SIP Overload Control IETF Design Team Status.
Communication thread core thread Spawn N negotiation threads... negotiation threads active inactive Initialize An Agent and Its Threads execution thread.
Lecture 4 Page 1 CS 111 Summer 2013 Scheduling CS 111 Operating Systems Peter Reiher.
Scheduling Mechanisms Applied to Packets in a Network Flow CSC /15/03 By Chris Hare, Ricky Johnson, and Fulviu Borcan.
Web Servers load balancing with adjusted health-check time slot.
Session-Independent Policies draft-ietf-sipping-session-indep-policy-02 Volker Hilt Jonathan Rosenberg Gonzalo.
Corelite Architecture: Achieving Rated Weight Fairness
Jonathan Rosenberg Volker Hilt Daryl Malas
Chapter 6 Queuing Disciplines
Lecture 18: Coherence and Synchronization
Modeling and Evaluating Variable Bit rate Video Steaming for ax
Presentation transcript:

Overload Design Team Status Jonathan Rosenberg Cisco

Team Overview Design team formed January 2007 Working on simulations of overload mechanisms Composed of experts in this area Many non-IETF participants Bi-Weekly Calls

Current Status Agreed on simulation model Several indpendendent simulators developed Simulations performed to determine baseline behavior –Drop requests on overload, no 503 [sim1] –Send 503 on overload, no retry [sim2] –Retry on 503 [sim3]

Baseline Results (Volker)

Baseline Results (Shen)

Stateful vs. Stateless 503 Found that stateless 503 server transactions seriously worsen performance Team agreed to use stateless 503 model despite this because faster 503 processing is critical overall

Nortel Algorithm Use 503/Retry-After and turn off traffic to server during interval Retry-After value determined algorithmically from queue sizes Equals amount of time for queue to drain to low watermark

Results

AT&T Algorithm During each Measurement Interval, Core Proxy estimates: –Mean processing rate  t , –Queue length at end of measurement interval q t, Core Proxy calculates the retry after period as the time needed for Core Proxy to process the queued messages that exceed the target queueing delay: Retry-after-delay = q t /  t - a x d e Retry-after-delay updated each Control Interval and distributed to Edge Proxies in 503 responses,

Results

Columbia Algorithm Sending elements send their current load forward Receiving elements send back desired load Receiving elements can compute fair share bandwidth allocations and fine grained load adjustment No simulation results yet

Bell Labs Algorithm Overload Control Feedback Loop in SIP –SIP extension that realizes an overload control feedback loop to upstream neighbors. –Transport vehicle for feedback generated by an overload control algorithm. Orthogonal to the specific control algorithm used. –draft-hilt-sipping-overload-03.txt Overload Control Algorithm –Algorithm that determines fine grained load feedback to adjust incoming load. No simulation results yet.

Next Steps Waiting for folks to finish implementing their algorithms Once done, can do the real work of comparing results and doing additional simulations Targeting proposal for Philadelphia