A self stabilizing overlay networking algorithm using geographical segments for linearization in distributed computing /
This research proposed a new algorithm for building overlay distributed computing network by using geographical position of the nodes as consideration when building its topology. This research is done to prove the scalability of the proposed algorithm, to analyze the limitation of simulating the alg...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | أطروحة |
| اللغة: | English |
| منشور في: |
Kuala Lumpur :
Kulliyyah of Information and Communication Technology, International Islamic University Malaysia,
2017
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://studentrepo.iium.edu.my/handle/123456789/5414 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| LEADER | 028810000a22002890004500 | ||
|---|---|---|---|
| 008 | 170921s2017 my a f m 000 0 eng d | ||
| 040 | |a UIAM |b eng |e rda | ||
| 041 | |a eng | ||
| 043 | |a a-my--- | ||
| 050 | 0 | 0 | |a QA76.9.S54 |
| 100 | 0 | |a Abdulfattah Muhyiddeen bin Muhamad Ridzuan, |e author | |
| 245 | 1 | 2 | |a A self stabilizing overlay networking algorithm using geographical segments for linearization in distributed computing / |c by Abdulfattah Muhyiddeen bin Muhamad Ridzuan |
| 264 | 1 | |a Kuala Lumpur : |b Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, |c 2017 | |
| 300 | |a xi, 38 leaves : |b illustrations ; |c 30cm. | ||
| 336 | |2 rdacontent |a text | ||
| 502 | |a Thesis (MCS)--International Islamic University Malaysia, 2017. | ||
| 504 | |a Includes bibliographical references (leaves 35-38). | ||
| 520 | |a This research proposed a new algorithm for building overlay distributed computing network by using geographical position of the nodes as consideration when building its topology. This research is done to prove the scalability of the proposed algorithm, to analyze the limitation of simulating the algorithm in terms of resources (memory) usage and to evaluate the degree of decentralization of the network which implementing the algorithm. A computer simulation is programmed to run and test the simulated network by analyzing how number of nodes affect the linearization process (in terms of number of cycles). The simulation also is used to analyze how many messages are passed during the linearization process to show limitations of simulation process. And lastly, the simulation also is used to calculate the degree of decentralization of the network. From the results, it can be concluded that the algorithm is scalable regardless the number of nodes. From another test, it was found that as number of nodes increases, number of messages passed among them collectively across the network increase exponentially which make it almost impossible to run the simulation of millions of nodes on a single machine. From the test also, the behavior of the network can be observed as number of supernodes increase, the network linearizes faster but approaching a limit. | ||
| 596 | |a 1 | ||
| 655 | 7 | |a Theses, IIUM local | |
| 690 | |a Dissertations, Academic |x Department of Computer Science |z IIUM | ||
| 710 | 2 | |a International Islamic University Malaysia. |b Department of Computer Science | |
| 856 | 4 | |u http://studentrepo.iium.edu.my/handle/123456789/5414 | |
| 900 | |a sbh-aaz-ls | ||
| 999 | |c 439871 |d 471151 | ||
| 952 | |0 0 |6 T QA 000076.9 S54 A1352S 2017 |7 0 |8 THESES |9 763355 |a IIUM |b IIUM |c MULTIMEDIA |g 0.00 |o t QA 76.9 S54 A1352S 2017 |p 11100379016 |r 2018-10-02 |t 1 |v 0.00 |y THESIS | ||
| 952 | |0 0 |6 TS CDF QA 76.9 S54 A1352S 2017 |7 0 |8 THESES |9 856390 |a IIUM |b IIUM |c MULTIMEDIA |g 0.00 |o ts cdf QA 76.9 S54 A1352S 2017 |p 00000905065 |r 2018-10-02 |t 1 |v 0.00 |y THESISDIG | ||