Multi-domain crankback operation for IP/MPLS & DWDM networks

Network carriers and operators have built and deployed a very wide range of networking technologies to meet their customers needs. These include ultra scalable fibre-optic backbone networks based upon dense wavelength division multiplexing (DWDM) solutions as well as advanced layer 2/3 IP multiprotocol label switching (MPLS) and Ethernet technologies as well. A range of networking control protocols has also been developed to implement service provisioning and management across these networks. As these infrastructures have been deployed, a range of new challenges have started to emerge. In particular, a major issue is that of provisioning connection services between networks running across different domain boundaries, e.g., administrative geographic, commercial, etc. As a result, many carriers are keenly interested in the design of multi-domain provisioning solutions and algorithms. Nevertheless, to date most such efforts have only looked at pre-configured, i.e., static, inter-domain route computation or more complex solutions based upon hierarchical routing. As such there is significant scope in developing more scalable and simplified multi-domain provisioning solutions. Moreover, it is here that crankback signaling offers much promise. Crankback makes use of active messaging techniques to compute routes in an iterative manner and avoid problematic resource-deficient links. However very few multi-domain crankback schemes have been proposed, leaving much room for further investigation. Along these lines, this thesis proposes crankback signaling solution for multi-domain IP/MPLS and DWDM network operation. The scheme uses a joint intra/inter-domain signaling strategy and is fully-compatible with the standardized resource reservation (RSVP-TE) protocol. Furthermore, the proposed solution also implements and advanced next-hop domain selection strategy to drive the overall crankback process. Finally the whole framework assumes realistic settings in which individual domains have full internal visibility via link-state routing protocols, e.g., open shortest path first traffic engineering (OSPF-TE), but limited \u27next-hop\u27 inter-domain visibility, e.g., as provided by inter-area or inter-autonomous system (AS) routing protocols. The performance of the proposed crankback solution is studied using software-based discrete event simulation. First, a range of multi-domain topologies are built and tested. Next, detailed simulation runs are conducted for a range of scenarios. Overall, the findings show that the proposed crankback solution is very competitive with hierarchical routing, in many cases even outperforming full mesh abstraction. Moreover the scheme maintains acceptable signaling overheads (owing to it dual inter/intra domain crankback design) and also outperforms existing multi-domain crankback algorithms.\u2

End-to-end provisioning in multi-domain/multi-layer networks

The last decade has seen many advances in high-speed networking technologies. At the Layer 1 fiber-optic level, dense wavelength division multiplexing (DWDM) has seen fast growth in long-haul backbone/metro sectors. At the Layer 1.5 level, revamped next-generation SONET/SDH (NGS) has gained strong traction in the metro space, as a highly flexible sub-rate\u27 aggregation and grooming solution. Meanwhile, ubiquitous Ethernet (Layer 2) and IP (Layer 3) technologies have also seen the introduction of new quality of service (QoS) paradigms via the differentiated services (Diff-Serv) and integrated services (Intserv) frameworks. In recent years, various control provisioning standards have also been developed to provision these new networks, e.g., via efforts within the IETF, ITU-T, and OIF organizations. As these networks technologies gain traction, there is an increasing need to internetwork multiple domains operating at different technology layers, e.g., IP, Ethernet, SONET, DWDM. However, most existing studies have only looked at single domain networks or multiple domains operating at the same technology layer. As a result, there is now a growing level of interest in developing expanded control solutions for multi-domain/multi-layer networks, i.e., IP-SONET-DWDM. Now given the increase in the number of inter-connected domains, it is difficult for a single entity to maintain complete \u27global\u27 information across all domains. Hence, related solutions must pursue a distributed approach to handling multi-domain/multi-layer problem. Namely, key provisions are needed in the area of inter- domain routing, path computation, and signaling. The work in this thesis addresses these very challenges. Namely, a hierarchical routing framework is first developed to incorporate the multiple link types/granularities encountered in different network domains. Commensurate topology abstraction algorithms and update strategies are then introduced to help condense domain level state and propagate global views. Finally, distributed path computation and signaling setup schemes are developed to leverage the condensed global state information and make intelligent connection routing decisions. The work leverages heavily from graph theory concepts and also addresses the inherent distributed grooming dimension of multi-layer networks. The performance of the proposed framework and algorithms is studied using discrete event simulation techniques. Specifically, a range of multi-domain/multi-layer network topologies are designed and tested. Findings show that the propagation of inter-domain tunneled link state has a huge impact on connection blocking performance, lowering inter-domain connection blocking rates by a notable amount. More importantly, these gains are achieved without any notable increase in inter-domain routing loads. Furthermore, the results also show that topology abstraction is most beneficial at lower network load settings, and when used in conjunction with load-balancing routing.\u2

