Techniques for traffic engineering of multiservice, multipriority networks

We present techniques for traffic engineering in quality of service (QoS)-s upported data networks and also illustrate the application of these techniq ues in a case study For scalability, we use multicommodity flow (MCF) solut ion techniques as primitives. The techniques address the design of topology and size of explicit routes in multiprotocol label switching (MPLS)-suppor ted Internet protocol (IP) networks and virtual private networks (VPNs). Th e techniques are for network-wide optimization, subject to constraints on r outing imposed by end-to-end QoS and other considerations. The notion of ad missible route sets is used to differentiate real-time services such as Int ernet telephony and video, from delay-insensitive services, such as premium data. Different optimization techniques are given for Best-Effort services . We also give an efficient and accurate design technique to handle priorit ies. Finally, we present a novel technique for obtaining traffic engineerin g designs for stochastic traffic models from MCF-based designs with only a small amount of incremental effort.