Advances, Systems and Applications
Table 1 AIAO primitives
From: Making programmable packet scheduling time-sensitive with a FIFO queue
Primitive | Function |
|---|---|
enqueue(pkt) | inserts a packet or a sequence of packets into the end of the FIFO queue |
dequeue() | takes a packet from the head of the FIFO queue |
drop(pkt) | discards a packet, preventing it from entering the FIFO queue |
store(pkt) | puts a TS packet into a register and returns the register’s address |
retrieve(addr) | retrieves a TS packet from the register indicated by its address addr |