Abstract
dc:description.abstractCommunication networks, in particular the Internet, face a variety of challenges that can disrupt our daily lives resulting in the loss of human lives and significant financial costs in the worst cases. We define challenges as external events that trigger faults that eventually result in service failures. Understanding these challenges accordingly is essential for improvement of the current networks and for designing Future Internet architectures. This dissertation presents a taxonomy of challenges that can help evaluate design choices for the current and Future Internet. Graph models to analyse critical infrastructures are examined and a multilevel graph model is developed to study interdependencies between different networks. Furthermore, graph-theoretic heuristic optimisation algorithms are developed. These heuristic algorithms add links to increase the resilience of networks in the least costly manner and they are computationally less expensive than an exhaustive search algorithm. The performance of networks under random failures, targeted attacks, and correlated area-based challenges are evaluated by the challenge simulation module that we developed. The GpENI Future Internet testbed is used to conduct experiments to evaluate the performance of the heuristic algorithms developed.
Degree
thesis:*- Grantor dc:publisher
- University of Kansas
- Year dc:date.issued
- 2013
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Cetinkaya, Egemen Kemal
- Advisor dc:contributor.advisor
-
- Sterbenz, James P.G.
Subjects
dc:subject × 8Rights
dc:rights- Statement dc:rights
-
- This item is protected by copyright and unless otherwise specified the copyright of this thesis/dissertation is held by the author.
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Dc Identifier Other
- http://dissertations.umi.com/ku:13157
- OAI identifier oai:identifier
- oai:kuscholarworks.ku.edu:1808/12985