This paper analyzes transient characteristics of Gaussian queues. More specifically, we determine the logarithmic asymptotics of P(Q 0 > pB, Q T B > qB), where Q t denotes the workload at time t. For any pair (p, q), three regimes can be distinguished: (A) For small values of T , one of the events {Q 0 > pB} and {Q T B > qB} will essentially imply the other. (B) Then there is an intermediate range of values of T for which it is to be expected that both {Q 0 > pB} and {Q T B > qB} are tight (in that none of them essentially implies the other), but that the time epochs 0 and T lie in the same busy period with overwhelming probability. (C) Finally, for large T , still both events are tight, but now they occur in different busy periods with overwhelming probability. For the short-range dependent case, explicit calcula- Queueing Syst (2009) 62: 383-409 tions are presented, whereas for the long-range dependent case, structural results are proven.