Heuristic for Lowering Electricity Costs for Routing in Optical Data Center Networks

Optical data centers consume a large quantity of energy and the cost of that energy has a significant contribution to the operational cost in data centers. The amount of electricity consumption in data centers and their related costs are increasing day by day. Data centers are geographically distributed all around the continents and the growing numbers of data replicas have made it possible to find more cost effective network routing. Besides flat-rate prices, today, there are companies which offers real-time pricing. In order to address the energy consumption cost problem, we propose an energy efficient routing scheme to find least cost path to the replicas based on real-time pricing model called energy price aware routing (EPAR). Our research considers anycast data transmission model to find the suitable replica as well as the fixed window traffic allocation model for demand request to reduce the energy consumption cost of data center networks

Ontwerp en evaluatie van content distributie netwerken voor multimediale streaming diensten.

Traditionele Internetgebaseerde diensten voor het verspreiden van bestanden, zoals Web browsen en het versturen van e-mails, worden aangeboden via één centrale server. Meer recente netwerkdiensten zoals interactieve digitale televisie of video-op-aanvraag vereisen echter hoge kwaliteitsgaranties (QoS), zoals een lage en constante netwerkvertraging, en verbruiken een aanzienlijke hoeveelheid bandbreedte op het netwerk. Architecturen met één centrale server kunnen deze garanties moeilijk bieden en voldoen daarom niet meer aan de hoge eisen van de volgende generatie multimediatoepassingen. In dit onderzoek worden daarom nieuwe netwerkarchitecturen bestudeerd, die een dergelijke dienstkwaliteit kunnen ondersteunen. Zowel peer-to-peer mechanismes, zoals bij het uitwisselen van muziekbestanden tussen eindgebruikers, als servergebaseerde oplossingen, zoals gedistribueerde caches en content distributie netwerken (CDN's), komen aan bod. Afhankelijk van de bestudeerde dienst en de gebruikte netwerktechnologieën en -architectuur, worden gecentraliseerde algoritmen voor netwerkontwerp voorgesteld. Deze algoritmen optimaliseren de plaatsing van de servers of netwerkcaches en bepalen de nodige capaciteit van de servers en netwerklinks. De dynamische plaatsing van de aangeboden bestanden in de verschillende netwerkelementen wordt aangepast aan de heersende staat van het netwerk en aan de variërende aanvraagpatronen van de eindgebruikers. Serverselectie, herroutering van aanvragen en het verspreiden van de belasting over het hele netwerk komen hierbij ook aan bod

Label-controlled optical switching nodes

Optical networks are evolving from initially static optical circuits and subsequently optical circuit switching towards optical packet switching in order to take advan- tage of the high transport capacity made available by WDM systems in a more °exible and e±cient way. Optically labeling of packets and routing the packets's payload optically under control of its label allows the network nodes to route and forward IP data without having to process the payload, thus keeping it in the optical domain; this is a promising solution to avoid electronic bottlenecks in routers. All-optical label switching can therefore be used to route and forward packets independent of their length and payload bitrate. Several optical signal labeling techniques have been proposed in previous re- search reported in literature; orthogonal labeling and time-serial labeling have been studied in this thesis. This thesis studies two orthogonal modulation label- ing techniques: one based on FSK labels with an IM payload, and another one on SCM labeling for a DPSK modulated payload. A time-serial labeling method based on IM labels with IM or DPSK payload is also presented and studied. The ¯rst two techniques assume electronic processing of the labels in the node, and hence assume that labels can be transmitted at a much lower bitrate than the payload data rate. The third technique assumes all-optical signal processing in the nodes, capable of handling a label at the same bitrate or slightly lower than the payload data. Labels at low bitrate in comparison with the payload bitrate are desirable in systems where the label processing will be conducted in the electrical domain, while labels at the same bitrate as the payload can be used in systems where the processing is conducted in the optical domain, exploiting all-optical processing techniques. These three techniques have been chosen because they are compatible with the existing networks, since the modulation format, bitrates, transmission properties, and other features of the signals are similar to the ones used for commercially available applications. Thus, they can be considered important candidates for migration scenarios from optical circuit switching towards optical burst switching networking. Orthogonal labeling based on FSK/IM is a promising scheme for implementing the labeling of optical signals, and it is the technology of choice in the STOLAS project. This technique o®ers advantageous features such as a relaxed timing de- lineation between payload and label, and ease of label erasure and re-writing of new labels. By using wavelength-agile tunable laser sources with FSK modula- tion capability, wavelength converters, and passive wavelength routing elements, a scalable modular label-controlled router featuring high reliability can be built. In this thesis, several aspects of the physical parameters of an FSK/IM labeling scheme within a routing node have been studied and presented. Optical ¯ltering requires special care, since the combined FSK/IM scheme has a broader spectrum than that of pure intensity modulated signals. The requirements on the limited extinction ratio for the IM signal can be relaxed at low bitrates of the label signal or, alternatively, by introducing data encoding. Optical labeling by using FSK/IM represents a simple and attractive way of implementing hybrid optical circuit and burst switching in optical networks. Architecturally, similar advantages can be mentioned for the second orthogo- nal labeling technique studied in this thesis, based on SCM labels and a DPSK payload. In-band subcarriers carrying low bitrate labels located at a frequency equal to half the bitrate of the payload signal can be inserted introducing only low power penalties. Wavelength conversion can be implemented by using passive highly nonlinear ¯bers and exploiting the four-wave mixing e®ect. This thesis also studies the design of two functional blocks of an all-optical core node proposed in the LASAGNE project, namely the all-optical label and payload separator and the wavelength converter unit for a time-serial labeling scheme. The label and payload processor can be realized exploiting nonlinear e®ects in SOAs. An implementation using polarization division multiplexing to transport the external control light for an IM/IM time-serial scheme was demon- strated. Label and payload processors with self-contained control signals were also demonstrated, either using a DPSK signal to simultaneously transport the payload data and the control signal or inserting a CW dummy in between the label and the payload, which were based on IM-RZ format. A study on single- and multi- wavelength conversion based on FWM in a HNLF was presented. This approach allows transparent wavelength conversion (independent of the data format used) at high bitrates (the nonlinear e®ects in a ¯ber are obtained at ultrafast speeds). The labeling techniques explored have indicated a viable way of migration towards optical burst packet switched networks while signi¯cantly improving the throughput of the routing nodes

WDM cross-path switching for large-scale ATM switches.

by Jin Mai.Thesis submitted in: June 1998.Thesis (M.Phil.)--Chinese University of Hong Kong, 1999.Includes bibliographical references (leaves 62-[67]).Abstract also in Chinese.Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Background and Motivation --- p.1Chapter 1.2 --- Organization of the thesis --- p.8Chapter 2 --- Principles of WDM Cross-Path Switch --- p.11Chapter 2.1 --- Principles of path scheduling --- p.11Chapter 2.2 --- Call setup and path rearrangement --- p.15Chapter 2.3 --- ABR control --- p.17Chapter 3 --- Star coupler and WDM path scheduling --- p.20Chapter 3.1 --- Star coupler and other WDM ATM switches --- p.20Chapter 3.2 --- Two schemes of implementation --- p.22Chapter 4 --- input/output modules and local routing --- p.26Chapter 4.1 --- Shared buffer memory switch --- p.26Chapter 4.2 --- local routing at input/output modules --- p.29Chapter 5 --- Multicasting --- p.32Chapter 5.1 --- Two multicasting schemes --- p.32Chapter 5.2 --- Call blocking --- p.36Chapter 6 --- Performance --- p.37Chapter 6.1 --- Introduction --- p.37Chapter 6.2 --- Switch complexity --- p.38Chapter 6.3 --- Speed up --- p.40Chapter 6.4 --- Two multicasting schemes --- p.41Chapter 7 --- Switch Model and Operation --- p.47Chapter 8 --- Conclusions --- p.50Chapter A --- Effective bandwidth and QoS guarantee --- p.52Chapter A.l --- ATM service categories and QoS parameters --- p.52Chapter A.2 --- Effective bandwidth for single source --- p.53Chapter A.2.1 --- Markovian on/off source approach --- p.54Chapter A.2.2 --- Leaky bucket regulated source --- p.55Chapter A.3 --- Effective bandwidth for multiplexed sources --- p.60Chapter A.3.1 --- Gaussian model approach --- p.60Bibliography --- p.6

Energy efficiency in content delivery networks

The increasing popularity of bandwidth-intensive video Internet services has positioned Content Distribution Networks (CDNs) in the limelight as the emerging provider platforms for video delivery. The goal of CDNs is to maximise the availability of content in the network while maintaining the quality of experience expected by users. This is a challenging task due to the scattered nature of video content sources and destinations. Furthermore, the high energy consumption associated with content distribution calls for developing energy-efficient solutions able to cater for the future Internet. This thesis addresses the problem of content placement and update while considering energy consumption in CDNs. First, this work contributed a new energy-efficient caching scheme that stores the most popular content at the edge of the core network and optimises the size of cached content to minimise energy usage. It takes into account the trend of daily traffic and recommends putting inactive segments of caches in sleep-mode during off-peak hours. Our results showed that power minimisation is achieved by deploying switch-off capable caches, and the trend of active cache segments over the time of day follows the trend of traffic. Second, the study explores different content popularity distributions and determines their influence on power consumption. The distribution of content popularity dictates the resultant cache hit ratio achieved by storing a certain number of videos. Therefore, it directly influences the power consumption of the cache. The evaluation results indicated that under video services where the popularity of content is very diverse, the optimum solution is to store the few most popular videos in caches. In contrast, when video popularities are similar, the most power efficient scheme is either to cache the whole library or to avoid caching completely depending on the size of the video library. Third, this thesis contributed an evaluation of the power consumption of the network under real world TV data and considering standard and high definition TV programmes. We proposed a cache replacement algorithm based on the predictable nature of TV viewings. The time-driven proactive cache replacement algorithm replaces cache contents several times a day to minimise power consumption. The algorithm achieves major power savings on top of the power reductions introduced by caching. CDNs are expected to continue to be the backbone for Internet video applications. This work has shown that storing the right amount of popular videos in core caches reduces from 42% to 72% of network power consumption considering a range of content popularity distributions. Maintaining up-to-date cache contents reduces up to 48% and 86% of power consumption considering fixed and sleep-mode capable caches, respectively. Reducing the energy consumption of CDNs provides a valuable contribution for future green video delivery

Advanced techniques for multicast service provision in core transport networks

Although the network-based multicast service is the optimal way to support of a large variety of popular applications such as high-definition television (HDTV), videoon- demand (VoD), virtual private LAN service (VPLS), grid computing, optical storage area networks (O-SAN), video conferencing, e-learning, massive multiplayer online role-playing games (MMORPG), networked virtual reality, etc., there are a number of technological and operational reasons that prevents a wider deployment. This PhD work addresses this problem in the context of core transport network, by proposing and analyzing new cost-effective and scalable techniques to support multicast both at the Optical layer and at the Network layer (MPLS-IP networks). In the Optical layer, in particular in Wavelength Division Multiplexing (WDM) Optical Circuit Switched networks, current multicast-capable OXC node designs are of a great complexity and have high attenuation levels, mainly because of the required signal splitting operation plus the traversal of a complex switching stage. This makes multi-point support rarely included in commercial OXC nodes. Inspired in previous works in the literature, we propose a novel architecture that combines the best of splitting and tap-and-continue (TaC), called 2-STC (2-split-tap-and-continue) in the framework of integrated optics. A 2-STC OXC node is a flexible design capable of tapping and splitting over up to two outgoing links in order to obtain lower end-to-end latency than in TaC and an improved power budget distribution over split-and-delivery (SaD) designs. Another advantage of this architecture is its simplicity and the reduced number of components required, scaling well even for implementations of the node with many input/output ports. Extensive simulations show that the binary split (2-split) is quite enough for most real-life core network topologies scenarios, since the average node degree is usually between 3 and 4. A variant of this design, called 2-STCg, for making the node capable of optical traffic grooming (i.e. accommodation of low-speed demands into wavelength-links) is also presented. At the Network layer, one of the main reasons that hinder multicast deployment is the high amount of forwarding state information required in core routers, especially when a large number of medium/small-sized multicast demands arrive to the core network, because the state data that needs to be kept at intermediate core routers grows proportionally to the number of multicast demands. In this scenario, we study the aggregation of multicast demands into shared distribution trees, providing a set of techniques to observe the trade-off between bandwidth and state information. This study is made in the context of MPLS VPN-based networks, with the aggregation of multicast VPNs in different real network scenarios and using novel heuristics for aggregation. Still, the main problem of aggregation is the high percentage of wasted bandwidth that depends mainly on the amount of shared trees used. On the other hand, recent works have brought back Bloom filters as an alternative for multicast forwarding. In this approach the packet header contains a Bloom filter that is evaluated at each hop for matching with the corresponding outgoing link ID. Although this approach is claimed to be stateless, it presents serious drawbacks due to false positives, namely important forwarding anomalies (duplicated flows, packet storms and loops) and the header overhead. In order to solve these drawbacks we propose D-MPSS (Depth-Wise Multi-Protocol Stateless Switching). This technique makes use of a stack of Bloom filters instead of a single one for all the path/tree, each one including only the links of a given depth of the tree. Analytical studies and simulations show that our approach reduces the forwarding anomalies present in similar state-of-the-art techniques, achieving in most network scenarios a forwarding efficiency (useful traffic) greater than 95%. Finally, we study the possibility of using tree aggregation and Bloom filters together, and propose a set of techniques grouped as H-ABF techniques (hybrid aggregation - Bloom filter-based forwarding), which improve D-MPSS and other previously proposed techniques, practically eliminating the forwarding loops and increasing the forwarding efficiency up to more than 99% in most network scenarios. -----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------Aunque el servicio de multidifusión (multicast) basado en redes es la mejor manera de dar soporte a una gran variedad de aplicaciones populares como la televisión de alta definición (HDTV), el video bajo demanda (VoD), el servicio de LAN privadas virtuales (VPLS), la computación grid, las redes de área de almacenamiento óptico (O-SAN), la videoconferencia, la educación a distancia, los juegos masivos de rol en línea de múltiples jugadores (MMORPG), la realidad virtual en red, etc., hay varias razones tecnológicas y operacionales que le impiden un mayor despliegue. Esta tesis doctoral aborda este problema en el contexto de las redes troncales de transporte, proponiendo y analizando técnicas de bajo coste y escalables para dar soporte al multicast tanto para la capa óptica como para la capa de red (redes MPLS-IP). En la capa óptica, en particular en las redes ópticas conmutadas por circuitos con multiplexación de longitud de onda (WDM), los diseños de nodos OXC con capacidades multicast muestran una gran complejidad y altos niveles de atenuación, principalmente debido a la necesaria operación de división de la señal, además del paso de ella a través de una compleja fase de conmutación. Esto hace que el soporte multi-punto sea raramente incluido en los nodos OXC comerciales. Inspirados en trabajos previos de la literatura, proponemos una novedosa arquitectura que combina lo mejor de dividir (splitting) y tap-y-continuar (TaC), llamado 2-STC (2-split-tapand- continue) en el marco de trabajo de la óptica integrada. Un nodo OXC 2-STC es un diseño flexible capaz de hacer tapping (tomar una pequeña muestra de la señal) y dividir la señal hacia un máximo de dos enlaces de salida, con el fin de obtener una menor latencia terminal-a-terminal que en TaC y una mejorada distribución de la disponibilidad de potencia por encima de los diseños split-and-delivery (SaD). Otra ventaja de esta arquitectura es su simplicidad y el número reducido de componentes requerido, escalando bien para las implementaciones del nodo con muchos puertos de entrada/salida. Extensas simulaciones muestran que la división binaria (2-split) es prácticamente suficiente para la mayoría de las topologías de redes de transporte en la vida real, debido a que el grado promedio de los nodos es usualmente 3 y 4. Una variante de este diseño, llamada 2-STCg, para hacer el nodo capaz de realizar grooming (es decir, la capacidad de acomodar demandas de menor velocidad en longitudes de onda - enlaces) de tráfico óptico, es también presentada. En la capa de red, una de las principales razones que obstaculizan el despliegue del multicast es la gran cantidad de información del estado de reenvío requerida en los enrutadores de la red de transporte, especialmente cuando un gran número de demandas multicast de tamaño mediano/pequeño llegan a la red de transporte, ya que los datos de estado a ser almacenados en los enrutadores crecen proporcionalmente con el número de demandas multicast. En este escenario, estudiamos la agregación de demandas multicast en árboles de distribución, proporcionando un conjunto de técnicas para observar el equilibrio entre el ancho de banda y la información de estado. Este estudio está hecho en el contexto de las redes basadas en redes privadas virtuales (VPN) MPLS, con la agregación de VPNs multicast en distintos escenarios de redes reales y utilizando nuevos heurísticos para la agregación. Aún así, el principal problema de la agregación es el alto porcentaje de ancho de banda desperdiciado que depende principalmente de la cantidad de árboles compartidos usados. Por otro lado, trabajos recientes han vuelto a traer a los filtros de Bloom como una alternativa para realizar el reenvío multicast. En esta aproximación la cabecera del paquete contiene un filtro de Bloom que es evaluado en cada salto para emparejarlo con el identificador del enlace de salida correspondiente. Aunque se afirma que esta solución no utiliza información de estado, presenta serias desventajas debido a los falsos positivos, esto es, anomalías de reenvío importantes (flujos duplicados, tormentas de paquetes y bucles) y gasto de ancho de banda por la cabecera de los paquetes. Para poder resolver estos problemas proponemos D-MPSS (Depth- Wise Multi-Protocol Stateless Switching). Esta técnica hace uso de una pila de filtros de Bloom en lugar de uno sólo para todo el camino/árbol, incluyendo cada uno sólo los enlaces de una determinada profundidad del árbol. Estudios analíticos y simulaciones demuestran que nuestra propuesta reduce los anomalías de reenvío presentes en otras técnicas similares del estado del arte, alcanzando en la mayoría de escenarios reales una eficiencia de reenvío (tráfico útil) mayor que 95%. Finalmente, estudiamos la posibilidad de usar agregación de árboles y filtros de Bloom juntos, y proponemos un conjunto de técnicas agrupadas como técnicas HABF (hybrid aggregation - Bloom filter-based forwarding), que mejoran D-MPSS y las otras técnicas propuestas previamente, eliminando prácticamente los bucles e incrementando la eficiencia de reenvío hasta más de un 99% en la mayoría de los escenarios de redes