## DIMRO, a DiffServ-Integrated Multicast algorithm for Internet Resource Optimization in source specific multicast applications (2004)

Venue: | in Proceedings of ICC 2004 |

Citations: | 4 - 2 self |

### BibTeX

@INPROCEEDINGS{Pompili04dimro,a,

author = {Dario Pompili and Luca Lopez and Caterina Scoglio},

title = {DIMRO, a DiffServ-Integrated Multicast algorithm for Internet Resource Optimization in source specific multicast applications},

booktitle = {in Proceedings of ICC 2004},

year = {2004}

}

### OpenURL

### Abstract

Abstract — In this work DIMRO, an efficient algorithm to build source specific multicast trees, is presented. DIMRO aims at achieving a high traffic balance in the network in order to avoid bandwidth bottlenecks and consequent network partitions, one of the main causes for low network performance. To do so, it computes multicast trees by dynamically selecting the least loaded available paths, obtaining an optimal distribution of network resources. Strictly integrated with the DiffServ Quality of Service (QoS) approach, the proposed multirate native multicast algorithm maps the QoS service requested by receivers into the proper DiffServ class, so as to respect the expected QoS requirements. The results are a better leverage of the network bandwidth resources, an improved QoS perceived by multicast group members, and time and resource saving due to its low computational complexity, as shown through extensive C++ based simulation campaign.

### Citations

639 |
Routing of multipoint connections
- Waxman
- 1988
(Show Context)
Citation Context ...ging to p(s, ri k ). A. Random network model III. SIMULATION RESULTS To ensure a fairly evaluation of different routing algorithms, a random network has been generated according to the Waxman’s model =-=[11]-=-[12]. (9)In the Waxman’s model network, nodes are randomly distributed across a Cartesian coordinate grid. Links are added to the graph by considering all possible pairs (u, v) of nodes and by using ... |

417 | Modeling Internet topology
- Calvert, Doar, et al.
- 1997
(Show Context)
Citation Context ... to p(s, ri k ). A. Random network model III. SIMULATION RESULTS To ensure a fairly evaluation of different routing algorithms, a random network has been generated according to the Waxman’s model [11]=-=[12]-=-. (9)In the Waxman’s model network, nodes are randomly distributed across a Cartesian coordinate grid. Links are added to the graph by considering all possible pairs (u, v) of nodes and by using the ... |

363 |
AMPL: A Modeling Language for
- Fourer, Gay, et al.
- 2002
(Show Context)
Citation Context ...k resources. The minimum-weight tree is found by solving the flow formulation of the Steiner tree problem proposed by Claus & Maculan [13] and Wong [3]. We further implemented the ILP problem in AMPL =-=[14]-=- and solved it with the CPLEX [15] solver. Starting from a completely unloaded Waxman network [11], it is requested to build a fixed number of source rooted trees, the Number of Requested Trees. Multi... |

336 |
An Architecture for Differentiated Services, RFC 2475
- Blake, Black, et al.
- 1998
(Show Context)
Citation Context ...eep low the average link traffic utilization by fairly distributing data flows among those least loaded links. The DIMRO algorithm is integrated with the DiffServ Quality of Service (QoS) approach [8]=-=[9]-=-. The QoS service requested by receivers, mapped into the proper DiffServ class, is taken into account in the multicast tree computation. DIMRO allows members with less stringent QoS requirements to r... |

307 |
Topological Graph Theory
- Gross, Tucker
- 1987
(Show Context)
Citation Context ... of data that is delivered to multiple receivers. One of the most challenging objective in multicasting is to minimize the amount of network resources employed to compute and setup multicast trees [1]=-=[2]-=-. In multicast communication the routing problem is to find the minimum-weight tree that spans all the nodes in the multicast group [3][4]. In source specific multicast communications only one node in... |

224 |
An approximate solution for the Steiner problem in graphs
- Takahashi, Matsuyama
- 1980
(Show Context)
Citation Context ...rk resources employed to compute and setup multicast trees [1][2]. In multicast communication the routing problem is to find the minimum-weight tree that spans all the nodes in the multicast group [3]=-=[4]-=-. In source specific multicast communications only one node in the multicast group sends data while all the other member nodes receive data. A tree that spans all member nodes is said multicast tree. ... |

62 |
Multicast routing algorithms and protocols: a tutorial
- Sahasrabuddhe, Mukherjee
- 2000
(Show Context)
Citation Context ...opy of data that is delivered to multiple receivers. One of the most challenging objective in multicasting is to minimize the amount of network resources employed to compute and setup multicast trees =-=[1]-=-[2]. In multicast communication the routing problem is to find the minimum-weight tree that spans all the nodes in the multicast group [3][4]. In source specific multicast communications only one node... |

58 |
A dual ascent approach for Steiner tree problems on a directed graph
- Wong
- 1984
(Show Context)
Citation Context ...twork resources employed to compute and setup multicast trees [1][2]. In multicast communication the routing problem is to find the minimum-weight tree that spans all the nodes in the multicast group =-=[3]-=-[4]. In source specific multicast communications only one node in the multicast group sends data while all the other member nodes receive data. A tree that spans all member nodes is said multicast tre... |

17 | Efficient multicast flow control using multiple multicast groups
- Bhattacharyya, Kurose, et al.
- 1997
(Show Context)
Citation Context ...]. In source specific communications, multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity, a layering scheme can be used =-=[6]-=-[7]. In a layering scheme, data transmission through the network takes place over logical channels. A sender can simultaneously transmit data on multiple channels and a receiver can receive data from ... |

15 |
Garcia-Luna-Aceves, A loopfree Bellman–Ford Routing protocol without bouncing effect
- Cheng, Riley, et al.
- 1989
(Show Context)
Citation Context ...{ auv (1−ρuv) α ∞ if buv ≥ Fk if buv < Fk or (u, v) /∈ E DIMRO uses the Bellman-Ford algorithm which finds a spanning tree of the shortest paths from the source node s to all other nodes of the graph =-=[10]-=-. The path p(s, n) from node s to node n, solution of eq. 1, is the one that minimizes the function: ∑ duv (6) {(u,v)∈p(s,n)} Computational complexity: if the number of receivers is M, the DIMRO algor... |

12 | A multicast transmission schedule for scalable multi-rate distribution of bulk data using non-scalable erasure-correcting codes
- Birk, Crupnicoff
- 2003
(Show Context)
Citation Context ...In source specific communications, multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity, a layering scheme can be used [6]=-=[7]-=-. In a layering scheme, data transmission through the network takes place over logical channels. A sender can simultaneously transmit data on multiple channels and a receiver can receive data from mul... |

8 |
Une Nouvelle Formulation du Probleme de Steiner sur un Graphe
- Claus, Maculan
- 1983
(Show Context)
Citation Context ...members is the multicast tree that uses the least amount of network resources. The minimum-weight tree is found by solving the flow formulation of the Steiner tree problem proposed by Claus & Maculan =-=[13]-=- and Wong [3]. We further implemented the ILP problem in AMPL [14] and solved it with the CPLEX [15] solver. Starting from a completely unloaded Waxman network [11], it is requested to build a fixed n... |