End-to-End Path Computer Schemes for Traffic Engineering in Next Generation Multi-Domain Networks

RÉSUMÉ Avec la venue des réseaux de prochaine génération basés sur le paradigme tout-IP et la demande croissante en qualité de service (QdS) des nouvelles applications temps réel, il existe un besoin imminent pour des mécanismes capables de soutenir le trac de bout-en-bout. Les requis de QdS sont souvent décrits par les paramètres de bande passante, délai, gigue, perte de paquets et disponibilité. Ainsi, les opérateurs de réseaux ont un besoin imminent de techniques qui leur permettraient de satisfaire les exigences de QdS des nouvelles applications IP. Le consensus pour subvenir aux exigences de QdS est la pratique de l'ingénierie de trac. L'ingénierie de trac consiste à acheminer le trac de façon optimale en utilisant les ressources disponibles, tout en satisfaisant les contraintes de QdS et celles du réseau. Cela est souvent réalisé en calculant des chemins optimaux par l'ingénierie de trac, qui constitue l'aspect central de cette thèse. En effet, les paramètres de performances de QdS peuvent être satisfaits en choisissant avec soin un chemin qui a assez de bande passante disponible et qui offre un délai et une gigue acceptable. Si la bande passante est réservée le long de ce chemin, la congestion peut être évitée et la perte de paquets peut ainsi être éliminée. En outre, le calcul minutieux des chemins principaux et de recours permet une meilleure disponibilité en cas de panne de lien ou de noeud. De plus, étant donné que le trac est habituellement transporté à travers différents réseaux administratifs, l'aspect inter-domaine du problème ne peut être négligé. Puis, il y a le fait que les réseaux sont de nature multi-couches. Donc, l'ingénierie de trac de bout-en-bout ne peut être atteint que si les aspects inter-domaine et inter-couche sont pris en compte. À cette fin, cette thèse propose un cadre complet pour l'aspect calcul de chemin bout-en-bout de l'ingénierie de trac, divisé en trois volets. Ces volets suivent tous la technologie G/MPLS pour l'acheminement du trac et la réservation de ressources sur les chemins optimaux calculés.---------ABSTRACT With the advent of all-IP Next Generation Networks and the ever increasing Quality of Service (QoS) demands of new real time IP applications, there is a stringent need for mechanisms that allow the end-to-end sustainment of the trac. QoS requirements are usually a set of network performance indicators that need to be satised in order for the IP applications to function properly. Common QoS parameters are the bandwidth, delay, jitter, packet loss and availability. Thus, network operators urgently need to implement solutions enabling them to satisfy the QoS requirements of real time IP applications. The consensus for QoS provisioning is the application of well dened trac engineering mechanisms, which consists in optimally routing the trac using available resources while satisfying QoS and network constraints. This is often achieved by trac engineered path computation, which is the central focus of this thesis. Indeed, the QoS performance parameters can be met by carefully choosing a path that has the available bandwidth, offers the acceptable delay and jitter. If bandwidth is reserved along this path, congestion is avoided and the packet loss performance parameter can also be met. Moreover, careful calculation of primary and backup paths allows high availability in case of node or link failure. Moreover, there is the fact that trac is usually transported across different administrative networks. Then, there is the detail that networks are multi-layer in nature. Thus, true end-to-end trac engineering can only be achieved if inter-domain and inter-layer aspects are both considered. To this end, this thesis proposes an overall framework for the end-to-end trac engineered path computation problem. As discussed below, the framework is subdivided into three separate aspects, all relying on G/MPLS forwarding technology, which enables a controlled routing and the reservation of resources along trac engineered paths. The proposals for each aspect are the outcome of extensive literature review which identify existing solutions, if any, and the reasons of their shortcomings or non-existence. This review limits the direction to be taken to nd a solution, often by using existing standards and protocols. This is extremely important given the fact that the research topic of this thesis is closely tied to problems of near future generation networks. Thus, it is crucial to reuse existing methods and standards as much as possible in order to get the approval of the research community on the proposed solutions. Moreover, each aspect or sub-problem is carefully studied by dening the actual real world dilemmas surrounding it

