Abstract
In this paper, we examine the issues that surround IP network design with quality of service (QoS) guarantees and propose a new network design methodology. The proposed network design model takes account of the new QoS technologies (i.e., DiffServ/MPLS) and allows for multiple delay constraints so that guaranteed performance can be achieved for each of the traffic classes. After discussing the most crucial planning issues that must be addressed when QoS mechanisms are used in an IP-based network, a non-linear multicommodity optimisation problem is formulated and heuristics for its approximate solutions are described. The network design model is evaluated in terms of accuracy and scalability for each of the main components that the model employs. The computational results for each of the building blocks demonstrate that realistic size problems can be solved with the proposed method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Atov, I., Tran, H.T., and Harris, R.J. (2003). Efficient QoS partition and routing in multiservice IP networks. In: Proceedings of IPCCC 2003, Phoenix, Arizona.
Atov, I., Tran, H.T., and Harris, R.J. (2004). OPQR-G: Algorithm for efficient QoS partition and routing in multiservice IP networks. Forthcoming in Journal of Computer Communications.
Atov, I. and Harris, R.J. (2003). LP-based algorithm for optimization in multiservice IP networks. WSEAS Transactions on Communications, 2:432–438.
Atov, I. and Harris, R.J. (2002). Characterization of class-based traffic flows in multiservice IP networks. In: Proceedings of ICCS 2002, Singapore.
Atov, I. and Harris, R.J. (2002). Dimensioning method for multiservice IP networks to satisfy delay QoS constraints. In: Proceedings of IFIP-TC6 Interworking 2002, Perth, Australia.
Floyd S. and Jacobson, V. (1995). Link-sharing and resource management models for packet networks. IEEE/ACM Trans. on Networking, 3:365–386.
Fortz, B. and Thorup, M. (2000). Internet traffic engineering by optimizing OSPF weights. In: Proceedings of INFOCOM 2000, Tel-Aviv, Israel.
Gavish, B. and Neuman, I. (1989). A system for routing and capacity assignment in computer communication networks. IEEE Transactions on Communications, 37:360–366.
Gendron, B., Crainic, T.G., and Frangoni, A. (1999). Multicommodity capacitated network design. In: B. Sansó and P. Soriano (eds), Telecommunications Network Planning, pp. 1–19. Kluwer Academic Publishers, Norwell, MA.
Guerin, R., Ahmadi, H., and Naghshineh, M. (1991). Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE Journal on Selected Areas in Communications, 9:968–981.
Hassin, R. (1992). Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17:36–42.
Holmberg, K. (2000). A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research, 48:461–481.
Ibaraki, T. and Katoh, N. (1988). Resource Allocation Problems: The Foundations of Computing. MIT Press, Cambridge, MA.
Kleinrock, L. (1975). Queueing Systems, Vol. II, Computer Applications. Wiley, New York.
Lee, H., Song, H.-G., Chung, J.-B., Chung, S.-J. (2000). Preplanned rerouting optimization and dynamic path rerouting for ATM restoration. Telecommunications Systems, 14:243–259.
Liang, W. and Ross, K.W. (1999). Loss models for broadband networks with non-linear constraint functions. In: B. Sansó and P. Soriano (eds), Telecommunications Network Planning, pp. 121–134. Kluwer Academic Publishers, Norwell, MA.
Lorenz, D.H. and Orda, A. (2002). Optimal partition of QoS requirements on unicast paths and multicast trees. IEEE/ACM Transactions on Networking, 10:102–114.
Lorenz, D.H., Orda, A., Raz, D., and Shavitt, Y. (2000). Efficient QoS partition and routing of unicast and multicast. In: Proceedings of IWQoS 2000, Pittsburgh, USA.
Monma, C.L., Schrijver, A., Todd, M.J., and Wei, V.K. (1990). Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases, and extensions. Mathematics of Operations Research, 15:736–748.
Puah, L.K. (1999). Capacity Dimensioning Methods for Multi-service Networks. Ph.D. Thesis, RMIT University, Melbourne.
Raz D. and Shavitt, Y. (2000). Optimal partition of QoS requirements with discrete cost functions. In: Proceedings of INFOCOM 2000, Tel-Aviv, Israel.
Wang, Z. (2001). Internet QoS: Architectures and Mechanisms for Quality of Service. Morgan Kaufmann Publishers.
Whitt, W. (1983). The queueing network analyzer. Bell System Technical Journal, 62:2779–2815.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Atov, I., Harris, R.J. (2005). Design of IP Networks with End-To-End Performance Guarantees. In: Girard, A., Sansò, B., Vázquez-Abad, F. (eds) Performance Evaluation and Planning Methods for the Next Generation Internet. Springer, Boston, MA. https://doi.org/10.1007/0-387-25551-6_1
Download citation
DOI: https://doi.org/10.1007/0-387-25551-6_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25550-7
Online ISBN: 978-0-387-25551-4
eBook Packages: Business and EconomicsBusiness and Management (R0)