Analysis of the Increase and Decrease. Congestion Avoidance in Computer Networks
|
|
- Maud Powell
- 6 years ago
- Views:
Transcription
1 Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks Dah-Ming Chiu, Raj Jain Presented by: Ashish Vulimiri
2 Congestion Control
3 Congestion Avoidance
4 Congestion Avoidance Congestion control vs congestion avoidance
5 System Model Single shared bottleneck resource Synchronous feedback Control applied by all users Feedback type: binary
6 System Model Feedback mechanism: set signal bit on packets, processed by destination Rejected alternatives: extra signal packets, induce routing changes, signal bit processed by source TCP Tahoe (and derivatives): signal = packet loss
7 Feedback Binary feedback { 0 Increase load y(t) = 1 Decrease load x i (t + 1) = x i (t) + u i (t) u i can be an arbitrary function of x i (t) and y(t) We focus on a linear model { a I + b I x i (t) x i (t + 1) = a D + b D x i (t) if y(t) Increase if y(t) Decrease
8 Criteria
9 Criteria 1 Efficiency: load must be as close to knee point as possible
10 Criteria 1 Efficiency: load must be as close to knee point as possible 2 Fairness In a perfectly fair system, i jx i = x j We use a fairness criterion: F = ( x i ) 2 n ( ) xi 2 F lies between 0 and 1, higher values indicating greater fairness
11 Criteria 1 Efficiency: load must be as close to knee point as possible 2 Fairness In a perfectly fair system, i jx i = x j We use a fairness criterion: F = ( x i ) 2 n ( ) xi 2 F lies between 0 and 1, higher values indicating greater fairness 3 Distributedness Users do not know anything about state of system Resource delivers only binary feedback to limit overhead
12 Criteria 4 Convergence Constant-state convergence unlikely since we use only binary feedback We use two parameters: responsiveness (how quickly the steady state is reached), and smoothness (size of oscillations)
13 Constraints
14 Constraints: Fairness Fairness must improve in at least one of increase and decrease, and not degrade in either This implies: both a I b I and a D b D must be non-negative, and at least one must be positive
15 Constraints: Fairness Fairness must improve in at least one of increase and decrease, and not degrade in either This implies: both a I b I and a D b D must be non-negative, and at least one must be positive
16 Constraints: Efficiency Feedback must be negative
17 Constraints: Efficiency Feedback must be negative
18 Efficiency: Example Consider a 2-user system with x 1 (t) = x 2 (t) = 100
19 Efficiency: Example Consider a 2-user system with x 1 (t) = x 2 (t) = 100 Let y(t) = decrease, a D = 10, b D = 1/2
20 Efficiency: Example Consider a 2-user system with x 1 (t) = x 2 (t) = 100 Let y(t) = decrease, a D = 10, b D = 1/2 Then x 1 (t + 1) = x 2 (t + 1) = 60
21 Efficiency: Example Consider a 2-user system with x 1 (t) = x 2 (t) = 100 Let y(t) = decrease, a D = 10, b D = 1/2 Then x 1 (t + 1) = x 2 (t + 1) = 60 -ve feedback
22 Efficiency: Example Consider a 2-user system with x 1 (t) = x 2 (t) = 100 Let y(t) = decrease, a D = 10, b D = 1/2 Then x 1 (t + 1) = x 2 (t + 1) = 60 -ve feedback Suppose instead x 1 (t) = x 2 (t) = 10
23 Efficiency: Example Consider a 2-user system with x 1 (t) = x 2 (t) = 100 Let y(t) = decrease, a D = 10, b D = 1/2 Then x 1 (t + 1) = x 2 (t + 1) = 60 -ve feedback Suppose instead x 1 (t) = x 2 (t) = 10 Then x 1 (t + 1) = x 2 (t + 1) = 15
24 Efficiency: Example Consider a 2-user system with x 1 (t) = x 2 (t) = 100 Let y(t) = decrease, a D = 10, b D = 1/2 Then x 1 (t + 1) = x 2 (t + 1) = 60 -ve feedback Suppose instead x 1 (t) = x 2 (t) = 10 Then x 1 (t + 1) = x 2 (t + 1) = 15 +ve feedback
25 Constraints: Efficiency + Distributedness Feedback must be negative no matter what the load distribution at the other users This implies a I > 0 b I 1 a D = 0 0 b d < 1 Constraints can be loosened if bounds on X goal and number of users are known
26 Constraints: Efficiency + Distributedness Feedback must be negative no matter what the load distribution at the other users This implies a I > 0 b I 1 a D = 0 0 b d < 1 Constraints can be loosened if bounds on X goal and number of users are known
27 Constraints: Efficiency + Distributedness Feedback must be negative no matter what the load distribution at the other users This implies a I > 0 b I 1 a D = 0 0 b d < 1 Constraints can be loosened if bounds on X goal and number of users are known
28 Combined Constraints Decrease Linear decrease must be purely multiplicative
29 Combined Constraints Increase Increase must have an additive component, and optionally a multiplicative component Multiplicative component 0 for optimal fairness convergence
30 Nonlinear Control Suppose x i (t + 1) = x i (t) + k= α k (x i (t)) k Can derive constraints on α k and k by evaluating the criteria as done for linear feedback Advantage: more flexibility Disadvantage: less robust higher sensitivity to system parameters like X goal and n
31 Unresolved Issues Effect of delayed feedback Utility of non-binary feedback X goal can t be known, but should users attempt to guess n? Asynchronous feedback
32 Other Issues Effect of packet loss due to errors Fault-resillience Can (and should) a scheme tailored to Internet traffic patterns be designed?
33 Other Issues Effect of packet loss due to errors Fault-resillience Can (and should) a scheme tailored to Internet traffic patterns be designed? And...?
Congestion Control 1: The Chiu-Jain Model
Mathematical Modelling for Computer Networks- Part I Spring 2013 (Period 4) Congestion Control 1: The Chiu-Jain Model Lecturers: Laila Daniel and Krishnan Narayanan Date:11th March 2013 Abstract This lesson
More informationCongestion Control In The Internet Part 1: Theory. JY Le Boudec 2018
Congestion Control In The Internet Part 1: Theory JY Le Boudec 2018 1 Contents 1. What is the problem; congestion collapse 2. Efficiency versus Fairness 3. Definitions of fairness 4. Additive Increase
More informationPIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control
PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control Saurabh Jain Joint work with Dr. Dmitri Loguinov June 21, 2007 1 Agenda Introduction Analysis of RCP QI-RCP PIQI-RCP Comparison Wrap
More informationMin Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min
JetMax: Scalable Max-Min Min Congestion Control for High- Speed Heterogeneous Networks Yueping Zhang Joint work with Derek Leonard and Dmitri Loguinov Internet Research Lab Department of Computer Science
More informationExtended Analysis of Binary Adjustment Algorithms
1 Extended Analysis of Binary Adjustment Algorithms Sergey Gorinsky Harrick Vin Technical Report TR22-39 Department of Computer Sciences The University of Texas at Austin Taylor Hall 2.124, Austin, TX
More informationA Different Kind of Flow Analysis. David M Nicol University of Illinois at Urbana-Champaign
A Different Kind of Flow Analysis David M Nicol University of Illinois at Urbana-Champaign 2 What Am I Doing Here??? Invite for ICASE Reunion Did research on Peformance Analysis Supporting Supercomputing
More informationUtility, Fairness and Rate Allocation
Utility, Fairness and Rate Allocation Laila Daniel and Krishnan Narayanan 11th March 2013 Outline of the talk A rate allocation example Fairness criteria and their formulation as utilities Convex optimization
More informationRouting. Topics: 6.976/ESD.937 1
Routing Topics: Definition Architecture for routing data plane algorithm Current routing algorithm control plane algorithm Optimal routing algorithm known algorithms and implementation issues new solution
More informationWindow Size. Window Size. Window Size. Time. Time. Time
A Spectrum of TCP-friendly Window-based Congestion Control Algorithms Λ Shudong Jin Liang Guo Ibrahim Matta Azer Bestavros Computer Science Department Boston University Boston, MA 5 fjins, guol, matta,
More informationElectrical Engineering Written PhD Qualifier Exam Spring 2014
Electrical Engineering Written PhD Qualifier Exam Spring 2014 Friday, February 7 th 2014 Please do not write your name on this page or any other page you submit with your work. Instead use the student
More informationDIMENSIONING BANDWIDTH FOR ELASTIC TRAFFIC IN HIGH-SPEED DATA NETWORKS
Submitted to IEEE/ACM Transactions on etworking DIMESIOIG BADWIDTH FOR ELASTIC TRAFFIC I HIGH-SPEED DATA ETWORKS Arthur W. Berger * and Yaakov Kogan Abstract Simple and robust engineering rules for dimensioning
More informationAutomatic Control Systems. -Lecture Note 15-
-Lecture Note 15- Modeling of Physical Systems 5 1/52 AC Motors AC Motors Classification i) Induction Motor (Asynchronous Motor) ii) Synchronous Motor 2/52 Advantages of AC Motors i) Cost-effective ii)
More informationCongestion Control. Need to understand: What is congestion? How do we prevent or manage it?
Congestion Control Phenomenon: when too much traffic enters into system, performance degrades excessive traffic can cause congestion Problem: regulate traffic influx such that congestion does not occur
More informationInternet Congestion Control: Equilibrium and Dynamics
Internet Congestion Control: Equilibrium and Dynamics A. Kevin Tang Cornell University ISS Seminar, Princeton University, February 21, 2008 Networks and Corresponding Theories Power networks (Maxwell Theory)
More informationDIMENSIONING BANDWIDTH FOR ELASTIC TRAFFIC IN HIGH-SPEED DATA NETWORKS
Submitted to IEEE/ACM Transactions on etworking DIMESIOIG BADWIDTH FOR ELASTIC TRAFFIC I HIGH-SPEED DATA ETWORKS Arthur W. Berger and Yaakov Kogan AT&T Labs 0 Crawfords Corner Rd. Holmdel J, 07733 U.S.A.
More informationcs/ee/ids 143 Communication Networks
cs/ee/ids 143 Communication Networks Chapter 4 Transport Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Agenda Internetworking n Routing across LANs, layer2-layer3 n DHCP n NAT Transport layer
More informationCDS 270-2: Lecture 6-1 Towards a Packet-based Control Theory
Goals: CDS 270-2: Lecture 6-1 Towards a Packet-based Control Theory Ling Shi May 1 2006 - Describe main issues with a packet-based control system - Introduce common models for a packet-based control system
More informationMS&E 246: Lecture 17 Network routing. Ramesh Johari
MS&E 246: Lecture 17 Network routing Ramesh Johari Network routing Basic definitions Wardrop equilibrium Braess paradox Implications Network routing N users travel across a network Transportation Internet
More informationTHE Internet is increasingly being used in the conduct of
94 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 14, NO. 1, FEBRUARY 2006 Global Stability Conditions for Rate Control With Arbitrary Communication Delays Priya Ranjan, Member, IEEE, Richard J. La, Member,
More informationWireless Internet Exercises
Wireless Internet Exercises Prof. Alessandro Redondi 2018-05-28 1 WLAN 1.1 Exercise 1 A Wi-Fi network has the following features: Physical layer transmission rate: 54 Mbps MAC layer header: 28 bytes MAC
More informationCongestion Control. Phenomenon: when too much traffic enters into system, performance degrades excessive traffic can cause congestion
Congestion Control Phenomenon: when too much traffic enters into system, performance degrades excessive traffic can cause congestion Problem: regulate traffic influx such that congestion does not occur
More informationUMBC. At the system level, DFT includes boundary scan and analog test bus. The DFT techniques discussed focus on improving testability of SAFs.
Overview Design for testability(dft) makes it possible to: Assure the detection of all faults in a circuit. Reduce the cost and time associated with test development. Reduce the execution time of performing
More informationFairness comparison of FAST TCP and TCP Vegas
Fairness comparison of FAST TCP and TCP Vegas Lachlan L. H. Andrew, Liansheng Tan, Tony Cui, and Moshe Zukerman ARC Special Research Centre for Ultra-Broadband Information Networks (CUBIN), an affiliated
More informationCS276 Homework 1: ns-2
CS276 Homework 1: ns-2 Erik Peterson October 28, 2006 1 Part 1 - Fairness between TCP variants 1.1 Method After learning ns-2, I wrote a script (Listing 3) that runs a simulation of one or two tcp flows
More informationTCP is Competitive Against a Limited AdversaryThis research was supported in part by grants from NSERC and CITO.
TCP is Competitive Against a Limited AdversaryThis research was supported in part by grants from NSERC and CITO. Jeff Edmonds Computer Science Department York University, Toronto, Canada jeff@cs.yorku.ca
More information384Y Project June 5, Stability of Congestion Control Algorithms Using Control Theory with an application to XCP
384Y Project June 5, 00 Stability of Congestion Control Algorithms Using Control Theory with an application to XCP . Introduction During recent years, a lot of work has been done towards the theoretical
More informationChapter 5 A Modified Scheduling Algorithm for The FIP Fieldbus System
Chapter 5 A Modified Scheduling Algorithm for The FIP Fieldbus System As we stated before FIP is one of the fieldbus systems, these systems usually consist of many control loops that communicate and interact
More informationSingular perturbation analysis of an additive increase multiplicative decrease control algorithm under time-varying buffering delays.
Singular perturbation analysis of an additive increase multiplicative decrease control algorithm under time-varying buffering delays. V. Guffens 1 and G. Bastin 2 Intelligent Systems and Networks Research
More informationCOE 202: Digital Logic Design Sequential Circuits Part 4. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
COE 202: Digital Logic Design Sequential Circuits Part 4 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Objectives Registers Counters Registers 0 1 n-1 A register is a group
More informationMicroeconomic Algorithms for Flow Control in Virtual Circuit Networks (Subset in Infocom 1989)
Microeconomic Algorithms for Flow Control in Virtual Circuit Networks (Subset in Infocom 1989) September 13th, 1995 Donald Ferguson*,** Christos Nikolaou* Yechiam Yemini** *IBM T.J. Watson Research Center
More informationObserved structure of addresses in IP traffic
Observed structure of addresses in IP traffic Eddie Kohler, Jinyang Li, Vern Paxson, Scott Shenker ICSI Center for Internet Research Thanks to David Donoho and Dick Karp Problem How can we model the set
More informationAnalysis of Rate-distortion Functions and Congestion Control in Scalable Internet Video Streaming
Analysis of Rate-distortion Functions and Congestion Control in Scalable Internet Video Streaming Min Dai Electrical Engineering, Texas A&M University Dmitri Loguinov Computer Science, Texas A&M University
More informationSCHOOL OF ELECTRICAL, MECHANICAL AND MECHATRONIC SYSTEMS. Transient Stability LECTURE NOTES SPRING SEMESTER, 2008
SCHOOL OF ELECTRICAL, MECHANICAL AND MECHATRONIC SYSTEMS LECTURE NOTES Transient Stability SPRING SEMESTER, 008 October 7, 008 Transient Stability Transient stability refers to the ability of a synchronous
More informationCHBE320 LECTURE XI CONTROLLER DESIGN AND PID CONTOLLER TUNING. Professor Dae Ryook Yang
CHBE320 LECTURE XI CONTROLLER DESIGN AND PID CONTOLLER TUNING Professor Dae Ryook Yang Spring 2018 Dept. of Chemical and Biological Engineering 11-1 Road Map of the Lecture XI Controller Design and PID
More informationESTIMATION OF THE BURST LENGTH IN OBS NETWORKS
ESTIMATION OF THE BURST LENGTH IN OBS NETWORKS Pallavi S. Department of CSE, Sathyabama University Chennai, Tamilnadu, India pallavi.das12@gmail.com M. Lakshmi Department of CSE, Sathyabama University
More informationAnalysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
More informationModeling Air Traffic Throughput and Delay with Network Cell Transmission Model
The,_,.. c._ ' The 'nstitute for, Research Modeling Air Traffic Throughput and Delay with Network Cell Transmission Model Alex Nguyen and John Baras University of Maryland College Park ICN 2010 Herndon,
More informationcs/ee/ids 143 Communication Networks
cs/ee/ids 143 Communication Networks Chapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also
More informationCS 700: Quantitative Methods & Experimental Design in Computer Science
CS 700: Quantitative Methods & Experimental Design in Computer Science Sanjeev Setia Dept of Computer Science George Mason University Logistics Grade: 35% project, 25% Homework assignments 20% midterm,
More informationDynamic queue control functions for ATM ABR switch schemes: design and analysis 1
Ž. Computer Networks 31 1999 1935 1949 www.elsevier.comrlocatercomnet Dynamic queue control functions for ATM ABR switch schemes: design and analysis 1 Bobby Vandalore ), Raj Jain 2, Rohit Goyal 3, Sonia
More informationStochastic Hybrid Systems: Applications to Communication Networks
research supported by NSF Stochastic Hybrid Systems: Applications to Communication Networks João P. Hespanha Center for Control Engineering and Computation University of California at Santa Barbara Talk
More informationPerformance Analysis of Priority Queueing Schemes in Internet Routers
Conference on Information Sciences and Systems, The Johns Hopkins University, March 8, Performance Analysis of Priority Queueing Schemes in Internet Routers Ashvin Lakshmikantha Coordinated Science Lab
More informationA Generalized FAST TCP Scheme
A Generalized FAST TCP Scheme Cao Yuan a, Liansheng Tan a,b, Lachlan L. H. Andrew c, Wei Zhang a, Moshe Zukerman d,, a Department of Computer Science, Central China Normal University, Wuhan 430079, P.R.
More informationAsymptotic Stability of Congestion Control Systems with Multiple Sources
Asymptotic Stability of ongestion ontrol Systems with ultiple Sources ihail L Sichitiu Dept of Electrical and omputer Eng N State University Raleigh, N 7695 mlsichit@ncsuedu Peter H Bauer Dept of Electrical
More informationPerformance Effects of Two-way FAST TCP
Performance Effects of Two-way FAST TCP Fei Ge a, Sammy Chan b, Lachlan L. H. Andrew c, Fan Li b, Liansheng Tan a, Moshe Zukerman b a Dept. of Computer Science, Huazhong Normal University, Wuhan, P.R.China
More informationResource Allocation and Pricing. R. Srikant University of Illinois
Resource Allocation and Pricing R. Srikant University of Illinois References The Mathematics of Internet Congestion Control, Birkhauser, 2004. Pricing: Kelly Distributed Resource Allocation: Kelly, Mauloo
More informationA Retrial Queueing model with FDL at OBS core node
A Retrial Queueing model with FDL at OBS core node Chuong Dang Thanh a, Duc Pham Trung a, Thang Doan Van b a Faculty of Information Technology, College of Sciences, Hue University, Hue, Viet Nam. E-mail:
More informationDigital Circuits ECS 371
Digital Circuits ECS 371 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 18 Office Hours: BKD 3601-7 Monday 9:00-10:30, 1:30-3:30 Tuesday 10:30-11:30 1 Announcement Reading Assignment: Chapter 7: 7-1,
More informationDynamic resource sharing
J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus
More informationEECS150 - Digital Design Lecture 18 - Counters
EECS150 - Digital Design Lecture 18 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS150 - Lec18-counters Page 1 Counters Special sequential circuits (FSMs) that sequence though a set outputs.
More informationEECS150 - Digital Design Lecture 18 - Counters
EECS50 - Digital Design Lecture 8 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS50 - Lec8-counters Page Counters Special sequential circuits (FSMs) that sequence though a set outputs. Examples:
More informationTHE problem of network flow control is to control
1 MaxNet: Faster Flow Control Convergence Bartek P. Wydrowski, Member, IEEE, Lachlan L. H. Andrew, Member, IEEE, Iven M. Y. Mareels, Fellow, IEEE. Abstract MaxNet is a distributed congestion control architecture
More informationSimplification of Network Dynamics in Large Systems
Simplification of Network Dynamics in Large Systems Xiaojun Lin and Ness B. Shroff Abstract In this paper we show that significant simplicity can be exploited for pricing-based control of large networks.
More informationBroadband Internet Access Disclosure
Broadband Internet Access Disclosure This document provides information about the network practices, performance characteristics, and commercial terms applicable broadband Internet access services provided
More informationImpact of Cross Traffic Burstiness on the Packet-scale Paradigm An Extended Analysis
Impact of ross Traffic Burstiness on the Packet-scale Paradigm An Extended Analysis Rebecca Lovewell and Jasleen Kaur Technical Report # TR11-007 Department of omputer Science University of North arolina
More informationTCP-friendly SIMD Congestion Control and Its Convergence Behavior
Boston University OpenBU Computer Science http://open.bu.edu CAS: Computer Science: Technical Reports 1-5-8 TCP-friendly SIMD Congestion Control and Its Convergence Behavior Jin, Shudong Boston University
More informationPower System Stability and Control. Dr. B. Kalyan Kumar, Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India
Power System Stability and Control Dr. B. Kalyan Kumar, Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India Contents Chapter 1 Introduction to Power System Stability
More informationProcessor Sharing Flows in the Internet
STANFORD HPNG TECHNICAL REPORT TR4-HPNG4 Processor Sharing Flows in the Internet Nandita Dukkipati, Nick McKeown Computer Systems Laboratory Stanford University Stanford, CA 9434-93, USA nanditad, nickm
More informationOperational Laws 33-1
Operational Laws Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings are available
More informationPart 2: Random Routing and Load Balancing
1 Part 2: Random Routing and Load Balancing Sid C-K Chau Chi-Kin.Chau@cl.cam.ac.uk http://www.cl.cam.ac.uk/~ckc25/teaching Problem: Traffic Routing 2 Suppose you are in charge of transportation. What do
More informationA New TCP End-to-End Congestion Avoidance Algorithm Through Output Feedback
2004 5th Asian Control Conference A New TCP End-to-End Congestion Avoidance Algorithm Through Output Feedback Yi Guo*, Zhihua &U* and Nageswara bot * Department of Electrical and Computer Engineering University
More informationPacket Loss Analysis of Load-Balancing Switch with ON/OFF Input Processes
Packet Loss Analysis of Load-Balancing Switch with ON/OFF Input Processes Yury Audzevich, Levente Bodrog 2, Yoram Ofek, and Miklós Telek 2 Department of Information Engineering and Computer Science, University
More informationA novel algorithm for dynamic admission control of elastic flows
A novel algorithm for dynamic admission control of elastic flows Franco Blanchini, Daniele Casagrande and Pier Luca Montessoro Abstract The task of assigning part of the forwarding capability of a router
More informationA Signal Processing Approach to the Analysis of Chemical Networking Protocols
Laurea Specialistica 19 July 2010 A Signal Processing Approach to the Analysis of Chemical Networking Protocols Author Supervisors Prof. Marco Luise Prof. Filippo Giannetti (University of Pisa) (University
More informationAnalytic Performance Evaluation of the RED Algorithm
Prof. Dr. P. Tran-Gia Analytic Performance Evaluation of the RED Algorithm Stefan Köhler, Michael Menth, Norbert Vicari TCP Model RED Model TCP over RED Results TCP > Reliable transmission > Closed loop
More informationCongestion Control. Topics
Congestion Control Topics Congestion control what & why? Current congestion control algorithms TCP and UDP Ideal congestion control Resource allocation Distributed algorithms Relation current algorithms
More informationPGT104 Digital Electronics. PGT104 Digital Electronics
1 Part 6 Sequential Logic ircuits Disclaimer: Most of the contents (if not all) are extracted from resources available for Digital Fundamentals 10 th Edition 2 Basic Shift Register Operations A shift register
More informationA STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL
A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL by Rodney B. Wallace IBM and The George Washington University rodney.wallace@us.ibm.com Ward Whitt Columbia University
More informationPublication List PAPERS IN REFEREED JOURNALS. Submitted for publication
Publication List YU (MARCO) NIE SEPTEMBER 2010 Department of Civil and Environmental Engineering Phone: (847) 467-0502 2145 Sheridan Road, A328 Technological Institute Fax: (847) 491-4011 Northwestern
More informationTransient Behaviors of TCP-friendly Congestion Control Protocols
Abbreviated version in Proceedings of IEEE INFOCOM 21, April 21. Transient Behaviors of -friendly Congestion Control Protocols Y. Richard Yang, Min Sik Kim, Simon S. Lam Department of Computer Sciences
More informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 18 Error Coding. In the real world. Our beautiful digital world.
Outline EECS 150 - Components and esign Techniques for igital Systems Lec 18 Error Coding Errors and error models Parity and Hamming Codes (SECE) Errors in Communications LFSRs Cyclic Redundancy Check
More informationNetwork Optimization and Control
Foundations and Trends R in Networking Vol. 2, No. 3 (2007) 271 379 c 2008 S. Shakkottai and R. Srikant DOI: 10.1561/1300000007 Network Optimization and Control Srinivas Shakkottai 1 and R. Srikant 2 1
More informationFibonacci Ring Oscillators as True Random Number Generators - A Security Risk. Markus Dichtl. Siemens Corporate Technology
Fibonacci Ring Oscillators as True Random Number Generators - A Security Risk Markus Dichtl Siemens Corporate Technology Abstract. Fibonacci ring oscillators are shown to have a risk to oscillate periodically
More informationThese are special traffic patterns that create more stress on a switch
Myths about Microbursts What are Microbursts? Microbursts are traffic patterns where traffic arrives in small bursts. While almost all network traffic is bursty to some extent, storage traffic usually
More informationCompound TCP with Random Losses
Compound TCP with Random Losses Alberto Blanc 1, Konstantin Avrachenkov 2, Denis Collange 1, and Giovanni Neglia 2 1 Orange Labs, 905 rue Albert Einstein, 06921 Sophia Antipolis, France {alberto.blanc,denis.collange}@orange-ftgroup.com
More informationWIDE AREA CONTROL THROUGH AGGREGATION OF POWER SYSTEMS
WIDE AREA CONTROL THROUGH AGGREGATION OF POWER SYSTEMS Arash Vahidnia B.Sc, M.Sc in Electrical Engineering A Thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy
More informationSynchronous Sequential Circuit Design. Digital Computer Design
Synchronous Sequential Circuit Design Digital Computer Design Races and Instability Combinational logic has no cyclic paths and no races If inputs are applied to combinational logic, the outputs will always
More informationvariability in size, see e.g., [10]. 2 BTD is similar to slow-down used for scheduling problems, e.g., [11], [12].
Size-based Adaptive Bandwidth Allocation: Optimizing the Average QoS for Elastic Flows Shanchieh Yang (scyang@ece.utexas.edu), Gustavo de Veciana (gustavo@ece.utexas.edu) Department of Electrical and Computer
More informationEECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates
EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150 - Lec24-blocks Page 1 Cross-coupled NOR gates remember, If both R=0 & S=0, then
More informationRobustness of Real and Virtual Queue based Active Queue Management Schemes
Robustness of Real and Virtual Queue based Active Queue Management Schemes Ashvin Lakshmikantha, C. L. Beck and R. Srikant Department of General Engineering University of Illinois lkshmknt@uiuc.edu, rsrikant@uiuc.edu,
More informationImpact of Queueing Delay Estimation Error on Equilibrium and Its Stability
Impact of Queueing Delay Estimation Error on Equilibrium and Its Stability Corentin Briat, Emre A. Yavuz, and Gunnar Karlsson ACCESS Linnaeus Center, KTH, SE-100 44 Stockholm, Sweden {cbriat,emreya,gk}@kth.se
More informationLBMP: A Logarithm-Barrier-based Multipath Protocol for Internet Traffic Management
LBMP: A Logarithm-Barrier-based Multipath Protocol for Internet Traffic Management Ke Xu Department of Computer Science, Tsinghua University, Beijing, China Email: xuke@tsinghua.edu.cn Hongying Liu Department
More informationBurst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks
Burst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks G. Mohan, M. Ashish, and K. Akash Department of Electrical and Computer Engineering National University
More informationCryptanalysis of the Bluetooth Stream Cipher
1 Cryptanalysis of the Bluetooth Stream Cipher Christophe De Cannière 1, Thomas Johansson 2, and Bart Preneel 1 1 Katholieke Universiteit Leuven, Dept. ESAT, Kasteelpark Arenberg 10, B 3001 Leuven-Heverlee,
More informationUnderstanding TCP Vegas: A Duality Model
Understanding TCP Vegas: A Duality Model Steven Low Departments of CS and EE, Caltech, USA slow@caltech.edu Larry Peterson Limin Wang Department of CS, Princeton University, USA {llp,lmwang}@cs.princeton.edu
More informationDeep Algebra Projects: Algebra 1 / Algebra 2 Go with the Flow
Deep Algebra Projects: Algebra 1 / Algebra 2 Go with the Flow Topics Solving systems of linear equations (numerically and algebraically) Dependent and independent systems of equations; free variables Mathematical
More informationRobust Network Codes for Unicast Connections: A Case Study
Robust Network Codes for Unicast Connections: A Case Study Salim Y. El Rouayheb, Alex Sprintson, and Costas Georghiades Department of Electrical and Computer Engineering Texas A&M University College Station,
More informationECEN 689 Special Topics in Data Science for Communications Networks
ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 13 Measuring and Inferring Traffic Matrices
More informationOscillation energy based sensitivity analysis and control for multi-mode oscillation systems
Oscillation energy based sensitivity analysis and control for multi-mode oscillation systems Horacio Silva-Saravia, Yajun Wang, Héctor Pulgar-Painemal, Kevin Tomsovic Department of Electrical Engineering
More informationComparison of TCP Reno and TCP Vegas via Fluid Approximation
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Comparison of TCP Reno and TCP Vegas via Fluid Approximation Thomas Bonald N 3563 Novembre 1998 THÈME 1 apport de recherche ISSN 0249-6399
More informationCongestion Equilibrium for Differentiated Service Classes Richard T. B. Ma
Congestion Equilibrium for Differentiated Service Classes Richard T. B. Ma School of Computing National University of Singapore Allerton Conference 2011 Outline Characterize Congestion Equilibrium Modeling
More informationCOMS 4771 Introduction to Machine Learning. Nakul Verma
COMS 4771 Introduction to Machine Learning Nakul Verma Announcements HW1 due next lecture Project details are available decide on the group and topic by Thursday Last time Generative vs. Discriminative
More informationLocal and Global Stability of Symmetric Heterogeneously-Delayed Control Systems
Local and Global Stability of Symmetric Heterogeneously-Delayed Control Systems Yueping Zhang and Dmitri Loguinov Texas A&M University, College Station, TX 77843 Email: {yueping, dmitri}@cs.tamu.edu Abstract
More informationSize-based Adaptive Bandwidth Allocation:
Size-based Adaptive Bandwidth Allocation: Optimizing the Average QoS for Elastic Flows Shanchieh Yang (scyang@ece.utexas.edu), Gustavo de Veciana (gustavo@ece.utexas.edu) Department of Electrical and Computer
More informationKCV Kalyanarama Sesha Sayee and Anurag Kumar
Adaptive Algorithms for Admission of Elastic Sessions in the Internet KCV Kalyanarama Sesha Sayee and Anurag Kumar Abstract In the Internet, the majority of the traffic consists of elastic transfers. Users
More informationCHW 261: Logic Design
CHW 26: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed4 http://bu.edu.eg/staff/ahmedshalaby4# Slide Digital Fundamentals CHAPTER 8 Counters Slide 2 Counting
More informationUtility Maximization in Peer-to-Peer Systems
1 Utility Maximization in Peer-to-Peer Systems Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Jin Li and Philip A. Chou Abstract In this paper, we study the problem of utility maximization in P2P systems,
More informationContents. PART I METHODS AND CONCEPTS 2. Transfer Function Approach Frequency Domain Representations... 42
Contents Preface.............................................. xiii 1. Introduction......................................... 1 1.1 Continuous and Discrete Control Systems................. 4 1.2 Open-Loop
More informationOperational Laws. Operational Laws. Overview. Operational Quantities
Operational Laws Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu Mini-Course offered at UC erkeley, Sept-Oct 2012 These slides and audio/video recordings are available
More information