| dc.date.accessioned |
2012-11-28T11:40:41Z |
und |
| dc.date.accessioned |
2017-10-24T12:24:36Z |
|
| dc.date.available |
2012-11-28T11:40:41Z |
und |
| dc.date.available |
2017-10-24T12:24:36Z |
|
| dc.date.issued |
2012-11-28T11:40:41Z |
|
| dc.identifier.uri |
http://radr.hulib.helsinki.fi/handle/10138.1/2175 |
und |
| dc.identifier.uri |
http://hdl.handle.net/10138.1/2175 |
|
| dc.title |
Replication-based Load Balancing in Distributed Content-Based Publish /Subscribe Systems |
en |
| ethesis.discipline |
Computer science |
en |
| ethesis.discipline |
Tietojenkäsittelytiede |
fi |
| ethesis.discipline |
Datavetenskap |
sv |
| ethesis.discipline.URI |
http://data.hulib.helsinki.fi/id/1dcabbeb-f422-4eec-aaff-bb11d7501348 |
|
| ethesis.department.URI |
http://data.hulib.helsinki.fi/id/225405e8-3362-4197-a7fd-6e7b79e52d14 |
|
| ethesis.department |
Institutionen för datavetenskap |
sv |
| ethesis.department |
Department of Computer Science |
en |
| ethesis.department |
Tietojenkäsittelytieteen laitos |
fi |
| ethesis.faculty |
Matematisk-naturvetenskapliga fakulteten |
sv |
| ethesis.faculty |
Matemaattis-luonnontieteellinen tiedekunta |
fi |
| ethesis.faculty |
Faculty of Science |
en |
| ethesis.faculty.URI |
http://data.hulib.helsinki.fi/id/8d59209f-6614-4edd-9744-1ebdaf1d13ca |
|
| ethesis.university.URI |
http://data.hulib.helsinki.fi/id/50ae46d8-7ba9-4821-877c-c994c78b0d97 |
|
| ethesis.university |
Helsingfors universitet |
sv |
| ethesis.university |
University of Helsinki |
en |
| ethesis.university |
Helsingin yliopisto |
fi |
| dct.creator |
Chao, Chen |
|
| dct.issued |
2012 |
|
| dct.language.ISO639-2 |
eng |
|
| dct.abstract |
In recent years, content-based Publish/Subscribe (pub/sub) has become a popular paradigm to decouple content producers and consumers for Internet-scale content services. Many real applications show that the content workloads frequently follow very skewed distribution, and incur unbalanced workloads. To balance the workloads, the current content-based Publish/Subscribe systems normally adopt a migration scheme (Mis) to move (a subset of) subscription filters from overloaded brokers to underloaded brokers. In this way, the publications that successfully match the moved filters are then o oaded, leading to balanced workloads. Unfortunately, the Mis scheme cannot reduce the overall matching workloads. In the worse case, suppose that all brokers su er from heavy workloads. Mis cannot find available brokers to o oad the heavy workloads of those overloaded brokers, and fail to balance the workloads of the overloaded brokers. To overcome the issue, we develop a set of novel load balancing algorithms, namely a similarity-based replication scheme (Sir). The novelty of Sir is that it not only balances the workloads of brokers but also reduces the overall workloads. Based on both simulation and emulation results, the extensive experiments verify that Sir can achieve much better performance than Mis, in terms of 43.10% higher entropy value (i.e., more balanced workloads) and 46.39% lower workloads. |
en |
| dct.language |
en |
|
| ethesis.language.URI |
http://data.hulib.helsinki.fi/id/languages/eng |
|
| ethesis.language |
English |
en |
| ethesis.language |
englanti |
fi |
| ethesis.language |
engelska |
sv |
| ethesis.thesistype |
pro gradu-avhandlingar |
sv |
| ethesis.thesistype |
pro gradu -tutkielmat |
fi |
| ethesis.thesistype |
master's thesis |
en |
| ethesis.thesistype.URI |
http://data.hulib.helsinki.fi/id/thesistypes/mastersthesis |
|
| dct.identifier.urn |
URN:NBN:fi-fe2017112252489 |
|
| dc.type.dcmitype |
Text |
|
