\documentclass[11pt]{article}
\usepackage{graphicx}
\usepackage[english]{babel}
\usepackage{amsmath}
\usepackage{mathtools}
\begin{document}

\title{Summary of changes}
\author{\textit{Best effort strategy and virtual load for  asynchronous iterative load balancing}}

\date{}
\maketitle

\textbf{We thank the editor and both reviewers for their valuable comments and efforts which helped us improve this paper. Below, some details and answers are provided corresponding to their comments.}
 

\vspace{1cm}
%\tableofcontents



%\newpage

\section*{Reviewer  1}

\vspace{0.3cm}

\textit{ The paper considers asynchronous load balancing algorithms based on
earlier work by Bertsekas and Tsitsiklis.
A new best effort strategy is proposed that tries to balance the load
of a node by sending some load to neighboring nodes with less load.
The goal is an even distribution of the load.
Load information messages are used between neighboring nodes to enable these
neighboring nodes to determine the amount of load to distribute in case of a
currently uneven distribution.
An experimental evaluation is provided using the SimGrid framework for different
topologies (line, torus, cube).}

\textit{
The paper is generally well written and addresses a useful problem.
The new algorithm is described in detail and it provides advantages over
the previous algorithm by Bertsekas and Tsitsiklis.
The experimental evaluation with SimGrid is detailed.
It would have been interesting to see a comparison with some of the more recent
load balancing algorithms described in the section on related work, see
references [7,9,24] as examples.
The paper needs some proof-reading due to several typos.
Nevertheless, the paper is suitable for publication.}


\textbf{BLABLALA}

\vspace{0.3cm}

\newpage
\section*{Reviewer  2}
\textit{This paper is about a practical implementation of a strategy for iterative load balancing using a best effort strategy. The idea is to send data to the neighbors that are under the average load in order to obtain that each neighbor has exactly the average.\\
To avoid the ping-pong effect they use a k-factor to reduce the amount of load. They also distinguish between control message (metadata about the load that is going to be exchanged) and data message (actual exchanged load) that allows to have a more precise and fast estimation of the load at a given time.\\
The experiments are convincing and I like very much the discussion about the data and the conclusion drawn from them. I think the authors did a very good job in that aspect. }

\subsection*{Request 1: My only concern is the section 5.2. I did not understand clearly what is this k-factor. The authors say, "Roughly speaking...", I do not what a fuzzy explanation but I need a correct, precise and operational description of that aspect of the work. I think the authors should present a clear explanation of what they do.     
}

\textbf{BLABLALA}



\end{document}




