A method for prioritizing queued data objects for recovery during restore operations in a backup storage system, comprising: identifying a set of data objects queued in a first sequential order; for each data object: obtaining a data criticality associated with the data object; identifying a priority weight for the data object based on the data criticality, and mapping a queue number and a sequence position of the data object to a data point in a Euclidean space, where the queue number identifies a data object queue within which the data object resides, where the sequence position of a data object refers to the position along the sequence of data objects in the data object queue that the data object occupies with respect to the front of that data object queue; identifying a set of data object pairs, each comprising a pair of adjacent queued data objects; for each data object pair of the set of data object pairs: calculating a modified weight-based Euclidean distance between the data point pair in the Euclidean space that maps to the data object pair, wherein the modified weight-based Euclidean distance calculated for each data object pair incorporates the priority weight for each adjacent data object of the data object pair; sorting the set of queued data objects based at least on the modified weight-based Euclidean distance calculated for each data object pair; obtaining, based on the sorting, the set of data objects queued in a second sequential order in which the nearest and most critical data objects are at the front; and transmitting the set of data objects queued in the second sequential order to a target host. identifying a set of data objects queued in a first sequential order; for each data object: obtaining a data criticality associated with the data object; identifying a priority weight for the data object based on the data criticality, and mapping a queue number and a sequence position of the data object to a data point in a Euclidean space, where the queue number identifies a data object queue within which the data object resides, where the sequence position of a data object refers to the position along the sequence of data objects in the data object queue that the data object occupies with respect to the front of that data object queue; identifying a set of data object pairs, each comprising a pair of adjacent queued data objects; for each data object pair of the set of data object pairs: calculating a modified weight-based Euclidean distance between the data point pair in the Euclidean space that maps to the data object pair, wherein the modified weight-based Euclidean distance calculated for each data object pair incorporates the priority weight for each adjacent data object of the data object pair; sorting the set of queued data objects based at least on the modified weight-based Euclidean distance calculated for each data object pair; obtaining, based on the sorting, the set of data objects queued in a second sequential order in which the nearest and most critical data objects are at the front; and transmitting the set of data objects queued in the second sequential order to a target host. obtaining a data criticality associated with the data object; identifying a priority weight for the data object based on the data criticality, and mapping a queue number and a sequence position of the data object to a data point in a Euclidean space, where the queue number identifies a data object queue within which the data object resides, where the sequence position of a data object refers to the position along the sequence of data objects in the data object queue that the data object occupies with respect to the front of that data object queue; identifying a set of data object pairs, each comprising a pair of adjacent queued data objects; for each data object pair of the set of data object pairs: calculating a modified weight-based Euclidean distance between the data point pair in the Euclidean space that maps to the data object pair, wherein the modified weight-based Euclidean distance calculated for each data object pair incorporates the priority weight for each adjacent data object of the data object pair; sorting the set of queued data objects based at least on the modified weight-based Euclidean distance calculated for each data object pair; obtaining, based on the sorting, the set of data objects queued in a second sequential order in which the nearest and most critical data objects are at the front; and transmitting the set of data objects queued in the second sequential order to a target host.