| 000 | 02001cam a2200325 a 4500 | ||
|---|---|---|---|
| 003 | EG-GiCUC | ||
| 005 | 20250223031137.0 | ||
| 008 | 150207s2014 ua d f m 000 0 eng d | ||
| 040 |
_aEG-GiCUC _beng _cEG-GiCUC |
||
| 041 | 0 | _aeng | |
| 049 | _aDeposite | ||
| 097 | _aM.Sc | ||
| 099 | _aCai01.20.02.M.Sc.2014.Fo.O | ||
| 100 | 0 | _aFouad Mohamed Ali | |
| 245 | 1 | 0 |
_aOptimization of peer- to- peer Network overlay / _cFouad Mohamed Ali ; Supervised Mohammed Adel Elbeltagy |
| 246 | 1 | 5 | _aامثلية الشبكات الندية المفروضه |
| 260 |
_aCairo : _bFouad Mohamed Ali , _c2014 |
||
| 300 |
_a95 Leaves : _bcharts ; _c30cm |
||
| 502 | _aThesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Operations Research and Decision Support | ||
| 520 | _aIt is well know that Peer- to- Peer (P2P) systems are advantageous in that the computational and bandwidth resources are distributed in a fashion that is more efficient as compared to systems that have central server and a multitude of clients. In the context of live streaming, there is a challenge in building systems that are both predictable and that realize minimum bandwidth load on the streaming server, i.e. maximum savings. The challenge is addressed by introducing a decentralized approach for peer placement and connectivity that are described as a probabilistic model. This approach can achieve bandwidth savings closely approaching what can be achieved in a centralized system with global knowledge. Peer placement is done by a decentralized overlay construction algorithm that manages to make use of an optimally generated centralized overlay construction algorithm | ||
| 530 | _aIssued also as CD | ||
| 653 | 4 | _aNetwork overlays | |
| 653 | 4 | _aOptimization | |
| 653 | 4 | _aPeer- to- peer Network | |
| 700 | 0 |
_aMohammed Adel Elbeltagy , _eSupervisor |
|
| 856 | _uhttp://172.23.153.220/th.pdf | ||
| 905 |
_aNazla _eRevisor |
||
| 905 |
_aSamia _eCataloger |
||
| 942 |
_2ddc _cTH |
||
| 999 |
_c49262 _d49262 |
||