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 presents a tabu search meta-heuristic to solve the static manycast routing and wavelength assignment problem (MA-RWA). The problem is to route a set of manycast requests over a wavelength-routed WDM network such that the number of wavelengths required is minimized. We present the details of a tabu search meta-heuristic for this problem and compare it to two other MA-RWA heuristics called...
Multicast is widely applied for multimedia communications in Internet. The effective multicast routing is the key technology to the communications. The Qos of multi-constrained multicast routing problem deserves more attention. The objective function is to minimize the cost and meet multiple constraints to realize high Qos. The solutions' fitness is obtained by the concentration mechanism of immune...
Quality-of-Service Multicast routing is a well-known NP-complete problem as constrained Steiner tree problem, which has various real-time multimedia applications in highspeed networks. The bandwidth-delay-constrained least-cost multicast routing algorithms based on Tabu Search are proposed in this paper. These algorithms can improve the search speed, and make a better solution by using one of the...
Multicast routing with quality-of-service constraints is one of the most important problems in computer networks as constrained Steiner tree problem. It is a well-known NP-complete problem, which has various real-time multimedia applications in high-speed networks. In this paper, we propose algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on Tabu search...
This paper proposes a tabu search (TS) based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we expect...
The fulfilment of guaranteed multiple criteria based quality of service (QoS) for multimedia applications servicing multiple subscribers is known to be a NP complete problem. Moreover, finding the multicast graph respecting the defined QoS requirements and minimizing network resources is also a NP-complete optimization task. The well-known greedy algorithm Mamcra, proposed in the literature, computes...
The multi-source network coding problem, in which multiple multicast sessions with independent data share a network, is an open challenge. This paper proposes an approach to implement multi-source multicast sessions with linear network coding. We divide the original network into several sub-graphs, and each sub-graph contains a source node and its corresponding sink nodes. Links belonging to different...
Multicast routing with quality-of-service constraints is one of the most important problems in computer networks as constrained Steiner tree problem. It is a well-known NP-complete problem, which has various real-time multimedia applications in high-speed networks. In this paper, we propose algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on Tabu Search...
In this paper, a QoS multicast routing scheme based on TS (Tabu Search) and AFS (artificial fish swarm) is presented. The corresponding model and its mathematical description are introduced. By combining fast searching ability of AFS and global optimization ability of TS, it tries to find the best multicast tree with the maximum probability of meeting multiple QoS constraints under the given cost...
The well-known greedy multicast routing algorithm Mamcra, proposed in the literature, computes the set of shortest paths from a source to all destinations, and then reduces this set to an efficient set of multicast routes, without compromising the requested level of QoS. In this paper, we propose a taboo search algorithm, named TabooQMR, that is augmented by some meta-heuristics to improve the multicast...
Based on QoS constraints such as delay, delay jitter, bandwidth and packet loss metrics this paper describes a network model suitable for investigating the routing problem and presents a multicast routing algorithm with multiple QoS constraints based on GA and TS hybrid strategy. This algorithm takes advantage of GA and TS and overcomes the shortcomings of GA used in solving the multicast routing...
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.