Skip to main content
SpringerLink
Log in

Capacity Planning of DiffServ Networks with Best-Effort and Expedited Forwarding Traffic

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

For networks providing a specific level of service guarantees, capacity planning is an imperative part of network management. Accurate dimensioning is especially important in DiffServ networks, where no per-flow signaling or control exists. In this paper, we address the problem of capacity planning for DiffServ networks with only Expedited Forwarding (EF) and best effort (BE) traffic classes. The problem is formulated as an optimization problem, where the total link cost is minimized, subject to the performance constraints of both EF and BE classes. The edge to edge EF demand pairs and the BE demands on each link are given. The variables to be determined are the non-bifurcated routing of EF traffic, and the discrete link capacities. We show that Lagrangian relaxation and subgradient optimization methods can be used to effectively solve the problem. Computational results show that the solution quality is verifiably good while the running time remains reasonable on practical-sized networks. This represents the first work for capacity planning of multi-class IP networks with non-linear performance constraints and discrete link capacity constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Ahuja, T. Magnanti and J. Orlin, Network Flows, Theory, Algorithms and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1993).

    Google Scholar 

  2. A. Amiri, A system for the design of packet-switched communication networks with economic tradeoffs, Computer Communications 21(18) (1998) 1670-1680.

    Article  Google Scholar 

  3. S. Ano, T. Hasegawa and N. Decre, Experimental TCP performance evaluation on diffserv AF PHBs over ATM SBR service, Telecommunication Systems 19(3/4) (2000) 425-441.

    Article  Google Scholar 

  4. M. Avriel, Nonlinear Programming (Prentice-Hall, Englewood Cliffs, NJ, 1976).

    Google Scholar 

  5. S. Blake et al., An architecture for differentiated service, IETF RFC 2475 (1998).

  6. B.E. Carpenter and K. Nichols, Differentiated services in the internet, Proceedings of the IEEE 90(9) (2002) 1479-1494.

    Article  Google Scholar 

  7. A. Charny and J.-Y.L. Boudec, Delay bounds in network with aggregate scheduling, in: Proc. of the 1st Internat. Workshop on Quality of Future Internet Service, Berlin, Germany, 2000, pp. 1-13.

  8. O. Crochat and J.L. Boudec, Design protection for WDM optical networks, IEEE Journal on Selected Areas in Communications 16(7) (1998) 1158-1165.

    Article  Google Scholar 

  9. B. David et al., An expedited forwarding PHB, IETF RFC 3246 (2002).

  10. L. Fratta, M. Gerla and L. Kleinrock, The flow deviation method: An approach to store-and-forward communication network design, Networks 3(2) (1973) 97-133.

    Google Scholar 

  11. B. Gavish and S. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Transactions on Communications 31(10) (1983) 1154-1161.

    Article  Google Scholar 

  12. B. Gavish and I. Neuman, Capacity and flow assignment in large computer networks, in: Proc. of IEEE INFOCOM' 86, IEEE, 1986, pp. 275-284.

  13. B. Gavish and I. Neuman, A system for routing and capacity assignment in computer networks, IEEE Transactions on Communications 37(4) (1989) 360-366.

    Article  Google Scholar 

  14. M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Transactions on Communications 25(1) (1977) 48-60.

    Article  Google Scholar 

  15. M. Gerla, J. Monteiro and R. Pazos, Topology design and bandwidth allocation in ATM nets, IEEE Journal on Selected Areas in Communications 7(8) (1989) 1253-1262.

    Article  Google Scholar 

  16. H. Gersht and R. Weihmayer, Joint optimization of data network design and facility location, IEEE Journal on Selected Areas in Communications 8(9) (1990) 149-152.

    Article  Google Scholar 

  17. O.I. Gerstel and S. Zaks, The layout of virtual paths in ATM networks, IEEE/ACM Transactions on Networking 4(6) (1996) 873-884.

    Article  Google Scholar 

  18. M. Girish, B. Zhou and J. Hu, Formulation of the traffic engineering problems in MPLS based IP networks, in: Proc. of the 5th IEEE Symposium on Computers and Communications, 2000, pp. 214-219.

  19. C.M. Grotschel and M. Stoer, Network Models, Handbooks in Operations Research and Management Science, Vol. 7 (North-Holland, Amsterdam, 1995) chapter 10, pp. 617-672.

    Google Scholar 

  20. V. Jacobson, K. Nichols and K. Poduri, An expedited forwarding PHB, IETF RFC 2598 (1999).

  21. S. Keshav, An Engineering Approach to Computer Networking (Addison-Wesley, Reading, MA, 1997).

    Google Scholar 

  22. L. Kleinrock, Queueing Systems, Vol. II: Computer Application (Wiley Interscience, New York, 1976).

    Google Scholar 

  23. J. Martin and A. Nilsson, On service level agree ments for IP networks, in: Proc. of IEEE INFOCOM' 02, IEEE, New York, 2002.

  24. D. Medhi, Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks, IEEE/ACMTransactions on Networking 3(6) (1995) 809-818.

    Article  Google Scholar 

  25. D. Medhi and D. Tipper, Some approaches to solving a multihour broadband network capacity design problem with single-path routing, Telecommunication Systems 13(2-4) (2000) 269-291.

    Article  Google Scholar 

  26. D. Mitra, J. Morrison and K. Ramakrishnan, ATMnetwork design and optimization: A multi-rate loss network framework, IEEE/ACMTransactions on Networking 4(4) (1996) 531-543.

    Article  Google Scholar 

  27. E. Modiano and A. Narula-Tam, Survivable routing of logical topologies in WDM networks, in: Proc. of IEEE INFOCOM' 01, Vol. 1, 2001, pp. 348-357.

    Google Scholar 

  28. R. Morris and D. Lin, Variance of aggregated web traffic, in: Proc. of IEEE INFOCOM' 00, IEEE, Tel Aviv, Israel, 2000, pp. 360-366.

  29. T. Ng and D. Hoang, Joint optimization of capacity and flow assignment in a packet-switched communication network, IEEE Transactions on Communications 35(2) (1987) 202-209.

    Google Scholar 

  30. K. Nichols, V. Jacobson and L. Zhang, A two-bit differentiated services architecture for the Internet, IETF RFC 2638 (1999).

  31. NLANR passive measurement and analysis project, http://pma.nlanr.net (2001).

  32. V. Paxson and S. Floyd, Wide-area traffic: The failure of poisson modeling, in: Proc. of ACM SIGCOMM' 94, 1994, London.

  33. H. Pirkul and A. Amiri, Routing in packet-switched communication networks, Computer Communications 17(5) (1994) 307-316.

    Article  Google Scholar 

  34. P. Sinha and A. Zoltners, The multiple choice knapsack problem, Operation Research 27(3) (1979) 503-515.

    Google Scholar 

  35. D. Tcha and K. Maruyama, On the selection of primary paths for a communication network, Computer Networks and ISDN Systems 9(4) (1985) 257-265.

    Article  Google Scholar 

  36. X. Tian, J. Wu and C. Ji, A unified framework for understanding network traffic using independent wavelet models, in: Proc. of IEEE INFOCOM' 02, IEEE, New York, 2002.

  37. J. Yen, Finding the K shortest loopless paths in a network, Management Science 17(11) (1971) 712-716.

    Google Scholar 

  38. E. Zegura, K. Calvert and M.J. Donahoo, A quantitative comparison of graph-based models for Internet topology, IEEE/ACM Transactions on Networks 5(6) (1997) 770-783.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departments of Electrical and Computer Engineering and Computer Science, North Carolina State University, USA

    Kehang Wu & Douglas S. Reeves

Authors
  1. Kehang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Douglas S. Reeves
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, K., Reeves, D.S. Capacity Planning of DiffServ Networks with Best-Effort and Expedited Forwarding Traffic. Telecommunication Systems 25, 193–207 (2004). https://doi.org/10.1023/B:TELS.0000014781.92903.7f

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:TELS.0000014781.92903.7f

Search

Navigation