Energy-efficient routing in data centre networks

dc.contributorSteinhöfel, Kathleen
dc.contributorKINGS COLLEGE LONDON, UNIVERSITY OF LONDON AND KINGS HEALTH PARTNERS INTEGRATED CANCER CENTRE
dc.date.accessioned2019-07-01T14:14:15Z
dc.date.accessioned2022-10-18T22:27:00Z
dc.date.available2019-07-01T14:14:15Z
dc.date.available2022-10-18T22:27:00Z
dc.date.created2019-07-01T14:14:15Z
dc.date.issued2016
dc.identifierhttp://hdl.handle.net/10533/236205
dc.identifier73160528
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4467540
dc.description.abstractThe increasing development of online services and cloud computing have driven attention to research in data centre technology, particularly energy-efficiency in Data Centre Networks (DCN). This work includes an overview of state of the art research in this field, with two main approaches: energy-efficient DCN architectures and energy-efficient algorithms. This project presents the implementation of a software simulation tool, whose objective is to simulate various DCN with different routing algorithms. In order to do this, network devices and architectures are modelled in Java, and a novel routing algorithm is implemented. The algorithm is taken from (2015, Wang et al), it is a greedy routing algorithm for multiresource data-flow requests, modelling Network as a Service (NaaS). The software design was conceived to be flexible, in order to facilitate further extensions to the project, such as the inclusion of more DCN architectures and/or routing algorithms.
dc.description.abstractThe increasing development of online services and cloud computing have driven attention to research in data centre technology, particularly energy-efficiency in Data Centre Networks (DCN). This work includes an overview of state of the art research in this field, with two main approaches: energy-efficient DCN architectures and energy-efficient algorithms. This project presents the implementation of a software simulation tool, whose objective is to simulate various DCN with different routing algorithms. In order to do this, network devices and architectures are modelled in Java, and a novel routing algorithm is implemented. The algorithm is taken from (2015, Wang et al), it is a greedy routing algorithm for multiresource data-flow requests, modelling Network as a Service (NaaS). The software design was conceived to be flexible, in order to facilitate further extensions to the project, such as the inclusion of more DCN architectures and/or routing algorithms.
dc.relationhttps://gitlab.com/sfehlandt/dcn_simulator_report/blob/master/Delivered_report.pdf
dc.relationinfo:eu-repo/grantAgreement//73160528
dc.relationinfo:eu-repo/semantics/dataset/hdl.handle.net/10533/93488
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.rightshttp://creativecommons.org/publicdomain/zero/1.0/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsCC0 1.0 Universal
dc.titleEnergy-efficient routing in data centre networks
dc.titleEnergy-efficient routing in data centre networks
dc.typeTesis Magíster


Este ítem pertenece a la siguiente institución