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

Resilience mechanisms for carrier-grade networks

In recent years, the advent of new Future Internet (FI) applications is creating ever-demanding requirements. These requirements are pushing network carriers for high transport capacity, energy efficiency, as well as high-availability services with low latency. A widespread practice to provide FI services is the adoption of a multi-layer network model consisting in the use of IP/MPLS and optical technologies such as Wavelength Division Multiplexing (WDM). Indeed, optical transport technologies are the foundation supporting the current telecommunication network backbones, because of the high transmission bandwidth achieved in fiber optical networks. Traditional optical networks consist of a fixed 50 GHz grid, resulting in a low Optical Spectrum (OS) utilization, specifically with transmission rates above 100 Gbps. Recently, optical networks have been undergoing significant changes with the purpose of providing a flexible grid that can fully exploit the potential of optical networks. This has led to a new network paradigm termed as Elastic Optical Network (EON). In recent years, the advent of new Future Internet (FI) applications is creating ever-demanding requirements. A widespread practice to provide FI services is the adoption of a multi-layer network model consisting in the use of IP/MPLS and optical technologies such as Wavelength Division Multiplexing (WDM). Traditional optical networks consist of a fixed 50 GHz grid, resulting in a low Optical Spectrum (OS) utilization. Recently, optical networks have been undergoing significant changes with the purpose of providing a flexible grid that can fully exploit the potential of optical networks. This has led to a new network paradigm termed as Elastic Optical Network (EON). Recently, a new protection scheme referred to as Network Coding Protection (NCP) has emerged as an innovative solution to proactively enable protection in an agile and efficient manner by means of throughput improvement techniques such as Network Coding. It is an intuitive reasoning that the throughput advantages of NCP might be magnified by means of the flexible-grid provided by EONs. The goal of this thesis is three-fold. The first, is to study the advantages of NCP schemes in planning scenarios. For this purpose, this thesis focuses on the performance of NCP assuming both a fixed as well as a flexible spectrum grid. However, conversely to planning scenarios, in dynamic scenarios the accuracy of Network State Information (NSI) is crucial since inaccurate NSI might substantially affect the performance of an NCP scheme. The second contribution of this thesis is to study the performance of protection schemes in dynamic scenarios considering inaccurate NSI. For this purpose, this thesis explores prediction techniques in order to mitigate the negative effects of inaccurate NSI. On the other hand, Internet users are continuously demanding new requirements that cannot be supported by the current host-oriented communication model.This communication model is not suitable for future Internet architectures such as the so-called Internet of Things (IoT). Fortunately, there is a new trend in network research referred to as ID/Locator Split Architectures (ILSAs) which is a non-disruptive technique to mitigate the issues related to host-oriented communications. Moreover, a new routing architecture referred to as Path Computation Element (PCE) has emerged with the aim of overcoming the well-known issues of the current routing schemes. Undoubtedly, routing and protection schemes need to be enhanced to fully exploit the advantages provided by new network architectures.In light of this, the third goal of this thesis introduces a novel PCE-like architecture termed as Context-Aware PCE. In a context-aware PCE scenario, the driver of a path computation is not a host/location, as in conventional PCE architectures, rather it is an interest for a service defined within a context.En los últimos años la llegada de nuevas aplicaciones del llamado Internet del Futuro (FI) está creando requerimientos sumamente exigentes. Estos requerimientos están empujando a los proveedores de redes a incrementar sus capacidades de transporte, eficiencia energética, y sus prestaciones de servicios de alta disponibilidad con baja latencia. Es una práctica sumamente extendida para proveer servicios (FI) la adopción de un modelo multi-capa el cual consiste en el uso de tecnologías IP/MPLS así como también ópticas como por ejemplo Wavelength Division Multiplexing (WDM). De hecho, las tecnologías de transporte son el sustento del backbone de las redes de telecomunicaciones actuales debido al gran ancho de banda que proveen las redes de fibra óptica. Las redes ópticas tradicionales consisten en el uso de un espectro fijo de 50 GHz. Esto resulta en una baja utilización del espectro Óptico, específicamente con tasas de transmisiones superiores a 100 Gbps. Recientemente, las redes ópticas están experimentado cambios significativos con el propósito de proveer un espectro flexible que pueda explotar el potencial de las redes ópticas. Esto ha llevado a un nuevo paradigma denominado Redes Ópticas Elásticas (EON). Por otro lado, un nuevo esquema de protección llamado Network Coding Protection (NCP) ha emergido como una solución innovadora para habilitar de manera proactiva protección eficiente y ágil usando técnicas de mejora de throughput como es Network Coding (NC). Es un razonamiento lógico pensar que las ventajas relacionadas con throughput de NCP pueden ser magnificadas mediante el espectro flexible proveído por las redes EONs. El objetivo de esta tesis es triple. El primero es estudiar las ventajas de esquemas NCP en un escenario de planificación. Para este propósito, esta tesis se enfoca en el rendimiento de NCP asumiendo un espectro fijo y un espectro flexible. Sin embargo, contrario a escenarios de planificación, en escenarios dinámicos la precisión relacionada de la Información de Estado de Red (NSI) es crucial, ya que la imprecisión de NSI puede afectar sustancialmente el rendimiento de un esquema NCP. La segunda contribución de esta tesis es el estudio del rendimiento de esquemas de protección en escenarios dinámicos considerando NSI no precisa. Para este propósito, esta tesis explora técnicas predictivas con el propósito de mitigar los efectos negativos de NSI impreciso. Por otro lado, los usuarios de Internet están demandando continuamente nuevos requerimientos los cuales no pueden ser soportados por el modelo de comunicación orientado a hosts. Este modelo de comunicaciones no es factible para arquitecturas FI como es el Internet de las cosas (IoT). Afortunadamente, existe un nueva línea investigativa llamada ID/Locator Split Architectures (ILSAs) la cual es una técnica no disruptiva para mitigar los problemas relacionadas con el modelo de comunicación orientado a hosts. Además, un nuevo esquema de enrutamiento llamado as Path Computation Element (PCE) ha emergido con el propósito de superar los problemas bien conocidos de los esquemas de enrutamiento tradicionales. Indudablemente, los esquemas de enrutamiento y protección deben ser mejorados para que estos puedan explotar las ventajas introducidas por las nuevas arquitecturas de redes. A luz de esto, el tercer objetivo de esta tesis es introducir una nueva arquitectura PCE denominada Context-Aware PCE. En un escenario context-aware PCE, el objetivo de una acción de computación de camino no es un host o localidad, como es el caso en lo esquemas PCE tradicionales. Más bien, es un interés por un servicio definido dentro de una información de contexto

