Learning Centre

Improving Dependability of Networks with Penalty and Revocation Mechanisms

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.advisor Gurtov, Andrei, Dr., Aalto University, Finland
dc.contributor.author Kuptsov, Dmitriy
dc.date.accessioned 2017-06-19T09:02:47Z
dc.date.available 2017-06-19T09:02:47Z
dc.date.issued 2014
dc.identifier.isbn 978-952-60-5962-4 (electronic)
dc.identifier.isbn 978-952-60-5961-7 (printed)
dc.identifier.issn 1799-4942 (electronic)
dc.identifier.issn 1799-4934 (printed)
dc.identifier.issn 1799-4934 (ISSN-L)
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/26896
dc.description.abstract Both malicious and non-malicious faults can dismantle computer networks. Thus, mitigating faults at various layers is essential in ensuring efficient and fair network resource utilization. In this thesis we take a step in this direction and study several ways to deal with faults by means of penalties and revocation mechanisms in networks that are lacking a centralized coordination point, either because of their scale or design. Compromised nodes can pose a serious threat to infrastructure, end-hosts and services. Such malicious elements can undermine the availability and fairness of networked systems. To deal with such nodes, we design and analyze protocols enabling their removal from the network in a fast and a secure way. We design these protocols for two different environments. In the former setting, we assume that there are multiple, but independent trusted points in the network which coordinate other nodes in the network. In the latter, we assume that all nodes play equal roles in the network and thus need to cooperate to carry out common functionality. We analyze these solutions and discuss possible deployment scenarios. Next we turn our attention to wireless edge networks. In this context, some nodes, without being malicious, can still behave in an unfair manner. To deal with the situation, we propose several self-penalty mechanisms. We implement the proposed protocols employing a commodity hardware and conduct experiments in real-world environments. The analysis of data collected in several measurement rounds revealed improvements in terms of higher fairness and throughput. We corroborate the results with simulations and an analytic model. And finally, we discuss how to measure fairness in dynamic settings, where nodes can have heterogeneous resource demands. en
dc.format.extent 78 + app. 74
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Aalto University en
dc.publisher Aalto-yliopisto fi
dc.relation.ispartofseries Aalto University publication series DOCTORAL DISSERTATIONS en
dc.relation.ispartofseries 185/2014
dc.relation.haspart [Publication 1]: Dmitriy Kuptsov and Andrei Gurtov. SAVAH: Source Address Validation with Host Identity Protocol. In Proceedings of the First International ICST Conference on Security and Privacy in Mobile Information and Communication Systems, pages 190–201, July 2009. DOI: 10.1007/978-3-642-04434-2_17
dc.relation.haspart [Publication 2]: Teemu Koponen, Scott Shenker, Hari Balakrishnan, Nick Feamster, Igor Ganichev, Ali Ghodsi, P. Brighten Godfrey, Nick McKeown, Guru Parulkar, Barath Raghavan, Jennifer Rexford, Somaya Arianfar and Dmitriy Kuptsov. Architecting for Innovation. In SIGCOMM Computer Communication Review, vol. 41, pages 24–36, July 2011. DOI: 10.1145/2002250.2002256
dc.relation.haspart [Publication 3]: Oscar Garcia, Dmitriy Kuptsov, Andrei Gurtov and Klaus Wehrle. Cooperative Security in Distributed Networks. Computer Communications (COMCOM), vol. 36, pages 1284–1297, August 2013. DOI: 10.1016/j.comcom.2013.04.007
dc.relation.haspart [Publication 4]: Dmitriy Kuptsov, Boris Nechaev, Andrey Lukyanenko and Andrei Gurtov. How penalty leads to improvement: A measurement study of wireless backoff in IEEE 802.11 networks. Computer Networks (COMNET), pages 1–21, September 2014. DOI: 10.1016/j.comnet.2014.09.008
dc.relation.haspart [Publication 5]: Dmitriy Kuptsov, Boris Nechaev, Andrey Lukyanenko and Andrei Gurtov A Novel Demand-Aware Fairness Metric for IEEE 802.11 Wireless Networks. In Proceedings of the 28th Annual ACM Symposium on Applied Computing (SAC’13), pages 603–610, March 2013. DOI: 10.1145/2480362.2480478
dc.subject.other Computer science en
dc.subject.other Telecommunications engineering en
dc.title Improving Dependability of Networks with Penalty and Revocation Mechanisms en
dc.type G5 Artikkeliväitöskirja fi
dc.contributor.school Perustieteiden korkeakoulu fi
dc.contributor.school School of Science en
dc.contributor.department Tietotekniikan laitos fi
dc.contributor.department Department of Computer Science and Engineering en
dc.subject.keyword Internet architecture en
dc.subject.keyword protocol design en
dc.subject.keyword network measurements en
dc.subject.keyword wireless sensor and edge networks en
dc.identifier.urn URN:ISBN:978-952-60-5962-4
dc.type.dcmitype text en
dc.type.ontasot Doctoral dissertation (article-based) en
dc.type.ontasot Väitöskirja (artikkeli) fi
dc.contributor.supervisor Ylä-Jääski, Antti, Prof., Aalto University, Department of Computer Science, Finland
dc.opn Kangasharju, Jussi, Prof., University of Helsinki, Finland
dc.rev Katz, Randy K., Prof., University of California, Berkeley, USA
dc.rev Fu, Xiaoming, Prof., Georg-August University of Goettingen, Germany
dc.date.defence 2014-12-05
local.aalto.formfolder 2017_06_19_klo_11_59
local.aalto.archive yes


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search archive


Advanced Search

article-iconSubmit a publication

Browse