In this paper, the authors consider the framed ALOHA protocol for a finite number of terminals. Terminals are single-buffered, i.e. each one can store only one data packet. They derive the throughput and the delay under two types of queue disciplines, First-In-First-Out (FIFO) and Last-In-First-Out (LIFO). It is assumed that terminals are independent each other and generate packets of constant size according to a Bernoulli process. The one slot duration equals to the one packet transmission. The analysis is carried out by means of Markovian tools. Some discussion on the applicability of that protocol is addressed.