Acyclic Type-of-Relationship Problems on the Internet : An Experimental Analysis

Zitieren

Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

HUMMEL, Benjamin, Sven KOSUB, 2007. Acyclic Type-of-Relationship Problems on the Internet : An Experimental Analysis. the 7th ACM SIGCOMM conference. San Diego, California, USA, 24. Okt 2007 - 26. Okt 2007. In: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement - IMC '07. the 7th ACM SIGCOMM conference. San Diego, California, USA, 24. Okt 2007 - 26. Okt 2007. New York, New York, USA:ACM Press, pp. 221. ISBN 978-1-59593-908-1. Available under: doi: 10.1145/1298306.1298337

@inproceedings{Hummel2007Acycl-3038, title={Acyclic Type-of-Relationship Problems on the Internet : An Experimental Analysis}, year={2007}, doi={10.1145/1298306.1298337}, isbn={978-1-59593-908-1}, address={New York, New York, USA}, publisher={ACM Press}, booktitle={Proceedings of the 7th ACM SIGCOMM conference on Internet measurement - IMC '07}, author={Hummel, Benjamin and Kosub, Sven} }

<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/3038"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Kosub, Sven</dc:contributor> <dcterms:abstract xml:lang="eng">An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is provided. We investigate the maximum acyclic type-of-relationship problem: on a given set of AS paths, find a maximum-cardinality subset which allows an acyclic and valley-free orientation. Inapproximability and NP-hardness results for this problem are presented and a heuristic is designed. The heuristic is experimentally compared to most of the state-of-the-art algorithms on a reliable data set. It turns out that the proposed heuristic produces the least number of misclassified customer-to-provider relationships among the tested algorithms. Moreover, it is flexible in handling pre-knowledge in the sense that already a small amount of correct relationships is enough to produce a high-quality relationship classification. Furthermore, the reliable data set is used to validate the acyclicity assumptions. The findings demonstrate that acyclicity notions should be an integral part of models of AS relationships.</dcterms:abstract> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Kosub, Sven</dc:creator> <dcterms:title>Acyclic Type-of-Relationship Problems on the Internet : An Experimental Analysis</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:53Z</dcterms:available> <dc:contributor>Hummel, Benjamin</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:53Z</dc:date> <dcterms:issued>2007</dcterms:issued> <dc:rights>deposit-license</dc:rights> <dcterms:bibliographicCitation>Publ. in: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement / Constantin Dovrolis, Matthew Roughan (eds.). New York: ACM Press, 2007, pp. 221-226</dcterms:bibliographicCitation> <dc:creator>Hummel, Benjamin</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3038"/> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto