MSLCFinder: An Algorithm in Limited Resources Environment for Finding Top-k Elephant Flows

Round 1

Reviewer 1 Report

First of all, thank you very much for the material you sent. This material is definitely neat.

The methodology is correct. However, it is not sufficiently described. Details were missing. And the authors can supplement it.

The results are correct and well validated.

The authors nevertheless describe the work of other researchers in more detail.

Best regards

Author Response

Please see the attachment.

Author Response File: Author Response.docx

Reviewer 2 Report

The authors proposed a novel strategy, called count-with-uth-level-sampling in this paper, to find top-k elephant flows in limited resource environments. Moreover, the proposed algorithm called MSLCFinder incurs lightweight counter and uth-level multi-sampling with small, constant processing for millions of flows.  Overall, this paper is well written. However, the authors should address the following three oncerns to further improve the quality of this paper.

1- Please add a table for related works in page 2.

2- The energy cost of the proposed strategy should be evaluated.

3- The complexity of the proposed strategy should be evaluated.

Author Response

Please see the attachment

Author Response File: Author Response.docx

Reviewer 3 Report

Comment are as follows.

1) Paper is well written, but authors must compare his results with recent literature.

2)  Explain future work in bit more detail in conclusion section.

Author Response

Please see the attachment.

Author Response File: Author Response.docx