Pull versus Push Mechanism in Large Distributed Networks: Closed Form Results


 Gladys Hart
 1 years ago
 Views:
Transcription
1 Pull versus Push Mechanism in Large Distributed Networks: Closed Form Results Wouter Minnebo, Benny Van Houdt Dept. Mathematics and Computer Science University of Antwerp  iminds Antwerp, Belgium Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 1/15
2 Outline Problem description Pull / Push / Hybrid strategies Finite system model Continuous time Markov chain Infinite system model Ordinary differential equations Closed form results Finite system simulations Conclusion Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 2/15
3 Problem Description Set of M / M /1 queues N queues (single server with infinite waiting room) Each has its own arrival stream of jobs: Poisson (λ) Processing time is exponential (µ = 1) Distribute work to reduce response time Some servers may be empty while others have jobs waiting inefficient Distribute waiting jobs (load sharing) Pull strategies (work stealing): Lightlyloaded servers attempt to attract work Push strategies: Heavilyloaded servers attempt to forward work Hybrid strategies: Combine Pull and Push strategy Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 3/15
4 Load sharing strategies Communication via probe messages Random queues are probed according to an Interrupted Poisson process (r) If the target accepts, a task is transfered to it Transfer and probe time is considered zero, i.e., instantaneous Strategies Pull: Idle servers generate probes (r), busy servers accept Push: Servers with pending jobs generate probes (r), idle servers accept Hybrid: Idle and servers with pending jobs generate probes (r = r 1 + r 2 ), servers accept accordingly Performance What is the required probe rate of a strategy to achieve a specified mean delay? Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 4/15
5 Load sharing strategies Relation to existing work Other works frequently use a maximum of Lp probes (in batch or onebyone) at task arrival / completion instead of ratebased probing Parameter r allows to match any predefined R It is fair to compare strategies if they have a similar (preferably equal) overall probe rate R Remarks Ratebased probing performs better, given the same overall probe rate R, if the Lp probes are sent in batch Both methods are equivalent if overall probe rate R is matched, given that the Lp probes are sent onebyone until success or the maximum is reached Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 5/15
6 Finite system model  Continuous time Markov chain System state N queues, independent arrivals and completions Define X (N) (t) = (X N 1 (t), X N 2 (t),...) t 0 X (N) i (t) {0,..., N} : Number of nodes with at least i jobs in queue at time t Note that for any state x = (x 1, x 2,...), x i x i+1 for all i 1 State transitions q (N) (x, y) is the transition rate between state x = (x 1, x 2,...) and y = (y 1, y 2,...) Events incurring a state change: Arrival Completion Succesful job transfer Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 6/15
7 Finite system model  Continuous time Markov chain State transitions Arrival : y = x + e i q (N) (x, y) = λ(x i 1 x i ) Completion : y = x e i q (N) (x, y) = (x i x i+1 ) Succesful task transfer : y = x + e 1 e i q (N) (x, y) = r(n x 1)(x i x i+1 ) N Load sharing strategies These transitions describe both pull, push and hybrid strategies, although semantics differ Probe rate target is idle initiator has exactly i jobs Push Probe rate initiator is idle target has exactly i jobs Pull Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 7/15
8 From Finite to Infinite Transition rates Define β l (x/n) = q (N) (x, x + l)/n, such that β ei (x/n) = λ(x i 1 /N x i /N), for i 1 β ei (x/n) = (x i /N x i+1 /N), for i 1 β e1 e i (x/n) = r(1 x 1 /N)(x i /N x i+1 /N) for i 2 Define F (x) = i 1 (e iβ ei (x) e i β ei (x)) + i 2 (e 1 e i )β e1 e i (x) Then the ODEs d dt x(t) = F (x(t)) describe the evolution of the infinite system model Density dependent Markov chain [Kurtz] of infinite dimensionality Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 8/15
9 Infinite system model  Ordinary differential equations Description Let x i (t) be the fraction of nodes with at least i jobs at time t The set d dt x(t) = F (x(t)) can be written as Arrivals d dt x 1(t) = ( {}}{ { }} { λ + rx 2 (t)) (1 x 1 (t)) } {{ } (x 1(t) x 2 (t)) } {{ } Incoming job transfers Completions Completions { }} { d dt x i(t)=λ(x i 1 (t) x i (t)) } {{ } ({}}{ 1 + r(1 x 1 (t))) (x i (t) x i+1 (t)) } {{ } Arrivals Outgoing job transfers Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 9/15
10 Infinite system model  Closed form results Unique fixed point Describes cumulative queue length distribution at t = π = (π 1, π 2,...) with i 1 π i <, explicitly: ( λ π i = λ 1 + (1 λ)r ) i 1 Performance The fixed point is a global attractor Proof by the KrasovskiiLasalle principle The mean response time is then given by: D = 1 + λ (1 λ)(1 + r) Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 10/15
11 Infinite system model  Closed form results Load sharing strategies D = 1 + Valid for Push / Pull / Hybrid λ (1 λ)(1 + r) Difference lies in the generated overall probe rate R: R = (1 λ)r 1 + r 2 λ (1 λ)r Using r = r 1 + r 2 for the Hybrid strategy Setting (r 1, r 2 ) = (r, 0) and (0, r) results in R pull and R push respectively Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 11/15
12 Infinite system model  Closed form results Mean response time Hybrid strategy is always inferior Using the relationship R, rewrite: D push = λ (1 λ)(λ + R), for R < λ2 /(1 λ) D push = 1, for R λ 2 /(1 λ) D pull = 1 + R 1 λ + R (1+R) 2 +4(1+R) (1+R) Resulting in D push < D pull if λ < 2 If R 0, D push < D pull if λ < φ 1 with φ = (1 + 5)/2 Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 12/15
13 Finite system simulations Finite vs. Infinite Errors are proportional to both load (λ) and probe rate (r) Using a push strategy r decreases with λ, nearly load insensitive error Using a pull strategy r increases with λ, larger error under high load Infinite model is accurate for large N : λ = λ = 0.95 Mean Delay (D push ) λ = λ = λ = Mean Delay (D pull ) λ = λ = λ = Infinity Infinity Number of Nodes (N) Number of Nodes (N) Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 13/15
14 Finite system simulations Finite vs. Infinite Simulation results using N = 100 (crosses) vs. infinite model: Mean Delay (D) push, R=0.5 push, R=1.0 pull, R=0.5 pull, R=1.0 Mean Delay (D) push, R=1.0 pull, R= Load (λ) Load (λ) Infinite model accurately predicts λ where both strategies perform equally well, even for systems of moderate size Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 14/15
15 Conclusion Push / Pull / Hybrid strategies Push outperforms pull (for N = ) if and only if: λ < (1+R) 2 +4(1+R) (1+R) Hybrid strategy is always inferior to pure push or pull strategy (proof in paper) Finite vs. Infinite Infinite model predicts finite model accurately Technical issues to formally prove the convergence of the steady state measures of the finite system model to the infinite system model were identified (see paper for details) 2 Wouter Minnebo, Benny Van Houdt Pull vs Push strategies 15/15
Rate adaptation, Congestion Control and Fairness: A Tutorial. JEANYVES LE BOUDEC Ecole Polytechnique Fédérale de Lausanne (EPFL)
Rate adaptation, Congestion Control and Fairness: A Tutorial JEANYVES LE BOUDEC Ecole Polytechnique Fédérale de Lausanne (EPFL) September 12, 2014 2 Thanks to all who contributed to reviews and debugging
More informationTO QUEUE OR NOT TO QUEUE: EQUILIBRIUM BEHAVIOR IN QUEUEING SYSTEMS
TO QUEUE OR NOT TO QUEUE: EQUILIBRIUM BEHAVIOR IN QUEUEING SYSTEMS REFAEL HASSIN Department of Statistics and Operations Research Tel Aviv University Tel Aviv 69978, Israel hassin@post.tau.ac.il MOSHE
More informationApproximately Detecting Duplicates for Streaming Data using Stable Bloom Filters
Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters Fan Deng University of Alberta fandeng@cs.ualberta.ca Davood Rafiei University of Alberta drafiei@cs.ualberta.ca ABSTRACT
More informationRobust Set Reconciliation
Robust Set Reconciliation Di Chen 1 Christian Konrad 2 Ke Yi 1 Wei Yu 3 Qin Zhang 4 1 Hong Kong University of Science and Technology, Hong Kong, China 2 Reykjavik University, Reykjavik, Iceland 3 Aarhus
More informationCall Admission Control in Mobile Cellular Networks: A Comprehensive Survey
Call Admission Control in Mobile Cellular Networks: A Comprehensive Survey Majid Ghaderi and Raouf Boutaba School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada Tel: +519
More informationGiotto: A TimeTriggered Language for Embedded Programming
Giotto: A TimeTriggered Language for Embedded Programming THOMAS A HENZINGER, MEMBER, IEEE, BENJAMIN HOROWITZ, MEMBER, IEEE, AND CHRISTOPH M KIRSCH Invited Paper Giotto provides an abstract programmer
More informationA Survey of Design Techniques for SystemLevel Dynamic Power Management
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 8, NO. 3, JUNE 2000 299 A Survey of Design Techniques for SystemLevel Dynamic Power Management Luca Benini, Member, IEEE, Alessandro
More informationPerformance of networks containing both MaxNet and SumNet links
Performance of networks containing both MaxNet and SumNet links Lachlan L. H. Andrew and Bartek P. Wydrowski Abstract Both MaxNet and SumNet are distributed congestion control architectures suitable for
More informationIntroduction to Queueing Theory and Stochastic Teletraffic Models
Introduction to Queueing Theory and Stochastic Teletraffic Models Moshe Zukerman EE Department, City University of Hong Kong Copyright M. Zukerman c 2000 2015 Preface The aim of this textbook is to provide
More informationHow to Use Expert Advice
NICOLÒ CESABIANCHI Università di Milano, Milan, Italy YOAV FREUND AT&T Labs, Florham Park, New Jersey DAVID HAUSSLER AND DAVID P. HELMBOLD University of California, Santa Cruz, Santa Cruz, California
More informationA Compositional Approach to Performance Modelling. Jane Hillston
A Compositional Approach to Performance Modelling Jane Hillston i Preface This book is, in essence, the dissertation I submitted to the University of Edinburgh in early January 1994. My examiners, Peter
More informationSubspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity
Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity Wei Dai and Olgica Milenkovic Department of Electrical and Computer Engineering University of Illinois at UrbanaChampaign
More informationThe Disadvantages of Free MIX Routes and How to Overcome Them
The Disadvantages of Free MIX Routes and How to Overcome Them Oliver Berthold 1, Andreas Pfitzmann 1, and Ronny Standtke 2 1 Dresden University of Technology, Germany {ob2,pfitza}@inf.tudresden.de 2 Secunet,
More informationChord: A Scalable Peertopeer Lookup Service for Internet Applications
Chord: A Scalable Peertopeer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT Laboratory for Computer Science chord@lcs.mit.edu
More informationThe Bullwhip Effect is problematic: order variability increases as orders propagate along the supply
PRODUCTION AND OPERATIONS MANAGEMENT Vol. 13, No. 2, Summer 2004, pp. 150 160 issn 10591478 04 1302 150$1.25 POMS 2004 Production and Operations Management Society An Analytical Investigation of the Bullwhip
More informationDimensioning Large Call Centers
OPERATIONS RESEARCH Vol. 52, No. 1, January February 2004, pp. 17 34 issn 0030364X eissn 15265463 04 5201 0017 informs doi 10.1287/opre.1030.0081 2004 INFORMS Dimensioning Large Call Centers Sem Borst
More informationA Googlelike Model of Road Network Dynamics and its Application to Regulation and Control
A Googlelike Model of Road Network Dynamics and its Application to Regulation and Control Emanuele Crisostomi, Steve Kirkland, Robert Shorten August, 2010 Abstract Inspired by the ability of Markov chains
More informationIntroduction to Stochastic ActorBased Models for Network Dynamics
Introduction to Stochastic ActorBased Models for Network Dynamics Tom A.B. Snijders Gerhard G. van de Bunt Christian E.G. Steglich Abstract Stochastic actorbased models are models for network dynamics
More informationAnalysis of EndtoEnd Response Times of MultiTier Internet Services
Analysis of EndtoEnd Response Times of MultiTier Internet Services ABSTRACT Modern Internet systems have evolved from simple monolithic systems to complex multitiered architectures For these systems,
More informationFEW would argue that one of TCP s strengths lies in its
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 13, NO. 8, OCTOBER 1995 1465 TCP Vegas: End to End Congestion Avoidance on a Global Internet Lawrence S. Brakmo, Student Member, IEEE, and Larry L.
More informationAutomating the MeanField Method for Large Dynamic Gossip Networks
Automating the MeanField Method for Large Dynamic Gossip Networks Rena Bakhshi, Jörg Endrullis, Stefan Endrullis, Wan Fokkink, Boudewijn Haverkort Department of Computer Science, Vrije Universiteit Amsterdam,
More informationCostAware Strategies for Query Result Caching in Web Search Engines
CostAware Strategies for Query Result Caching in Web Search Engines RIFAT OZCAN, ISMAIL SENGOR ALTINGOVDE, and ÖZGÜR ULUSOY, Bilkent University Search engines and largescale IR systems need to cache
More informationTHE PROBLEM OF finding localized energy solutions
600 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 45, NO. 3, MARCH 1997 Sparse Signal Reconstruction from Limited Data Using FOCUSS: A Reweighted Minimum Norm Algorithm Irina F. Gorodnitsky, Member, IEEE,
More informationProcess Modeling Notations and Workflow Patterns
Process Modeling Notations and Workflow Patterns Stephen A. White, IBM Corp., United States ABSTRACT The research work of Wil van der Aalst, Arthur ter Hofstede, Bartek Kiepuszewski, and Alistair Barros
More informationHighAvailability Algorithms for Distributed Stream Processing
HighAvailability Algorithms for Distributed Stream Processing JeongHyon Hwang, Magdalena Balazinska, Alexander Rasin, Uğur Çetintemel, Michael Stonebraker, and Stan Zdonik Brown University MIT {jhhwang,
More informationMINITAB ASSISTANT WHITE PAPER
MINITAB ASSISTANT WHITE PAPER This paper explains the research conducted by Minitab statisticians to develop the methods and data checks used in the Assistant in Minitab 17 Statistical Software. OneWay
More informationIEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 50, NO. 5, MAY 2005 577. Least Mean Square Algorithms With Markov RegimeSwitching Limit
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 50, NO. 5, MAY 2005 577 Least Mean Square Algorithms With Markov RegimeSwitching Limit G. George Yin, Fellow, IEEE, and Vikram Krishnamurthy, Fellow, IEEE
More informationBoundary Conditions For MeanReverting Square Root Process
Boundary Conditions For MeanReverting Square Root Process by Jonathan AquanAssee A research paper presented to the University of Waterloo in fulfillment of the requirement for the degree of Master of
More informationMeasured Capacity of an Ethernet: Myths and Reality
S E P E M B E R 1 9 8 8 WRL Research Report 88/4 Measured Capacity of an Ethernet: Myths and Reality David R. Boggs Jeffrey C. Mogul Christopher A. Kent d i g i t a l Western Research Laboratory 1 Hamilton
More informationErgodicity and Energy Distributions for Some Boundary Driven Integrable Hamiltonian Chains
Ergodicity and Energy Distributions for Some Boundary Driven Integrable Hamiltonian Chains Peter Balint 1, Kevin K. Lin 2, and LaiSang Young 3 Abstract. We consider systems of moving particles in 1dimensional
More information