Design and provisioning of WDM networks for traffic grooming

Wavelength Division Multiplexing (WDM) is the most viable technique for utilizing the enormous amounts of bandwidth inherently available in optical fibers. However, the bandwidth offered by a single wavelength in WDM networks is on the order of tens of Gigabits per second, while most of the applications\u27 bandwidth requirements are still subwavelength. Therefore, cost-effective design and provisioning of WDM networks require that traffic from different sessions share bandwidth of a single wavelength by employing electronic multiplexing at higher layers. This is known as traffic grooming. Optical networks supporting traffic grooming are usually designed in a way such that the cost of the higher layer equipment used to support a given traffic matrix is reduced. In this thesis, we propose a number of optimal and heuristic solutions for the design and provisioning of optical networks for traffic grooming with an objective of network cost reduction. In doing so, we address several practical issues. Specifically, we address the design and provisioning of WDM networks on unidirectional and bidirectional rings for arbitrary unicast traffic grooming, and on mesh topologies for arbitrary multipoint traffic grooming. In multipoint traffic grooming, we address both multicast and many-to-one traffic grooming problems. We provide a unified frame work for optimal and approximate network dimensioning and channel provisioning for the generic multicast traffic grooming problem, as well as some variants of the problem. For many-to-one traffic grooming we propose optimal as well as heuristic solutions. Optimal formulations which are inherently non-linear are mapped to an optimal linear formulation. In the heuristic solutions, we employ different problem specific search strategies to explore the solution space. We provide a number of experimental results to show the efficacy of our proposed techniques for the traffic grooming problem in WDM networks

Distributed Failure Restoration for Asynchronous Transfer Mode (ATM) Tactical Communication Networks

Asynchronous Transfer Mode (A TM) is an attractive choice for future military communication systems because it can provide high throughput and support multi-service applications. Furthermore its use is consistent with the 'off the shelf technology policy that is currently operated by the Defence Engineering Research Agency of Great Britain. However, A TM has been developed as a civil standard and is designed to operate in network infrastructures with very low failure rates. In contrast, tactical networks are much less reliable. Indeed tactical networks operate on the premise that failures, particularly node failures, are expected. Hence, efficient, automatic failure restoration schemes are essential if an A TM based tactical network is to remain operational. The main objective of this research is the proposal and verification of one or more new restoration algorithms that meet the specific requirements of tactical networks. The aspects of ATM networks that influence restoration algorithms' implementation are discussed. In particular, the features of A TM networks such as the concept of Virtual Paths Virtual Channels and OAM (Operation And Maintenance) mechanisms that facilitate implementation of efficient restoration techniques. The unique characteristics of tactical networks and their impact on restoration are also presented. A significant part of the research was the study and evaluation of existing approaches to failure restoration in civil networks. A critical analysis of the suitability of these approaches to the tactical environment shows no one restoration algorithm fully meets the requirements of tactical networks. Consequently, two restoration algorithms for tactical A TM networks, DRA-TN (Dynamic Restoration Algorithm for Tactical Networks) and PPR-TN (Pre-planned Restoration Algorithm for Tactical Networks), are proposed and described in detail. Since the primary concern of restoration in tactical networks is the recovery of high priority connections the proposed algorithms attempt to restore high-priority connections by disrupting low-priority calls. Also, a number of additional mechanisms are proposed to reduce the use of bandwidth, which is a scarce resource in tactical networks. It is next argued that software simulation is the most appropriate method to prove the consistency of the proposed algorithms, assess their performance and test them on different network topologies as well as traffic and failure conditions. For this reason a simulation software package was designed and built specifically to model the proposed restoration algorithms. The design of the package is presented in detail and the most important implementation issues are discussed. The proposed restoration algorithms are modelled on three network topologies under various traffic loads, and their performance compared against the performance of known algorithms proposed for civil networks. It is shown that DRA-TN and PPR-TN provide better restoration of higher priority traffic. Furthermore, as the traffic load increases the relative performance of the DRA-TN and PPR-TN algorithms increases. The DRA-TN and PPR-TN algorithms are also compared and their advantages and disadvantages noted. Also, recommendations are given about the applicability of the proposed algorithms, and some practical implementation issues are discussed. The number of problems that need further study are briefly described.Defence Engineering Research Agency of Great Britai

LOGICAL TOPOLOGY DESIGN FOR SURVIVABILITY IN IP-OVER-WDM NETWORKS

IP-over-WDM networks integrate Wavelength Division Multiplexing (WDM) technology with Internet Protocol (IP) and are widely regarded as the architecture for the next generation high-speed Internet. The problem of designing an IP-over-WDM network can be modeled as an embedding problem in which an IP network is embedded in a WDM network by establishing all optical paths between IP routers in the WDM network. Survivability is considered a vital requirement in such networks, which can be achieved by embedding the IP network in the WDM network in such a way that the IP network stays connected in the presence of failure or failures in the WDM network. Otherwise, some of the IP routers may not be reachable.The problem can be formulated as an Integer Linear Program (ILP), which can be solved optimally but is NP-complete. In this thesis, we have studied and proposed various efficient algorithms that can be used to make IP-over-WDM networks survivable in the presence of a single WDM link (optical fiber cable or cables) failure.First we evaluate an existing approach, named Survivable Mapping Algorithm by Ring Trimming (SMART), which provides survivability for an entire network by successively considering pieces of the network. The evaluation provides much insight into the approach, which allowed us to propose several enhancements. The modified approach with enhancements leads to better performance than the original SMART.We have also proposed a hybrid algorithm that guarantees survivability, if the IP and the WDM networks are at least 2-edge connected. The algorithm uses a combination of proactive (protection) and reactive (restoration) mechanisms to obtain a survivable embedding for any given IP network in any given WDM network.Circuits and cutsets are dual concepts. SMART approach is based on circuits. The question then arises whether there exists a dual methodology based on cutsets. We investigate this question and provide much needed insight. We provide a unified algorithmic framework based on circuits and cutsets. We also provide new methodologies based on cutsets and give a new proof of correctnessof SMART. We also develop a method based on incidence sets that are a special case of cutsets. Noting that for some IP networks a survivable embedding may not exist, the option of adding new IP links is pursued. Comparative evaluations of all the algorithms through extensive simulations are also given in this dissertation

Intelligent Network Infrastructures: New Functional Perspectives on Leveraging Future Internet Services

The Internet experience of the 21st century is by far very different from that of the early '80s. The Internet has adapted itself to become what it really is today, a very successful business platform of global scale. As every highly successful technology, the Internet has suffered from a natural process of ossification. Over the last 30 years, the technical solutions adopted to leverage emerging applications can be divided in two categories. First, the addition of new functionalities either patching existing protocols or adding new upper layers. Second, accommodating traffic grow with higher bandwidth links. Unfortunately, this approach is not suitable to provide the proper ground for a wide gamma of new applications. To be deployed, these future Internet applications require from the network layer advanced capabilities that the TCP/IP stack and its derived protocols can not provide by design in a robust, scalable fashion. NGNs (Next Generation Networks) on top of intelligent telecommunication infrastructures are being envisioned to support future Internet Services. This thesis contributes with three proposals to achieve this ambitious goal. The first proposal presents a preliminary architecture to allow NGNs to seamlessly request advanced services from layer 1 transport networks, such as QoS guaranteed point-to-multipoint circuits. This architecture is based on virtualization techniques applied to layer 1 networks, and hides from NGNs all complexities of interdomain provisioning. Moreover, the economic aspects involved were also considered, making the architecture attractive to carriers. The second contribution regards a framework to develop DiffServ-MPLS capable networks based exclusively on open source software and commodity PCs. The developed DiffServ-MPLS flexible software router was designed to allow NGN prototyping, that make use of pseudo virtual circuits and assured QoS as a starting point of development. The third proposal presents a state of the art routing and wavelength assignment algorithm for photonic networks. This algorithm considers physical layer impairments to 100% guarantee the requested QoS profile, even in case of single network failures. A number of novel techniques were applied to offer lower blocking probability when compared with recent proposed algorithms, without impacting on setup delay time

