Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper proposes a linear formulation and an iterative heuristic, both with traffic grooming capability, which can maximize the number of remaining available routes and minimize the number of transceivers in Elastic Optical Networks (EON). The aim of the proposal is to preserve the open capacity for the accommodation of future unknown demands. Case studies are carried out in order to analyze the...
In this paper, we consider the Routing and Wavelength Assignment problem in WDM optical networks. We consider the dynamic traffic and assume that in each optical fiber the number of wavelengths has fixed. In this paper, our attempt is to minimize the call connection blocking ratio using Intelligent Water Drops (IWD) Algorithm for RWA problem in an optical network. The IWD algorithm employed has modified...
In this paper we have computed the blocking probability of dynamic traffic using statistical method for WDM networks. Here, the logical topology created for dynamic traffic is transformed by virtually connected static g-link topology. We have computed the blocking performance of dynamic traffic using Erlang B traffic loss model that is mapped with g-link topology.
Network virtualization has become an important feature for cloud-based services. Virtual networks can be set up over high-capacity optical networks. They consist of virtual links and nodes, which are mapped over physical resources. Operational virtual networks get gradually upgraded to avoid capacity exhaustion and create resources to handle traffic growth. These upgrades require leasing of new virtual...
In the recent years many researchers have addressed the problem of energy efficient routing in the WDM optical networks. Typical strategies involve putting the network components into sleep mode or switching off the network components in low utilization periods. In this paper, we propose a strategy based on the principle of anycast routing, where it is possible to select the most suitable destination,...
This work proposes a new Integer Linear Programming (ILP) formulation for traffic grooming, routing and spectrum allocation (GRSA) to be used in translucent elastic networks. In order to compare our method with classic routing and spectrum allocation (RSA), it was presented an ILP model for RSA problem, allowing the evaluation of the benefits of traffic grooming in translucent elastic networks. Numerical...
Disasters hit telecommunication structures every year. As Earth becomes more disaster-prone, telecom networks, and especially optical networks due to their high capacity, should be designed to prepare against disasters. Although disaster resiliency for optical core networks has been subject of significant recent research, damages on the network infrastructure due to the direct or indirect impacts...
This paper introduces an ant colony optimisation algorithm for the optimal placement of regenerators in optical networks. The algorithm guarantees survivability of the underlying network whilst also minimising the number of regenerators required. These are vital requirements in optical networks as the cost of regeneration equipment is very high. However, minimisation of the number of regenerator sites...
We design and implement an SDN control plane architecture, based on stackable active stateful PCEs and mature protocols, to enable multi-tenant optical network virtualization. Each tenant independently controls its allocated network slice. The system is validated in an experimental testbed.
We show that IP-over-WDM multilayer networks can be designed to guarantee that a large majority of the traffic is restored at a subsecond timescale, using IP Fast Rerouting techniques. The rationale is enforcing OSPF/ECMP traffic balancing on SRG-disjoint lightpaths.
We explain why distributed control lacks the ability to optimally control networks with multiple transport domains or both IP and optical layers. We then propose a practical architecture to fix these issues and experimentally demonstrate it over commercial IP/transport gear.
A broker on top of opaquely-managed optical domains advertising their capabilities is proposed to provision multi-AS connections in multi-operator scenarios. In case of no spectrum continuity, intra-domain spectral defragmentation is performed. Experimental assessment was conducted on a distributed multi-continental infrastructure.
We engineered the first open-source network topology database. The innovative use of aspect-oriented programming with ITU-TG.805 based topology constructs, makes the implementation generic, scalable and easy to integrate across vendor and technology barriers.
Traffic grooming schemes have attracted a lot of research attention for addressing the bandwidth mismatch between low data-rate user connection requests and a high capacity lightpath. Survivability of individual user connections is also highly important. The problem of survivable traffic grooming is known to be NP-Complete. In this paper we suggest heuristics to solve the problem in WDM mesh networks...
Fixed and Mobile Convergence (FMC) is a key stake for operators in the perspective of 5G networks. This paper analyzes the expected role of optical networks for convergence and integration of fixed and mobile infrastructures.
This paper investigates malleable reservation (MR) for data-oriented requests to revitalize spectrum fragments in elastic optical networks. We formulate a mixed integer linear programming model and propose a time-efficient heuristic to solve the MR problem.
We propose a novel active stateful PCE-based inter-domain routing strategy for BRPC domain sequence selection, which is validated through experiments. Results show that our proposed strategy performs better in blocking probability.
We define k-content connectivity as the reachability of at least one content from any point of a data center network under concurrent k-1 failures. A flexible content placement algorithm is proposed to achieve k-content connectivity.
This paper describes the work done to test the interoperability of northbound interface implemented in the controllers of a transport SDON prototype. A test framework named NBI Platform is introduced and used in this test.
This paper presents a strategy as attempt to solve the problem of choosing the best combination among the M combinations of shortest paths in optical translucent networks. Fixed routing algorithms demands a single route to each pair of nodes. The existence of multiple shortest paths to some pairs of nodes originates the problem of choose the shortest path which fits better the network requests. The...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.