Computational Analysis of Complex Systems : Discrete Foundations, Algorithms, and the Internet

Kosub, Sven

Computational Analysis of Complex Systems : Discrete Foundations, Algorithms, and the Internet

Dateien

Kosub_2-1arm04l5ot2q38.pdfGröße: 849.89 KBDownloads: 168

Datum

2007

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Habilitation

Publikationsstatus

Published

Zusammenfassung

Complex systems are collections of functionally highly interdependent elements. To analyze, control, and manipulate the connection between the behavior of a complex system as a whole and its local behavior on the elementary scale is a central in complex systems research. We investigate a mathematical framework for finite, discrete dynamical systems capable to serve as a reference model for a computational analysis of complex systems from an ex post point of view. The framework is based on clone theory and forbidden graph minors an exhausts the class of all finite systems. Within the framework the islands of tractability for finding and counting fixed points in Boolean dynamical systems can be completely described. The benefits from such complexity classifications are precise maps of where simulations of complex systems allow short cuts. An application representative for theory building is Internet routing using the Border Gateway Protocol (BGP). The dissemination of BGP routes results from a discrete dynamical process without convergence guarantees by the protocol. Rather, the dynamic is driven by local policies of Autonomous Systems according to their business relationships. As business contracts are not publicly available, inferring relationships is an important algorithmic problem for ex post analyses. In respect of thereof, a purely combinatorial approach is presented. Experiments suggest that the involved acyclicity conditions should be an integral part of relationship models.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

KOSUB, Sven, 2007. Computational Analysis of Complex Systems : Discrete Foundations, Algorithms, and the Internet [Postdoctoral thesis]. München: TU München

BibTex

@book{Kosub2007Compu-55843,
  year={2007},
  title={Computational Analysis of Complex Systems : Discrete Foundations, Algorithms, and the Internet},
  url={http://mediatum.ub.tum.de/?id=821227},
  author={Kosub, Sven}
}

RDF

<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/server/rdf/resource/123456789/55843">
    <dcterms:title>Computational Analysis of Complex Systems : Discrete Foundations, Algorithms, and the Internet</dcterms:title>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-10T15:30:12Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55843"/>
    <dcterms:abstract xml:lang="eng">Complex systems are collections of functionally highly interdependent elements. To analyze, control, and manipulate the connection between the behavior of a complex system as a whole and its local behavior on the elementary scale is a central in complex systems research. We investigate a mathematical framework for finite, discrete dynamical systems capable to serve as a reference model for a computational analysis of complex systems from an ex post point of view. The framework is based on clone theory and forbidden graph minors an exhausts the class of all finite systems. Within the framework the islands of tractability for finding and counting fixed points in Boolean dynamical systems can be completely described. The benefits from such complexity classifications are precise maps of where simulations of complex systems allow short cuts. An application representative for theory building is Internet routing using the Border Gateway Protocol (BGP). The dissemination of BGP routes results from a discrete dynamical process without convergence guarantees by the protocol. Rather, the dynamic is driven by local policies of Autonomous Systems according to their business relationships. As business contracts are not publicly available, inferring relationships is an important algorithmic problem for ex post analyses. In respect of thereof, a purely combinatorial approach is presented. Experiments suggest that the involved acyclicity conditions should be an integral part of relationship models.</dcterms:abstract>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-10T15:30:12Z</dcterms:available>
    <dc:creator>Kosub, Sven</dc:creator>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/55843/3/Kosub_2-1arm04l5ot2q38.pdf"/>
    <dc:contributor>Kosub, Sven</dc:contributor>
    <dcterms:issued>2007</dcterms:issued>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/55843/3/Kosub_2-1arm04l5ot2q38.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>terms-of-use</dc:rights>
  </rdf:Description>
</rdf:RDF>

URL der Originalveröffentl.

http://mediatum.ub.tum.de/?id=821227

Prüfdatum der URL

2021-12-10

Hochschulschriftenvermerk

München, TU München, Habil.-Schr., 2009

Universitätsbibliographie

Nein