122 research outputs found

    Saturation routing for asynchronous transfer mode (ATM) networks

    Get PDF
    The main objective of this thesis is to show that saturation routing, often in the past considered inefficient, can in fact be a viable approach to use in many important applications and services over an Asynchronous Transfer Mode (ATM) network. For other applications and services, a hybrid approach (one that partially uses saturation routing) is presented. First, the minimum effects of saturation routing are demonstrated by showing that the ratio, defined as f, of routing overhead cells over information cells is small even for large networks. Second, modeling and simulation and M/D/l queuing analysis techniques are used to show that the overall effect on performance when using saturation routing is not significant over ATM networks. Then saturation routing ATM implementation is also provided, with important extensions to services such as multicast routing. After an analytical comparison, in terms of routing overhead, is made between Saturation Routing and the currently proposed Private Network-Network Interface (PNNI) procedure for ATM routing made by the ATM forum. This comparison is made for networks of different sizes (343node and 2401 -node networks) and different number of hierarchical levels (3 and 4 levels of hierarchy). The results show that the higher the number of levels of hierarchy and the farthest (in terms of hierarchical levels) the source and the destination nodes are from each other, the more advantageous saturation routing becomes. Finally, a set of measures of performance for use by saturation routing (or any routing algorithm), as metrics for routing path selection, is proposed. Among these measures, an innovative new measure of performance derived for measuring quality of service provided to Constant Bit Rate (CBR) users (e.g., such as voice and video users) called the Burst Voice Arrival Lag (BVAL) is described and derived

    Routage adaptatif et qualité de service dans les réseaux optiques à commutation de rafales

    Get PDF
    Les rĂ©seaux optiques Ă  commutation de rafales (OBS) sont des candidats pour jouer un rĂŽle important dans le cadre des rĂ©seaux optiques de nouvelle gĂ©nĂ©ration. Dans cette thĂšse, nous nous intĂ©ressons au routage adaptatif et au provisionnement de la qualitĂ© de service dans ce type de rĂ©seaux. Dans une premiĂšre partie de la thĂšse, nous nous intĂ©ressons Ă  la capacitĂ© du routage multi-chemins et du routage alternatif (par dĂ©flection) Ă  amĂ©liorer les performances des rĂ©seaux OBS, pro-activement pour le premier et rĂ©-activement pour le second. Dans ce contexte, nous proposons une approche basĂ©e sur l’apprentissage par renforcement oĂč des agents placĂ©s dans tous les nƓuds du rĂ©seau coopĂšrent pour apprendre, continuellement, les chemins du routage et les chemins alternatifs optimaux selon l’état actuel du rĂ©seau. Les rĂ©sultats numĂ©riques montrent que cette approche amĂ©liore les performances des rĂ©seaux OBS comparativement aux solutions proposĂ©es dans la littĂ©rature. Dans la deuxiĂšme partie de cette thĂšse, nous nous intĂ©ressons au provisionnement absolu de la qualitĂ© de service oĂč les performances pire-cas des classes de trafic de prioritĂ© Ă©levĂ©e sont garanties quantitativement. Plus spĂ©cifiquement, notre objectif est de garantir la transmission sans pertes des rafales de prioritĂ© Ă©levĂ©e Ă  l’intĂ©rieur du rĂ©seau OBS tout en prĂ©servant le multiplexage statistique et l’utilisation efficace des ressources qui caractĂ©risent les rĂ©seaux OBS. Aussi, nous considĂ©rons l’amĂ©lioration des performances du trafic best effort. Ainsi, nous proposons deux approches : une approche basĂ©e sur les nƓuds et une approche basĂ©e sur les chemins. Dans l’approche basĂ©e sur les nƓuds, un ensemble de longueurs d’onde est assignĂ© Ă  chaque nƓud du bord du rĂ©seau OBS pour qu’il puisse envoyer son trafic garanti. Cette assignation prend en considĂ©ration les distances physiques entre les nƓuds du bord. En outre, nous proposons un algorithme de sĂ©lection des longueurs d’onde pour amĂ©liorer les performances des rafales best effort. Dans l’approche basĂ©e sur les chemins, le provisionnement absolu de la qualitĂ© de service est fourni au niveau des chemins entre les nƓuds du bord du rĂ©seau OBS. À cette fin, nous proposons une approche de routage et d’assignation des longueurs d’onde qui a pour but la rĂ©duction du nombre requis de longueurs d’onde pour Ă©tablir des chemins sans contentions. NĂ©anmoins, si cet objectif ne peut pas ĂȘtre atteint Ă  cause du nombre limitĂ© de longueurs d’onde, nous proposons de synchroniser les chemins en conflit sans le besoin pour des Ă©quipements additionnels. LĂ  aussi, nous proposons un algorithme de sĂ©lection des longueurs d’onde pour les rafales best effort. Les rĂ©sultats numĂ©riques montrent que l’approche basĂ©e sur les nƓuds et l’approche basĂ©e sur les chemins fournissent le provisionnement absolu de la qualitĂ© de service pour le trafic garanti et amĂ©liorent les performances du trafic best effort. En outre, quand le nombre de longueurs d’ondes est suffisant, l’approche basĂ©e sur les chemins peut accommoder plus de trafic garanti et amĂ©liorer les performances du trafic best effort par rapport Ă  l’approche basĂ©e sur les nƓuds.Optical Burst Switching (OBS) networks are candidates to play an important role in the context of next generation optical networks. In this thesis, we are interested in adaptive routing and quality of service provisioning for these networks. In the first part of the thesis, we study the capability of multi-path routing and alternative routing (deflection routing) to improve the performance of the OBS network proactively for the former and reactively for the latter. In this context, we propose a reinforcement learning-based approach where learning agents, placed in each OBS node, cooperate to learn, continuously, optimal routing paths and alternative paths according to the current state of the network. Numerical results show that the proposed approach improves the performance of the OBS network compared to existing solutions in the literature. In the second part of the thesis, we consider the problem of absolute quality of service provisioning for OBS networks where worst-case performance of high priority traffic is guaranteed quantitatively. Particularly, we are interested in the loss-free transmission, inside the OBS network, of high priority bursts, while preserving statistical multiplexing gain and high resources utilization of the OBS network. Also, we aim to improve the performance of best effort traffic. Hence, we propose two approaches: (a) the node-based approach; and (b) the path-based approach. In the node-based approach, we propose to assign a set of wavelengths to each OBS edge node that it can use to send its guaranteed traffic. This assignment takes into consideration physical distances between edge nodes. Furthermore, we propose a wavelength selection algorithm to improve the performance of best effort bursts. In the path-based approach, absolute quality of service provisioning is offered at end-to-end path level. To do this, we propose a routing and wavelength assignment approach which aims to reduce the number of wavelengths required to establish contention free paths. Nevertheless, if this objective cannot be reached because of the limited number of wavelengths in each fiber link, we propose an approach to synchronize overlapping paths without the need for additional equipments for synchronization. Here again, we propose a wavelength selection algorithm for best effort bursts. Numerical results show that both the node-based and the path-based approaches successfully provide absolute quality of service provisioning for guaranteed traffic and improve the performance of best effort traffic. Also, path-based approach could accommodate more guaranteed traffic and improve the performance of best effort traffic compared to node-based approach when the number of wavelengths is sufficient

    GMPLS-OBS interoperability and routing acalability in internet

    Get PDF
    The popularization of Internet has turned the telecom world upside down over the last two decades. Network operators, vendors and service providers are being challenged to adapt themselves to Internet requirements in a way to properly serve the huge number of demanding users (residential and business). The Internet (data-oriented network) is supported by an IP packet-switched architecture on top of a circuit-switched, optical-based architecture (voice-oriented network), which results in a complex and rather costly infrastructure to the transport of IP traffic (the dominant traffic nowadays). In such a way, a simple and IP-adapted network architecture is desired. From the transport network perspective, both Generalized Multi-Protocol Label Switching (GMPLS) and Optical Burst Switching (OBS) technologies are part of the set of solutions to progress towards an IP-over-WDM architecture, providing intelligence in the control and management of resources (i.e. GMPLS) as well as a good network resource access and usage (i.e. OBS). The GMPLS framework is the key enabler to orchestrate a unified optical network control and thus reduce network operational expenses (OPEX), while increasing operator's revenues. Simultaneously, the OBS technology is one of the well positioned switching technologies to realize the envisioned IP-over-WDM network architecture, leveraging on the statistical multiplexing of data plane resources to enable sub-wavelength in optical networks. Despite of the GMPLS principle of unified control, little effort has been put on extending it to incorporate the OBS technology and many open questions still remain. From the IP network perspective, the Internet is facing scalability issues as enormous quantities of service instances and devices must be managed. Nowadays, it is believed that the current Internet features and mechanisms cannot cope with the size and dynamics of the Future Internet. Compact Routing is one of the main breakthrough paradigms on the design of a routing system scalable with the Future Internet requirements. It intends to address the fundamental limits of current stretch-1 shortest-path routing in terms of RT scalability (aiming at sub-linear growth). Although "static" compact routing works fine, scaling logarithmically on the number of nodes even in scale-free graphs such as Internet, it does not handle dynamic graphs. Moreover, as multimedia content/services proliferate, the multicast is again under the spotlight as bandwidth efficiency and low RT sizes are desired. However, it makes the problem even worse as more routing entries should be maintained. In a nutshell, the main objective of this thesis in to contribute with fully detailed solutions dealing both with i) GMPLS-OBS control interoperability (Part I), fostering unified control over multiple switching domains and reduce redundancy in IP transport. The proposed solution overcomes every interoperability technology-specific issue as well as it offers (absolute) QoS guarantees overcoming OBS performance issues by making use of the GMPLS traffic-engineering (TE) features. Keys extensions to the GMPLS protocol standards are equally approached; and ii) new compact routing scheme for multicast scenarios, in order to overcome the Future Internet inter-domain routing system scalability problem (Part II). In such a way, the first known name-independent (i.e. topology unaware) compact multicast routing algorithm is proposed. On the other hand, the AnyTraffic Labeled concept is also introduced saving on forwarding entries by sharing a single forwarding entry to unicast and multicast traffic type. Exhaustive simulation campaigns are run in both cases in order to assess the reliability and feasible of the proposals

    Dynamic Optical Networks for Data Centres and Media Production

    Get PDF
    This thesis explores all-optical networks for data centres, with a particular focus on network designs for live media production. A design for an all-optical data centre network is presented, with experimental verification of the feasibility of the network data plane. The design uses fast tunable (< 200 ns) lasers and coherent receivers across a passive optical star coupler core, forming a network capable of reaching over 1000 nodes. Experimental transmission of 25 Gb/s data across the network core, with combined wavelength switching and time division multiplexing (WS-TDM), is demonstrated. Enhancements to laser tuning time via current pre-emphasis are discussed, including experimental demonstration of fast wavelength switching (< 35 ns) of a single laser between all combinations of 96 wavelengths spaced at 50 GHz over a range wider than the optical C-band. Methods of increasing the overall network throughput by using a higher complexity modulation format are also described, along with designs for line codes to enable pulse amplitude modulation across the WS-TDM network core. The construction of an optical star coupler network core is investigated, by evaluating methods of constructing large star couplers from smaller optical coupler components. By using optical circuit switches to rearrange star coupler connectivity, the network can be partitioned, creating independent reserves of bandwidth and resulting in increased overall network throughput. Several topologies for constructing a star from optical couplers are compared, and algorithms for optimum construction methods are presented. All of the designs target strict criteria for the flexible and dynamic creation of multicast groups, which will enable future live media production workflows in data centres. The data throughput performance of the network designs is simulated under synthetic and practical media production traffic scenarios, showing improved throughput when reconfigurable star couplers are used compared to a single large star. An energy consumption evaluation shows reduced network power consumption compared to incumbent and other proposed data centre network technologies

    End-to-end quality of service provisioning in multilayer and multidomain environments

    Full text link
    Tesis doctoral inédita. Universidad Autónoma de Madrid, Escuela Politécnica Superior, marzo de 200

    Radio Communications

    Get PDF
    In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modiïŹed our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the ïŹeld of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks

    Design and protection algorithms for path level aggregation of traffic in WDM metro optical networks

    Get PDF
    Wavelength Division Multiplexing (WDM) promises to offer a cost effective and scalable solution to meet the emerging demands of the Internet. WDM splits the tremendous bandwidth latent in a fiber into multiple non-overlapping wavelength channels, each of which can be operated at the peak electronic rate. Commercial systems with 128 wavelengths and transmission rates of up to 40 Gbps per wavelength have been made possible using state of the art optical technologies to deal with physical impairments. Systems with higher capacities are likely to evolve in the future. The end user requirements for bandwidth, on the other hand, have been ranging from 155 Mbps to 2.5 Gbps. Dedicating a wavelength for each end user will lead to severe underutilization of WDM channels. This brings to forefront the requirement for sharing of bandwidth in a wavelength among multiple end users.;The concept of wavelength sharing among multiple clients is called grooming. Grooming can be done purely at the optical layer (optical grooming) or it can be done with support from the client layer (electronic grooming). The advantage of all optical grooming is the ease of scalability due to its transparency as opposed to electronic grooming which is constrained by electronic bottlenecks. Efforts towards enhancing optical grooming is pursued through increasing optical switching speeds. However, technologies to make optical switches with high speeds, large port counts and low insertion losses have been elusive and may continue to remain so in the near future.;Recently, there have been some research into designing new architectures and protocols focused on optical grooming without resorting to fast optical switching. Typically, this is achieved in three steps: (1) configure the circuit in the form of a path or a tree; (2) use optical devices like couplers or splitters to allow multiple transmitters and/or receivers to share the same circuit; and (3) provide an arbitration mechanism to avoid contention among end users of the circuit. This transparent sharing of the wavelength channel utilizes the network resources better than the conventional low-speed circuit switched approaches. Consequently, it becomes important to quantify the improvement in achieved performance and evaluate if the reaped benefits justify the cost of the required additional hardware and software.;The contribution of this thesis is two fold: (1) developing a new architecture called light-trails as an IP based solution for next generation WDM optical networks, and (2) designing a unified framework to model Path Level Aggregation of Traffic in metrO Optical Networks (PLATOONs). The algorithms suggested here have three features: (1) accounts for four different path level aggregation strategies---namely, point to point (for example, lightpaths), point to multi-point (for example, source based light-trails), multi-point to point (for example, destination based light-trails) and multi-point to multi-point (for example, light-trails); (2) incorporates heterogenous switching architectures; and (3) accommodates multi-rate traffic. Algorithms for network design and survivability are developed for PLATOONs in the presence of both static and dynamic traffic. Connection level dedicated/shared, segregated/mixed protection schemes are formulated for single link failures in the presence of static and dynamic traffic. A simple medium access control protocol that avoids collisions when the channel is shared by multiple clients is also proposed.;Based on extensive simulations, we conclude that, for the studied scenarios, (1) when client layer has no electronic grooming capabilities, light-trails (employing multi-point to multi-point aggregation strategy) perform several orders of magnitude better than lightpaths and (2) when client layer has full electronic grooming capabilities, source based light-trails (employing point to multi-point aggregation strategy) perform the best in wavelength limited scenarios and lightpaths perform the best in transceiver limited scenarios.;The algorithms that are developed here will be helpful in designing optical networks that deploy path level aggregation strategies. The proposed ideas will impact the design of transparent, high-speed all-optical networks.</p
    • 

    corecore