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.
As the survivable mapping is critical in IP-over-wavelength-division-multiplexing (WDM) network to guarantee the restorability of IP layer, provisioning survivability in network with dynamic traffic is essential. However, survivable mapping problem for dynamic traffic shows more complexity than that for static traffic: 1) How to guarantee a survivable mapping since the lightpath is established and...
We propose to use an iterative heuristic for the shortest path routing in static RWA problem of optical networks. The heuristic's performance is compared, in terms of number of wavelengths, with the shortest Dijkstra's path algorithm. The results suggest that it is feasible to choose routes, among the shortest paths, minimizing the number of wavelengths. For all studied scenarios, the heuristic achieved...
This paper addresses the problem of reducing congestion during logical topology design in de Bruijn WDM networks that can withstand the failure of a single physical link. Survivable routing of a logical topology ensures that the lightpaths are routed in a way that a single link failure does not disconnect the network. Survivable routing of the logical topology demands setting up of additional lightpaths...
Traffic grooming in wavelength division multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. Dynamic grooming deals with requests for wavelength allocation based on a dynamic pattern of arrivals in contrast to the situation of static grooming in which the pattern of arrivals must be previously...
In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and...
Traffic grooming in wavelength division multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. On-line solutions for dynamic grooming typically involve the construction of an auxiliary graph for deciding on the routing and wavelength assignment. An auxiliary graph can represent the network...
In this paper, we propose a new heuristic algorithm, protection based on survivable integrated auxiliary graph (PSIAG), to tolerate the single-link failure in waveband switching optical networks. The survivable integrated auxiliary graph (SIAG) contains single virtual topology layer and multiple waveband-plane layers, and it can well solve the routing and waveband assignment. In PSIAG, we can well...
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.