Duality Model of TCP/AQM
|
|
- Blanche York
- 5 years ago
- Views:
Transcription
1 Optimization and Contro of Network Duaity Mode of TCP/AQM Lijun Chen 02/08/2016
2 Agenda Utiity maimization and dua decompoition An introduction to TCP congetion contro A genera dynamica mode of TCP/AQM The duaity mode of TCP/AQM 2
3 Network mode A network modeed a a et L of ink with finite capacitie c { c, L} Shared by a et S of ource Each ource ue a ubet L L of ink, which define a routing matri 1 if L R 1 0 otherwie 110 R c 1 c
4 Utiity function Each ource attain a utiity U when tranmitting at rate q Non-decreaing function Given the et X of poibe aterna1ve, a func1on U : X R i a u1ity func1on repreen1ng preference rea1on among aterna1ve, if for a y, X, " i at eat a good a y" U U y To ue u1ity func1on to characterize preference i a fundamenta aump1on in economic 4
5 2 3 Reource aocation probem Each ource attain a utiity U when tranmitting at rate Utiity maimization Key 98 ma. t. U R c c c2 c 1 c R c c 1 2 5
6 Fairne For eatic traffic, U i aumed to be continuouy differentiabe, increaing and tricty concave q Diminihing return U Enure ome kind of fairne Eampe: U 1 α / 1 α, α > 0 q α 1, U og, proportiona fairne y / 0 q α, ma-min fairne 6
7 ma. t. U R c Poynomia-ovabe, if a the utiity and contraint information i provided. But impractica in rea network Have to eek decompoition to obtain ditributed agorithm 7
8 8 Lagrangian dua Conider the dua probem Low 99 q Congetion contro: given end-to-end price q Price update: given aggregate ource rate q Price can be updated and fed back to ource impicity c p p R U c R p U p D T c T o p + ma ma : min p R q 1 ' t q U t ] [ 1 c t y t p t p γ R y
9 Agenda Utiity maimization and dua decompoition An introduction to TCP congetion contro A genera dynamic mode of TCP/AQM The duaity mode of TCP/AQM 9
10 TCP/IP protoco tack S D appication tranport network ink phyica Doe the part of tak pecific to the particuar appication Provide reiabe end-to-end tranmiion, congetion contro Provide end-to-end path between two end node routing Provide reiabe point-to-point tranmiion, channe acce Provide a ink for tranmitting bit between two node 10
11 Congetion contro Effect of congetion q Packet o, retranmiion, reduced throughput even congetion coape q Internet ha it firt congetion coape in Oct throughput Congetion contro q Achieve high utiization q Avoid congetion q Fair bandwidth haring oad 11
12 Window-baed fow contro RTT Source 1 2 W 1 2 W time data ACK Detination 1 2 W 1 2 W time q ~ W packet per RTT round trip time q Lot packet detected by miing ACK q Source rate ~ W/RTT 12
13 TCP congetion contro Source cacuate cwnd from indication of network congetion q cwnd: congetion window ize Congetion indication q Packet oe q Deay q Packet mark Agorithm to cacuate cwnd q Tahoe, Reno, Vega, q DropTai, RED, REM, 13
14 TCP Reno Jacobon 90 cwnd SS CA time SS: Sow Start CA: Congetion Avoidance 14
15 Sow tart Start with cwnd 1 ow tart On each uccefu ACK increment cwnd cwnd cnwd + 1 Eponentia growth of cwnd each RTT: cwnd 2 cwnd Enter CA when cwnd > threh 15
16 Sow Start 1 RTT ender cwnd 1 2 data packet ACK receiver cwnd cwnd + 1 for each ACK
17 Congetion Avoidance Start when cwnd threh On each uccefu ACK: cwnd cwnd + 1/cwnd Linear growth of cwnd each RTT: cwnd cwnd
18 Congetion Avoidance ender cwnd 1 data packet receiver 2 ACK 1 RTT 3 4 cwnd cwnd + 1 for each cwnd ACKS
19 Packet Lo Aumption: o indicate congetion Packet o detected by q Retranmiion TimeOut RTO timer q Dupicate ACK at eat 3 Packet Acknowedgement
20 Summary: Reno Baic idea q Genty probe network for pare capacity q Draticay reduce rate on congetion for every ACK { if W < threh then W++ ee W + 1/W } for every o { threh W/2 W threh } SS CA 20
21 TCP Vega Brakmo & Peteron 94 cwnd SS CA time for every RTT { if W/RTT min W/RTT < α then W ++ if W/RTT min W/RTT > α then W -- } for every o W : W/2 queue ize Congetion meaure: end-to-end queueing deay 21
22 Link agorithm AQM DropTai: drop coming packet when buffer i fu RED random eary detection: warn ource of incipient congetion by probabiiticay marking/ dropping packet q Probabiiticay drop packet q Probabiiticay mark packet marking 1 router B Avg queue 22
23 Agenda Utiity maimization and dua decompoition An introduction to TCP congetion contro A genera dynamica mode of TCP/AQM The duaity mode of TCP/AQM 23
24 TCP & AQM p t i t Two component q A ource agorithm: adjut the ending rate baed on congetion Impemented in TCP Tranmiion Contro Protoco q A ink agorithm: update a congetion meaure and end it back to the ource Congetion meaure: o probabiity and deay In form of o/mark or deay Carried out by AQM Active Queuing Management 24
25 Dynamic mode of TCP/AQM Notation q q q q t : ource rate at time t R : aggregate ource rate at ink t t : ink congetion meaure y p Source can oberve ony t and Link can oberve ony t and t q t R p t : end-to-end congetion meaure of ource q t p t y 25
26 p t i t q Dynamica mode p t t F G p t, t, q y t t q The eact form of F and G are determined by the pecific TCP/AQM protoco 26
27 Eampe: Vega D d + q for every RTT { if W/RTT min W/RTT < α then W ++ if W/RTT min W/RTT > α then W -- } for every o W : W/2 queue ize F: G: 1 t + t + if w t d t < α d 1 2 D t 2 D if w t d t > α d t t + 1 t ee p t+1 [p t + y t/c - 1] + 27
28 Agenda Utiity maimization and dua decompoition An introduction to TCP congetion contro A genera dynamic mode of TCP/AQM The duaity mode of TCP/AQM 28
29 Duaity mode of TCP/AQM Denote by, p the equiibrium of the ytem p t t F G p t, t, q y t t The fied point equation define a reation q f q F > 0 i continuouy differentiabe, and Define a utiity function for each ource U f d, > q Uuay continuou, increaing and tricty concave q Ony determined by tcp agorithm F 0, q F / q 0 impicity 29
30 30 Eampe: Vega At equiibrium Utiity function d t d t w D t t < + + α if ee 1 t t + d t d t w D t t > + α if F: / d q d q d d D d d w α α α α d U og α
31 Define utiity maimization Dua probem min p o ma. t. R c Interpret ource rate a prima variabe and the congetion price p a dua variabe U D ma U R c p + p T c 31
32 32 The equiibrium ove the prima and dua, if it atifie KKT condition q The compementary ackne condition i atified by any AQM that tabiize the queue q AQM houd match input rate to capacity to maimize utiization at every botteneck ink, p ' q U p c y p c y
33 Remark Revere engineering: the network a an optimization over, and different TCP/AQM protoco a ditributed prima-dua agorithm to ove the utiity maimization and it dua Forward engineering: guide new congetion contro deign q By carefuy chooing utiity function q By propoing better convergent agorithm 33
34 Can etend to provide a mathematica theory for network architecture and a genera approach to cro-ayer deign appication tranport network ink phyica Minimize repone time web ayout Maimize utiity TCP/AQM Minimize path cot IP Throughput-maima cheduing, Minimize SIR, ma capacitie, 34
Lecture 3: Duality Model of TCP/AQM
CDS270: Otimization, Game and Layering in Communication Network Lecture 3: Duaity Mode of TCP/AQM and Market Mechanim for Reource Aocation Lijun Chen 10/18/2006 Agenda The duaity mode of TCP/AQM Utiity
More informationLayering as Optimization Decomposition
TLEN7000/ECEN7002: Analytical Foundation of Network Layering a Optimization Decompoition Lijun Chen 11/29/2012 The Internet Compleity i ever increaing Large in ize and cope Enormou heterogeneity Incomplete
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 informationNetwork utility maximisation framework with multiclass traffic
www.ietd.org Pubihed in IET Networ Received on 3rd June 2012 Revied on 11th March 2013 Accepted on 18th May 2013 Networ utiity maximiation framewor with mutica traffic Phuong Luu Vo, Nguyen Hoang Tran,
More informationUtility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach 61 Tobia Hark Konrad-Zue-Zentrum für Informationtechnik Berlin (ZIB), Department Optimization, Takutr. 7, 14195 Berlin,
More informationDeparture Time and Route Choices with Bottleneck Congestion: User Equilibrium under Risk and Ambiguity
Departure Time and Route Choice with Bottleneck Congetion: Uer Equilibrium under Rik and Ambiguity Yang Liu, Yuanyuan Li and Lu Hu Department of Indutrial Sytem Engineering and Management National Univerity
More informationTCP and Network Coding: Equilibrium and Dynamic Properties
TCP and Network Coding: Equiibrium and Dynamic Properties Hamet Medina Ruiz, Miche Kieffer, Beatrice Pesquet-Popescu To cite this version: Hamet Medina Ruiz, Miche Kieffer, Beatrice Pesquet-Popescu. TCP
More informationDecomposition Methods for Network Utility Maximization
TECHNICAL UNIVERSITY OF CRETE ELECTRONIC AND COMPUTER ENGINEERING DEPARTMENT TELECOMMUNICATIONS DIVISION Decompoition Method for Network Utiity Maximization by Giorgo Kotoua A THESIS SUBMITTED IN PARTIAL
More informationAlgorithm Design and Analysis
Algorithm Deign and Analyi LECTURES 1-1 Network Flow Flow, cut Ford-Fulkeron Min-cut/max-flow theorem Adam Smith // A. Smith; baed on lide by E. Demaine, C. Leieron, S. Rakhodnikova, K. Wayne Detecting
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 informationSliding Mode Based Congestion Control and
Sliding Mode Baed Congetion Control and 1 Scheduling for Multi-cla Traffic over Per-link Queueing Wirele Network Zongrui Ding and Dapeng Wu Abtract Thi paper conider the problem of joint congetion control
More informationEquilibrium of Heterogeneous Congestion Control Protocols
Equiibrium of Heterogeneous Congestion Contro Protocos Ao Tang Jiantao Wang Steven H. Low EAS Division, Caifornia Institute of Technoogy Mung Chiang EE Department, Princeton University Abstract When heterogeneous
More informationToday. Flow review. Augmenting paths. Ford-Fulkerson Algorithm. Intro to cuts (reason: prove correctness)
Today Flow review Augmenting path Ford-Fulkeron Algorithm Intro to cut (reaon: prove correctne) Flow Network = ource, t = ink. c(e) = capacity of edge e Capacity condition: f(e) c(e) Conervation condition:
More informationIN today networks, error correction is achieved by a
On the Beneit o Partia Channe State Inormation or Repetition Protoco in Bock Fading Channe Daniea Tuninetti Abtract Thi paper tudie the throughput perormance o HARQ hybrid automatic repeat requet protoco
More informationModeling The Interaction between TCP and Rate Adaptation at Links
Modeling The Interaction between TCP and Rate Adaptation at Link Faheem Khuhawar, Marco Mellia, Michela Meo Dip. di Elettronica e Telecomunicazioni, Politecnico di Torino, Italy. Email: {firtname.latname}@polito.it
More informationIEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 65, NO. 10, OCTOBER Wenguang Mao, Xudong Wang, Senior Member, IEEE, and Shanshan Wu
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 65, NO. 10, OCTOBER 2016 8511 Ditributed Opportunitic Scheduling With QoS Contraint for Wirele Network With Hybrid Link Wenguang Mao, Xudong Wang, Senior
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 informationControl Theory and Congestion
Control Theor and Congetion Glenn Vinnicombe and Fernando Paganini Cambridge/Caltech and UCLA IPAM Tutorial March 2002. Outline of econd part: 1. Performance in feedback loop: tracking, diturbance rejection,
More informationSTOCHASTIC GENERALIZED TRANSPORTATION PROBLEM WITH DISCRETE DISTRIBUTION OF DEMAND
OPERATIONS RESEARCH AND DECISIONS No. 4 203 DOI: 0.5277/ord30402 Marcin ANHOLCER STOCHASTIC GENERALIZED TRANSPORTATION PROBLEM WITH DISCRETE DISTRIBUTION OF DEMAND The generalized tranportation problem
More informationThe Impact of Imperfect Scheduling on Cross-Layer Rate. Control in Multihop Wireless Networks
The mpact of mperfect Scheduling on Cro-Layer Rate Control in Multihop Wirele Network Xiaojun Lin and Ne B. Shroff Center for Wirele Sytem and Application (CWSA) School of Electrical and Computer Engineering,
More informationMethods for calculation of the coupling coefficients in the Coupling Cavity Model of arbitrary chain of resonators
Method for cacuation of the couping coefficient in the Couping Cavity Mode of arbitrary chain of reonator M.I. Ayzaty V.V.Mytrocheno Nationa Science Center Kharov Intitute of Phyic and echnoogy (NSC KIP)
More informationChapter Landscape of an Optimization Problem. Local Search. Coping With NP-Hardness. Gradient Descent: Vertex Cover
Coping With NP-Hardne Chapter 12 Local Search Q Suppoe I need to olve an NP-hard problem What hould I do? A Theory ay you're unlikely to find poly-time algorithm Mut acrifice one of three deired feature
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 informationM C. Analytical Methods for Network Congestion Control. Steven H. Low Engineering & Applied Science, Caltech
Analytical Methods for Network Congestion Control Steven H. Low Engineering & Applied Science, Caltech SYNTHESIS LECTURES ON COMMUNICATION NETWORKS & M C Morgan & claypool publishers ABSTRACT The congestion
More informationMyriad of applications
Shortet Path Myriad of application Finding hortet ditance between location (Google map, etc.) Internet router protocol: OSPF (Open Shortet Path Firt) i ued to find the hortet path to interchange package
More informationRate Control in Communication Networks
From Models to Algorithms Department of Computer Science & Engineering The Chinese University of Hong Kong February 29, 2008 Outline Preliminaries 1 Preliminaries Convex Optimization TCP Congestion Control
More informationCONGESTION control is a key functionality in modern
IEEE TRANSACTIONS ON INFORMATION TEORY, VOL. X, NO. X, XXXXXXX 2008 On the Connection-Level Stability of Congetion-Controlled Communication Network Xiaojun Lin, Member, IEEE, Ne B. Shroff, Fellow, IEEE,
More informationChapter 7. Network Flow. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 7 Network Flow Slide by Kevin Wayne. Copyright 5 Pearon-Addion Weley. All right reerved. Soviet Rail Network, 55 Reference: On the hitory of the tranportation and maximum flow problem. Alexander
More informationLow order controller design for systems with time delays
20 50th IEEE Conference on Deciion and Contro and European Contro Conference (CDC-ECC) Orando, FL, USA, December 2-5, 20 Low order controer deign for ytem with time deay A N Gündeş and H Özbay Abtract
More informationOn the Stability Region of Congestion Control
On the Stability Region of Congetion Control Xiaojun Lin and Ne B. Shroff School of Electrical and Computer Engineering Purdue Univerity, Wet Lafayette, IN 47906 {linx,hroff}@ecn.purdue.edu Abtract It
More informationNon-linear Control and Observer Design for the Self-energizing Electro-Hydraulic Brake
9. Non-inear Contro and Oberver Deign for the Sef-energizing Eectro-Hydrauic Brake Michae Kühnein, Juian Ewad, Hubertu Murrenhoff RWTH achen Univerity, Germany, Intitute for uid Power Drive and Contro
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 informationImproved Approximation of Storage-Rate Tradeoff for Caching via New Outer Bounds
Improved Approximation of Storage-Rate Tradeoff for Caching via New Outer Bound Avik Sengupta, Ravi Tandon, T. Chare Cancy Hume Center & Dept. of Eectrica and Computer Engineering Dicovery Anaytic Center
More informationChapter 10. Closed-Loop Control Systems
hapter 0 loed-loop ontrol Sytem ontrol Diagram of a Typical ontrol Loop Actuator Sytem F F 2 T T 2 ontroller T Senor Sytem T TT omponent and Signal of a Typical ontrol Loop F F 2 T Air 3-5 pig 4-20 ma
More informationAnalytical Methods for Network Congestion Control SYNTHESIS LECTURES ON COMMUNICATION NETWORKS
Analytical Methods for Network Congestion Control Steven H. Low Engineering & Applied Science, Caltech SYNTHESIS LECTURES ON COMMUNICATION NETWORKS & M C Morgan & claypool publishers c These are draft
More informationPower Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks
ower Contro and Transmission Scheduing for Network Utiity Maximization in Wireess Networks Min Cao, Vivek Raghunathan, Stephen Hany, Vinod Sharma and. R. Kumar Abstract We consider a joint power contro
More informationVIII. Addition of Angular Momenta
VIII Addition of Anguar Momenta a Couped and Uncouped Bae When deaing with two different ource of anguar momentum, Ĵ and Ĵ, there are two obviou bae that one might chooe to work in The firt i caed the
More informationμ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL =
Our online Tutor are available 4*7 to provide Help with Proce control ytem Homework/Aignment or a long term Graduate/Undergraduate Proce control ytem Project. Our Tutor being experienced and proficient
More informationState Space: Observer Design Lecture 11
State Space: Oberver Deign Lecture Advanced Control Sytem Dr Eyad Radwan Dr Eyad Radwan/ACS/ State Space-L Controller deign relie upon acce to the tate variable for feedback through adjutable gain. Thi
More informationStability analysis of a max-min fair Rate Control Protocol (RCP) in a small buffer regime
Stabiity anaysis of a max-min fair Rate Contro Protoco RCP) in a sma buffer regime Thomas Voice and Gaurav Raina Cambridge Consutants and IIT Madras Abstract In this note we anayse various stabiity properties
More informationComparison of Augmented State Track Fusion Methods for Non-full-rate Communication
8th Internationa Conference on Information Fuion Wahington, DC - Juy 6-9, Comparion of Augmented tate Trac Fuion Method for Non-fu-rate Communication Feix Govaer enor Data and Information Fuion Fraunhofer
More informationProblem Set 8 Solutions
Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem
More informationResearch Article Simplicity and Commutative Bases of Derivations in Polynomial and Power Series Rings
ISRN Agebra Voume 2013 Artice ID 560648 4 page http://dx.doi.org/10.1155/2013/560648 Reearch Artice Simpicity and Commutative Bae of Derivation in Poynomia and Power Serie Ring Rene Batazar Univeridade
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 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 informationA Theoretical Study of Internet Congestion Control: Equilibrium and Dynamics
A Theoretical Study of Internet Congestion Control: Equilibrium and Dynamics Thesis by Jiantao Wang In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute
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 informationUnderstanding TCP Vegas: A Duality Model
Understanding TCP Vegas: A Duality Model STEVEN H. LOW Caltech, Pasadena, California AND LARRY L. PETERSON AND LIMIN WANG Princeton University, Princeton, New Jersey Abstract. We view congestion control
More informationAnalysis and Design of a Proportional-Integral Rate Controller for Streaming Videos
Analyi and Deign of a Proportional-Integral Rate Controller for Streaming Video Yingong Huang and Shiwen Mao Department of Electrical and Computer Engineering, Auburn Univerity, Auburn, AL Email: yzh0002@auburn.edu,
More informationBeyond Cut-Set Bounds - The Approximate Capacity of D2D Networks
Beyond Cut-Set Bound - The Approximate Capacity of DD Network Avik Sengupta Hume Center for National Security and Technology Department of Electrical and Computer Engineering Virginia Tech, Blackburg,
More informationPricing surplus server capacity for mean waiting time sensitive customers
Pricing urplu erver capacity for mean waiting time enitive cutomer Sudhir K. Sinha, N. Rangaraj and N. Hemachandra Indutrial Engineering and Operation Reearch, Indian Intitute of Technology Bombay, Mumbai
More informationcommunication networks
Positive matrices associated with synchronised communication networks Abraham Berman Department of Mathematics Robert Shorten Hamilton Institute Douglas Leith Hamilton Instiute The Technion NUI Maynooth
More informationMotivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:
CDS270 Maryam Fazel Lecture 2 Topics from Optimization and Duality Motivation network utility maximization (NUM) problem: consider a network with S sources (users), each sending one flow at rate x s, through
More informationEntropy Minimization in Design of Extractive Distillation System with Internal Heat Exchangers
Entropy Minimization in Deign of Extractive Ditillation Sytem with Internal Heat Exchanger Diego F. Mendoza, Carlo.M. Riaco * Group of Proce Sytem Engineering, Department of Chemical and Environmental
More informationOSCILLATION AND PERIOD DOUBLING IN TCP/RED SYSTEM: ANALYSIS AND VERIFICATION
International Journal of Bifurcation and Chaos, Vol. 18, No. 5 (28) 1459 1475 c World Scientific Publishing Company OSCILLATION AND PERIOD DOUBLING IN TCP/RED SYSTEM: ANALYSIS AND VERIFICATION XI CHEN,
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 informationEnergy Approach-Based Simulation of Structural Materials High-Cycle Fatigue
IOP Conference Serie: Materia Science and Engineering PAPER OPEN ACCESS Energy Approach-Baed Simuation of Structura Materia High-Cyce Fatigue To cite thi artice: A F Baayev et a 016 IOP Conf. Ser.: Mater.
More informationGain and Phase Margins Based Delay Dependent Stability Analysis of Two- Area LFC System with Communication Delays
Gain and Phae Margin Baed Delay Dependent Stability Analyi of Two- Area LFC Sytem with Communication Delay Şahin Sönmez and Saffet Ayaun Department of Electrical Engineering, Niğde Ömer Halidemir Univerity,
More informationReliability: Theory & Applications No.3, September 2006
REDUNDANCY AND RENEWAL OF SERVERS IN OPENED QUEUING NETWORKS G. Sh. Tsitsiashvii M.A. Osipova Vadivosto, Russia 1 An opened queuing networ with a redundancy and a renewa of servers is considered. To cacuate
More informationied widely. The waiting time ditribution and queue ize for a queue with gamma ditributed arrival proce with a pecial Markovian tructure and i.i.d. exp
Modeling of Correlated Arrival Procee in the Internet Muckai K Girih SBC Technology Reource, Inc. 4698 Willow Road Pleaanton, CA 94588 mgirih@tri.bc.com Jian-Qiang Hu Λ Dept. of Manufacturing Engineering
More informationControl chart for waiting time in system of (M / M / S) :( / FCFS) Queuing model
IOSR Journal of Mathematic (IOSR-JM) e-issn: 78-578. Volume 5, Iue 6 (Mar. - Apr. 3), PP 48-53 www.iorjournal.org Control chart for waiting time in ytem of (M / M / S) :( / FCFS) Queuing model T.Poongodi,
More informationEffective Capacity-Based Quality of Service Measures for Wireless Networks
Effective Capacity-Baed Quality of Service Meaure for Wirele Network Dapeng Wu Rohit Negi Abtract An important objective of next-generation wirele network i to provide quality of ervice (QoS) guarantee.
More informationThe Impact of Imperfect Scheduling on Cross-Layer Rate Control in Wireless Networks
The Impact of Imperfect Scheduling on Cro-Layer Rate Control in Wirele Network Xiaojun Lin and Ne B. Shroff Center for Wirele Sytem and Application (CWSA) School of Electrical and Computer Engineering,
More information6.3 Buffer Space versus Number of Flows
6.3 Buffer Space veru Number of Flow What to do when the number of flow i o large that it become impractical to allocate a eparate flow-control window for each one of them Per-detination flow merging:
More informationAnalysis of TCP Westwood+ in high speed networks
Analysis of TCP Westwood+ in high speed networks 1 E. Altman, C. Barakat, S. Mascolo, N. Möller and J. Sun Abstract TCP Westwood+ is modelled and analyzed using stochastic recursive equations. It is shown
More informationDTM: A Distributed Traffic Management Algorithm for Sensor Networks
8 IJCSNS International Journal of Computer Science Network Security, VOL6 No8A, Augut 6 DM: A Ditributed raffic Management Algorithm for Senor Network Yantao Pan, Xicheng Lu, Peidong Zhu School of Computer,
More informationASSESSING EXPECTED ACCURACY OF PROBE VEHICLE TRAVEL TIME REPORTS
ASSESSING EXPECTED ACCURACY OF PROBE VEHICLE TRAVEL TIME REPORTS By Bruce Hellinga, 1 P.E., and Liping Fu 2 (Reviewed by the Urban Tranportation Diviion) ABSTRACT: The ue of probe vehicle to provide etimate
More informationChapter 4: Applications of Fourier Representations. Chih-Wei Liu
Chapter 4: Application of Fourier Repreentation Chih-Wei Liu Outline Introduction Fourier ranform of Periodic Signal Convolution/Multiplication with Non-Periodic Signal Fourier ranform of Dicrete-ime Signal
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More informationOptimal revenue management in two class pre-emptive delay dependent Markovian queues
Optimal revenue management in two cla pre-emptive delay dependent Markovian queue Manu K. Gupta, N. Hemachandra and J. Venkatewaran Indutrial Engineering and Operation Reearch, IIT Bombay March 15, 2015
More informationPacket Size Optimization for Multiple Input Multiple Output Cognitive Radio Sensor Networks aided Internet of Things.
JOURNAL OF L A TEX CLASS FILES, VOL. 3, NO. 9, SEPTEMBER 04 Packet Size Optimization for Multiple Input Multiple Output Cognitive Radio Ser Network aided Internet of Thing. Chitradeep Majumdar*, Doohwan
More information3.1 The Revised Simplex Algorithm. 3 Computational considerations. Thus, we work with the following tableau. Basic observations = CARRY. ... m.
3 Computational conideration In what follow, we analyze the complexity of the Simplex algorithm more in detail For thi purpoe, we focu on the update proce in each iteration of thi procedure Clearly, ince,
More informationRiser Dynamic Analysis Using WKB-Based Dynamic Stiffness Method
Rier ynamic Anayi Uing WKB-Baed ynamic Stiffne Method The MIT Facuty ha made thi artice openy avaiabe. Peae hare how thi acce benefit you. Your tory matter. Citation A Pubihed Pubiher Cheng, Yongming,
More informationChapter 7. Network Flow. CS 350: Winter 2018
Chapter 7 Network Flow CS 3: Winter 1 1 Soviet Rail Network, Reference: On the hitory of the tranportation and maximum flow problem. Alexander Schrijver in Math Programming, 1: 3,. Maximum Flow and Minimum
More informationA New TCP/AQM System Analysis
A ew TCP/AQM System Analysis Qin Xu, Fan Li, Jinsheng Sun, and Moshe Zukerman, Fellow, IEEE arxiv:37.24v [cs.i] 4 Jul 23 Abstract The fluid model has been used extensively to guide designs of AQM schemes
More informationRelaxation in Glass: Review of Thermodynamics. Lecture 10: Thermodynamic Functions
Reaxation in a: Review of hermodynamic Lecture 10: hermodynamic Function 2 nd Law of hermodynamic irreveribe procee Exercie for omework: Conider the two procee: Reveribe equiibrium heating of ice from
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 informationInternational Journal of Advanced Engineering and Management Research Vol. 2 Issue 5, ISSN:
Internationa Journa of Advanced Engineering and Management Reearch Vo. 2 Iue 5, 2017 http://ijaemr.com/ ISSN: 2456-3676 STUDY ON TEMPERATURE FIELD DISTRIBUTION OF HOT MELT WELDING OF PE100 ZHANG Ao-peng
More informationChapter 2 Sampling and Quantization. In order to investigate sampling and quantization, the difference between analog
Chapter Sampling and Quantization.1 Analog and Digital Signal In order to invetigate ampling and quantization, the difference between analog and digital ignal mut be undertood. Analog ignal conit of continuou
More informationReliable Data Transport: Sliding Windows
Reliable Data Transport: Sliding Windows 6.02 Fall 2013 Lecture 23 Exclusive! A Brief History of the Internet guest lecture by Prof. Hari Balakrishnan Wenesday December 4, 2013, usual 6.02 lecture time
More informationSuggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall
Beyond Significance Teting ( nd Edition), Rex B. Kline Suggeted Anwer To Exercie Chapter. The tatitic meaure variability among core at the cae level. In a normal ditribution, about 68% of the core fall
More informationSPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems
SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneou Storage Sytem Mario Mene Chritian Scheideler Abtract In thi paper we tudy the problem of deigning an adaptive hah table
More informationMULTI-PERIOD LOCATION ALLOCATION PROBLEM WITH SAFETY STOCK OPTIMIZATION
MU-EROD OCAON AOCAON ROBEM WH SAFEY SOC OMZAON 9 th nternationa Conference on roduction Reearch E. GEBENNN, R. GAMBERN, R. MANZN, C. MORA Department of Engineering Science and Method, Univerity of Modena
More informationNCAAPMT Calculus Challenge Challenge #3 Due: October 26, 2011
NCAAPMT Calculu Challenge 011 01 Challenge #3 Due: October 6, 011 A Model of Traffic Flow Everyone ha at ome time been on a multi-lane highway and encountered road contruction that required the traffic
More informationOn Energy Efficiency of Prioritized IoT Systems: KTH Technical Report
1 On Energy Efficiency of Prioritized IoT Sytem: KTH Tecnica Report Abduraman Aabbai, Baem Siada, and Cicek Cavdar Roya Intitute of Tecnoogy KTH Emai: {aabbai, cavdar}@kt.e King Abdua Univerity of Science
More information9. Dual decomposition and dual algorithms
EE 546, Univ of Washington, Spring 2016 9. Dual decomposition and dual algorithms dual gradient ascent example: network rate control dual decomposition and the proximal gradient method examples with simple
More information<C 2 2. λ 2 l. λ 1 l 1 < C 1
Teecommunication Network Contro and Management (EE E694) Prof. A. A. Lazar Notes for the ecture of 7/Feb/95 by Huayan Wang (this document was ast LaT E X-ed on May 9,995) Queueing Primer for Muticass Optima
More informationONLINE APPENDIX FOR HOUSING BOOMS, MANUFACTURING DECLINE,
ONLINE APPENDIX FOR HOUSING BOOS, ANUFACTURING DECLINE, AND LABOR ARKET OUTCOES Kerwin Kofi Charle Erik Hurt atthew J. Notowidigdo July 2017 A. Background on Propertie of Frechet Ditribution Thi ection
More informationOptimal Coordination of Samples in Business Surveys
Paper preented at the ICES-III, June 8-, 007, Montreal, Quebec, Canada Optimal Coordination of Sample in Buine Survey enka Mach, Ioana Şchiopu-Kratina, Philip T Rei, Jean-Marc Fillion Statitic Canada New
More informationLeopold Franzens University Innsbruck. Responding to Spurious Loss Events in TCP/IP. Master Thesis. Institute of Computer Science
Leopold Franzens University Innsbruck Institute of Computer Science Distributed and Parallel Systems Group Responding to Spurious Loss Events in TCP/IP Master Thesis Supervisor: Dr. Michael Welzl Author:
More informationRate adaptation, Congestion Control and Fairness: A Tutorial. JEAN-YVES LE BOUDEC Ecole Polytechnique Fédérale de Lausanne (EPFL)
Rate adaptation, Congestion Control and Fairness: A Tutorial JEAN-YVES LE BOUDEC Ecole Polytechnique Fédérale de Lausanne (EPFL) December 2000 2 Contents 31 Congestion Control for Best Effort: Theory 1
More informationME2142/ME2142E Feedback Control Systems
Root Locu Analyi Root Locu Analyi Conider the cloed-loop ytem R + E - G C B H The tranient repone, and tability, of the cloed-loop ytem i determined by the value of the root of the characteritic equation
More informationDemand in Leisure Markets
Demand in Leisure Markets An Empirica Anaysis of Time Aocation Shomi Pariat Ph.D Candidate Eitan Bergas Schoo of Economics Te Aviv University Motivation Leisure activities matter 35% of waking time 9.7%
More informationA Comparative Study of Least-Squares and the Weak- Form Galerkin Finite Element Models for the Nonlinear Analysis of Timoshenko Beams
Journa of Soid Mechanic Vo., No. () pp. -4 A Comparative Study of eat-square and the Weak- Form Gaerkin Finite Eement Mode for the Noninear Anayi of Timohenko Beam W. Kim, J.N. Reddy,* Department of Mechanica
More informationStructural Control of Probabilistic Boolean Networks and Its Application to Design of Real-Time Pricing Systems
Preprints of the 9th Word Congress The Internationa Federation of Automatic Contro Structura Contro of Probabiistic Booean Networks and Its Appication to Design of Rea-Time Pricing Systems Koichi Kobayashi
More informationAdvanced Digital Signal Processing. Stationary/nonstationary signals. Time-Frequency Analysis... Some nonstationary signals. Time-Frequency Analysis
Advanced Digital ignal Proceing Prof. Nizamettin AYDIN naydin@yildiz.edu.tr Time-Frequency Analyi http://www.yildiz.edu.tr/~naydin 2 tationary/nontationary ignal Time-Frequency Analyi Fourier Tranform
More informationThrottle Actuator Swapping Modularity Design for Idle Speed Control
9 merican ontrol onference Hyatt Regency Riverfront, St. Loui, MO, US June -, 9 ThB.4 Throttle ctuator Swapping Modularity Deign for Idle Speed ontrol Shifang Li, Melih akmakci, Ilya V. Kolmanovky and.
More informationFUNDAMENTALS OF POWER SYSTEMS
1 FUNDAMENTALS OF POWER SYSTEMS 1 Chapter FUNDAMENTALS OF POWER SYSTEMS INTRODUCTION The three baic element of electrical engineering are reitor, inductor and capacitor. The reitor conume ohmic or diipative
More informationEP2200 Queueing theory and teletraffic systems
P00 Queueing theory and teletraffic ytem Lecture 9 M/G/ ytem Vitoria Fodor KTH S/LCN The M/G/ queue Arrival proce memoryle (Poion( Service time general, identical, independent, f(x Single erver M/ r /
More informationQuestion 1 Equivalent Circuits
MAE 40 inear ircuit Fall 2007 Final Intruction ) Thi exam i open book You may ue whatever written material you chooe, including your cla note and textbook You may ue a hand calculator with no communication
More information