Back to Search
Start Over
Iterative Research Method Applied to the Design and Evaluation of a Dynamic Multicast Routing Scheme
- Source :
- Measurement Methodology and Tools ISBN: 9783642412950, LECTURE NOTES IN COMPUTER SCIENCE, Recercat. Dipósit de la Recerca de Catalunya, Universitat Jaume I, UPCommons. Portal del coneixement obert de la UPC, Universitat Politècnica de Catalunya (UPC)
- Publication Year :
- 2013
- Publisher :
- Springer Berlin Heidelberg, 2013.
-
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.
- Subjects :
- Dynamic Source Routing
Encaminadors (Xarxes d'ordinadors)
Technology and Engineering
Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors [Àrees temàtiques de la UPC]
compact
experimental
Equal-cost multi-path routing
Computer science
computer.internet_protocol
Routing table
Distributed computing
Enhanced Interior Gateway Routing Protocol
Distance Vector Multicast Routing Protocol
Network topology
Steiner tree problem
symbols.namesake
Multicast address
Destination-Sequenced Distance Vector routing
Xcast
Pragmatic General Multicast
Static routing
evaluation
Protocol Independent Multicast
Multicast
Inter-domain
business.industry
Routers (Xarxes d'ordinadors)
ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS
Policy-based routing
multicast routing
Source-specific multicast
Link-state routing protocol
Multipath routing
Reliable multicast
symbols
IP multicast
IBCN
business
computer
performance
Computer network
Subjects
Details
- ISBN :
- 978-3-642-41295-0
978-3-642-41296-7 - ISSN :
- 03029743
- ISBNs :
- 9783642412950 and 9783642412967
- Database :
- OpenAIRE
- Journal :
- Measurement Methodology and Tools ISBN: 9783642412950, LECTURE NOTES IN COMPUTER SCIENCE, Recercat. Dipósit de la Recerca de Catalunya, Universitat Jaume I, UPCommons. Portal del coneixement obert de la UPC, Universitat Politècnica de Catalunya (UPC)
- Accession number :
- edsair.doi.dedup.....85c78bb658650d1498594e205048126d