A bifibration of categories is a functor
that is both a Grothendieck fibration as well as an opfibration.
Therefore every morphism in a bifibration has both a push-forward as well as a pullback .
For any category with pullbacks, the codomain fibration is a bifibration.
Dually, for any category with pushouts, the domain opfibration is a bifibration.
Ordinary Grothendieck fibrations correspond to pseudofunctors to Cat, by the Grothendieck construction and hence to prestacks. For these one may consider descent.
If the fibration is even a bifibration, there is a particularly elegant algebraic way to encode its decent properties; this is monadic descent. The Benabou–Roubaud theorem characterizes descent properties for bifibrations.