Providing ATM Multipoint Survivability Via Disjoint VC Mesh Backup Groups

This paper presents simulation experiments investigating the feasibility and cost of providing survivability to ATM multipoint groups using dedicated bandwidth on disjoint backup groups. Disjoint dedicated backup groups are formed via the VC Mesh model by two different approaches: (1) a backup group consisting exclusively of point-to-point circuits (unicast), or (2) a backup group consisting exclusively of point-to-multipoint circuits (multicast). Results for the two networks studied show that although backup groups of point-to-multipoint circuits (multicast) are lower in cost than backup groups of point-to-point circuits (unicast) at a 95% confidence level, the feasibility of providing guaranteed survivability with backup groups via either approach begins at only about 50% for a group size of three and decreases rapidly for larger group sizes due to multipoint "trap" topologies and hop-limit constraints. The conclusion is that while use of disjoint dedicated backup groups for ATM mult..

Esquema de controlo para redes multicast baseadas com classes

Doutoramento em Engenharia ElectrotécnicaThe expectations of citizens from the Information Technologies (ITs) are increasing as the ITs have become integral part of our society, serving all kinds of activities whether professional, leisure, safety-critical applications or business. Hence, the limitations of the traditional network designs to provide innovative and enhanced services and applications motivated a consensus to integrate all services over packet switching infrastructures, using the Internet Protocol, so as to leverage flexible control and economical benefits in the Next Generation Networks (NGNs). However, the Internet is not capable of treating services differently while each service has its own requirements (e.g., Quality of Service - QoS). Therefore, the need for more evolved forms of communications has driven to radical changes of architectural and layering designs which demand appropriate solutions for service admission and network resources control. This Thesis addresses QoS and network control issues, aiming to improve overall control performance in current and future networks which classify services into classes. The Thesis is divided into three parts. In the first part, we propose two resource over-reservation algorithms, a Class-based bandwidth Over-Reservation (COR) and an Enhanced COR (ECOR). The over-reservation means reserving more bandwidth than a Class of Service (CoS) needs, so the QoS reservation signalling rate is reduced. COR and ECOR allow for dynamically defining over-reservation parameters for CoSs based on network interfaces resource conditions; they aim to reduce QoS signalling and related overhead without incurring CoS starvation or waste of bandwidth. ECOR differs from COR by allowing for optimizing control overhead minimization. Further, we propose a centralized control mechanism called Advanced Centralization Architecture (ACA), that uses a single state-full Control Decision Point (CDP) which maintains a good view of its underlying network topology and the related links resource statistics on real-time basis to control the overall network. It is very important to mention that, in this Thesis, we use multicast trees as the basis for session transport, not only for group communication purposes, but mainly to pin packets of a session mapped to a tree to follow the desired tree. Our simulation results prove a drastic reduction of QoS control signalling and the related overhead without QoS violation or waste of resources. Besides, we provide a generic-purpose analytical model to assess the impact of various parameters (e.g., link capacity, session dynamics, etc.) that generally challenge resource overprovisioning control. In the second part of this Thesis, we propose a decentralization control mechanism called Advanced Class-based resource OverpRovisioning (ACOR), that aims to achieve better scalability than the ACA approach. ACOR enables multiple CDPs, distributed at network edge, to cooperate and exchange appropriate control data (e.g., trees and bandwidth usage information) such that each CDP is able to maintain a good knowledge of the network topology and the related links resource statistics on real-time basis. From scalability perspective, ACOR cooperation is selective, meaning that control information is exchanged dynamically among only the CDPs which are concerned (correlated). Moreover, the synchronization is carried out through our proposed concept of Virtual Over-Provisioned Resource (VOPR), which is a share of over-reservations of each interface to each tree that uses the interface. Thus, each CDP can process several session requests over a tree without requiring synchronization between the correlated CDPs as long as the VOPR of the tree is not exhausted. Analytical and simulation results demonstrate that aggregate over-reservation control in decentralized scenarios keep low signalling without QoS violations or waste of resources. We also introduced a control signalling protocol called ACOR Protocol (ACOR-P) to support the centralization and decentralization designs in this Thesis. Further, we propose an Extended ACOR (E-ACOR) which aggregates the VOPR of all trees that originate at the same CDP, and more session requests can be processed without synchronization when compared with ACOR. In addition, E-ACOR introduces a mechanism to efficiently track network congestion information to prevent unnecessary synchronization during congestion time when VOPRs would exhaust upon every session request. The performance evaluation through analytical and simulation results proves the superiority of E-ACOR in minimizing overall control signalling overhead while keeping all advantages of ACOR, that is, without incurring QoS violations or waste of resources. The last part of this Thesis includes the Survivable ACOR (SACOR) proposal to support stable operations of the QoS and network control mechanisms in case of failures and recoveries (e.g., of links and nodes). The performance results show flexible survivability characterized by fast convergence time and differentiation of traffic re-routing under efficient resource utilization i.e. without wasting bandwidth. In summary, the QoS and architectural control mechanisms proposed in this Thesis provide efficient and scalable support for network control key sub-systems (e.g., QoS and resource control, traffic engineering, multicasting, etc.), and thus allow for optimizing network overall control performance.À medida que as Tecnologias de Informação (TIs) se tornaram parte integrante da nossa sociedade, a expectativa dos cidadãos relativamente ao uso desses serviços também demonstrou um aumento, seja no âmbito das atividades profissionais, de lazer, aplicações de segurança crítica ou negócios. Portanto, as limitações dos projetos de rede tradicionais quanto ao fornecimento de serviços inovadores e aplicações avançadas motivaram um consenso quanto à integração de todos os serviços e infra-estruturas de comutação de pacotes, utilizando o IP, de modo a extrair benefícios económicos e um controlo mais flexível nas Redes de Nova Geração (RNG). Entretanto, tendo em vista que a Internet não apresenta capacidade de diferenciação de serviços, e sabendo que cada serviço apresenta as suas necessidades próprias, como por exemplo, a Qualidade de Serviço - QoS, a necessidade de formas mais evoluídas de comunicação tem-se tornado cada vez mais visível, levando a mudanças radicais na arquitectura das redes, que exigem soluções adequadas para a admissão de serviços e controlo de recursos de rede. Sendo assim, este trabalho aborda questões de controlo de QoS e rede com o objetivo de melhorar o desempenho do controlo de recursos total em redes atuais e futuras, através da análise dos serviços de acordo com as suas classes de serviço. Esta Tese encontra-se dividida em três partes. Na primeira parte são propostos dois algoritmos de sobre-reserva, o Class-based bandwidth Over-Reservation (COR) e uma extensão melhorada do COR denominado de Enhanced COR (ECOR). A sobre-reserva significa a reserva de uma largura de banda maior para o serviço em questão do que uma classe de serviço (CoS) necessita e, portanto, a quantidade de sinalização para reserva de recursos é reduzida. COR e ECOR consideram uma definição dinâmica de sobre-reserva de parâmetros para CoSs com base nas condições da rede, com vista à redução da sobrecarga de sinalização em QoS sem que ocorra desperdício de largura de banda. O ECOR, por sua vez, difere do COR por permitir a otimização com minimização de controlo de overhead. Além disso, nesta Tese é proposto também um mecanismo de controlo centralizado chamado Advanced Centralization Architecture (ACA) , usando um único Ponto de Controlo de Decisão (CDP) que mantém uma visão ampla da topologia de rede e de análise dos recursos ocupados em tempo real como base de controlo para a rede global. Nesta Tese são utilizadas árvores multicast como base para o transporte de sessão, não só para fins de comunicação em grupo, mas principalmente para que os pacotes que pertençam a uma sessão que é mapeada numa determinada árvore sigam o seu caminho. Os resultados obtidos nas simulações dos mecanismos mostram uma redução significativa da sobrecarga da sinalização de controlo, sem a violação dos requisitos de QoS ou desperdício de recursos. Além disso, foi proposto um modelo analítico no sentido de avaliar o impacto provocado por diversos parâmetros (como por exemplo, a capacidade da ligação, a dinâmica das sessões, etc), no sobre-provisionamento dos recursos. Na segunda parte desta tese propôe-se um mecanismo para controlo descentralizado de recursos denominado de Advanced Class-based resource OverprRovisioning (ACOR), que permite obter uma melhor escalabilidade do que o obtido pelo ACA. O ACOR permite que os pontos de decisão e controlo da rede, os CDPs, sejam distribuídos na periferia da rede, cooperem entre si, através da troca de dados e controlo adequados (por exemplo, localização das árvores e informações sobre o uso da largura de banda), de tal forma que cada CDP seja capaz de manter um bom conhecimento da topologia da rede, bem como das suas ligações. Do ponto de vista de escalabilidade, a cooperação do ACOR é seletiva, o que significa que as informações de controlo são trocadas de forma dinâmica apenas entre os CDPs analisados. Além disso, a sincronização é feita através do conceito proposto de Recursos Virtuais Sobre-Provisionado (VOPR), que partilha as reservas de cada interface para cada árvore que usa a interface. Assim, cada CDP pode processar pedidos de sessão numa ou mais árvores, sem a necessidade de sincronização entre os CDPs correlacionados, enquanto o VOPR da árvore não estiver esgotado. Os resultados analíticos e de simulação demonstram que o controlo de sobre-reserva é agregado em cenários descentralizados, mantendo a sinalização de QoS baixa sem perda de largura de banda. Também é desenvolvido um protocolo de controlo de sinalização chamado ACOR Protocol (ACOR-P) para suportar as arquitecturas de centralização e descentralização deste trabalho. O ACOR Estendido (E-ACOR) agrega a VOPR de todas as árvores que se originam no mesmo CDP, e mais pedidos de sessão podem ser processados sem a necessidade de sincronização quando comparado com ACOR. Além disso, E-ACOR introduz um mecanismo para controlar as informações àcerca do congestionamento da rede, e impede a sincronização desnecessária durante o tempo de congestionamento quando os VOPRs esgotam consoante cada pedido de sessão. A avaliação de desempenho, através de resultados analíticos e de simulação, mostra a superioridade do E-ACOR em minimizar o controlo geral da carga da sinalização, mantendo todas as vantagens do ACOR, sem apresentar violações de QoS ou desperdício de recursos. A última parte desta Tese inclui a proposta para recuperação a falhas, o Survivability ACOR (SACOR), o qual permite ter QoS estável em caso de falhas de ligações e nós. Os resultados de desempenho analisados mostram uma capacidade flexível de sobrevivência caracterizada por um tempo de convergência rápido e diferenciação de tráfego com uma utilização eficiente dos recursos. Em resumo, os mecanismos de controlo de recursos propostos nesta Tese fornecem um suporte eficiente e escalável para controlo da rede, como também para os seus principais sub-sistemas (por exemplo, QoS, controlo de recursos, engenharia de tráfego, multicast, etc) e, assim, permitir a otimização do desempenho da rede a nível do controlo global

Proceedings of the Third Edition of the Annual Conference on Wireless On-demand Network Systems and Services (WONS 2006)

Ce fichier regroupe en un seul documents l'ensemble des articles accéptés pour la conférences WONS2006/http://citi.insa-lyon.fr/wons2006/index.htmlThis year, 56 papers were submitted. From the Open Call submissions we accepted 16 papers as full papers (up to 12 pages) and 8 papers as short papers (up to 6 pages). All the accepted papers will be presented orally in the Workshop sessions. More precisely, the selected papers have been organized in 7 session: Channel access and scheduling, Energy-aware Protocols, QoS in Mobile Ad-Hoc networks, Multihop Performance Issues, Wireless Internet, Applications and finally Security Issues. The papers (and authors) come from all parts of the world, confirming the international stature of this Workshop. The majority of the contributions are from Europe (France, Germany, Greece, Italy, Netherlands, Norway, Switzerland, UK). However, a significant number is from Australia, Brazil, Canada, Iran, Korea and USA. The proceedings also include two invited papers. We take this opportunity to thank all the authors who submitted their papers to WONS 2006. You helped make this event again a success