Admission control in Flow-Aware Networking (FAN) architectures under GridFTP traffic

This is the author’s version of a work that was accepted for publication in Optical Switching and Networking. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Optical Switching and Networking, 6, 9 (2009) DOI: 10.1016/j.osn.2008.05.003Selected papers from First International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2007Computing and networking resources virtualization is the main objective of Grid services. Such a concept is already used in the context of Web-services on the Internet. In the next few years, a large number of applications belonging to various domains (biotechnology, banking, finance, car and aircraft manufacturing, nuclear energy etc.) will also benefit from Grid services. Admission control is a key functionality for Quality of Service (QoS) provision in IP networks, and more specifically for Grid services provision. Service differentiation (DS) is a widely deployed technique on the Internet. It operates at the packet level on a best-effort mode. Flow-Aware Networking (FAN) that operates at the scale of the IP flows relies on implicit flow differentiation through priority fair queuing (PFQ). It may be seen as an alternative to DS. A Grid session may be seen as a succession of parallel TCP/IP flows characterized by data transfers with much larger volume than usual TCP/IP flows. In this paper, we propose an extension of FAN for the Grid environment called Grid over FAN (GoFAN). We compare, by means of computer simulations, the efficiency of Grid over DS (GoDS) and GoFAN. Two variants of GoFAN architectures based on different fair queuing algorithms are considered. As a first step, we provide two short surveys on QoS for Grid environment and on QoS in IP networks respectively

Next Generation Optical Access Networks: from TDM to WDM

