{'fraction_non_alphanumeric': 0.02454873646209386, 'fraction_numerical': 0.0, 'mean_word_length': 5.6, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
MPLS Traffic Engineering for Survivable Book-Ahead Guaranteed Services∗

With the emergence of Multi-protocol Label Switching (MPLS), it is now possible to address various traffic engineering problems that would not have been possible on the current Internet. In this paper, we consider a set of services called book-ahead guaranteed (BAG) services (with possibly different survivability requirements) that may be offered in an MPLS-based network together with best effort services. The traffic engineering problem we address is to consider both BAG services as well as best-effort services that may have differing objectives along with different survivability requirements for service requests. Due to different (potentially conflicting) objectives for guaranteed and best-effort services, this problem becomes a multi-criteria decision problem. We present an integrated optimization formulation where we show how to unify these different objectives while selecting explicit routes for survivable BAG services, and at the same time, not effecting best-effort services drastically; such selection of explicit routes can be implemented using Label switches paths (LSP) in MPLS. We provide a heuristic approach to solving this model. We present experimental results to show that the heuristic performs well; and more importantly, the optimization model captures the different objectives.