article

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

Authors:

Douglas S. ReevesAuthors Info & Claims

Telecommunications Systems, Volume 25, Issue 3-4

Pages 193 - 207

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

Published: 01 March 2004 Publication History

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.

References

[1]

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

[2]

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

Digital Library

[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.

[4]

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

[5]

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

Digital Library

[6]

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

[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.

Digital Library

[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.

[11]

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

[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.

[14]

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

[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.

Digital Library

[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.

[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.

Digital Library

[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.

[20]

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

Digital Library

[21]

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

[22]

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

[23]

J. Martin and A. Nilsson, On service level agreements 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/ACM Transactions on Networking 3(6) (1995) 809-818.

Digital Library

[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.

[26]

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

Digital Library

[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.

[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.

[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.

Digital Library

[34]

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

Digital Library

[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.

[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.

[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.

Digital Library

Cited By

Davy ABotvich DJennings B(2006)An efficient process for estimation of network demand for qos-aware IP network planningProceedings of the 6th IEEE international conference on IP Operations and Management10.1007/11908852_11(120-131)Online publication date: 23-Oct-2006
https://dl.acm.org/doi/10.1007/11908852_11

Capacity Planning of DiffServ Networks with Best-Effort and Expedited Forwarding Traffic
1. Networks
  1. Network services

Recommendations

Expedited forwarding end-to-end delay and jitter in DiffServ

The scheduling disciplines and active buffer management represent the main components employed in the differentiated services (DiffServ) data plane, which provide qualitative per-hop behaviors corresponding to the QoS required by supported traffic ...
Invited A new traffic engineering manager for DiffServ/MPLS networks: design and implementation on an IP QoS Testbed

In a multi-service network, different applications have varying QoS requirements. The IETF has proposed the DiffServ architecture as a scalable solution to provide Quality of Service (QoS) in IP Networks. In order to provide quantitative guarantees and ...
A scalable QoS routing model for diffserv over MPLS networks

In this paper, we present a new Quality of Service (QoS) routing model for Differentiated Services (Diffserv) over Multiprotocol Label Switching (MPLS) networks. We use a pre-established multi-path model in which several MPLS label switching paths (LSPs)...

Comments

Information & Contributors

Information

Published In

cover image Telecommunications Systems

Telecommunications Systems Volume 25, Issue 3-4

March 2004

292 pages

ISSN:1018-4864

Issue’s Table of Contents

Copyright © Copyright © 2004 Kluwer Academic Publishers.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 March 2004

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Davy ABotvich DJennings B(2006)An efficient process for estimation of network demand for qos-aware IP network planningProceedings of the 6th IEEE international conference on IP Operations and Management10.1007/11908852_11(120-131)Online publication date: 23-Oct-2006
https://dl.acm.org/doi/10.1007/11908852_11

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents