614 |
how well distributed resource discovery algorithms can be made to endurate hostile attacks |
how well distributed resource discovery algorithms can be made to endurate hostile attacks |
615 |
in Peer-to-Peer enviroment. |
in Peer-to-Peer enviroment. |
616 |
|
|
|
Our goal is to build a Peer-to-Peer system that allows one to perform a *global* |
|
|
data lookups and fetch a block (i.e., xanalogical media) if *anybody* has published it in |
|
|
the Internet. |
|
617 |
|
|
618 |
|
- is it possible to achieve logarithmical efficiency with Gnutella-like overlay (extreme ad hoc) ? |
619 |
|
- is it possible to improve the adaptivity of tightly structured systems without losing performance |
620 |
|
/ increasing node's load (gnutella's ad hoc) |
621 |
|
- is it possible to develop efficient algorithms which are resilient in adverse conditions ? |
622 |
|
- is it possible to develop algorihtms which provide O(1) efficiency and which are |
623 |
|
resilient in adverse conditions ? |
624 |
|
- is it possible to develop working security infrastructure in a P2P environment ? |
625 |
|
- is it possible to identify entity trustworthy in P2P environement (i.e. the Sybil attack) |
626 |
|
- is ideology behind tightly structured systems suitable for ad hoc enviroment (deterministic mapping |
627 |
|
(of overlay and items) ? |
628 |
|
|
629 |
Research schedule |
Research schedule |
630 |
----------------- |
----------------- |