Performance Analysis of Multilayered Multipriority Asymmetric-Sized Delta Networks

Algorithm 2

Unicast-forwarding for multilayered, multipriority MINs.

Unicast-Forwarding (cs_id, cl_id, nl_id, sq_id, aq_id, pr_id)

Input: Current Stage_id (cs_id); Current and Next Stage Layer_id (cl_id, nl_id) of Send- and Accept-Queue/s respectively;

     Send-Queue_id (sq_id) of Current Stage; Accept-Queue_id (aq_id) of Next Stage; Priority_id (pr_id).

Output: Population for Send- and Accept-Queues (Pop); total number of Serviced and Blocked packets for Send-

        (Serviced, Blocked) respectively; total number of packet delay cycles for Send-Queue (Delay);

        Routing Address RA of each buffer position of queue

{

    if (Pop[aq_id][cs_id+1][nl_id][pr_id] = B[cs_id+1] [pr_id]) // Blocking State;

    // where B[cs_id+1] [pr_id] is the buffer-size of the pr_id-class Accept-Queue of Next Stage cs_id + 1

        Blocked[sq_id][cs_id][cl_id][pr_id] = Blocked[sq_id][cs_id][cl_id][pr_id] + 1;

   else // unicast-forwarding

   {

      Serviced[sq_id][cs_id][cl_id][pr_id] =       Serviced[sq_id][cs_id][cl_id][pr_id] + 1;

      Pop[sq_id][cs_id][cl_id][pr_id] = Pop[sq_id][cs_id][cl_id][pr_id] − 1;

      Pop[aq_id][cs_id + 1][nl_id][pr_id] = Pop[aq_id][cs_id + 1][nl_id][pr_id] + 1;

      RA[aq_id][cs_id + 1][nl_id][pr_id][Pop[aq_id][cs_id+1][nl_id][pr_id]] = RA[sq_id][cs_id][cl_id][pr_id] [1];

      for (bf_id =1; bf_id ≥Pop[sq_id][cs_id][cl_id][pr_id]; bf_id++)

          RA[sq_id][cs_id][cl_id][pr_id][bf_id] = RA[sq_id][cs_id][cl_id][pr_id][bf_id+ 1]; // where RA is the Routing Address

          // of the packet located at (bf_id)th position of Send-Queue

  }

 Delay[sq_id][cs_id][cl_id][pr_id] = Delay[sq_id][cs_id][cl_id][pr_id] + Pop[sq_id][cs_id][cl_id][pr_id];

 return Pop, Serviced, Blocked, Delay, RA;

}