The connection optimisation problem for two types of multipoint videoc
onferences is formulated. The first type is called a selectable media
conference. In this type each conferee can choose to receive a particu
lar video composition. In the second type, called a common media confe
rence, only one composite video is generated for all conferees in this
type of conference. Algorithms that use a combination of look-up tabl
e and online processing are designed for computation of the optimal pa
ths for connecting the conference sites. The blocking probabilities fo
r these two types of videoconference in fully connected networks are d
erived and compared. The sensitivity of network throughput to conferen
ce-size distribution is also studied.