Path signalling in a wireless back-haul network integrating unidirectional broadcast technologies

The black-haul infrastructures of today's wireless operators must support the triple-play services demanded by the market or regulatory bodies. To cope with increasing capacity demand, in our previous work, we have developed a cost-effective heterogeneous layer 2.5 wireless back-haul (WiBACK) architecture, which leverages the native multicast capabilities of broadcast technologies such as DVB to off-load high-bandwidth broadcast content delivery. Furthermore, our architecture provides support for unidirectional technologies on the data and the control plane. This adopts a centralized coordinator approach, in which coordinator nodes install so-called management and data pipes. No routing state is kept at plain WiBACK nodes, which merely store QoS-aware pipe forwarding state. Consequently, the architecture requires a reliable protocol to push resource allocation and pipe forwarding state into the network, considering possibly unidirectional connectivity. Such a protocol, whose task is related to MPLS label distribution, is essential during the initial forming of WiBACK topologies and during regular network operations to reliably manage the data pipes. In this paper, we present a novel approach to extend our IEEE 802.21-inspired WiBACK TransportService and, based upon this, the design of an RSVP-TE-style pipe signalling protocol using nested hop-by-hop request/response MIH transactions that supports signalling over unidirectional technologies. A thorough evaluation and successful testbed deployments show that this protocol reliably signals pipe state even under high loss conditions

Fault Localization in All-Optical Mesh Networks

Fault management is a challenging task in all-optical wavelength division multiplexing (WDM) networks. However, fast fault localization for shared risk link groups (SRLGs) with multiple links is essential for building a fully survival and functional transparent all-optical mesh network. Monitoring trail (m-trail) technology is an effective approach to achieve the goal, whereby a set of m-trails are derived for unambiguous fault localization (UFL). However, an m-trail traverses through a link by utilizing a dedicated wavelength channel (WL), causing a significant amount of resource consumption. In addition, existing m-trail methods incur long and variable alarm dissemination delay. We introduce a novel framework of real-time fault localization in all-optical WDM mesh networks, called the monitoring-burst (m-burst), which aims at initiating a balanced trade-off between consumed monitoring resources and fault localization latency. The m-burst framework has a single monitoring node (MN) and requires one WL in each unidirectional link if the link is traversed by any m-trail. The MN launches short duration optical bursts periodically along each m-trail to probe the links of the m-trail. Bursts along different m-trails are kept non-overlapping through each unidirectional link by scheduling burst launching times from the MN and multiplexing multiple bursts, if any, traversing the link. Thus, the MN can unambiguously localize the failed links by identifying the lost bursts without incurring any alarm dissemination delay. We have proposed several novel m-trail allocation, burst launching time scheduling, and node switch fabric configuration schemes. Numerical results show that the schemes, when deployed in the m-burst framework, are able to localize single-link and multi-link SRLG faults unambiguously, with reasonable fault localization latency, by using at most one WL in each unidirectional link. To reduce the fault localization latency further, we also introduce a novel methodology called nested m-trails. At first, mesh networks are decomposed into cycles and trails. Each cycle (trail) is realized as an independent virtual ring (linear) network using a separate pair of WLs (one WL in each direction) in each undirected link traversed by the cycle (trail). Then, sets of m-trails, i.e., nested m-trails, derived in each virtual network are deployed independently in the m-burst framework for ring (linear) networks. As a result, the fault localization latency is reduced significantly. Moreover, the application of nested m-trails in adaptive probing also reduces the number of sequential probes significantly. Therefore, practical deployment of adaptive probing is now possible. However, the WL consumption of the nested m-trail technique is not limited by one WL per unidirectional link. Thus, further investigation is needed to reduce the WL consumption of the technique.1 yea

