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-5 z 5
    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ł:
    Random Approach to Optimization of Overlay Public-Resource Computing Systems
    Autorzy:
    Chmaj, G.
    Walkowiak, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/226168.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    computing systems
    overlay
    P2P
    unicast
    optimization
    Opis:
    The growing need for computationally demanding systems triggers the development of various network-oriented computing systems organized in a distributed manner. In this work we concentrate on one kind of such systems, i.e. public-resource computing systems. The considered system works on the top of an overlay network and uses personal computers and other relatively simple electronic equipment instead of supercomputers. We assume that two kinds of network flows are used to distribute the data in the public-resource computing systems: unicast and peer-to-peer. We formulate an optimization model of the system. After that we propose random algorithms that optimize jointly the allocation of computational tasks and the distribution of the output data. To evaluate the algorithms we run numerical experiments and present results showing the comparison of the random approach against optimal solutions provided by the CPLEX solver.
    Źródło:
    International Journal of Electronics and Telecommunications; 2010, 56, 1; 55-61
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows
    Autorzy:
    Gładysz, J.
    Walkowiak, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/226174.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    anycast
    network design
    tabu search
    survivability
    Opis:
    In this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.
    Źródło:
    International Journal of Electronics and Telecommunications; 2010, 56, 1; 41-47
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Two Approaches to Network Design Problem for Overlay Multicast with Limited Tree Delay : Model and Optimal Results
    Autorzy:
    Szostak, M.
    Walkowiak, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/226284.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    overlay network
    multicasting
    optimization
    network design
    Opis:
    Live multimedia streaming and on-demand streaming applications (such as Internet radio or Internet TV) have been gaining more popularity in recent years. They require significant amount of bandwidth from media streaming servers and can easily saturate network infrastructure when the number of participant or bit rate of streaming content increases. Overlay multicast is an effective approach to the problem of streaming distribution. It combines flexibility of application layer multicast with efficiency of network layer multicast. Since overlay networks are built on the top of existing infrastructure, the cost of maintenance and deployment of this solution is relatively low compared to traditional Content Distribution Networks (CDN). Based on our previous works, we focus on solving the overlay network design problem to economically distribute content among the participants using overlay multicast. The optimization goal is to minimize the overlay network cost expressed by the cost of access links. Additionally, we assume that the maximum total delay of a streaming tree is upper bounded to provide QoS (Quality of Service) guarantees. We present two approaches to this problem and construct model using Levels and Flow Conservation Constraints. We show how various constraints following from real overlay systems influence the behavior of the distributing system. In numerical experiments we use real ISPs' price lists. To illustrate our approach we present optimal results obtained from the CPLEX solver.
    Źródło:
    International Journal of Electronics and Telecommunications; 2011, 57, 3; 335-340
    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ł
      Wyświetlanie 1-5 z 5

      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