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ę "Walkowiak, K." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Modelling of Minimum Cost Overlay Multicast Tree in Two Layer Networks
    Autorzy:
    Kucharzak, M.
    Walkowiak, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/226288.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    modelling
    overlay multicast
    multilayer networks
    Opis:
    Multicast realises the data delivering to a group of destinations simultaneously while using the minimum network resources. The first implementation of multicasting has been built using specialized multicast routers and is well known as IP Multicast. Such a network comprises some drawback including complex addressing and routing scheme, it requires the deployment of special routers that are rather expensive and finally, there has not been proposed a reasonable business model regarding cross-providers multicast realization. Thereby, for the past few years, a new interest in delivering multicast traffic has arisen and some multicast systems defined for end-hosts overlay network have been successfully proposed. Overlay multicast implements a multicast technique at the top of computer networks and creates a virtual topology of clients which duplicate packets and maintain a multicast structure. This overlay structure forms an independent layer with logical links between the nodes without the knowledge about the underlaying topology. In the work we take a look at flow cost minimization of multicast stream in a system which combines the advantages of overlays and underlaying network awareness. This papers presents three independent linear-based models aimed at optimization of multicast tree topology and its network level unicast realization. The proposed formulations can be applied for deriving either lower bound of flows costs in existing systems or for designing new cooperative multilayer protocols for effective multicast transmission.
    Źródło:
    International Journal of Electronics and Telecommunications; 2011, 57, 3; 317-322
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Comparison of Evolutionary Algorithm and Heuristics for Flow Optimization in P2P Systems
    Autorzy:
    Kucharzak, M.
    Siwek, A.
    Walkowiak, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/226952.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    P2P
    flows
    network optimization
    Opis:
    Nowadays, many Internet users make use of Peer-to-Peer (P2P) systems to download electronic content including music, movies, software, etc. Growing popularity in P2P based protocol implementations for file sharing purposes caused that the P2P traffic exceeds Web traffic and in accordance with to many statistics, P2P systems produce a more than 50% of the whole Internet traffic. Therefore, P2P systems provide remarkable income for Internet Service Providers (ISP). However, at the same time P2P systems generates many problems related to traffic engineering, optimization, network congestion. In this paper we focus on the problem of flow optimization in P2P file sharing systems. Corresponding to BitTorrent-based systems behaviour, the optimization of P2P flows is very complex and in this work we consider different heuristic strategies for content distribution and moreover we propose a new evolutionary algorithm (EA) for this problem. We compare results of the algorithms against optimal results yielded by CPLEX solver for networks including 10 peers and relation to random algorithm for 100-node systems. According to numerical experiments, the EA provides solutions close to optimal for small instances and all of the heuristics exhibit a superior performance over random search.
    Źródło:
    International Journal of Electronics and Telecommunications; 2010, 56, 2; 145-152
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Heuristic algorithms for optimization of task allocation and result distribution in peer-to-peer computing systems
    Autorzy:
    Chmaj, G.
    Walkowiak, K.
    Tarnawski, M.
    Kucharzak, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/330970.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    system obliczeniowy P2P
    przetwarzanie rozproszone
    optymalizacja
    heurystyka
    algorytm ewolucyjny
    P2P computing system
    distributed computing
    optimization
    heuristics
    evolutionary algorithms
    Opis:
    Recently, distributed computing system have been gaining much attention due to a growing demand for various kinds of effective computations in both industry and academia. In this paper, we focus on Peer-to-Peer (P2P) computing systems, also called public-resource computing systems or global computing systems. P2P computing systems, contrary to grids, use personal computers and other relatively simple electronic equipment (e.g., the PlayStation console) to process sophisticated computational projects. A significant example of the P2P computing idea is the BOINC (Berkeley Open Infrastructure for Network Computing) project. To improve the performance of the computing system, we propose to use the P2P approach to distribute results of computational projects, i.e., results are transmitted in the system like in P2P file sharing systems (e.g., BitTorrent). In this work, we concentrate on offline optimization of the P2P computing system including two elements: scheduling of computations and data distribution. The objective is to minimize the system OPEX cost related to data processing and data transmission. We formulate an Integer Linear Problem (ILP) to model the system and apply this formulation to obtain optimal results using the CPLEX solver. Next, we propose two heuristic algorithms that provide results very close to an optimum and can be used for larger problem instances than those solvable by CPLEX or other ILP solvers.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 733-748
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      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