The end-to-end delay bound of packets was studied.

Then,this conclusion was generalized to more general cases,and end-to-end delay of packets in the guaranteed rate node-formed network is analyzed according to this conclusion,and a tight delay bound is got.

Simulation shows that the advanced version can observably reduce the end-to-end delay without too much increased overhead compared to AODV.

The maximum end-to-end delay bound, the maximum backlog bound and the effective bandwidth of IntServ guaranteed service are derived.

This paper presents network model and NCS model,analyzes the characteristics,the components and the bottleneck of the end-to-end delay based on the OPNET simulation results,and studies the relationship between the data packet size and delay.

To estimate performance of ESSDRR in end-to-end delay and short-term throughput property,extensive simulation experiments have been done using NS2 in the same condition.

In order to reduce the measurement traffic in network topology inference algorithms based on end to end delay,a cluster measurement method and two step topology inference algorithm are proposed.

This paper implemented end to end delay meas.

Models of bounds on end-to-end delay of long-range dependence traffic based on fractal leaky buckets;

End-to-End Delay Support Using Earliest Deadline First Scheduling;

Theoretical analysis and simulation show that this method can decrease the end-to-end delay of IP packets in optical burst switching network obviously.

Based on the packet-switch network,this paper present a method of computing the end-to-end delay and buffer size.