Postprint (author’s final draft

Dynamic bandwidth allocation with SLA awareness for QoS in ethernet passive optical networks

Quality-of-service (QoS) support in Ethernet passive optical networks is a crucial concern. We propose a new dynamic bandwidth allocation (DBA) algorithm for service differentiation that meets the service-level agreements (SLAs) of the users. The proposed delay-aware (DA) online DBA algorithm provides constant and predictable average packet delay and reduced delay variation for the high-and medium-priority traffic while keeping the packet loss rate under check. We prove the effectiveness of the proposed algorithm by exhaustive simulations

New dynamic bandwidth allocation algorithm analysis: DDSPON for ethernet passive optical networks

This project aims to present the state of the art in Dynamic Bandwidth Allocation (DBA) solutions, as well as the study and evaluation of one proposal of DBA algorithm: the Distributed Dynamic Scheduling for EPON (DDSPON), which is the UPC contribution to the research in scheduling algorithms for EPON

Network level performance of differentiated services (diffserv) networks

The Differentiated Services (DiffServ) architecture is a promising means of providing Quality of Service (QoS) in Internet. In DiffServ networks, three service classes, or Per-hop Behaviors (PHBs), have been defined: Expedited Forwarding (EF), Assured Forwarding (AF) and Best Effort (BE). In this dissertation, the performance of DiffServ networks at the network level, such as end-to-end QoS, network stability, and fairness of bandwidth allocation over the entire network have been extensively investigated. It has been shown in literature that the end-to-end delay of EF traffic can go to infinity even in an over-provisioned network. In this dissertation, a simple scalable aggregate scheduling scheme, called Youngest Serve First (YSF) algorithm is proposed. YSF is not only able to guarantee finite end-to-end delay, but also to keep a low scheduling complexity. With respect to the Best Effort traffic, Random Exponential Marking (REM), an existing AQM scheme is studied under a new continuous time model, and its local stable condition is presented. Next, a novel virtual queue and rate based AQM scheme (VQR) is proposed, and its local stability condition has been presented. Then, a new AQM framework, Edge-based AQM (EAQM) is proposed. EAQM is easier to implement, and it achieves similar or better performance than traditional AQM schemes. With respect to the Assured Forwarding, a network-assist packet marking (NPM) scheme has been proposed. It has been demonstrated that NPM can fairly distribute bandwidth among AF aggregates based on their Committed Information Rates (CIRs) in both single and multiple bottleneck link networks

Multiservice QoS-Enabled MAC for Optical Burst Switching

The emergence of a broad range of network-driven applications (e.g., multimedia, online gaming) brings in the need for a network environment able to provide multiservice capabilities with diverse quality-of-service (QoS) guarantees. In this paper, a medium access control protocol is proposed to support multiple services and QoS levels in optical burst-switched mesh networks without wavelength conversion. The protocol provides two different access mechanisms, queue-arbitrated and prearbitrated for connectionless and connection-oriented burst transport, respectively. It has been evaluated through extensive simulations and its simplistic form makes it very promising for implementation and deployment. Results indicate that the protocol can clearly provide a relative quality differentiation for connectionless traffic and guarantee null (or negligible, and thus acceptable) burst loss probability for a wide range of network (or offered) load while ensuring low access delay for the higher-priority traffic. Furthermore, in the multiservice scenario mixing connectionless and connection-oriented burst transmissions, three different prearbitrated slot scheduling algorithms are evaluated, each one providing a different performance in terms of connection blocking probability. The overall results demonstrate the suitability of this architecture for future integrated multiservice optical networks

Mecanismos para gerenciamento de banda passante em redes ópticas passivas Ethernet com clientes locatários de múltiplas unidades ópticas de redes

Orientador: Nelson Luis Saldanha da FonsecaDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: As atuais redes de acesso banda larga à Internet necessitam dar suporte às altas demandas de diversas aplicações tais como voz sobre IP (VoIP), streaming de vídeo UHD, videoconferência, internet das coisas (IoT) e jogos interativos. A tecnologia de redes ópticas passivas (PONs) é considerada promissora para fornecer alta capacidade de acesso com um custo-benefício aceitável. Existem duas diferentes tecnologias que disputam o mercado das redes ópticas; Ethernet PON (EPON) e Gigabit Capable PON(GPON). Devido ao alto custo de aquisição e manutenção de uma infraestrutura PON, muitas empresas (clientes) recorrem a fornecedores de infraestrutura (InP) para reduzir os altos custo, por meio do aluguel de uma porção dos recursos da PON. Esses clientes podem ser, por exemplo, operadores de rede móvel ou provedores de serviços virtuais, que podem adquirir múltiplas unidades da rede óptica (ONU) conectadas em uma única PON. Essa facilidade de alugar múltiplas ONUs pode gerar problemas de balanceamento de carga entre ONUs, uma vez que os atuais algoritmos de alocação de banda passante (DBA) são capazes de garantir banda para uma única ONU. Consequentemente, picos de demanda de banda passante podem ultrapassar a banda garantida em algumas ONUs e, ao mesmo tempo, subutilizar a banda garantida em outras ONUs de um mesmo cliente. Nesta dissertação, aborda-se o problema de gerenciamento de largura de banda para clientes multi-ONU nas redes EPON. Propõe-se um algoritmo de alocação dinâmica de banda passante (DBA) (MOS-IPACT) para dar suporte ao contrato de serviço (SLA) para clientes com várias ONUs. O mecanismo proposto distribui a largura de banda agregada entre ONUs de um mesmo cliente, com o objetivo de melhorar a utilização da largura de banda. Além disso propõe-se um algoritmo DBA para EPONs (subMOSIPACT) com o objetivo de garantir banda passante em diferentes níveis de granularidade. Este algoritmo é fundamental para clientes multi-ONU e que oferecem diversos tipos de serviços. Por exemplo, um operador da rede virtual pode alugar as ONUs de um InP para oferecer serviços corporativos e residenciais. Introduz-se, também, um algoritmo DBA para EPONs (coopMOS-IPACT) que permite a cooperação entre clientes. O algoritmo proposto permite que clientes cooperativos compartilhem banda passante não utilizada a fim de aumentar a banda disponível para alocação mas sem afetar seus SLAs individuais. Os resultados mostram que os três algoritmos propostos são capazes de garantir banda passante para clientes multi-ONU, mesmo em condições de tráfego desbalanceadas; Além de garantir banda passante em diferentes níveis de granularidade aumentando o suporte aos requisitos de qualidade de serviço (QoS). Resultados derivados por simulação mostraram que os algoritmos distribuem eficientemente a largura de banda entre os clientes multi-ONU bem como para clientes convencionais que possuem uma única ONU. Por fim, este trabalho mostra os benefícios do modelo de clientes cooperativos para aumentar a largura de banda disponívelAbstract: Current broadband access networks need to support the Quality of Service (QoS) requirements of diverse application such as voice over IP (VoIP), ultra-high video streaming, video conferencing, Internet of Things (IoT) and interactive gaming. Passive Optical Networks (PONs) is considered a promising solution to provides high access capacity with acceptable cost-benefit. Two different technologies share the optical access networks market: Ethernet PON (EPON) and Gigabit Capable PON (GPON). However, the deployment of PON infrastructure involves significant costs. On the other hand, Infrastructure Provider (InP) can alleviate these costs by leasing their PONs to several enterprises (customers). These customers can be Mobile Network Operators (MNOs), multi-site enterprises, or virtual service providers. New scenarios are envisioned in which customers owning multiple Optical Network Units (ONUs) (multi-ONUs customers) are connected to a single PON. However, current EPON Dynamic Bandwidth Allocation (DBA) algorithms are able to support only guaranteed bandwidth for individual ONUs. Consequently, peaks of bandwidth demand may surpass the guaranteed bandwidth for some ONUs and, at the same time, underutilize the bandwidth in other ONUs of a multi-ONU customer. In this work, the bandwidth management problem for multi-ONU customers in EPON network is addressed. This dissertation proposes a mechanisms for the support of multiONU Service Level Agreements (SLA) in DBA algorithms for EPONs. The proposed DBA algorithms (MOS-IPACT) allows customers owning multiple ONUs to redistribute the aggregated bandwidth of the group of ONUs to better balance the bandwidth utilization. This dissertation also proposes a DBA algorithm for EPON networks (subMOS-IPACT) with the objective of assuring bandwidth at different levels of granularity. This algorithm is quite important for multi-ONU customers offering diverse type of services. For example, a virtual network operator can lease ONUs from an InP to offer enterprise and residential services to its client.This work also introduce a DBA algorithm for EPONs (coopMOS-IPACT), which allows cooperation between customers. The proposed DBA algorithm allows cooperative customers share the unused bandwidth without affecting their individual multi-ONU SLAs. Results show that the three proposed Dynamic Bandwidth Allocation (DBA) algorithms are able to guarantee bandwidth for multi-Optical Network Unit (ONU) customers even in unbalancing traffic conditions. Furthermore, assuring bandwidth at different levels of granularity improves the Quality of Service (QoS) providing. Simulation results showed that the mechanisms efficiently distributes bandwidth between multi-ONU customers and traditional customers owning a single ONU. Finally, this work show the benefits of cooperative customers model in order to increase the available bandwidthMestradoCiência da ComputaçãoMestre em Ciência da Computação132308/2016-9CNP

Datacenter Traffic Control: Understanding Techniques and Trade-offs

Datacenters provide cost-effective and flexible access to scalable compute and storage resources necessary for today's cloud computing needs. A typical datacenter is made up of thousands of servers connected with a large network and usually managed by one operator. To provide quality access to the variety of applications and services hosted on datacenters and maximize performance, it deems necessary to use datacenter networks effectively and efficiently. Datacenter traffic is often a mix of several classes with different priorities and requirements. This includes user-generated interactive traffic, traffic with deadlines, and long-running traffic. To this end, custom transport protocols and traffic management techniques have been developed to improve datacenter network performance. In this tutorial paper, we review the general architecture of datacenter networks, various topologies proposed for them, their traffic properties, general traffic control challenges in datacenters and general traffic control objectives. The purpose of this paper is to bring out the important characteristics of traffic control in datacenters and not to survey all existing solutions (as it is virtually impossible due to massive body of existing research). We hope to provide readers with a wide range of options and factors while considering a variety of traffic control mechanisms. We discuss various characteristics of datacenter traffic control including management schemes, transmission control, traffic shaping, prioritization, load balancing, multipathing, and traffic scheduling. Next, we point to several open challenges as well as new and interesting networking paradigms. At the end of this paper, we briefly review inter-datacenter networks that connect geographically dispersed datacenters which have been receiving increasing attention recently and pose interesting and novel research problems.Comment: Accepted for Publication in IEEE Communications Surveys and Tutorial