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ę "Multicast routing" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    A Scalable Multicast Routing Protocol for Mobile Ad-Hoc Networks
    Autorzy:
    Qabajeh, Liana Khamis
    Powiązania:
    https://bibliotekanauki.pl/articles/2142308.pdf
    Data publikacji:
    2022
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    ad-hoc network
    MAODV
    ODMRP
    position-based multicast routing protocol
    simulated performance evaluation
    Opis:
    The multicasting technique supports a variety of applications that require data to be instantaneously transmitted to a set of destination nodes. In environments with continuously moving nodes, such as mobile ad-hoc networks, the search for efficient routes from sources to the projected destinations is a common issue. Proposed Windmill protocol provides a scalable multicast solution for mobile ad-hoc networks. Windmill aims to improve routing protocol’s performance by introducing a hierarchal distributed routing algorithm and dividing the area into zones. Additionally, it attempts to demonstrate better scalability, performance and robustness when faced with frequent topology changes, by utilizing restricted directional flooding. A detailed and extensive simulated performance evaluation has been conducted to assess Windmill and compare it with multicast ad-hoc on-demand distance vector (MAODV) and on-demand multicast routing protocols (ODMRP). Simulation results show that the three protocols achieved high packet delivery rates in most scenarios. Results also show that Windmill is capable of achieving scalability by maintaining the minimum packet routing load, even upon increasing the nodes’ speed, the number of sources, the number of group members and the size of the simulated network. The results also indicate that it offers superior performance and is well suited for ad-hoc wireless networks with mobile hosts. The trade-off of using Windmill consists in slightly longer paths – a characteristic that makes it a good choice for applications that require simultaneous data transmission to a large set of nodes.
    Źródło:
    Journal of Telecommunications and Information Technology; 2022, 2; 58--74
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Comparison of Multicast Algorithm Evaluation Results in Low and High Multicast Saturation Environments
    Autorzy:
    Stachowiak, Krzysztof
    Zwierzykowski, Piotr
    Powiązania:
    https://bibliotekanauki.pl/articles/309461.pdf
    Data publikacji:
    2019
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    quality of service
    multicast
    routing
    multicast saturation
    Opis:
    The multicast quality of service-enabled routing is a computationally challenging task. Despite ongoing research efforts, the associated mathematical problems are still considered to be NP-hard. In certain applications, computational complexity of finding the optimal connection between a set of network devices may be a particularly difficult challenge. For example, connecting a small group of participants of a teleconference is not much more complex than setting up a set of mutual point-to-point connections. On the other hand, satisfying the demand for such services as IPTV, with their receivers constituting the majority of the network, requires applying appropriate optimization methods in order to ensure real system execution. In this paper, algorithms solving this class of problems are considered. The notion of multicast saturation is introduced to measure the amount of multicast participants relative to the entire network, and the efficiency of the analyzed algorithms is evaluated for different saturation degrees.
    Źródło:
    Journal of Telecommunications and Information Technology; 2019, 3; 3-7
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On-demand QoS and Stability Based Multicast Routing in Mobile Ad Hoc Networks
    Autorzy:
    Basarkod, P. I.
    Manvi, S. S.
    Powiązania:
    https://bibliotekanauki.pl/articles/308940.pdf
    Data publikacji:
    2014
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    mobile ad hoc network
    mobility
    multicast routing
    QoS
    stability
    Opis:
    Finding a connection path that remains stable for suciently longer period is critical in mobile ad hoc networks due to frequent link breaks. In this paper, an on-demand Quality of Service (QoS) and stability based multicast routing (OQSMR) scheme is proposed, which is an extension of ad hoc on-demand multicast routing protocol (ODMRP) to provide QoS support for real time applications. The scheme works as follows. Each node in the network periodically estimates the parameters, i.e., node and link stability factor, bandwidth availability, and delays. Next step is creation of neighbor stability and QoS database at every node by using estimated parameters. The last sequence is multicast path construction by using, route request and route reply packets, and QoS and stability information, i.e., link/node stability factor, bandwidth and delays in route information cache of nodes, and performing route maintenance in case of node mobility and route failures. The simulation results indicate that proposed OQSMR demonstrates reduction in packet overhead, improvement in Packet Delivery Ratio (PDR), and reduction in end-to-end delays as compared to ODMRP, and Enhanced ODMRP (E-ODMRP).
    Źródło:
    Journal of Telecommunications and Information Technology; 2014, 3; 98-112
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Innovative Method of the Evaluation of Multicriterial Multicast Routing Algorithms
    Autorzy:
    Stachowiak, K.
    Zwierzykowski, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/307838.pdf
    Data publikacji:
    2013
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    evaluation
    graph algorithms
    multicast
    QoS
    resource drainage
    routing
    Opis:
    Theoretical considerations of the multicast Quality of Service (QoS) routing have been a rapidly developing and dynamic research area for years. Several algorithms derived from different approaches have been proposed, while the pool of valid solutions to the problem is steadily growing. When new solutions are compared with their predecessors, as much information as possible about their characteristics and differences is needed. Both the graph theory and the optimization theory provide robust and objective means of comparing not only algorithms, but also the results they produce. However, any possible extension to the comparison methods is vital and can bring interesting new information that would eventually lead to innovative conclusions. This article presents a method, derived from practice and experience, that simulates the drainage of resources accumulated by consecutive communication allocations. The nature of this comparison is an extension to the classical measurement of the success ratio and this creates a context of the continuous measure of a success rather than a simple binary value. In this article such a method with regard to algorithms optimizing multicast problems for more than two criteria is used for the first time and leads to an interesting conclusion about the influence of the number of the criteria on the result.
    Źródło:
    Journal of Telecommunications and Information Technology; 2013, 1; 49-55
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Survey of QoS Routing Protocols for Ad Hoc Networks
    Autorzy:
    Tafa, Igli
    Powiązania:
    https://bibliotekanauki.pl/articles/1035767.pdf
    Data publikacji:
    2011
    Wydawca:
    Academicus. International Scientific Journal publishing house
    Tematy:
    QoS
    MAODV
    Multicast routing
    AD HOC NETWORKS
    MAODV-Extension
    Opis:
    The aim of this paper is to give a big survey in enhancing the balance of the routing load and the consumption of resources using network layer metrics for the path discovery in the MAODV protocol. A ad hoc network (AD HOC NETWORKS) consists of a collection of wireless mobile nodes, which form a temporary network without relying on any existing infrastructure or centralized administration. The bandwidth of the ad hoc networks architecture is limited and shared between the participating nodes in the network, therefore an efficient utilization of the network bandwidth is very important. Multicasting technology can minimize the consumption of the link bandwidth and reduce the communication cost too. As multimedia and group-oriented computing gains more popularity for users of ad hoc networks, the effective Quality of Service (QoS) of the multicasting protocol plays a significant role in ad hoc networks. In this paper we propose a reconstruction of the MAODV protocol by extending some featuring QoS in MAODV. All simulations are prepared with the NS2 simulator and compare the performance of this algorithm with the MAODV algorithm. The achieved results illustrate faster path discovery and more performing routing balance in the use of MAODV-Extension.This paper would give relatively a modest support in Mobile Technology according to QoS communication.
    Źródło:
    Academicus International Scientific Journal; 2011, 03; 108-120
    2079-3715
    2309-1088
    Pojawia się w:
    Academicus International Scientific Journal
    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