On the validity of flow-level tcp network models for grid and cloud simulations

Researchers in the area of grid/cloud computing perform many of their experiments using simulations that must capture network behavior. In this context, packet-level simulations, which are widely used to study network protocols, are too costly given the typical large scales of simulated systems and applications. An alternative is to implement network simulations with less costly flow-level models. Several flow-level models have been proposed and implemented in grid/cloud simulators. Surprisingly, published validations of these models, if any, consist of verifications for only a few simple cases. Consequently, even when they have been used to obtain published results, the ability of these simulators to produce scientifically meaningful results is in doubt. This work evaluates these state-of-the-art flow-level network models of TCP communication via comparison to packet-level simulation. While it is straightforward to show cases in which previously proposed models lead to good results, instead we follow the critical method, which places model refutation at the center of the scientific activity, and we systematically seek cases that lead to invalid results. Careful analysis of these cases reveals fundamental flaws and also suggests improvements. One contribution of this work is that these improvements lead to a new model that, while far from being perfect, improves upon all previously proposed models in the context of simulation of grids or clouds. A more important contribution, perhaps, is provided by the pitfalls and unexpected behaviors encountered in this work, leading to a number of enlightening lessons. In particular, this work shows that model validation cannot be achieved solely by exhibiting (possibly many) “good cases.” Confidence in the quality of a model can only be strengthened through an invalidation approach that attempts to prove the model wrong.

[1]  Margo I. Seltzer,et al.  Network Coordinates in the Wild , 2007, NSDI.

[2]  Chris Fleizach CSE 262 Readings : May 11 . 2006 Task Scheduling Strategies for Workflow based Applications in Grids , 2015 .

[3]  Kees Verstoep,et al.  Fast Measurement of LogP Parameters for Message Passing Platforms , 2000, IPDPS Workshops.

[4]  Peng Xie,et al.  Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[6]  Fumihiko Ino,et al.  LogGPS: a parallel computational model for synchronization analysis , 2001, PPoPP '01.

[7]  Henri Casanova,et al.  A Network Model for Simulation of Grid Application , 2002 .

[8]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM 2002.

[9]  Chris J. Scheiman,et al.  LogGP: incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation , 1995, SPAA '95.

[10]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[11]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[12]  Henri Casanova,et al.  Speed and accuracy of network simulation in the SimGrid framework , 2007, ValueTools '07.

[13]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[14]  Dah-Ming Chiu,et al.  Some observations on fairness of bandwidth sharing , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.

[15]  A. Lumsdaine,et al.  LogGOPSim: simulating large-scale applications in the LogGOPS model , 2010, HPDC '10.

[16]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[17]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[18]  R. Srikant,et al.  A Mathematical Framework for Designing a Low-Loss, Low-Delay Internet , 2004 .

[19]  Lachlan L. H. Andrew,et al.  Queue Dynamics With Window Flow Control , 2010, IEEE/ACM Transactions on Networking.

[20]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[21]  Lachlan L. H. Andrew,et al.  Window Flow Control: Macroscopic Properties from Microscopic Factors , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[22]  Laxmikant V. Kalé,et al.  BigSim: a parallel simulator for performance prediction of extremely large parallel machines , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[23]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[24]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[25]  Walter Willinger,et al.  The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[26]  Matthew Doar,et al.  A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[27]  George F. Riley,et al.  The Georgia Tech Network Simulator , 2003, MoMeTools '03.

[28]  Kostas Pentikousis Connector: active queue management , 2001, CROS.

[29]  Jesús Carretero,et al.  Design of a New Cloud Computing Simulation Platform , 2011, ICCSA.

[30]  Giovanni Pau,et al.  TCP Libra : Exploring RTT-Fairness for TCP , 2007, Networking.

[31]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[32]  Prithviraj Banerjee,et al.  Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM Compiler , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[33]  Rajkumar Buyya,et al.  CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms , 2011, Softw. Pract. Exp..

[34]  Manish Jain,et al.  The tcp bandwidth-delay product revisited: network buffering , 2003 .

[35]  Lachlan L. H. Andrew,et al.  ACK-Clocking Dynamics: Modelling the Interaction between Windows and the Network , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[36]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[37]  Omar Elloumi,et al.  RED behavior with different packet sizes , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.

[38]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[39]  Teerawat Issariyakul,et al.  Introduction to Network Simulator NS2 , 2008 .

[40]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[41]  M. Frans Kaashoek,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM 2004.

