Wyniki wyszukiwania - BazTech

1

Multi criterion multicast routing algorithm comparison for large networks

Stachowiak K.

Image Processing & Communications

|

2017

|

Vol. 22, no. 1

49--55

EN

QoS enabled multicast routing is known to be of non-polynominal complexity, which leads to the necessity of using heuristic algorithms to ﬁnd sub-optimal solutions to the problems of this class. The evaluation of such algorithms requires the use of the simulation techniques as the heuristics’ results are of stochastic nature. Because of the problem complexity the simulation times increase signiﬁcantly in the function of the network size, therefore the results presented in the literature are often limited to only small models. In this article the results of the evaluation of different multicast QoS routing algorithms (further referred to as the Multi-Constrained Minimum Steiner Tree Problem-MCMST)have been presented for a wide range of network sizes reaching thousands of nodes.

2

On-demand QoS and Stability Based Multicast Routing in Mobile Ad Hoc Networks

Basarkod P. I., Manvi S. S.

Journal of Telecommunications and Information Technology

|

2014

|

nr 3

98--112

EN

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).

3

Evaluation of Multicast Routing Algorithms with Fuzzy Sets

Piechowiak M., Prokopowicz P.

Advances in Electronics and Telecommunications

|

2013

|

Vol. 3, no. 5

44--48

EN

The paper presents a proposal of a new methodology that evaluates multicast routing algorithms in packet-switched networks with an application of fuzzy sets. Proposed multicriteria mechanism evaluate representative multicast routing algorithms: KPP, CSPT and MLRA (Multicast Routing Algorithm with Lagrange Relaxation) that minimize cost of paths between source and each destination node using Lagrange relaxation, and finally, minimize the total cost of multicast tree. A wide range of simulation research carried out by the authors, confirmed both the accuracy of new methodology and the effectiveness of the MLRA algorithm proposed by authors in earlier works.

4

Path-based multicast routing in network on chip architecture

Hawraniak M., Dziurzański P.

Elektronika : konstrukcje, technologie, zastosowania

|

2011

|

Vol. 52, nr 2

180-184

EN

The majority of contemporary implementations of multicast in on-chip networks rely on multiple unicast communication pattern. The drawbacks of such approach are inefficient network resources utilization and information redundancy, which results in the performance degradation and high message latencies. In this paper, the new routing algorithm is presented for handling many destinations (multicast) and adaptivity, including irregular mesh networks. The algorithm is based on Double-Channel XY Multicast Routing algorithm known from literature. The SystemC implementation of the algorithm and its application in the routing scheme is outlined. The simulation results confirms the benefits of the proposal.

PL

Większość współczesnych implementacji routingu jeden-do-wielu (ang. multicast) w sieciach wewnątrzukładowych opiera się o wielokrotne wysyłanie przez źródło tych samych pakietów do różnych węzłów (ang. uni-cast). Wadą takiego podejścia jest nieefektywne wykorzystanie zasobów sieciowych i redundancja informacji, która przekłada się na obniżenie wydajności i opóźnienia przy przesyłania pakietów. W artykule zaproponowany został algorytm typu multicast działający zarówno w regularnych, jak i nieregularnych sieciach typu siatka (ang. mesh). Proponowany algorytm jest oparty na podejściu Double-Channel XY Multicast Routing, znanym z literatury. W pracy zarysowano implementację wykonaną w języku SystemC oraz zastosowanie opisywanego algorytmu. Badania eksperymentalne potwierdziły zalety proponowanego podejścia.

5

Adaptive tree-based multicast routing in network on chip architecture

Czarnecki Ł., Dziużański P.

Elektronika : konstrukcje, technologie, zastosowania

|

2010

|

Vol. 51, nr 4

33-37

EN

The majority of the contemporary implementations of multicast in on-chip networks rely on multiple unicast communication pattern. The drawbacks of such an approach are inefficient network resources utilization and information redundancy, which results with the performance degradation and high message latencies. In the paper, we propose an adaptive tree-based multicast routing algorithm for an interconnection networks. The presented algorithm is based on the network traffic analysis and adapts the routing decisions to the current network conditions. We receive message delay improvement by 85-200% incomparison to the unicast communication pattern.

PL

Większość współczesnych implementacji routingu jeden-do-wielu w sieciach wewnątrzukładowych opiera się o wielokrotne wysyłanie przez źródło tych samych pakietów do różnych węzłów. Wadą takiego podejścia jest nieefektywne wykorzystanie zasobów sieciowych i redundancja informacji, która przekłada się na obniżenie wydajności i opóźnienia przy przesyłania pakietów. W artykule zaproponowany został adaptacyjny algorytm typu multicast oparty na konstrukcji drzew rozpinających. Zaprezentowany algorytm dokonuje analizy ruchu sieciowego i adaptacyjnie podejmuje decyzje w zależności od aktualnego stanu sieci. Badania eksperymentalne wykazały zmniejszenie opóźnienia o 85. ..200% w porównaniu z wielokrotną transmisją typu unicast.

6

The influence on network topology on the efficiency of multicast heuristic algorithms

Piechowiak M., Żmudziński P.

Image Processing & Communications

|

2006

|

Vol. 11, no 1

41-51

EN

The article investigates representative heuristic algorithms finding the cheapest spanning trees between a source node and the group of destination nodes (multicast connections). Reliable comparison and analysis of the efficiency of algorithms require the usage of network structures reflecting real Internet topology. This article also presents method for generation that topologies. The key part of the article includes the efficiency analysis and the influence of the parameters of a given structure (network model generated by BRITE tool) upon the efficiency of the algorithms under scrutiny.