Skip to main content
. 2021 Feb 3;7:e342. doi: 10.7717/peerj-cs.342

Algorithm 1. Priority assignment algorithm.

Priority(delayiT, STestk)
if delayiT ≤ STestk then
 return (H)
else if T1 < delayiT ≤ T2 then
 if SBCAT = 1 then
  return (H)
 else if SBCAT = 2 then
  return (M)
 else if SBCAT = 3 then
  return (L)
else if delayiT > T2 then
 if SBCAT = 1 then
  if QH is not full then
   return (H)
  else
   return (M)
 else if SBCAT = 2 then
  if QM is not full then
   return (M)
  else
   return (L)
 else if SBCAT = 3 then
  return (L)