Imprecise Multicast Routing for Scalable Information Distribution

Cite This

Files in this item

Checksum: MD5:0172f6f7e3af778332e46bacdec6cf83

NORDEN, Samphel, Marcel WALDVOGEL, 2002. Imprecise Multicast Routing for Scalable Information Distribution. IZS. Zurich, Switzerland, Feb, 2002. In: 17th International Zurich Seminar on Broadband Communications (IZS 2002), Zurich, Switzerland, February 2002

@inproceedings{Norden2002Impre-6427, title={Imprecise Multicast Routing for Scalable Information Distribution}, year={2002}, booktitle={17th International Zurich Seminar on Broadband Communications (IZS 2002), Zurich, Switzerland, February 2002}, author={Norden, Samphel and Waldvogel, Marcel} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/6427"> <dcterms:bibliographicCitation>First publ. in: 17th International Zurich Seminar on Broadband Communications (IZS 2002), Zurich, Switzerland, February 2002.</dcterms:bibliographicCitation> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:contributor>Waldvogel, Marcel</dc:contributor> <dc:format>application/pdf</dc:format> <dc:creator>Norden, Samphel</dc:creator> <dc:contributor>Norden, Samphel</dc:contributor> <dcterms:issued>2002</dcterms:issued> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:40Z</dc:date> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6427/1/norden02imprecise.pdf"/> <dcterms:abstract xml:lang="eng">Typically, multicast data distribution uses rendezvous points (PIM, CBT), multicast distribution tree building protocols, and multicast forwarding. Whereas the first two approaches have been extensively studied, scaling multicast forwarding state without increasing forwarding complexity has not been addressed in detail. Having a scalable strategy for aggregation of multicast forwarding state is essential for inter-domain multicast which could have any number of concurrent multicast groups, especially in applications such as event notification and web cache invalidation mechanisms. We first present the essential characteristics of a scalable multicast routing mechanism. We then introduce and analyze, according to these metrics, a scalable aggregation mechanism for multicast-based update and change distribution based on imprecise (too generous) aggregation. Our mechanism is simple to implement, requires no additional information about the groups, and allows important savings in routing table size and routing protocol overhead, at a minimal expense in additional network and end-system traffic.</dcterms:abstract> <dc:creator>Waldvogel, Marcel</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6427/1/norden02imprecise.pdf"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:40Z</dcterms:available> <dc:rights>terms-of-use</dc:rights> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:title>Imprecise Multicast Routing for Scalable Information Distribution</dcterms:title> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6427"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

norden02imprecise.pdf 134

This item appears in the following Collection(s)

terms-of-use Except where otherwise noted, this item's license is described as terms-of-use

Search KOPS


Browse

My Account