Multicast traffic aggregation in MPLS-based VPN networks

This article gives an overview of the current practical approaches under study for a scalable implementation of multicast in layer 2 and 3 VPNs over an IP-MPLS multiservice network. These proposals are based on a well-known technique: the aggregation of traffic into shared trees to manage the forwarding state vs. bandwidth saving trade-off. This sort of traffic engineering mechanism requires methods to estimate the resources needed to set up a multicast shared tree for a set of VPNs. The methodology proposed in this article consists of studying the effect of aggregation obtained by random shared tree allocation on a reference model of a representative network scenario.Publicad

Traffic Control in Packet Switched Networks

This thesis examines traffic control options available in two existing routing solutions in packet-switched networks. The first solution is the shortest path hop-by-hop routing deployed with the OSPF or IS-IS routing protocol and the IP forwarding protocol. This is the initially deployed and still the most popular routing solution in the Internet. The second solution is explicit routing implemented with the RSVP-TE or CR-LDP signalling protocol and the MPLS forwarding protocol. This is the latest solution to have become widely deployed in the Internet. The thesis analyses the limitations of the two routing solutions as tools for traffic control and yields new insights that can guide the analysis and design of protocols involved in the process. A set of recommendations for modifications of the existing protocols is provided which would allow for a range of new traffic control approaches to be deployed in packet-switched networks. For future routing solutions which comply with the proposed recommendations two new algorithms are presented in the thesis. They are called the Link Mask Topology (LMT) algorithm, and the Link Cost Topology (LCT) algorithm. The two algorithms define a set of routing topologies and assign network traffic to routes available in these topologies aiming to simultaneously achieve high network throughput and fair resource allocation. While there are similarities in the operation of the two algorithms, their applicability is different as they allocate resources to multiple paths between two network nodes which are available in the defined routing topologies according to a different rule set. The LMT algorithm directs traffic sent between any pair of network nodes to a single route. The LCT algorithm directs traffic sent between a pair of network nodes to a number of routes. The performance of the two proposed algorithms is evaluated in the thesis with calculations comparing them to the shortest path routing algorithm in a number of test cases. The test results demonstrate the potentials of the two proposed algorithms in improving the performance of networks which employ shortest path routing

Topological Design of Multiple Virtual Private Networks UTILIZING SINK-TREE PATHS

With the deployment of MultiProtocol Label Switching (MPLS) over a core backbone networks, it is possible for a service provider to built Virtual Private Networks (VPNs) supporting various classes of services with QoS guarantees. Efficiently mapping the logical layout of multiple VPNs over a service provider network is a challenging traffic engineering problem. The use of sink-tree (multipoint-to-point) routing paths in a MPLS network makes the VPN design problem different from traditional design approaches where a full-mesh of point-to-point paths is often the choice. The clear benefits of using sink-tree paths are the reduction in the number of label switch paths and bandwidth savings due to larger granularities of bandwidth aggregation within the network. In this thesis, the design of multiple VPNs over a MPLS-like infrastructure network, using sink-tree routing, is formulated as a mixed integer programming problem to simultaneously find a set of VPN logical topologies and their dimensions to carry multi-service, multi-hour traffic from various customers. Such a problem formulation yields a NP-hard complexity. A heuristic path selection algorithm is proposed here to scale the VPN design problem by choosing a small-but-good candidate set of feasible sink-tree paths over which the optimal routes and capacity assignments are determined. The proposed heuristic has clearly shown to speed up the optimization process and the solution can be obtained within a reasonable time for a realistic-size network. Nevertheless, when a large number of VPNs are being layout simultaneously, a standard optimization approach has a limited scalability. Here, the heuristics termed the Minimum-Capacity Sink-Tree Assignment (MCSTA) algorithm proposed to approximate the optimal bandwidth and sink-tree route assignment for multiple VPNs within a polynomial computational time. Numerical results demonstrate the MCSTA algorithm yields a good solution within a small error and sometimes yields the exact solution. Lastly, the proposed VPN design models and solution algorithms are extended for multipoint traffic demand including multipoint-to-point and broadcasting connections

ATM PNNI Interfacing Issues with MPLS Networking

School of Electrical and Computer Engineerin

Concepção e implementação de experiências laboratoriais sobre MPLS

