The choice of the packet service disciplines is an important issue in providing guaranteed performance service at switching nodes. The service disciplines at a switching node control the order in which packets are serviced and thus determine how packets from different connections interact with each other. In addition, we also need to guarantee the bounds on end-to-end performance in a networking environment, where traffic dynamics are more complex than in a single switching node. In this paper, we give an overview of these proposed service disciplines. Furthermore, we analyze the delay bounds and fairness property of the Hierarchical Packet Fair Queuing (H-PFQ) algorithm.