ArticlePDF Available

Genetic routing algorithm for multicast connections in packet networks

Authors:
Adam Chojnacki
Adam Chojnacki
Adam Chojnacki
  • This person is not on ResearchGate, or hasn't claimed this research yet.
Maciej Piechowiak at Kazimierz Wielki University in Bydgoszcz
Maciej Piechowiak
Piotr Zwierzykowski at Poznan University of Technology
Piotr Zwierzykowski
Download full-text PDFDownload full-text PDF
Read full-text
Download citation

Abstract and Figures

The article analyzes and explores the influence of different genetical solutions on the efficiency and effectiveness of the performance of genetic algorithms for multicast routing. The results of the simulation studies were compared with the results obtained with the application of classic heuristics, i.e. (KPP, CSPT and LD). The tests were carried out for a wide range of parameters defining properties and characteristics of test networks topologies. The simulation study takes into consideration topology generation methods in line with the Waxman model and the Barabási-Albert model.
Figures - uploaded by Piotr Zwierzykowski
Author content
All figure content in this area was uploaded by Piotr Zwierzykowski
Content may be subject to copyright.
ipc_genet
ic.pdf
Content uploaded by Piotr Zwierzykowski
Author content
All content in this area was uploaded by Piotr Zwierzykowski
Content may be subject to copyright.
ipc_genet
ic.pdf
Content uploaded by Piotr Zwierzykowski
Author content
All content in this area was uploaded by Piotr Zwierzykowski
Content may be subject to copyright.
A preview of the PDF is not available
... The application provides a range of network topology models and appropriate generative methods. The research work was conducted with the application of the networks generated by the above-mentioned methods that were appropriately adopted and unified [21], [22], [23], [24], [25], [26]. A network model was adopted in which the nodes were arranged on a square grid with the size of 1000 × 1000 (Waxman parameters: α = 0.15, β = 0.2). ...
The Influence of Group Members Arrangement on the Multicast Tree Cost
Article
Full-text available
  • Sep 2009
In the paper we introduce a group members arrangement as a new parameter for analyzing multicast routing algorithms finding multicast trees. We also propose a new multicast routing algorithm without constraints. The objective of STA (Switched Trees Algorithm) is to minimize the total cost of the multicast tree using a modification of the classical Prim’s algorithm (Pruned Prim’s Heuristic) and the SPT (Shortest Path Tree) algorithm that constructs a shortest path tree between a source and each multicast node.
View
... In general, at first either the Dijkstra algorithm[6]or the Bellman-Ford algorithm[7]are used, then the branches of the tree that do not have destination nodes are pruned. Several routing algorithms have been proposed in the literature for this problem[8,9,10,11,12,13]. Within the context of business relations between the user and the Internet Service Provider, or many ISPs, in real networks, a service level agreement (SLA) is negotiated to ensure the quality of transmission at the required level. ...
The Application of K–Shortest Path Algorithm in Multicast Routing
Article
Full-text available
  • Jan 2009
There have been many heuristic algorithms finding multicast trees proposed over the past few years. The necessity for finding a better and more suitable algorithm is still a current and important challenge. The article presents a new multicast routing algorithm for finding a multicast tree in packet networks. The objective of the K-Shortest Path Multicast Algorithm (KSPMA) is to minimize the cost of paths between the source and each destination node using a generalized Dijkstra's algorithm that would comply with maximum delay bound along each path. A wide range of simulation research carried out by the authors for many network topologies and parameters has confirmed the effectiveness of the proposed algorithm.
View
... The application provides a range of network topology models and appropriate generative methods. The research work was conducted with the application of the networks generated by the above-mentioned methods that were appropriately adopted and unified [20], [21], [22], [23], [24], [25]. A network model was adopted in which the nodes were arranged on a square grid with the size of 1000 × 1000 (Waxman parameters: α = 0.15, β = 0.2). ...
Analysis of the Influence of Group Members Arrangement on the Multicast Tree Cost
Conference Paper
Full-text available
  • Jan 2009
In the paper we introduce a group members arrangement as a new parameter for analyzing multicast routing algorithms finding multicast trees. We also propose a new multicast routing algorithm without constraints. The objective of STA (Switched Trees Algorithm) is to minimize the total cost of the multicast tree using a modification of the classical Prim's algorithm (Pruned Prim's Heuristic) and the SPT (Shortest Path Tree) algorithm that constructs a shortest path tree between a source and each multicast node.
View
Lagrangian Relaxation in the Multicriterial Routing
Conference Paper
  • Sep 2011
Communications networks routing is not a new subject. However, with a growth of packet networks and the increase of their range and importance, the task of conveying information over the web has grown beyond its original shape and has become far more sophisticated. It is no longer computer scientists and the military that make use of the global network exclusively; it can be stated that almost every possible group from the global population has numerous representatives among Internet users. This fact is coupled with a decrease in the popularity of the original communication media such as the telephone and the e-mail. This is mainly due to them being assimilated into packet networks along with the process of network convergence. A number of different types of information streams in packet networks has been observed and classified. It turns out that careful resources management itself may lead to an increase in the information transporting efficiency. In this paper, an approach is explored - the Lagrangian relaxation - that enables incorporating multiple criteria into the routing problem solution. At the same time, the low computation complexity is maintained that enables further consideration of the technique also in practical scenarios.
View
Performance Evaluation of Multicast Routing Algorithms with Fuzzy Sets
Chapter
  • Jan 2014
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 proposed algorithm. Get article (self-archiving): http://www.maciej.ukw.edu.pl/selfarchive/?paper=PiechowiakP_IPC2014
View
Implementation of vector-space online document retrieval system using open source technology
Conference Paper
Full-text available
  • Sep 2011
Vector-space model is one of the most popular information retrieval models and it has been successfully implemented in retrieving many textual document collections. However, not many vector-space implementations employed open source technology. This paper discusses the integration of Oracle 10g Express edition database and Java language in realizing the development of an online document retrieval system for an Archive and Museum Unit in a public university. The retrieval system is tested on thirty publication documents and natural language queries entered managed to retrieve and ranked the documents successfully.
View
A new delay-constrained multicast routing algorithm for packet networks
Conference Paper
  • Oct 2009
There have been many heuristic algorithms finding multicast trees proposed in the literature. The necessity for finding a better and more suitable algorithm is still topical and relevant. The paper presents a new multicast routing algorithm for finding a multicast tree in packet-switched networks. The objective of the proposed KSPMA algorithm is to minimize cost of constrained paths between the source and destination nodes using the generalized Dijkstra's algorithm regarding maximum delay bound along each path. A wide range of simulation research carried out by the authors, for many network topologies and parameters, has confirmed the effectiveness of the proposed algorithm.
View
On the Methodology for the Evaluation of Unconstrained Multicast Routing Algorithms
Conference Paper
  • Jun 2009
Having in mind various implementations of methods for generating network topology, there is also a need for a wider mechanism determining receiving nodes in a network by geographical positioning, or one that would be related to link and node parameters. This will allow us to answer the question whether the way receiving nodes are distributed has any influence on the quality of multicast trees constructed by algorithms. The paper proposes methods that arrange group members in packet-switched networks. In the research we discuss the influence of the group arrangement method on the total cost of tree and the average cost of path in a tree for unconstrained routing algorithms for multicast connections. The methods for the receiving nodes distribution in the network have not been hitherto addressed and analyzed in literature.
View
An Appraisal of Some Shortest Path Algorithm
Article
Full-text available
  • Jun 1969
This paper treats five discrete shortest-path problems: (1) determining the shortest path between two specified nodes of a network; (2) determining the shortest paths between all pairs of nodes of a network; (3) determining the second, third, etc., shortest path; (4) determining the fastest path through a network with travel times depending on the departure time; and (5) finding the shortest path between specified endpoints that passes through specified intermediate nodes. Existing good algorithms are identified while some others are modified to yield efficient procedures. Also, certain misrepresentations and errors in the literature are demonstrated.
View
A Fast Algorithm for Steiner Trees
Article
Full-text available
  • Jun 1981
Given an undirected distance graph G=(V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and SV is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that spans S with minimal total distance on its edges. In this paper, we analyze a heuristic algorithm for the Steiner tree problem. The heuristic algorithm has a worst case time complexity of O(SV 2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1–1/l) times that of the optimal tree, where l is the number of leaves in the optimal tree.
View
View
Emergence of Scaling in Random Networks
Article
  • Jan 1999
Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mech-anisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
View
On a Routing Problem
Article
  • Apr 1958
: Given a set of N cities, with every two linked by a road, and the times required to traverse these roads, we wish to determine the path from one given city to another given city which minimizes the travel time. The times are not directly proportional to the distances due to varying quality of roads, and v varying quantities of traffic. The functional equation technique of dynamic programming, combined with approximation in policy space, yield an iterative algorithm which converges after at most (N-1) iterations.
View
On a routing problem
Article
  • Jul 2004
  • PROBAB ENG INFORM SC
In a system with one queue and several service stations, it is a natural principle to route a customer to the idle station with the distributionwise shortest service time. For the case with exponentially distributed service times, we use a coupling to give strong support to that principle. We also treat another topic. A modified version of our methods brings support to the design principle: It is better with few but quick servers.
View
View
View
View
View