Reducing Internet Latency : A Survey of Techniques and their Merit

Bob Briscoe, Anna Brunstrom, Andreas Petlund, David Hayes, David Ros, Ing-Jyh Tsang, Stein Gjessing, Gorry Fairhurst, Carsten Griwodz, Michael WelzlPeer reviewedPreprin

Hierarchical network topographical routing

Within the last 10 years the content consumption model that underlies many of the assumptions about traffic aggregation within the Internet has changed; the previous short burst transfer followed by longer periods of inactivity that allowed for statistical aggregation of traffic has been increasingly replaced by continuous data transfer models. Approaching this issue from a clean slate perspective; this work looks at the design of a network routing structure and supporting protocols for assisting in the delivery of large scale content services. Rather than approaching a content support model through existing IP models the work takes a fresh look at Internet routing through a hierarchical model in order to highlight the benefits that can be gained with a new structural Internet or through similar modifications to the existing IP model. The work is divided into three major sections: investigating the existing UK based Internet structure as compared to the traditional Autonomous System (AS) Internet structural model; a localised hierarchical network topographical routing model; and intelligent distributed localised service models. The work begins by looking at the United Kingdom (UK) Internet structure as an example of a current generation technical and economic model with shared access to the last mile connectivity and a large scale wholesale network between Internet Service Providers (ISPs) and the end user. This model combined with the Internet Protocol (IP) address allocation and transparency of the wholesale network results in an enforced inefficiency within the overall network restricting the ability of ISPs to collaborate. From this model a core / edge separation hierarchical virtual tree based routing protocol based on the physical network topography (layers 2 and 3) is developed to remove this enforced inefficiency by allowing direct management and control at the lowest levels of the network. This model acts as the base layer for further distributed intelligent services such as management and content delivery to enable both ISPs and third parties to actively collaborate and provide content from the most efficient source

Methods and design issues for next generation network-aware applications

Networks are becoming an essential component of modern cyberinfrastructure and this work describes methods of designing distributed applications for high-speed networks to improve application scalability, performance and capabilities. As the amount of data generated by scientific applications continues to grow, to be able to handle and process it, applications should be designed to use parallel, distributed resources and high-speed networks. For scalable application design developers should move away from the current component-based approach and implement instead an integrated, non-layered architecture where applications can use specialized low-level interfaces. The main focus of this research is on interactive, collaborative visualization of large datasets. This work describes how a visualization application can be improved through using distributed resources and high-speed network links to interactively visualize tens of gigabytes of data and handle terabyte datasets while maintaining high quality. The application supports interactive frame rates, high resolution, collaborative visualization and sustains remote I/O bandwidths of several Gbps (up to 30 times faster than local I/O). Motivated by the distributed visualization application, this work also researches remote data access systems. Because wide-area networks may have a high latency, the remote I/O system uses an architecture that effectively hides latency. Five remote data access architectures are analyzed and the results show that an architecture that combines bulk and pipeline processing is the best solution for high-throughput remote data access. The resulting system, also supporting high-speed transport protocols and configurable remote operations, is up to 400 times faster than a comparable existing remote data access system. Transport protocols are compared to understand which protocol can best utilize high-speed network connections, concluding that a rate-based protocol is the best solution, being 8 times faster than standard TCP. An HD-based remote teaching application experiment is conducted, illustrating the potential of network-aware applications in a production environment. Future research areas are presented, with emphasis on network-aware optimization, execution and deployment scenarios