[42]  S. Low,et al.  Understanding Vegas: a duality model , 2002 .

[43]  FaloutsosMichalis,et al.  On power-law relationships of the Internet topology , 1999 .

[44]  Henri Casanova,et al.  Scheduling distributed applications: the SimGrid simulation framework , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[45]  Mary Baker,et al.  Narses: A Scalable Flow-Based Network Simulator , 2002, ArXiv.

[46]  LegrandArnaud,et al.  On the validity of flow-level tcp network models for grid and cloud simulations , 2013 .

[47]  Márk Jelasity,et al.  PeerSim: A scalable P2P simulator , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[48]  Anthony McGregor,et al.  Validation of simulated real world TCP stacks , 2007, 2007 Winter Simulation Conference.

[49]  R. Swinburne OBJECTIVE KNOWLEDGE: AN EVOLUTIONARY APPROACH , 1973 .

[50]  Karl Henrik Johansson,et al.  ACK-Clocking Dynamics: Modelling the Interaction between Windows and the Network , 2008, INFOCOM 2008.

[51]  Henri Casanova,et al.  SimGrid: A Generic Framework for Large-Scale Distributed Experiments , 2008, Tenth International Conference on Computer Modeling and Simulation (uksim 2008).

[52]  Jean C. Walrand,et al.  Analysis and comparison of TCP Reno and Vegas , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[53]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM 1991.

[54]  Kurt Stockinger,et al.  OptorSim-A Grid Simulator for Studying Dynamic Data Replication Strategies , 2003 .

[55]  Xiaohong Jiang,et al.  An Energy-Efficient Scheme for Cloud Resource Provisioning Based on CloudSim , 2011, 2011 IEEE International Conference on Cluster Computing.

[56]  Radu Prodan,et al.  Dynamic Cloud provisioning for scientific Grid workflows , 2010, 2010 11th IEEE/ACM International Conference on Grid Computing.

[57]  Laxmikant V. Kalé,et al.  Performance modeling and programming environments for petaflops computers and the Blue Gene machine , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[58]  Andrzej Duda,et al.  Two-way TCP connections: old problem, new insight , 2011, CCRV.

[59]  Robert Tappan Morris,et al.  Comparing the Performance of Distributed Hash Tables Under Churn , 2004, IPTPS.

[60]  Jean-Marc Vincent,et al.  Detection and analysis of resource usage anomalies in large distributed systems through multi‐scale visualization , 2012, Concurr. Comput. Pract. Exp..

[61]  Salim Hariri,et al.  Task scheduling algorithms for heterogeneous processors , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[62]  Ken Kennedy,et al.  TaskScheduling Strategies forWorkflow-based Applications inGrids , 2005 .

[63]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[64]  Steven H. Low,et al.  Understanding TCP Vegas: a duality model , 2002 .

[65]  András Varga,et al.  An overview of the OMNeT++ simulation environment , 2008, SimuTools.

[66]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[67]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[68]  Hwangnam Kim,et al.  MR-CloudSim: Designing and implementing MapReduce computing model on CloudSim , 2012, 2012 International Conference on ICT Convergence (ICTC).

[69]  Arnaud Legrand,et al.  Accuracy study and improvement of network simulation in the SimGrid framework , 2009, SimuTools.

[70]  Lei Yu,et al.  SimMapReduce: A Simulator for Modeling MapReduce Framework , 2011, 2011 Fifth FTRA International Conference on Multimedia and Ubiquitous Engineering.

[71]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[72]  K. Popper Objective Knowledge: An Evolutionary Approach , 1972 .

[73]  Lucas Mello Schnorr,et al.  Triva: Interactive 3D visualization for performance analysis of parallel applications , 2010, Future Gener. Comput. Syst..

[74]  Henri Casanova,et al.  Single Node On-Line Simulation of MPI Applications with SMPI , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[75]  Henri Casanova,et al.  Simgrid: a toolkit for the simulation of application scheduling , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[76]  Robert Tappan Morris,et al.  A performance vs. cost framework for evaluating DHT design tradeoffs under churn , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[77]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[78]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[79]  Ewa Deelman,et al.  WorkflowSim: A toolkit for simulating scientific workflows in distributed environments , 2012, 2012 IEEE 8th International Conference on E-Science.

[80]  Ingmar Baumgart,et al.  OverSim: A scalable and flexible overlay framework for simulation and real network applications , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[81]  Rajkumar Buyya,et al.  GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing , 2002, Concurr. Comput. Pract. Exp..