Possible Collision Avoidance with Off-line Route Selection

Abstract

The paper describes the traffic flow problems in telecommunication networks based on the Internet protocol. The main aim of telecommunication network operator today is to offer an SLA (Service Level Agreement) contract to end users, with provided QoS (Quality of Service) for different classes of services. In order to achieve this, it is necessary to establish the routes between marginal network nodes meeting the network traffic requirements and optimizing the network performances free of simultaneous flows conflicts. In DiffServ/MPLS (Multi-Protocol Label Switching) networks traffic flows traverse the network simultaneously and there may come to collision of concurrent flows. They are distributed among LSPs (Labeled Switching Paths) related to service classes. In LSP creation the IGP (Interior Gateway Protocol) uses simple on-line routing algorithms based on the shortest path methodology. In highly loaded networks this becomes an insufficient technique. In this suggested approach LSP need not necessarily be the shortest path solution. It can be pre-computed much earlier, possibly during the SLA negotiation process. In that sense an effective algorithm for collision control is developed. It may find a longer but lightly loaded path, taking care of the collision possibility. It could be a very good solution for collision avoidance and for better load-balancing purpose where links are running close to capacity. The algorithm can be significantly improved through heuristic approach. Heuristic options are compared in test-examples and their application for collision control is explained. KEYWORDS: Telecommunication networks, collision avoidance, multi-constraint route selection, self-organizing systems, MPLS, QoS