Mestrado em Engenharia Electrónica e TelecomunicaçõesO Multiprotocol Label Switching (MPLS) é um mecanismo de transporte de dados, sob a forma de um protocolo agnóstico, com grande potencial de crescimento e adequação. Opera na “Camada 2.5” do modelo OSI e constitui um mecanismo de alto desempenho utilizado nas redes de núcleo para transportar dados de um nó da rede para outro. O sucesso do MPLS resulta do facto de permitir que a rede transporte todos os tipos de dados, desde tráfego IP a tráfego da camada de ligação de dados, devido ao encapsulamento dos pacotes dos diversos protocolos, permitindo a criação de “links virtuais” entre nós distantes. O MPLS pertence à família das “redes de comutação de pacotes”, sendo os pacotes de dados associados a “etiquetas” que determinam o seu encaminhamento, sem necessidade de examinar o conteúdo dos próprios pacotes. Isto permite a criação de circuitos “extremo-aextremo” através de qualquer tipo de rede de transporte e independentemente do protocolo de encaminhamento que é utilizado. O projecto do MPLS considera múltiplas tecnologias no sentido de prestar um serviço único de transporte de dados, tentando simultaneamente proporcionar capacidades de engenharia de tráfego e controlo “out-of-band”, uma característica muito atraente para uma implementação em grande escala. No fundo, o MPLS é uma forma de consolidar muitas redes IP dentro de uma única rede. Dada a importância desta tecnologia, é urgente desenvolver ferramentas que permitam entender melhor a sua complexidade. O MPLS corre normalmente nas redes de núcleo dos ISPs. No sentido de tornar o seu estudo viável, recorreu-se nesta dissertação à emulação para implementar cenários de complexidade adequada. Existem actualmente boas ferramentas disponíveis que permitem a recriação em laboratório de cenários bastante complicados. Contudo, a exigência computacional da emulação é proporcional à complexidade do projecto em questão, tornando-se rapidamente impossível de realizar numa única máquina. A computação distribuída ou a “Cloud Computing” são actualmente as abordagens mais adequadas e inovadoras apara a resolução deste problema. Esta dissertação tem como objectivo criar algumas experiências em laboratório que evidenciam aspectos relevantes da tecnologia MPLS, usando para esse efeito um emulador computacional, o Dynamips, impulsionado por generosas fontes computacionais disponibilizadas pela Amazon ec2. A utilização destas ferramentas de emulação permite testar cenários de rede e serviços reais em ambiente controlado, efectuando o debugging das suas configurações e optimizando o seu desempenho, antes de os colocar em funcionamento nas redes em operação.The Multiprotocol Label Switching (MPLS) is a highly scalable and agnostic protocol to carry network data. Operating at "Layer 2.5" of the OSI model, MPLS is an highperformance mechanism that is used at the network backbone for conveying data from one network node to the next. The success of MPLS results from the fact that it enables the network to carry all kinds of traffic, ranging from IP to layer 2 traffic, since it encapsulates the packets of the diverse network protocols, allowing the creation of "virtual links" between distant nodes. MPLS belongs to the family of packet switched networks, where labels are assigned to data packets that are forwarded based on decisions that rely only on the label contents, without the need to examine the packets contents. This allows the creation of end-to-end circuits across any type of transport medium, using any protocol. The MPLS design takes multiform transport technologies into account to provide a unified data-carrying service, attempting simultaneously to preserve traffic engineering and out-of-band control, a very attractive characteristic for large-scale deployment. MPLS is the way to consolidate many IP networks into a single one. Due to this obvious potential, it is urgent to develop means and tools to better understand its functioning and complexity. MPLS normally runs at the backbone of Service Providers networks, being deployed across an extensive set of expensive equipment. In order to turn the study of MPLS feasible, emulation was considered as the best solution. Currently, there are very good available tools to recreate, in a lab environment, quite complicated scenarios. However, the computational demand of the emulation is proportional to the complexity of the project, becoming quickly unfeasible in a single machine. Fortunately, distributed computing or Cloud computing are suitable and novel approaches to solve this computation problem. So, this work aims to create some lab experiments that can illustrate/demonstrate relevant aspects of the MPLS technology, using the Dynamips emulator driven by the computational resources that were made available by the Amazon ec2 cloud computing facilities. The utilization of these emulation tools allows testing real networks and service scenarios in a controlled environment, being able to debug their configurations and optimize their performance before deploying them in real operating networks

Deliverable DJRA1.2. Solutions and protocols proposal for the network control, management and monitoring in a virtualized network context

This deliverable presents several research proposals for the FEDERICA network, in different subjects, such as monitoring, routing, signalling, resource discovery, and isolation. For each topic one or more possible solutions are elaborated, explaining the background, functioning and the implications of the proposed solutions.This deliverable goes further on the research aspects within FEDERICA. First of all the architecture of the control plane for the FEDERICA infrastructure will be defined. Several possibilities could be implemented, using the basic FEDERICA infrastructure as a starting point. The focus on this document is the intra-domain aspects of the control plane and their properties. Also some inter-domain aspects are addressed. The main objective of this deliverable is to lay great stress on creating and implementing the prototype/tool for the FEDERICA slice-oriented control system using the appropriate framework. This deliverable goes deeply into the definition of the containers between entities and their syntax, preparing this tool for the future implementation of any kind of algorithm related to the control plane, for both to apply UPB policies or to configure it by hand. We opt for an open solution despite the real time limitations that we could have (for instance, opening web services connexions or applying fast recovering mechanisms). The application being developed is the central element in the control plane, and additional features must be added to this application. This control plane, from the functionality point of view, is composed by several procedures that provide a reliable application and that include some mechanisms or algorithms to be able to discover and assign resources to the user. To achieve this, several topics must be researched in order to propose new protocols for the virtual infrastructure. The topics and necessary features covered in this document include resource discovery, resource allocation, signalling, routing, isolation and monitoring. All these topics must be researched in order to find a good solution for the FEDERICA network. Some of these algorithms have started to be analyzed and will be expanded in the next deliverable. Current standardization and existing solutions have been investigated in order to find a good solution for FEDERICA. Resource discovery is an important issue within the FEDERICA network, as manual resource discovery is no option, due to scalability requirement. Furthermore, no standardization exists, so knowledge must be obtained from related work. Ideally, the proposed solutions for these topics should not only be adequate specifically for this infrastructure, but could also be applied to other virtualized networks.Postprint (published version