Advanced search
2 files | 30.11 MB Add to list

Iterative research method applied to the design and evaluation of a dynamic multicast routing scheme

Author
Organization
Abstract
Following the iterative research cycle process, this chapter elaborates a methodology and documents the steps followed for the design of a dynamic multicast routing algorithm, referred to as Greedy Compact Multicast Routing. Starting from the design of the dynamic multicast routing algorithm, we then evaluate by simulation on large-scale topologies its performance and compare them with the Abraham compact multicast routing scheme and two other reference schemes, namely the Shortest Path Tree (SPT) and the Steiner Tree (ST) algorithm. Performance evaluation and comparison include i) the stretch of the multicast routing paths also referred to as multicast distribution tree (MDT), ii) the memory space required to store the resulting routing table entries, and iii) the total communication or messaging cost, i.e., the number of messages exchanged to build the MDT. However, such performance evaluation is a necessary but not a sufficient condition to meet in order to expect deployment of multicast routing. Indeed, if one can determine that traffic exchanges are spatially and temporally concentrated, this would provide elements indicating the relevance for the introduction of such scheme in the Internet. Otherwise (if traffic exchanges are spatially and temporally diverse, i.e., highly distributed), then very few of them would benefit from a (shared) point-to-multipoint routing paths and multicast routing scheme would be less useful. For this purpose, we have conducted a multicast tree inference study. In turn, data and results obtained from these studies provides more realistic scenarios for emulation experiments against the currently deployed approach combining MBGP and PIMdeployed in IPTV or mVPN context.
Keywords
multicast routing, IBCN, compact, experimental, performance, evaluation

Downloads

  • 5712 i.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 800.80 KB
  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 29.31 MB

Citation

Please use this url to cite or link to this publication:

MLA
Papadimitriou, D et al. “Iterative Research Method Applied to the Design and Evaluation of a Dynamic Multicast Routing Scheme.” Lecture Notes in Computer Science. Ed. L Fabrega et al. Vol. 7586. Springer, 2013. 107–126. Print.
APA
Papadimitriou, D, Coras, F., Rodriguez, A., Carela, V., Careglio, D., Fàbrega, L., Vilà, P., et al. (2013). Iterative research method applied to the design and evaluation of a dynamic multicast routing scheme. In L. Fabrega, P. Vila, D. Careglio, & D. Papadimitriou (Eds.), LECTURE NOTES IN COMPUTER SCIENCE (Vol. 7586, pp. 107–126). Presented at the 1st European Workshop of EU 7th Framework Programme (FP7) Future Internet Res Experimentat (FIRE)/Expt UpdateLess Evolut Routing (EULER) Project on Measurement Methodol and Tools, Springer.
Chicago author-date
Papadimitriou, D, F Coras, A Rodriguez, V Carela, D Careglio, L Fàbrega, P Vilà, and Piet Demeester. 2013. “Iterative Research Method Applied to the Design and Evaluation of a Dynamic Multicast Routing Scheme.” In Lecture Notes in Computer Science, ed. L Fabrega, P Vila, D Careglio, and D Papadimitriou, 7586:107–126. Springer.
Chicago author-date (all authors)
Papadimitriou, D, F Coras, A Rodriguez, V Carela, D Careglio, L Fàbrega, P Vilà, and Piet Demeester. 2013. “Iterative Research Method Applied to the Design and Evaluation of a Dynamic Multicast Routing Scheme.” In Lecture Notes in Computer Science, ed. L Fabrega, P Vila, D Careglio, and D Papadimitriou, 7586:107–126. Springer.
Vancouver
1.
Papadimitriou D, Coras F, Rodriguez A, Carela V, Careglio D, Fàbrega L, et al. Iterative research method applied to the design and evaluation of a dynamic multicast routing scheme. In: Fabrega L, Vila P, Careglio D, Papadimitriou D, editors. LECTURE NOTES IN COMPUTER SCIENCE. Springer; 2013. p. 107–26.
IEEE
[1]
D. Papadimitriou et al., “Iterative research method applied to the design and evaluation of a dynamic multicast routing scheme,” in LECTURE NOTES IN COMPUTER SCIENCE, Aalborg, Denmark, 2013, vol. 7586, pp. 107–126.
@inproceedings{4192965,
  abstract     = {Following the iterative research cycle process, this chapter elaborates a methodology and documents the steps followed for the design of a dynamic multicast routing algorithm, referred to as Greedy Compact Multicast Routing. Starting from the design of the dynamic multicast routing algorithm, we then evaluate by simulation on large-scale topologies its performance and compare them with the Abraham compact multicast routing scheme and two other reference schemes, namely the Shortest Path Tree (SPT) and the Steiner Tree (ST) algorithm. Performance evaluation and comparison include i) the stretch of the multicast routing paths also referred to as multicast distribution tree (MDT), ii) the memory space required to store the resulting routing table entries, and iii) the total communication or messaging cost, i.e., the number of messages exchanged to build the MDT. However, such performance evaluation is a necessary but not a sufficient condition to meet in order to expect deployment of multicast routing. Indeed, if one can determine that traffic exchanges are spatially and temporally concentrated, this would provide elements indicating the relevance for the introduction of such scheme in the Internet. Otherwise (if traffic exchanges are spatially and temporally diverse, i.e., highly distributed), then very few of them would benefit from a (shared) point-to-multipoint routing paths and multicast routing scheme would be less useful. For this purpose, we have conducted a multicast tree inference study. In turn, data and results obtained from these studies provides more realistic scenarios for emulation experiments against the currently deployed approach combining MBGP and PIMdeployed in IPTV or mVPN context.},
  author       = {Papadimitriou, D and Coras, F and Rodriguez, A and Carela, V and Careglio, D and Fàbrega, L and Vilà, P and Demeester, Piet},
  booktitle    = {LECTURE NOTES IN COMPUTER SCIENCE},
  editor       = {Fabrega, L and Vila, P and Careglio, D and Papadimitriou, D},
  isbn         = {9783642412967},
  issn         = {0302-9743},
  keywords     = {multicast routing,IBCN,compact,experimental,performance,evaluation},
  language     = {eng},
  location     = {Aalborg, Denmark},
  pages        = {107--126},
  publisher    = {Springer},
  title        = {Iterative research method applied to the design and evaluation of a dynamic multicast routing scheme},
  volume       = {7586},
  year         = {2013},
}

Web of Science
Times cited: