In resource-sharing communication media such as buses

crossbars and networks

multiplexings are inevitable.While sending packets over a multiplexing node

the worst-case delay bound can be computed using network calculus.The tightness of such delay bound remains an open problem.This paper studies different analysis approaches for multiplexing models

from the single multiplexing node to multi-flow-multi-node model

applying two traffic arrival models

and two service properties when getting equivalent service curves.We analyze per-flow delay bounds with different models

then empirically evaluate the tightness of the delay bounds.Our results show the quality of different analysis models

and how influential each parameter is to tightness.