Achieving Bursty Traffic Guarantees by Integrating Traffic Engineering and Buffer Management Tools

  • Miriam Allalouf
  • Yuval Shavitt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3976)

Abstract

Traffic engineering tools are applied to design a set of paths, e.g., using MPLS, in the network in order to achieve global network utilization. Usually, paths are guaranteed long-term traffic rates, while the short-term rates of bursty traffic are not guaranteed. The resource allocation scheme, suggested in this paper, handles bursts based on maximal traffic volume allocation (termed TVAfB) instead of a single maximal or sustained rate allocation. This translates to better SLAs to the network customers, namely SLAs with higher traffic peaks, that guarantees burst non-dropping. Given a set of paths and bandwidth allocation along them, the suggested algorithm finds a special collection of bottleneck links, which we term the first cut, as the optimal buffering location for bursts. In these locations, the buffers act as an additional resource to improve the network short-term behavior, allowing traffic to take advantage of the under-used resources at the links that precede and follow the bottleneck links. The algorithm was implemented in MATLAB. The resulted provisioning parameters were simulated using NS-2 to demonstrate the effectiveness of the proposed scheme.

References

  1. 1.
    Allalouf, M., Shavitt, Y.: Centralized and distributed approximation algorithms for routing and weighted max-min fair bandwidth allocation. In: IEEE HPSR 2005 (2005)Google Scholar
  2. 2.
    Nichols, K., Jacobson, V., Zhang, L.: A two-bit differentiated services architecture for the internet – RFC. In: Jeuring, J., Jones, S.L.P. (eds.) AFP 2002. LNCS, vol. 2638, pp. 469–498. Springer, Heidelberg (2003)Google Scholar
  3. 3.
    Cruz, R.L.: A calculus for network delay part II: Network analysis. IEEE Trans. on Information Theory 37, 132–141 (1991)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Parekh, A.K., Gallagher, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Transactions on Networking 2, 137–150 (1994)CrossRefGoogle Scholar
  5. 5.
    Georgiadis, L., Guérin, R., Peris, V., Sivarajan, K.N.: Efficient network QoS provisioning based on per node traffic shaping. IEEE/ACM Transactions on Networking 4 (1996)Google Scholar
  6. 6.
    Yaron, O., Sidi, M.: Generalized processor sharing networks with exponentially bounded burstiness arrivals. In: INFOCOM, vol. (2), pp. 628–634 (1994)Google Scholar
  7. 7.
    Christin, N., Liebeherr, J., Abdelzaher, T.: A quantitative assured forwarding service. In: IEEE INFOCOM 2002, New York, NY, USA (2002)Google Scholar
  8. 8.
    Liebeherr, J.: A note on statistical multiplexing and scheduling in video networks at high data rates (2002)Google Scholar
  9. 9.
    Clark, D., Lehr, W., Liu, I.: Provisioning for bursty internet traffic: Implications for industry structure. In: MIT ITC Workshop on Internet Quality of Service (1999)Google Scholar
  10. 10.
    Guerin, R., Ahmadi, H., Naghshineh, M.: Equivalent bandwidth and its application to bandwidth allocation in high-speed networks. IEEE Journal on Selected Areas in Communications 9, 968–981 (1991)CrossRefGoogle Scholar
  11. 11.
    Biton, E., Orda, A.: Qos provision and routing with stochastic guarantees. In: QShine 2004 (2004)Google Scholar
  12. 12.
    Allalouf, M., Shavitt, Y.: Achieving bursty traffic guarantees by integrating traffic engineering and buffer management tools. Technical report, Dept. of EE, Tel Aviv University, EES2005-50 (2005)Google Scholar
  13. 13.
    Dhamdhere, A., Jiang, H., Dovrolis, C.: Buffer sizing for congested internet links. In: INFOCOM 2005 (2005)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Miriam Allalouf
    • 1
  • Yuval Shavitt
    • 1
  1. 1.School of Electrical EngineeringTel Aviv UniversityIsrael

Personalised recommendations