Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "elastic optical networks" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-9 z 9
    Tytuł:
    Rearrangeability of 2×2 W-S-W Elastic Switching Fabrics with Two Connection Rate
    Autorzy:
    Kabaciński, W.
    Rajewski, R.
    Al-Tameemi, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/307745.pdf
    Data publikacji:
    2018
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    elastic optical networks
    elastic optical switching nodes
    interconnection networks
    rearrangeable non-blocking conditions
    Opis:
    The rearreangeable conditions for the 2×2 three-stage switching fabric of a W-S-W architecture for elastic optical switches are considered in this paper. Analogies between the switching fabric considered and the three-stage Clos network are shown. On the other hand, differences are also shown, which presented the modifications required in the control algorithm used in rearrangeable networks. The rearrangeable conditions and the control algorithm are presented and proved. Operation of the proposed control algorithm is shown based on a few examples. The required number of frequency slot units in interstage links of rearrangeable switching fabrics is much lower than in the strict-sense non-blocking switching fabrics characterized by the same parameters.
    Źródło:
    Journal of Telecommunications and Information Technology; 2018, 1; 11-17
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Utilization Balancing Algorithms for Dynamic Multicast Scheduling Problem in EON
    Autorzy:
    Markowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/963830.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    elastic optical networks
    multicast
    load balancing
    flow assignment
    dynamic scheduling
    heuristic algorithms
    Opis:
    Dynamic data transfer demands are often being a challenge for present communication networks, as they appear in unpredictable time and must be satisfied prior to deadline. Important kind are the multi-target demands occurring in task of replication, backup, database synchronization or file transferring in pear-to-pear networks. Optimal scheduling usually depends of the nature of transport network. In the paper dynamic deadlinedriven multicast scheduling problem over elastic optical network is considered. Particularly, the method for improving link utilization by traffic balance for multicast demands is proposed. Few heuristic algorithms and results of experiments, proving the benefits of balancing concept are presented
    Źródło:
    International Journal of Electronics and Telecommunications; 2016, 62, 4; 363-370
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Investigation of dynamic routing and spectrum allocation methods in elastic optical networks
    Autorzy:
    Biernacka, E.
    Domżał, J.
    Wójcik, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/226037.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    elastic optical networks
    routing and spectrum allocation
    dynamic two-step RSA method
    Opis:
    The introduction of flexible frequency grids and advanced modulation techniques to optical transmission, namely an elastic optical network, requires new routing and spectrum allocation techniques. In this paper, we investigate dynamic two-step routing and spectrum allocation (RSA) methods for elastic optical networks. K-shortest path-based methods as well as spectrum allocation methods are analysed and discussed. Experimental verification of the investigated techniques is provided using simulation software. Simulation results present effectiveness of routing and spectrum allocation methods for analyzed networks using requested bandwidth of connections. Moreover, performance of shortest path first methods improves considerably when a number of candidate paths increases in the UBN24 topology.
    Źródło:
    International Journal of Electronics and Telecommunications; 2017, 63, 1; 85-92
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Constrained Maximum Available Frequency Slots on Path Based Online Routing and Spectrum Allocation for Dynamic Traffic in Elastic Optical Networks
    Autorzy:
    Khan, Akhtar Nawaz
    Powiązania:
    https://bibliotekanauki.pl/articles/1844474.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    elastic optical networks
    routing and spectrum allocation
    blocking probability
    continuity constraint
    contiguity constraint
    Opis:
    Elastic optical networking is a potential candidate to support dynamic traffic with heterogeneous data rates and variable bandwidth requirements with the support of the optical orthogonal frequency division multiplexing technology (OOFDM). During the dynamic network operation, lightpath arrives and departs frequently and the network status updates accordingly. Fixed routing and alternate routing algorithms do not tune according to the current network status which are computed offline. Therefore, offline algorithms greedily use resources with an objective to compute shortest possible paths and results in high blocking probability during dynamic network operation. In this paper, adaptive routing algorithms are proposed for shortest path routing as well as alternate path routing which make routing decision based on the maximum idle frequency slots (FS) available on different paths. The proposed algorithms select an underutilized path between different choices with maximum idle FS and efficiently avoids utilizing a congested path. The proposed routing algorithms are compared with offline routing algorithms as well as an existing adaptive routing algorithm in different network scenarios. It has been shown that the proposed algorithms efficiently improve network performance in terms of FS utilization and blocking probability during dynamic network operation.
    Źródło:
    International Journal of Electronics and Telecommunications; 2020, 66, 4; 707-714
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Advanced Considerations Concerning Impact of Applied Call Admission Control Mechanisms on Traffic Characteristics in Elastic Optical Network Nodes
    Autorzy:
    Głąbowski, Mariusz
    Sobieraj, Maciej
    Powiązania:
    https://bibliotekanauki.pl/articles/27312941.pdf
    Data publikacji:
    2023
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    elastic optical networks
    frequency slot unit
    loss probability
    reservation mechanism
    threshold mechanism
    switching networks
    traffic management
    Opis:
    Over the past few years, a significant increase in network traffic volumes has been observed. The ever growing bandwidth demands mean that a reliable and optimum service level needs to be ensured in communication systems for specific traffic categories. Optimal allocation and use of resources may be achieved through the use of call admission control (CAC) mechanisms implemented in network systems. The resource reservation mechanism and the threshold mechanism are two of the most popular CAC methods. In the reservation mechanisms, a certain number of resources is reserved for selected (predefined) services only. In the case of threshold mechanisms, the number of resources allocated to individual traffic classes depends on the network load. This article discusses the results of simulations verifying the impact of applied CAC mechanisms on the traffic characteristics in elastic optical network (EON) nodes with a Clos structure. Loss probability results obtained with the use of the simulator are presented as well.
    Źródło:
    Journal of Telecommunications and Information Technology; 2023, 4; 68--75
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Combination of Advanced Reservation and Resource Periodic Arrangement for RMSA in EON with Deep Reinforcement Learning
    Autorzy:
    Silaban, R. J.
    Alaydrus, Mudrik
    Umaisaroh, U.
    Powiązania:
    https://bibliotekanauki.pl/articles/27311944.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    Elastic Optical Networks (EON)
    Routing Modulation and Spectrum Assignment (RMSA)
    Advanced Reservation (AR)
    Resource Periodic Arrangement (RPA)
    Opis:
    The Elastic Optical Networks (EON) provide a solution to the massive demand for connections and extremely high data traffic with the Routing Modulation and Spectrum Assignment (RMSA) as a challenge. In previous RMSA research, there was a high blocking probability because the route to be passed by the K-SP method with a deep neural network approach used the First Fit policy, and the modulation problem was solved with Modulation Format Identification (MFI) or BPSK using Deep Reinforcement Learning. The issue might be apparent in spectrum assignment because of the influence of Advanced Reservation (AR) and Resource Periodic Arrangement (RPA), which is a decision block on a connection request path with both idle and active data traffic. The study’s limitation begins with determining the modulation of m = 1 and m = 4, followed by the placement of frequencies, namely 13 with a combination of standard block frequencies 41224–24412, so that the simulation results are less than 0.0199, due to the combination of block frequency slices with spectrum allocation rule techniques.
    Źródło:
    International Journal of Electronics and Telecommunications; 2023, 69, 3; 515--522
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Elastyczne sieci optyczne
    Elastic optical networks
    Autorzy:
    Biernacka, E.
    Lasoń, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/317692.pdf
    Data publikacji:
    2013
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    elastyczna sieć optyczna
    interfejsy optyczne PMD
    problem routingu i alokacji zasobów częstotliwościowych RSA
    elastic optical networks
    physical media dependent
    routing and spectrum allocation
    Opis:
    Artykuł przybliża koncepcję elastycznej sieci optycznej i charakterystyczne zagadnienia związane z jej implementacją. Przedstawiono w nim standardy styków optycznych sieci Ethernet 40 Gbit/s i 100 Gbit/s zawarte w dokumencie IEEE 802.3ba. Następnie opisano szczelinowy charakter widma elastycznej sieci optycznej, porównując ze sztywnym podziałem częstotliwości DWDM. Nakreślono problem planowania i dynamicznej alokacji zasobów w sieci.
    The paper studies a novel concept of elastic optical network and selected network–level requirements of next generation optical networks. It investigates new optical IEEE 802.3ba Physical Layer Specification. Next it is compared the fixed-grid wavelength division multiplexing optical networks with flexible-grid elastic optical networks. It is important to define routing and spectrum assignment RSA algorithms, which are required for network planning and dynamic resource allocation. Mobile lab, radiocommunication services testing, radiocommunication networks measurements.
    Źródło:
    Telekomunikacja i Techniki Informacyjne; 2013, 1-2; 5-17
    1640-1549
    1899-8933
    Pojawia się w:
    Telekomunikacja i Techniki Informacyjne
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Combinatorial Properties and Defragmentation Algorithms in WSW1 Switching Fabrics
    Autorzy:
    Rajewski, Remigiusz
    Kabaciński, Wojciech
    Al-Tameemi, Atyaf
    Powiązania:
    https://bibliotekanauki.pl/articles/227184.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    elastic optical network
    switching networks
    rearrenging algorithm
    defragmentation algorithm
    Opis:
    A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-space-wavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability.
    Źródło:
    International Journal of Electronics and Telecommunications; 2020, 66, 1; 99-105
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Handling high and low priority traffic in multi-layer networks
    Autorzy:
    Biernacka, Edyta
    Boryło, Piotr
    Jurkiewicz, Piotr
    Wójcik, Robert
    Domżał, Jerzy
    Powiązania:
    https://bibliotekanauki.pl/articles/27311464.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    elastic optical resources
    high priority traffic
    multi-layer networks
    priority-aware bypasses
    sieci wielowarstwowe
    obejście uwzględniające priorytety
    ruch priorytetowy
    zasób optyczny elastyczny
    Opis:
    In this paper, we propose a novel priority-aware solution named bypass to handle high- and low-priority traffic in multi-layer networks. Our approach assumes diversification of elastic optical spectrum to ensure additional resources reserved for emergency situations. When congestion occurs, the solution dynamically provides new paths, allocating a hidden spectrum to offload traffic from the congested links in the IP layer. Resources for a bypass are selected based on traffic priority. High-priority traffic always gets the shortest bypasses in terms of physical distance, which minimizes delay. Bypasses for low-priority traffic can be established if the utilization of the spectrum along the path is below the assumed threshold. The software-defined networking controller ensures the global view of the network and cooperation between IP and elastic optical layers. Simulation results show that the solution successfully reduces the amount of rejected high-priority traffic when compared to regular bypasses and when no bypasses are used. Also, overall bandwidth blocking probability is lower when our priority-aware bypasses are used.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 3; art. no. e145568
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-9 z 9

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies