In this paper, the authors summarize the results of network calculus, describe two fundamental network calculus tools, i.e. arrival curve and service curve. Some results including the bottleneck effect of service curves, the optimal and approximate deterministic end-to-end delay bounds, and the service curve for a network node offering guaranteed service are obtained in this paper. Finally, the authors compute the deterministic end-to-end delay bounds in guaranteed service with rate latency and PGPS (packetized generalized processor sharing) service curves.