Traffic engineering in dynamic optical networks

Traffic Engineering (TE) refers to all the techniques a Service Provider employs to improve the efficiency and reliability of network operations. In IP over Optical (IPO) networks, traffic coming from upper layers is carried over the logical topology defined by the set of established lightpaths. Within this framework then, TE techniques allow to optimize the configuration of optical resources with respect to an highly dynamic traffic demand. TE can be performed with two main methods: if the demand is known only in terms of an aggregated traffic matrix, the problem of automatically updating the configuration of an optical network to accommodate traffic changes is called Virtual Topology Reconfiguration (VTR). If instead the traffic demand is known in terms of data-level connection requests with sub-wavelength granularity, arriving dynamically from some source node to any destination node, the problem is called Dynamic Traffic Grooming (DTG). In this dissertation new VTR algorithms for load balancing in optical networks based on Local Search (LS) techniques are presented. The main advantage of using LS is the minimization of network disruption, since the reconfiguration involves only a small part of the network. A comparison between the proposed schemes and the optimal solutions found via an ILP solver shows calculation time savings for comparable results of network congestion. A similar load balancing technique has been applied to alleviate congestion in an MPLS network, based on the efficient rerouting of Label-Switched Paths (LSP) from the most congested links to allow a better usage of network resources. Many algorithms have been developed to deal with DTG in IPO networks, where most of the attention is focused on optimizing the physical resources utilization by considering specific constraints on the optical node architecture, while very few attention has been put so far on the Quality of Service (QoS) guarantees for the carried traffic. In this thesis a novel Traffic Engineering scheme is proposed to guarantee QoS from both the viewpoint of service differentiation and transmission quality. Another contribution in this thesis is a formal framework for the definition of dynamic grooming policies in IPO networks. The framework is then specialized for an overlay architecture, where the control plane of the IP and optical level are separated, and no information is shared between the two. A family of grooming policies based on constraints on the number of hops and on the bandwidth sharing degree at the IP level is defined, and its performance analyzed in both regular and irregular topologies. While most of the literature on DTG problem implicitly considers the grooming of low-speed connections onto optical channels using a TDM approach, the proposed grooming policies are evaluated here by considering a realistic traffic model which consider a Dynamic Statistical Multiplexing (DSM) approach, i.e. a single wavelength channel is shared between multiple IP elastic traffic flows

Quality of service in optical burst switching networks

Tese dout., Engenharia Electrónica e Computação, Universidade do Algarve, 2009Fundação para e Ciência e a Tecnologi

Integration of unidirectional technologies into wireless back-haul architecture

