Real-time traffic service in networks with DiffServ 


Vol. 32,  No. 1, pp. 53-60, Jan.  2007


PDF
  Abstract

We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Joung, "Real-time traffic service in networks with DiffServ," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 1, pp. 53-60, 2007. DOI: .

[ACM Style]

Jinoo Joung. 2007. Real-time traffic service in networks with DiffServ. The Journal of Korean Institute of Communications and Information Sciences, 32, 1, (2007), 53-60. DOI: .

[KICS Style]

Jinoo Joung, "Real-time traffic service in networks with DiffServ," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 1, pp. 53-60, 1. 2007.