Improve Performance of Telecommunication Billing System by Call Graph Partitioning
Date Issued
2016
Date
2016
Author(s)
Lai, Hong-Yi
Abstract
In this thesis, we develop a data distribution policy for a distributed NoSQLbased billing system. We define an optimization problem which is call graph partitioning problem. The objective of the problem is to balance communication while enhancing data locality. We prove that the problem is NP-complete and design a greedy algorithm to partition a call graph. Then we apply the call graph partitioning technique to a distributed NoSQL-based billing system. We improve system performance by balancing communication across servers and enhancing data locality.
Subjects
Graph Partitioning
Call Graph
Balance Communication
Data Locality
Data Distribution Policy
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-105-R02922069-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):a6f70823f3a91730f920a36cb0ad187d