Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Scaling geometric monitoring over distributed streams

Keros Alexandros-Dimitrios

Simple record


URIhttp://purl.tuc.gr/dl/dias/06B38814-2483-404B-9B2A-1CEC22C98D80-
Identifierhttps://doi.org/10.26233/heallink.tuc.65984-
Languageen-
Extent71 pagesen
TitleScaling geometric monitoring over distributed streamsen
TitleΚλιμάκωση της γεωμετρικής μεθόδου επί κατανεμημένων ροών δεδομένωνel
CreatorKeros Alexandros-Dimitriosen
CreatorΚερος Αλεξανδρος-Δημητριοςel
Contributor [Thesis Supervisor]Samoladas Vasilisen
Contributor [Thesis Supervisor]Σαμολαδας Βασιληςel
Contributor [Committee Member]Garofalakis Minosen
Contributor [Committee Member]Γαροφαλακης Μινωςel
Contributor [Committee Member]Deligiannakis Antoniosen
Contributor [Committee Member]Δεληγιαννακης Αντωνιοςel
PublisherΠολυτεχνείο Κρήτηςel
PublisherTechnical University of Creteen
Academic UnitTechnical University of Crete::School of Electrical and Computer Engineeringen
Academic UnitΠολυτεχνείο Κρήτης::Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστώνel
Content SummaryModern applications, such as telecommunication and sensor networks, have brought distributed data streams to the foreground, with monitoring tasks being an important aspect of such systems. The inefficiency of collecting data to a central point for processing dictates the need to devise local or semi-local algorithms that aim to reduce the communication overhead while retaining accuracy standards. The geometric monitoring method [Sharfman et al., “A Geometric Approach to Monitoring Threshold Functions over Distributed Data Streams”, ACM SIGMOD ’06 ICMD] provides a frame- work for enforcing local constraints at distributed nodes, as well as a method for resolving violations not representing the system’s state i.e., false alarms, in order to reduce the necessary communi- cation with the coordinating node. Furthermore, successive work proposed optimizations to the selection process of the nodes participating to the set that resolves such violations. We propose a heuristic method that exploits data stream characteristics and utilizes multi- objective optimization in order to avert, or delay, successive false alarms by optimally positioning vector representations of data streams during the violation resolution process. Additionally, a hierarchical node clustering method for deterministic and optimal node selection, found in [ Keren et al., “Geometric Monitoring of Heterogeneous Streams”, IEEE Trans. Knowl. Data Eng., 2014], is improved and simplified. Extensive experimentation on real-world and synthetic datasets showcase that the proposed methods can reduce the communication burden in half, compared to that of the original geometric monitoring method.en
Type of ItemΔιπλωματική Εργασίαel
Type of ItemDiploma Worken
Licensehttp://creativecommons.org/licenses/by-nc-sa/4.0/en
Date of Item2016-07-07-
Date of Publication2016-
SubjectData streamsen
SubjectScalabilityen
SubjectDistributed streamsen
SubjectGeometric monitoringen
SubjectMulti-objective optimizationen
Bibliographic CitationAlexandros-Dimitrios Keros, "Scaling geometric monitoring over distributed streams", Diploma Work, School of Electrical and Computer Engineering, Technical University of Crete, Chania, Greece, 2016en
Bibliographic CitationΑλέξανδρος-Δημήτριος Κέρος, "Κλιμάκωση της γεωμετρικής μεθόδου επί κατανεμημένων ροών δεδομένων", Διπλωματική Εργασία, Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών, Πολυτεχνείο Κρήτης, Χανιά, Ελλάς, 2016el

Available Files

Services

Statistics