254 research outputs found
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
Strategies for internet route control: past, present and future
Uno de los problemas más complejos en redes de computadores es el de proporcionar garantĂas de calidad y confiabilidad a las comunicaciones de datos entre entidades que se encuentran en dominios distintos. Esto se debe a un amplio conjunto de razones -- las cuales serán analizadas en detalle en esta tesis -- pero de manera muy breve podemos destacar: i) la limitada flexibilidad que presenta el modelo actual de encaminamiento inter-dominio en materia de ingenierĂa de tráfico; ii) la naturaleza distribuida y potencialmente antagĂłnica de las polĂticas de encaminamiento, las cuales son administradas individualmente y sin coordinaciĂłn por cada dominio en Internet; y iii) las carencias del protocolo de encaminamiento inter-dominio utilizado en Internet, denominado BGP (Border Gateway Protocol).El objetivo de esta tesis, es precisamente el estudio y propuesta de soluciones que permitan mejorar drásticamente la calidad y confiabilidad de las comunicaciones de datos en redes conformadas por mĂşltiples dominios.Una de las principales herramientas para lograr este fin, es tomar el control de las decisiones de encaminamiento y las posibles acciones de ingenierĂa de tráfico llevadas a cabo en cada dominio. Por este motivo, esta tesis explora distintas estrategias de como controlar en forma precisa y eficiente, tanto el encaminamiento como las decisiones de ingenierĂa de tráfico en Internet. En la actualidad este control reside principalmente en BGP, el cual como indicamos anteriormente, es uno de los principales responsables de las limitantes existentes. El paso natural serĂa reemplazar a BGP, pero su despliegue actual y su reconocida operatividad en muchos otros aspectos, resultan claros indicadores de que su sustituciĂłn (Ăł su posible evoluciĂłn) será probablemente gradual. En este escenario, esta tesis propone analizar y contribuir con nuevas estrategias en materia de control de encaminamiento e ingenierĂa de tráfico inter-dominio en tres marcos temporales distintos: i) en la actualidad en redes IP; ii) en un futuro cercano en redes IP/MPLS (MultiProtocol Label Switching); y iii) a largo plazo en redes Ăłpticas, modelando asĂ una evoluciĂłn progresiva y realista, facilitando el reemplazo gradual de BGP.Más concretamente, este trabajo analiza y contribuye mediante: - La propuesta de estrategias incrementales basadas en el Control Inteligente de Rutas (Intelligent Route Control, IRC) para redes IP en la actualidad. Las estrategias propuestas en este caso son de carácter incremental en el sentido de que interaccionan con BGP, solucionando varias de las carencias que Ă©ste presenta sin llegar a proponer aĂşn su reemplazo. - La propuesta de estrategias concurrentes basadas en extender el concepto del PCE (Path Computation Element) proveniente del IETF (Internet Engineering Task Force) para redes IP/MPLS en un futuro cercano. Las estrategias propuestas en este caso son de carácter concurrente en el sentido de que no interaccionan con BGP y pueden ser desplegadas en forma paralela. En este caso, BGP continĂşa controlando el encaminamiento y las acciones de ingenierĂa de tráfico inter-dominio del tráfico IP, pero el control del tráfico IP/MPLS se efectĂşa en forma independiente de BGP mediante los PCEs.- La propuesta de estrategias que reemplazan completamente a BGP basadas en la incorporaciĂłn de un nuevo agente de control, al cual denominamos IDRA (Inter-Domain Routing Agent). Estos agentes proporcionan un plano de control dedicado, fĂsicamente independiente del plano de datos, y con gran capacidad computacional para las futuras redes Ăłpticas multi-dominio.Los resultados expuestos aquĂ validan la efectividad de las estrategias propuestas, las cuales mejoran significativamente tanto la concepciĂłn como la performance de las actuales soluciones en el área de Control Inteligente de Rutas, del esperado PCE en un futuro cercano, y de las propuestas existentes para extender BGP al área de redes Ăłpticas.One of the most complex problems in computer networks is how to provide guaranteed performance and reliability to the communications carried out between nodes located in different domains. This is due to several reasons -- which will be analyzed in detail in this thesis -- but in brief, this is mostly due to: i) the limited capabilities of the current inter-domain routing model in terms of Traffic Engineering (TE); ii) the distributed and potentially conflicting nature of policy-based routing, where routing policies are managed independently and without coordination among domains; and iii) the clear limitations of the inter-domain routing protocol, namely, the Border Gateway Protocol (BGP). The goal of this thesis is precisely to study and propose solutions allowing to drastically improve the performance and reliability of inter-domain communications. One of the most important tools to achieve this goal, is to control the routing and TE decisions performed by routing domains. Therefore, this thesis explores different strategies on how to control such decisions in a highly efficient and accurate way. At present, this control mostly resides in BGP, but as mentioned above, BGP is in fact one of the main causes of the existing limitations. The natural next-step would be to replace BGP, but the large installed base at present together with its recognized effectiveness in other aspects, are clear indicators that its replacement (or its possible evolution) will probably be gradually put into practice.In this framework, this thesis proposes to to study and contribute with novel strategies to control the routing and TE decisions of domains in three different time frames: i) at present in IP multi-domain networks; ii) in the near-future in IP/MPLS (MultiProtocol Label Switching) multi- domain networks; and iii) in the future optical Internet, modeling in this way a realistic and progressive evolution, facilitating the gradual replacement of BGP.More specifically, the contributions in this thesis can be summarized as follows. - We start by proposing incremental strategies based on Intelligent Route Control (IRC) solutions for IP networks. The strategies proposed in this case are incremental in the sense that they interact with BGP, and tackle several of its well-known limitations. - Then, we propose a set of concurrent route control strategies for MPLS networks, based on broadening the concept of the Path Computation Element (PCE) coming from the IETF (Internet Engineering Task Force). Our strategies are concurrent in the sense that they do not interact directly with BGP, and they can be deployed in parallel. In this case, BGP still controlls the routing and TE actions concerning regular IP-based traffic, but not how IP/MPLS paths are routed and controlled. These are handled independently by the PCEs.- We end with the proposal of a set of route control strategies for multi-domain optical networks, where BGP has been completely replaced. These strategies are supported by the introduction of a new route control element, which we named Inter-Domain Routing Agent (IDRA). These IDRAs provide a dedicated control plane, i.e., physically independent from the data plane, and with high computational capacity for future optical networks.The results obtained validate the effectiveness of the strategies proposed here, and confirm that our proposals significantly improve both the conception and performance of the current IRC solutions, the expected PCE in the near-future, as well as the existing proposals about the optical extension of BGP.Postprint (published version
Recommended from our members
Application priority framework for fixed mobile converged communication networks
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The current prospects in wired and wireless access networks, it is becoming increasingly important to address potential convergence in order to offer integrated broadband services. These systems will need to offer higher data transmission capacities and long battery life, which is the catalyst for an everincreasing variety of air interface technologies targeting local area to wide area connectivity. Current integrated industrial networks do not offer application aware context delivery and enhanced services for optimised networks. Application aware services provide value-added functionality to business applications by capturing, integrating, and consolidating intelligence about users and their endpoint devices from various points in the network. This thesis mainly intends to resolve the issues related to ubiquitous application aware service, fair allocation of radio access, reduced energy consumption and improved capacity. A technique that measures and evaluates the data rate demand to reduce application response time and queuing delay for multi radio interfaces is proposed. The technique overcomes the challenges of network integration, requiring no user intervention, saving battery life and selecting the radio access connection for the application requested by the end user. This study is split in two parts. The first contribution identifies some constraints of the services towards the application layer in terms of e.g. data rate and signal strength. The objectives are achieved by application controlled handover (ACH) mechanism in order to maintain acceptable data rate for real-time application services. It also looks into the impact of the radio link on the application and identifies elements and parameters like wireless link quality and handover that will influence the application type. It also identifies some enhanced traditional mechanisms such as distance controlled multihop and mesh topology required in order to support energy efficient multimedia applications. The second contribution unfolds an intelligent application priority assignment mechanism (IAPAM) for medical applications using wireless sensor networks. IAPAM proposes and evaluates a technique based on prioritising multiple virtual queues for the critical nature of medical data to improve instant transmission. Various mobility patterns (directed, controlled and random waypoint) has been investigated and compared by simulating IAPAM enabled mobile BWSN. The following topics have been studied, modelled, simulated and discussed in this thesis: 1. Application Controlled Handover (ACH) for multi radios over fibre 2. Power Controlled Scheme for mesh multi radios over fibre using ACH 3. IAPAM for Biomedical Wireless Sensor Networks (BWSN) and impact of mobility over IAPAM enabled BWSN. Extensive simulation studies are performed to analyze and to evaluate the proposed techniques. Simulation results demonstrate significant improvements in multi radios over fibre performance in terms of application response delay and power consumption by upto 75% and 15 % respectively, reduction in traffic loss by upto 53% and reduction in delay for real time application by more than 25% in some cases
Cross-layer modeling and optimization of next-generation internet networks
Scaling traditional telecommunication networks so that they are able to cope with the volume of future traffic demands and the stringent European Commission (EC) regulations on emissions would entail unaffordable investments. For this very reason, the design of an innovative ultra-high bandwidth power-efficient network architecture is nowadays a bold topic within the research community. So far, the independent evolution of network layers has resulted in isolated, and hence, far-from-optimal contributions, which have eventually led to the issues today's networks are facing such as inefficient energy strategy, limited network scalability and flexibility, reduced network manageability and increased overall network and customer services costs. Consequently, there is currently large consensus among network operators and the research community that cross-layer interaction and coordination is fundamental for the proper architectural design of next-generation Internet networks.
This thesis actively contributes to the this goal by addressing the modeling, optimization and performance analysis of a set of potential technologies to be deployed in future cross-layer network architectures. By applying a transversal design approach (i.e., joint consideration of several network layers), we aim for achieving the maximization of the integration of the different network layers involved in each specific problem. To this end, Part I provides a comprehensive evaluation of optical transport networks (OTNs) based on layer 2 (L2) sub-wavelength switching (SWS) technologies, also taking into consideration the impact of physical layer impairments (PLIs) (L0 phenomena). Indeed, the recent and relevant advances in optical technologies have dramatically increased the impact that PLIs have on the optical signal quality, particularly in the context of SWS networks. Then, in Part II of the thesis, we present a set of case studies where it is shown that the application of operations research (OR) methodologies in the desing/planning stage of future cross-layer Internet network architectures leads to the successful joint optimization of key network performance indicators (KPIs) such as cost (i.e., CAPEX/OPEX), resources usage and energy consumption. OR can definitely play an important role by allowing network designers/architects to obtain good near-optimal solutions to real-sized problems within practical running times
Architectures and protocols for sub-wavelength optical networks: contributions to connectionless and connection-oriented data transport
La rĂ pida evoluciĂł d’Internet i l’à mplia gamma de noves aplicacions (per exemple, multimèdia, videoconferència, jocs en lĂnia, etc.) ha fomentat canvis revolucionaris en la manera com ens comuniquem. A mĂ©s, algunes d’aquestes aplicacions demanden grans quantitats de recursos d’ample de banda amb diversos requeriments de qualitat de servei (QoS).
El desenvolupament de la multiplexaciĂł per divisiĂł de longitud d’ona (WDM) en els anys noranta va fer molt rendible la disponibilitat d’ample de banda. Avui dia, les tecnologies de commutaciĂł òptica de circuits sĂłn predominants en el nucli de la xarxa, les quals permeten la configuraciĂł de canals (lightpaths) a travĂ©s de la xarxa. No obstant això, la granularitat d’aquests canals ocupa tota la longitud d’ona, el que fa que siguin ineficients per a proveir canals de menor ample de banda (sub-longitud d’ona). Segons la comunitat cientĂfica, Ă©s necessari augmentar la transparència dels protocols, aixĂ com millorar l’aprovisionament d’ample de banda de forma dinĂ mica. Per tal de fer això realitat, Ă©s necessari desenvolupar noves arquitectures. La commutaciĂł òptica de rĂ fegues i de paquets (OBS/OPS), sĂłn dues de les tecnologies proposades.
Aquesta tesi contribueix amb tres arquitectures de xarxa destinades a millorar el transport de dades sub-longitud d’ona. En primer lloc, aprofundim en la naturalesa sense connexió en OBS. En aquest cas, la xarxa incrementa el seu dinamisme a causa de les transmissions a rà fega. A més, les col·lisions entre rà fegues degraden el rendiment de la xarxa fins i tot a cà rregues molt baixes. Per fer front a aquestes col·lisions, es proposa un esquema de resolució de col·lisions pro actiu basat en un algorisme d’encaminament i assignació de longitud d’ona (RWA) que balanceja de forma automà tica i distribuïda la cà rrega en la xarxa. En aquest protocol, el RWA i la transmissió de rà fegues es basen en l’explotació i exploració de regles de commutació que incorporen informació sobre contencions i encaminament. Per donar suport a aquesta arquitectura, s’utilitzen dos tipus de paquets de control per a l’encaminament de les rà fegues i l’actualització de les regles de commutació, respectivament. Per analitzar els beneficis del nou algorisme, s’utilitzen quatre topologies de xarxa diferents. Els resultats indiquen que el mètode proposat millora en diferents marges la resta d’algorismes RWA en funció de la topologia i sense penalitzar altres parà metres com el retard extrem a extrem.
La segona contribuciĂł proposa una arquitectura hĂbrida sense i orientada a connexiĂł sobre la base d’un protocol de control d’accĂ©s al medi (MAC) per a xarxes OBS (DAOBS). El MAC ofereix dos mètodes d’accĂ©s: arbitratge de cua (QA) per a la transmissiĂł de rĂ fegues sense connexiĂł, i pre-arbitratge (PA) per serveis TDM orientats a connexiĂł. Aquesta arquitectura permet una Ă mplia gamma d’aplicacions sensibles al retard i al bloqueig. Els resultats avaluats a travĂ©s de simulacions mostren que en l’accĂ©s QA, les rĂ fegues de mĂ©s alta prioritat tenen garantides zero pèrdues i latències d’accĂ©s molt baixes. Pel que fa a l’accĂ©s PA, es reporta que la duplicaciĂł de la cĂ rrega TDM augmenta en mĂ©s d’un ordre la probabilitat de bloqueig, però sense afectar en la mateixa mesura les rĂ fegues sense connexiĂł. En aquest capĂtol tambĂ© es tracten dos dels problemes relacionats amb l’arquitectura DAOBS i el seu funcionament. En primer lloc, es proposa un model matemĂ tic per aproximar el retard d’accĂ©s inferior i superior com a conseqüència de l’accĂ©s QA. En segon lloc, es formula matemĂ ticament la generaciĂł i optimitzaciĂł de les topologies virtuals que suporten el protocol per a l’escenari amb trĂ fic estĂ tic.
Finalment, l’última contribuciĂł explora els beneficis d’una arquitectura de xarxa òptica per temps compartit (TSON) basada en elements de cĂ lcul de camins (PCE) centralitzats per tal d’evitar col·lisions en la xarxa. Aquesta arquitectura permet garantir l’aprovisionament orientat a connexiĂł de canals sub-longitud d’ona. En aquest capĂtol proposem i simulem tres arquitectures GMPLS/PCE/TSON. A causa del enfocament centralitzat, el rendiment de la xarxa depèn en gran mesura de l’assignaciĂł i aprovisionament de les connexions. Amb aquesta finalitat, es proposen diferents algorismes d’assignaciĂł de ranures temporals i es comparen amb les corresponents formulacions de programaciĂł lineal (ILP) per al cas estĂ tic. Per al cas de trĂ fic dinĂ mic, proposem i avaluem mitjançant simulaciĂł diferents heurĂstiques. Els resultats mostren els beneficis de proporcionar flexibilitat en els dominis temporal i freqĂĽencial a l’hora d’assignar les ranures temporals.The rapid evolving Internet and the broad range of new data applications (e.g., multimedia, video-conference, online gaming, etc.)
is fostering revolutionary changes in the way we communicate. In addition, some of these applications demand for unprecedented
amounts of bandwidth resources with diverse quality of service (QoS).
The development of wavelength division multiplexing (WDM) in the 90's made very cost-effective the availability of bandwidth.
Nowadays, optical circuit switching technologies are predominant in the core enabling the set up of lightpaths across the network.
However, full-wavelength lightpath granularity is too coarse, which results to be inefficient for provisioning sub-wavelength
channels. As remarked by the research community, an open issue in optical networking is increasing the protocol transparency as
well as provisioning true dynamic bandwidth allocation at the network level. To this end, new architectures are required. Optical
burst/packet switching (OBS/OPS) are two such proposed technologies under investigation.
This thesis contributes with three network architectures which aim at improving the sub-wavelength data transport from different
perspectives. First, we gain insight into the connectionless nature of OBS. Here, the network dynamics are increased due to the
short-lived burst transmissions. Moreover, burst contentions degrade the performance even at very low loads. To cope with them,
we propose a proactive resolution scheme by means of a distributed auto load-balancing routing and wavelength assignment
(RWA) algorithm for wavelength-continuity constraint networks. In this protocol, the RWA and burst forwarding is based on the
exploitation and exploration of switching rule concentration values that incorporate contention and forwarding desirability
information. To support such architecture, forward and backward control packets are used in the burst forwarding and updating
rules, respectively. In order to analyze the benefits of the new algorithm, four different network topologies are used. Results
indicate that the proposed method outperforms the rest of tested RWA algorithms at various margins depending on the topology
without penalizing other parameters such as end-to-end delay.
The second contribution proposes a hybrid connectionless and connection-oriented architecture based on a medium access control
(MAC) protocol for OBS networks (DAOBS). The MAC provides two main access mechanisms: queue arbitrated (QA) for
connectionless bursts and pre-arbitrated (PA) for TDM connection-oriented services. Such an architecture allows for a broad range
of delay-sensitive applications or guaranteed services. Results evaluated through simulations show that in the QA access mode
highest priority bursts are guaranteed zero losses and very low access latencies. Regarding the PA mode, we report that doubling
the offered TDM traffic load increases in more than one order their connection blocking, slightly affecting the blocking of other
connectionless bursts. In this chapter, we also tackle two of the issues related with the DAOBS architecture and its operation.
Firstly, we model mathematically the lower and upper approximations of the access delay as a consequence of the connectionless
queue arbitrated access. Secondly, we formulate the generation of the virtual light-tree overlay topology for the static traffic case.Postprint (published version
Characterization, design and re-optimization on multi-layer optical networks
L'augment de volum de trĂ fic IP provocat per l'increment de serveis multimèdia com HDTV o vĂdeo conferència planteja nous reptes als operadors de xarxa per tal de proveir transmissiĂł de dades eficient. Tot i que les xarxes mallades amb multiplexaciĂł per divisiĂł de longitud d'ona (DWDM) suporten connexions òptiques de gran velocitat, aquestes xarxes manquen de flexibilitat per suportar trĂ fic d’inferior granularitat, fet que provoca un pobre Ăşs d'ample de banda. Per fer front al transport d'aquest trĂ fic heterogeni, les xarxes multicapa representen la millor soluciĂł.
Les xarxes òptiques multicapa permeten optimitzar la capacitat mitjançant l'empaquetament de connexions de baixa velocitat dins de connexions òptiques de gran velocitat. Durant aquesta operació, es crea i modifica constantment una topologia virtual dinà mica grà cies al pla de control responsable d’aquestes operacions. Donada aquesta dinamicitat, un ús sub-òptim de recursos pot existir a la xarxa en un moment donat. En aquest context, una re-optimizació periòdica dels recursos utilitzats pot ser aplicada, millorant aixà l'ús de recursos.
Aquesta tesi estĂ dedicada a la caracteritzaciĂł, planificaciĂł, i re-optimitzaciĂł de xarxes òptiques multicapa de nova generaciĂł des d’un punt de vista unificat incloent optimitzaciĂł als nivells de capa fĂsica, capa òptica, capa virtual i pla de control. Concretament s'han desenvolupat models estadĂstics i de programaciĂł matemĂ tica i meta-heurĂstiques. Aquest objectiu principal s'ha assolit mitjançant cinc objectius concrets cobrint diversos temes oberts de recerca.
En primer lloc, proposem una metodologia estadĂstica per millorar el cĂ lcul del factor Q en problemes d'assignaciĂł de ruta i longitud d'ona considerant interaccions fĂsiques (IA-RWA). Amb aquest objectiu, proposem dos models estadĂstics per computar l'efecte XPM (el coll d'ampolla en termes de computaciĂł i complexitat) per problemes IA-RWA, demostrant la precisiĂł d’ambdĂłs models en el cĂ lcul del factor Q en escenaris reals de trĂ fic.
En segon lloc i fixant-nos a la capa òptica, presentem un nou particionament del conjunt de longituds d'ona que permet maximitzar, respecte el cas habitual, la quantitat de trĂ fic extra proveĂŻt en entorns de protecciĂł compartida. Concretament, definim diversos models estadĂstics per estimar la quantitat de trĂ fic donat un grau de servei objectiu, i diferents models de planificaciĂł de xarxa amb l'objectiu de maximitzar els ingressos previstos i el valor actual net de la xarxa. DesprĂ©s de resoldre aquests problemes per xarxes reals, concloem que la nostra proposta maximitza ambdĂłs objectius.
En tercer lloc, afrontem el disseny de xarxes multicapa robustes davant de fallida simple a la capa IP/MPLS i als enllaços de fibra. Per resoldre aquest problema eficientment, proposem un enfocament basat en sobre-dimensionar l'equipament de la capa IP/MPLS i recuperar la connectivitat i el comparem amb la soluciĂł convencional basada en duplicar la capa IP/MPLS. DesprĂ©s de comparar solucions mitjançant models ILP i heurĂstiques, concloem que la nostra soluciĂł permet obtenir un estalvi significatiu en termes de costos de desplegament.
Com a quart objectiu, introduĂŻm un mecanisme adaptatiu per reduir l'Ăşs de ports opto-electrònics (O/E) en xarxes multicapa sota escenaris de trĂ fic dinĂ mic. Una formulaciĂł ILP i diverses heurĂstiques sĂłn desenvolupades per resoldre aquest problema, que permet reduir significativament l’ús de ports O/E en temps molt curts.
Finalment, adrecem el problema de disseny resilient del pla de control GMPLS. DesprĂ©s de proposar un nou model analĂtic per quantificar la resiliència en topologies mallades de pla de control, usem aquest model per proposar un problema de disseny de pla de control. Proposem un procediment iteratiu lineal i una heurĂstica i els usem per resoldre instĂ ncies reals, arribant a la conclusiĂł que es pot reduir significativament la quantitat d'enllaços del pla de control sense afectar la qualitat de servei a la xarxa.The explosion of IP traffic due to the increase of IP-based multimedia services such as HDTV or video conferencing poses new challenges to network operators to provide a cost-effective data transmission. Although Dense Wavelength Division Multiplexing (DWDM) meshed transport networks support high-speed optical connections, these networks lack the flexibility to support sub-wavelength traffic leading to poor bandwidth usage. To cope with the transport of that huge and heterogeneous amount of traffic, multilayer networks represent the most accepted architectural solution.
Multilayer optical networks allow optimizing network capacity by means of packing several low-speed traffic streams into higher-speed optical connections (lightpaths). During this operation, a dynamic virtual topology is created and modified the whole time thanks to a control plane responsible for the establishment, maintenance, and release of connections. Because of this dynamicity, a suboptimal allocation of resources may exist at any time. In this context, a periodically resource reallocation could be deployed in the network, thus improving network resource utilization.
This thesis is devoted to the characterization, planning, and re-optimization of next-generation multilayer networks from an integral perspective including physical layer, optical layer, virtual layer, and control plane optimization. To this aim, statistical models, mathematical programming models and meta-heuristics are developed. More specifically, this main objective has been attained by developing five goals covering different open issues.
First, we provide a statistical methodology to improve the computation of the Q-factor for impairment-aware routing and wavelength assignment problems (IA-RWA). To this aim we propose two statistical models to compute the Cross-Phase Modulation variance (which represents the bottleneck in terms of computation time and complexity) in off-line and on-line IA-RWA problems, proving the accuracy of both models when computing Q-factor values in real traffic scenarios.
Second and moving to the optical layer, we present a new wavelength partitioning scheme that allows maximizing the amount of extra traffic provided in shared path protected environments compared with current solutions. Specifically, we define several statistical models to estimate the traffic intensity given a target grade of service, and different network planning problems for maximizing the expected revenues and net present value. After solving these problems for real networks, we conclude that our proposed scheme maximizes both revenues and NPV.
Third, we tackle the design of survivable multilayer networks against single failures at the IP/MPLS layer and WSON links. To efficiently solve this problem, we propose a new approach based on over-dimensioning IP/MPLS devices and lightpath connectivity and recovery and we compare it against the conventional solution based on duplicating backbone IP/MPLS nodes. After evaluating both approaches by means of ILP models and heuristic algorithms, we conclude that our proposed approach leads to significant CAPEX savings.
Fourth, we introduce an adaptive mechanism to reduce the usage of opto-electronic (O/E) ports of IP/MPLS-over-WSON multilayer networks in dynamic scenarios. A ILP formulation and several heuristics are developed to solve this problem, which allows significantly reducing the usage of O/E ports in very short running times.
Finally, we address the design of resilient control plane topologies in GMPLS-enabled transport networks. After proposing a novel analytical model to quantify the resilience in mesh control plane topologies, we use this model to propose a problem to design the control plane topology. An iterative model and a heuristic are proposed and used to solve real instances, concluding that a significant reduction in the number of control plane links can be performed without affecting the quality of service of the network
Towards An Optimal Core Optical Network Using Overflow Channels
This dissertation is based on a traditional circuit switched core WDM network that is supplemented by a pool of wavelengths that carry optical burst switched overflow data. These overflow channels function to absorb channel overflows from traditional circuit switched networks and they also provide wavelengths for newer, high bandwidth applications. The channel overflows that appear at the overflow layer as optical bursts are either carried over a permanently configured, primary light path, or over a burst-switched, best-effort path while traversing the core network. At every successive hop along the best effort path, the optical bursts will attempt to enter a primary light path to its destination. Thus, each node in the network is a Hybrid Node that will provide entry for optical bursts to hybrid path that is made of a point to point, pre-provisioned light path or a burst switched path. The dissertation's main outcome is to determine the cost optimality of a Hybrid Route, to analyze cost-effectiveness of a Hybrid Node and compare it to a route and a node performing non-hybrid operation, respectively. Finally, an example network that consists of several Hybrid Routes and Hybrid Nodes is analyzed for its cost-effectiveness. Cost-effectiveness and optimality of a Hybrid Route is tested for its dependency on the mean and variance of channel demands offered to the route, the number of sources sharing the route, and the relative cost of a primary and overflow path called path cost ratio. An optimality condition that relates the effect of traffic statistics to the path cost ratio is analytically derived and tested. Cost-effectiveness of a Hybrid Node is compared among different switching fabric architecture that is used to construct the Hybrid Node. Broadcast-Select, Benes and Clos architectures are each considered with different degrees of chip integration. An example Hybrid Network that consists of several Hybrid Routes and Hybrid Nodes is found to be cost-effective and dependent of the ratio of switching to transport costs
Optimised Design and Analysis of All-Optical Networks
This PhD thesis presents a suite of methods for optimising design and for analysing blocking probabilities of all-optical networks. It thus contributes methodical knowledge to the field of computer assisted planning of optical networks. A two-stage greenfield optical network design optimiser is developed, based on shortest-path algorithms and a comparatively new metaheuristic called simulated allocation. It is able to handle design of all-optical mesh networks with optical cross-connects, considers duct as well as fibre and node costs, and can also design protected networks. The method is assessed through various experiments and is shown to produce good results and to be able to scale up to networks of realistic sizes. A novel method, subpath wavelength grouping, for routing connections in a multigranular all-optical network where several wavelengths can be grouped and switched at band and fibre level is presented. The method uses an unorthodox routing strategy focusing on common subpaths rather than individual connections, and strives to minimise switch port count as well as fibre usage. It is shown to produce cheaper network designs than previous methods when fibre costs are comparatively high. A new optical network concept, the synchronous optical hierarchy, is proposed, in which wavelengths are subdivided into timeslots to match the traffic granularity. Various theoretical properties of this concept are investigated and compared in simulation studies. An integer linear programming model for optical ring network design is presented. Manually designed real world ring networks are studied and it is found that the model can lead to cheaper network design. Moreover, ring and mesh network architectures are compared using real world costs, and it is found that optical cros..
- …