Update linked lists after packet is read

• Remove from queue(i):

• • last block in queue(i)
    • queue(i).empty ?1
    • queue(i) had more than one element
      • next block in queue(i), becomes new head of queue(i)

Previous slide

Next slide

Back to first slide

View graphic version