POSSIBLE COLLISION AVOIDANCE WITH OFF-LINE ROUTE SELECTION

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

[1]  Raouf Boutaba,et al.  DORA: Efficient Routing for MPLS Traffic Engineering , 2002, Journal of Network and Systems Management.

[2]  B. R. Badrinath,et al.  Creating multipoint-to-point LSPs for traffic engineering , 2005, IEEE Communications Magazine.

[3]  James Won-Ki Hong,et al.  Virtual network approach to scalable IP service deployment and efficient resource management , 2005, IEEE Communications Magazine.

[4]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[5]  Jyh-Cheng Chen,et al.  Comparative study of protocols for dynamic service negotiation in the next-generation Internet , 2006, IEEE Communications Magazine.

[6]  Nazim Agoulmine,et al.  Designing scalable on-demand policy-based resource allocation in IP networks , 2006, IEEE Communications Magazine.

[7]  Natalie Degrande,et al.  Inter-Area Traffic Engineering in a Differentiated Services Network , 2003, Journal of Network and Systems Management.

[8]  Antonio Pescapè,et al.  Dynamic Service Management in Heterogeneous Networks , 2004, Journal of Network and Systems Management.

[9]  Jean-Philippe Vasseur,et al.  Definitive MPLS Network Designs , 2005 .

[10]  Giorgio Ventre,et al.  Advanced QoS provisioning in IP networks: the European premium IP projects , 2003, IEEE Commun. Mag..

[11]  Ram Krishnan,et al.  Multi-Protocol Label Switching (MPLS) Support of Differentiated Services , 2002, RFC.

[12]  H. Luss.  A heuristic for capacity expansion planning with multiple facility types , 1986 .

[13]  Paulo Carvalho,et al.  Distributed Admission Control for QoS and SLS Management , 2004, Journal of Network and Systems Management.

[14]  Srecko Krile,et al.  The application of bandwidth optimization technique in SLA negotiation process , 2006, 2006 11th International Workshop on Computer-Aided Modeling, Analysis and Design of Communication Links and Networks.