Planning data transfers in grids: a multi‐service queueing approach

Grid applications move large amounts of data between distributed resources, and the efficiency of a Grid depends on their timely delivery within given bounds (deadlines). In most cases, the data volume and deadline are known in advance, allowing for both network planning and connection admission control (textrmCAC). We formally define the problem and, based on this formalization, describe the operation of a feasible procedure for network reservations of deadline‐constrained bulk data transfer requests. The procedure guarantees a minimum bandwidth to meet the deadlines and allows for opportunistic utilization of residual network capacity. We propose a novel analytical model based on the solution of an M/M(nc)/1/k(s)−RPS queue. The analytical model is validated against ns−2 simulations taking into account network level details (IP and TCP protocols), showing remarkably good coherence even under heavy loads. The model is orders of magnitude faster than simulation, which enables its application to plan the capacity of Grid networks, and to enforce CAC under the hypothesis of a dominating bottleneck on the transfer route. Copyright © 2011 John Wiley & Sons, Ltd.

[1]  Miklós Telek,et al.  On providing blocking probability and throughput guarantees in a multi-service environment , 2002, Int. J. Commun. Syst..

[2]  Philippe Robert,et al.  Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Ian T. Foster,et al.  End-to-end quality of service for high-end applications , 2004, Comput. Commun..

[4]  Eitan Altman,et al.  Parallel TCP Sockets: Simple Model, Throughput and Validation , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[5]  Michael Welzl,et al.  Accurate Shared Bottleneck Detection Based On SVD and Outliers Detection , 2008 .

[6]  Michael Welzl,et al.  On the Accurate Identification of Network Paths Having a Common Bottleneck , 2013, TheScientificWorldJournal.

[7]  Marco Mellia,et al.  A new class of QoS routing strategies based on network graph reduction , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Michael Welzl,et al.  An End-to-End QoS Mechanism for Grid Bulk Data Transfer for Supporting Virtualization ∗ , 2007 .

[9]  Huyin Zhang,et al.  Flexible Advance Reservation for Grid Computing , 2004, GCC.

[10]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[11]  Yaakov Kogan,et al.  Dimensioning bandwidth for elastic traffic in high-speed data networks , 2000, TNET.

[12]  Ian Foster,et al.  A quality of service architecture that combines resource reservation and application adaptation , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[13]  Thomas Bonald,et al.  Congestion at flow level and the impact of user behaviour , 2003, Comput. Networks.

[14]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..

[15]  Ashraf S. Hasan Mahmoud,et al.  Performance analysis of two throughput-based call admission control schemes for 3G WCDMA wireless networks supporting multiservices , 2008, Comput. Commun..

[16]  Elio Salvadori,et al.  Dynamic grooming in IP over optical networks based on the overlay architecture , 2006, Opt. Switch. Netw..

[17]  Thomas Bonald,et al.  Performance modeling of elastic traffic in overload , 2001, SIGMETRICS '01.

[18]  Michael Welzl,et al.  Grid Network Dimensioning by Modeling the Deadline Constrained Bulk Data Transfers , 2009, 2009 11th IEEE International Conference on High Performance Computing and Communications.

[19]  Murali S. Kodialam,et al.  Fast network re-optimization schemes for MPLS and optical networks , 2006, Comput. Networks.

[20]  Pascale Vicat-Blanc Primet,et al.  Flow scheduling and endpoint rate control in GridNetworks , 2009, Future Gener. Comput. Syst..

[21]  Javeria Iqbal,et al.  A network topology mapping tool for the grid , 2009, FIT.

[22]  César A. F. De Rose,et al.  Performance issues of bandwidth reservations for grid computing , 2003, Proceedings. 15th Symposium on Computer Architecture and High Performance Computing.

[23]  Chanle Wu,et al.  An Adaptive Advance Reservation Mechanism for Grid Computing , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

[24]  Zhong Fan.  Dimensioning Bandwidth for Elastic Traffic , 2002, NETWORKING.

[25]  Klara Nahrstedt,et al.  A distributed resource management architecture that supports advance reservations and co-allocation , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[26]  Rajkumar Buyya,et al.  A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids , 2005, ICA3PP.

[27]  Sumit Naiksatam,et al.  Elastic reservations for efficient bandwidth utilization in LambdaGrids , 2007, Future Gener. Comput. Syst..

[28]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[29]  J. W. Roberts,et al.  A survey on statistical bandwidth sharing , 2004, Comput. Networks.