There are two possible resource-allocation strategies for the quality of service (QoS) guarantee in the Internet: the resource separation and the resource share. The resource-separation strategy allows a prioritised flow to occupy its own network resource, which is physically or logically separated from resources used by other traffic. The resource-sharing strategy secures some portion of network resources for prioritised traffic, but secured resource is shared by all of prioritised flows. This study compares these two resource-allocation strategies in terms of the provided QoS level. It is found that the two strategies form a striking contrast to each other in terms of the resource usage. The resource share can benefit from the statistical multiplexing gain, but it increases the envelope of each individual multiplexed flow. In contrast to this, the resource separation does not increase the envelope of flows so much, while it does not benefit from the statistical multiplexing gain. That is, the general belief that the resource separation like the IntServ provides better QoS is not always true, and various conditions including network topology or QoS target would determine which strategy is preferable.

References

1. 1)
  - X. Yu , L.J.T. Ian , Y.M. Jiang . Queuing processes in GPS and PGPS with LRD traffic inputs. IEEE/ACM Trans. Netw. , 6 , 1442 - 1453
2. 2)
  - 19. Shreedhar, M., Varghese, G.: ‘Efficient fair queueing using deficit roundrobin’, IEEE/ACM Trans. Netw., 1996, 4, (3), pp. 375–385 (doi: 10.1109/90.502236).
3. 3)
  - 8. Shioda, S.: ‘Performance bounds for feedforward queueing networks with upper constrained inputs’, Perform. Eval., 2007, 64, (7–8), pp. 782–801 (doi: 10.1016/j.peva.2007.01.003).
4. 4)
  - 6. Vojnović, M., Le Boudec, J.-Y.: ‘Stochastic analysis of some expedited forwarding networks’. IEEE INFOCOM, 2002.
5. 5)
  - 18. Agrawal, R., Cruz, R.L., Okino, C., Rajan, R.: ‘Performance bounds for flow control protocols’, IEEE/ACM Trans. Netw., 1999, 7, pp. 310–323 (doi: 10.1109/90.779197).
6. 6)
  - 7. Le Boudec, J.-Y., Thiran, P.: ‘Network calculus – a theory of deterministic queueing systems for the internet’ (Springer-Verlag, 2004).
7. 7)
  - 14. Ciucu, F., Schmitt, J.: ‘Perspectives on network calculus: no free lunch, but still good value’. ACM SIGCOMM, 2012, pp. 311–322.
8. 8)
  - 17. Stiliadis, D., Varma, A.: ‘Latency-rate servers: a general model for analysis of traffic scheduling algorithms’, IEEE/ACM Trans. Netw., 1998, 6, (5), pp. 611–624 (doi: 10.1109/90.731196).
9. 9)
  - 12. Fidler, M.: ‘Survey of deterministic and stochastic service curve models in the network calculus’, IEEE Commun. Surv. Tutor., 2010, 12, (1), pp. 59–86 (doi: 10.1109/SURV.2010.020110.00019).
10. 10)
  - 13. Ciucu, F., Hohlfeld, O.: ‘On computing bounds on average backlogs and delays with network calculus’. IEEE ICC, 2010.
11. 11)
  - 15. Boorstyn, R.R., Burchard, A., Liebeherr, J., Oottamakorn, C.: ‘Statistical service assurances for traffic scheduling algorithms’, IEEE J. Sel. Areas Commun., 2000, 18, (12), pp. 2651–2664 (doi: 10.1109/49.898747).
12. 12)
  - 1. Braden, R., Clark, D., Shenker, S.: ‘Integrated services in the Internet architecture: an overview’, RFC 1633, 1994.
13. 13)
  - 24. Yatsuzuka, Y.: ‘Highly sensitive speech detector and high-speed voiceband data discriminator in DSI-ADPCM systems’, IEEE Trans. Commun., 1982, 30, pp. 739–750 (doi: 10.1109/TCOM.1982.1095513).
14. 14)
  - A.K. Parekh , R.G. Gallager . A generalised processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Netw. , 2 , 137 - 150
15. 15)
  - 2. Breslau, L., Knightly, E.W., Shenker, S., Stoica, I., Zhang, H.: ‘Endpoint admission control: architectural issues and performance’. ACM SIGCOMM ‘00, 2000, pp. 57–69.
16. 16)
  - 4. Chang, C.S., Chiu, Y.M., Song, W.T.: ‘On the performance of multiplexing independent regulated inputs’. ACM SIGMETRICS 2001, 2001, pp. 184–193.
17. 17)
  - 25. ITU-T Recommendation G.723.1: ‘Dual rate speech coder for multimedia communications transmitting at 5.3 and 6.3 kbit/s’.
18. 18)
  - 16. Chang, C.S., Cruz, R.L., Le Boudec, J.Y., Thiran, P.: ‘A min, + system theory for constrained traffic regulation and dynamic service guarantees’, IEEE/ACM Trans. Netw., 2002, 10, pp. 805–817 (doi: 10.1109/TNET.2002.804824).
19. 19)
  - 3. Blake, S., Black, D., Carlson, M., et al: ‘An architecture for diffentiated services’, RFC 2475, 1998.
20. 20)
  - 11. Jiang, Y., Yin, Q., Liu, Y., Jiang, S.: ‘Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks’, Comput. Netw., 2009, 53, (12), pp. 2011–2021 (doi: 10.1016/j.comnet.2009.03.004).
21. 21)
  - A.K. Parekh , R.G. Gallager . A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE/ACM Trans. Netw. , 3 , 344 - 357
22. 22)
  - K. Sriram , W. Whitt . Characterizing superposition arrival processes in packet multiplexers for voice and data. IEEE J. Sel. Areas Commun. , 833 - 846
23. 23)
  - 5. Vojnović, M., Le Boudec, J.-Y.: ‘Bounds for independent regulated inputs multiplexed in a service curve network element’, IEEE Trans. Commun., 2003, 51, pp. 735–740 (doi: 10.1109/TCOMM.2003.811383).
24. 24)
  - 9. Nakamura, K., Shioda, S.: ‘Statistical multiplexing of regulated sources having deterministic subadditive envelopes’, J. Oper. Res. Soc. Jpn, 2004, 47, (4), pp. 359–378.
25. 25)
  - 22. ITU-T Recommendation G.729: ‘Coding of speech at 8 kbit/s using conjugate structure algebraic-code-excited linear prediction (CS-ACELP)’.

Fundamental trade-offs between resource separation and resource share for quality of service guarantees

References

Related content