Capacity planning of DiffServ networks with best-effort and expedited forwarding traffic

Telecommunication Systems

Volumn 25, Issue 3-4, 2004, Pages 193-207

  Wu, Kehang ^a   Reeves, Douglas S ^a  

^a North Carolina State University   (United States)

Author keywords

Capacity planning; Diffserv; Lagrangian relaxation

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER NETWORKS; COST EFFECTIVENESS; ELECTRONIC COMMERCE; GRADIENT METHODS; LAGRANGE MULTIPLIERS; OPTIMIZATION; PACKET NETWORKS; PACKET SWITCHING; PORTALS; ROUTERS; TELECOMMUNICATION LINKS;

CAPACITY PLANNING; DIFFSERV; LAGRANGIAN RELAXATION (LR); NETWORK MANAGEMENT (NM);

DIGITAL COMMUNICATION SYSTEMS;

EID: 3543051149     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:TELS.0000014781.92903.7f     Document Type: Article

References (38)

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 trade-offs, Computer Communications 21(18) (1998) 1670-1680.
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).
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.
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.
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.
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).
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 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/ACM Transactions on Networking 3(6) (1995) 809-818.
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.
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.
34. P. Sinha and A. Zoltners, The multiple choice knapsack problem, Operation Research 27(3) (1979) 503-515.
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.