This thesis was submitted for the degree of Docter of Philosophy and awarded by Brunel University.Back-haul infrastructures of today's wireless operators must support the triple-play services demanded by the market or regulatory bodies. To cope with increasing capacity demand, the EU FP7 project CARMEN has developed a cost-effective heterogeneous multi-radio wireless back-haul architecture, which may also leverage the native multicast capabilities of broadcast technologies such as DVB-T to off-load high-bandwidth broadcast content delivery. However, the integration of such unidirectional technologies into a packet-switched architecture requires careful considerations. The contribution of this thesis is the investigation, design and evaluation of protocols and mechanisms facilitating the integration of such unidirectional technologies into the wireless back-haul architecture so that they can be configured and utilized by the spectrum and capacity optimization modules. This integration mainly concerns the control plane and, in particular, the aspects related to resource and capability descriptions, neighborhood, link and Multi Protocol Label Switching (MPLS) Label-Switched Path (LSP) monitoring, unicast and multicast LSP signalling as well as topology forming and maintenance. During the course of this study we have analyzed the problem space, proposed solutions to the resulting research questions and evaluated our approach. Our results show that the now Unidirectional Technology (UDT)-aware architecture can readily consider Unidirectional Technologies (UDTs) to distribute, for example, broadcast content

GMPLS-OBS interoperability and routing acalability in internet

The popularization of Internet has turned the telecom world upside down over the last two decades. Network operators, vendors and service providers are being challenged to adapt themselves to Internet requirements in a way to properly serve the huge number of demanding users (residential and business). The Internet (data-oriented network) is supported by an IP packet-switched architecture on top of a circuit-switched, optical-based architecture (voice-oriented network), which results in a complex and rather costly infrastructure to the transport of IP traffic (the dominant traffic nowadays). In such a way, a simple and IP-adapted network architecture is desired. From the transport network perspective, both Generalized Multi-Protocol Label Switching (GMPLS) and Optical Burst Switching (OBS) technologies are part of the set of solutions to progress towards an IP-over-WDM architecture, providing intelligence in the control and management of resources (i.e. GMPLS) as well as a good network resource access and usage (i.e. OBS). The GMPLS framework is the key enabler to orchestrate a unified optical network control and thus reduce network operational expenses (OPEX), while increasing operator's revenues. Simultaneously, the OBS technology is one of the well positioned switching technologies to realize the envisioned IP-over-WDM network architecture, leveraging on the statistical multiplexing of data plane resources to enable sub-wavelength in optical networks. Despite of the GMPLS principle of unified control, little effort has been put on extending it to incorporate the OBS technology and many open questions still remain. From the IP network perspective, the Internet is facing scalability issues as enormous quantities of service instances and devices must be managed. Nowadays, it is believed that the current Internet features and mechanisms cannot cope with the size and dynamics of the Future Internet. Compact Routing is one of the main breakthrough paradigms on the design of a routing system scalable with the Future Internet requirements. It intends to address the fundamental limits of current stretch-1 shortest-path routing in terms of RT scalability (aiming at sub-linear growth). Although "static" compact routing works fine, scaling logarithmically on the number of nodes even in scale-free graphs such as Internet, it does not handle dynamic graphs. Moreover, as multimedia content/services proliferate, the multicast is again under the spotlight as bandwidth efficiency and low RT sizes are desired. However, it makes the problem even worse as more routing entries should be maintained. In a nutshell, the main objective of this thesis in to contribute with fully detailed solutions dealing both with i) GMPLS-OBS control interoperability (Part I), fostering unified control over multiple switching domains and reduce redundancy in IP transport. The proposed solution overcomes every interoperability technology-specific issue as well as it offers (absolute) QoS guarantees overcoming OBS performance issues by making use of the GMPLS traffic-engineering (TE) features. Keys extensions to the GMPLS protocol standards are equally approached; and ii) new compact routing scheme for multicast scenarios, in order to overcome the Future Internet inter-domain routing system scalability problem (Part II). In such a way, the first known name-independent (i.e. topology unaware) compact multicast routing algorithm is proposed. On the other hand, the AnyTraffic Labeled concept is also introduced saving on forwarding entries by sharing a single forwarding entry to unicast and multicast traffic type. Exhaustive simulation campaigns are run in both cases in order to assess the reliability and feasible of the proposals