Design of IP Networks with End-To-End Performance Guarantees

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.

[1]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..

[2]  Heesang Lee,et al.  Preplanned rerouting optimization and dynamic path rerouting for ATM VP restoration , 2000, Telecommun. Syst..

[3]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[4]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[5]  Hieu T. Tran,et al.  Efficient QoS partition and routing in multiservice IP networks , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[6]  Richard J. Harris,et al.  Dimensioning Method for Multiservice IP Networks to Satisfy Delay QoS Constraints , 2002, INTERWORKING.

[7]  Zheng Wang,et al.  Internet QoS: Architectures and Mechanisms for Quality of Service , 2001 .

[8]  Teodor Gabriel Crainic,et al.  Multicommodity Capacitated Network Design , 1999 .

[9]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Richard J. Harris,et al.  LP-based algorithm for optimization in multiservice IP networks , 2003 .

[11]  Brunilde Sansò,et al.  Telecommunications Network Planning , 1998 .

[12]  Naoki Katoh,et al.  Resource Allocation Problems , 1998 .

[13]  Keith W. Ross,et al.  Loss Models For Broadband Networks With Non-Linear Constraint Functions , 1999 .

[14]  Clyde L. Monma,et al.  Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions , 1990, Math. Oper. Res..

[15]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[16]  李幼升,et al.  Ph , 1989 .

[17]  Hieu T. Tran,et al.  OPQR-G: algorithm for efficient QoS partition and routing in multiservice IP networks , 2005, Comput. Commun..

[18]  Ariel Orda,et al.  Optimal partition of QoS requirements on unicast paths and multicast trees , 2002, TNET.

[19]  Yuval Shavitt,et al.  Optimal partition of QoS requirements with discrete cost functions , 2000, IEEE J. Sel. Areas Commun..

[20]  Ariel Orda,et al.  Efficient QoS Partition and Routing of Unicast and Multicast , 2006, IEEE/ACM Transactions on Networking.

[21]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[22]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[23]  Richard J. Harris,et al.  Characterization of class-based traffic flows in multiservice IP networks , 2002, The 8th International Conference on Communication Systems, 2002. ICCS 2002..

[24]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .