A dynamic multicast routing satisfying multiple QoS constraints

Abstract

In this paper we propose a QoS-based routing algorithm for dynamic multicasting. The complexity of the problem can be reduced to a simple shortest path problem by applying a Weighted Fair Queuing (WFQ) service discipline. Using a modified Bellman-Ford algorithm, the proposed routing builds a multicast tree, where a node is added to the existing multicast tree without re-routing and satisfying QoS constraints. With user defined life-time of connection this heuristic algorthm builds multicast tree which is near optimum over the whole duration of session. Simulation results show that tree costs are nearly as good as other dynamic multicast routings that does not consider QoS.

Finding Top-k Shortest Path Distance Changes in an Evolutionary Network

“…A number of algorithms in computer networks [22,8] also solve the problem of recomputing shortest path trees when edges are added to or removed from the graph. Some related work [6,3,19,4] for this problem proposes methods for exact computation of dynamic shortest paths in a variety of graph settings and in parallel or distributed scenarios.…”

“…We used the DBLP co-authorship graphs 7 , IMDB co-starring graphs 8 and Ontario road network graphs 9 . The nodes for the DBLP co-authorship graphs are authors and the edges denote the collaborations.…”

Dynamic update of shortest path tree in OSPF

“…Thus, it is crucial that algorithms for dynamically updating SPT are introduced to handle link state changes in a network efficiently. The problem to derive the shortest path is a subject of continual research interest [7,8,9]. In order to achieve less computation time, the updating process to separate weightincrease operations and weight-decrease operations is proposed for the dynamic SPT updates [10].…”

Dynamic shortest path tree update for multiple link state decrements

“…1 If v ∈ V is a node in graph G = (V, E, w), given a SPT from G originated from a source node S(G), an available node list M and suppose that the decreased value of the shortest distance of node v is d, let N f ixed (v) be a node set containing node v. Some other nodes (e.g., v ) can be recursively added to this node set iff: , w), given a SPT from G originated from a source node S(G), and a node set N f ixed (v), let N f loating (v) be a node set where a node is not in N f ixed (v) but a direct child of any node in N f ixed (v) following the SPT.…”

“…Dynamic SPT update approaches are proposed in recent years on network routing for path determination, with the central problem being to reduce costs, particularly computation times [1], [2], [3], [4]. The case of multiple link state changes deserves more attention for dynamic SPT update.…”