Localized QoS Routing with End-to-End Delay Guarantees

Propose a new algorithm of routing with information collected locally

“…Using end-to-end Delay to be constraint, many other localized routing algorithms were proposed recently such as [15]. One of them is Localized Delay-Constrained QoS Routing algorithm (ldcr) [15].…”

“…To evaluate the results, we collect all of parameters of simulation as vectors, scalars and histograms to compare. The setup of simulation experiments is similar to the simulation in [10][11][12][13][14][15], described as follows: network built with 32 nodes, links of these nodes are all bidirectional with the same capacity C = 150Mbps in each direction and the same value of delay D = 10ms, flows arrive to each source node according to a Poisson process with rate λ and destination nodes are randomly selected (each node is capable of being both source and destination), flow duration is exponentially distributed with mean 1/µ, flow bandwidths are uniformly distributed within [0. . Network is performed in Fig.…”

“…To compare with other schemes, we choose flow blocking and bandwidth blocking probabilities as criteria as well as the simulation in [10][11][12][13][14][15]. The blocking probabilities are calculated based on the most recent 100,000 flows.…”