Performance comparison between IntServ-based and DiffServ-based networks

It is generally believed that IntServ architecture is more suitable for strict QoS guarantees than DiffServ architecture because the former has per-flow-base traffic handling mechanisms but the latter does not. This general belief, however, has not been fully verified yet. In this paper, we theoretically and numerically compare IntServ and DiffServ architectures in terms of x-percentile end-to-end queueing delay as well as the maximum end-to-end queueing delay. We find that, in some network topology, DiffServ architecture makes the maximum queueing delay smaller than IntServ architecture does. We also find that in most cases x-percentile queueing delay in DiffServ-based networks is much smaller than that in IntServ-based networks

[1]  Cheng-Shang Chang.  On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering , 1998, IEEE Trans. Inf. Theory.

[2]  Cheng-Shang Chang,et al.  On the performance of multiplexing independent regulated inputs , 2001, SIGMETRICS '01.

[3]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[4]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[5]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.

[6]  Yiwei Thomas Hou,et al.  Virtual time reference system: a unifying scheduling framework for scalable support of guaranteed services , 2000, IEEE Journal on Selected Areas in Communications.

[7]  Jean-Yves Le Boudec,et al.  Stochastic analysis of some Expedited Forwarding networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Shigeo Shioda,et al.  STATISTICAL MULTIPLEXING OF REGULATED SOURCES HAVING DETERMINISTIC SUBADDITIVE ENVELOPES( Network Design, Control and Optimization) , 2004 .

[9]  Chaiwat Oottamakorn,et al.  Statistical service assurances for traffic scheduling algorithms , 2000, IEEE Journal on Selected Areas in Communications.

[10]  Jean-Yves Le Boudec,et al.  Bounds for independent regulated inputs multiplexed in a service curve network element , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[11]  Cheng-Shang Chang,et al.  A min, + system theory for constrained traffic regulation and dynamic service guarantees , 2002, TNET.

[12]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[13]  S. Shioda,et al.  Performance bounds for feedforward queueing networks with upper-constrained inputs , 2007, Perform. Evaluation.