768 |
Tomorrow's computer environment will involve vast, constant media downloads. ZigZag structure offers a scalable, rational system of registration and storage which can handle this very cleanly. |
Tomorrow's computer environment will involve vast, constant media downloads. ZigZag structure offers a scalable, rational system of registration and storage which can handle this very cleanly. |
769 |
3. A new form of SPATIAL PROGRAMMING, table-driven in zzspace, may simplify programming and computer environments in general. |
3. A new form of SPATIAL PROGRAMMING, table-driven in zzspace, may simplify programming and computer environments in general. |
770 |
|
|
771 |
5. Problmes related to P2P |
5. Problems related to P2P |
772 |
|
|
773 |
5.1. Misc |
5.1. Misc |
774 |
-Could we use SDSI/SPKI in our system (it's hierarchical), like in ConChord \cite{ajmani02conchord} |
-Could we use SDSI/SPKI in our system (it's hierarchical), like in ConChord \cite{ajmani02conchord} |
777 |
-in our model: trust = trust no one |
-in our model: trust = trust no one |
778 |
-give a brief explanation of current techiques in accountability and trust |
-give a brief explanation of current techiques in accountability and trust |
779 |
|
|
780 |
Tuomas' example scenario (in finnish): |
Tuomas' example scenario #1(in finnish): |
781 |
|
|
782 |
jos joku sanoo, ett? urn-5 foo on blokeissa X |
jos joku sanoo, ett? urn-5 foo on blokeissa X |
783 |
ja j?tt?? blokit Y pois |
ja j?tt?? blokit Y pois |
789 |
floodaamalla indeksi |
floodaamalla indeksi |
790 |
mutta sitten poistamalla ne serverit |
mutta sitten poistamalla ne serverit |
791 |
|
|
792 |
What will happen if, jyu's network connection is broken ? Inside jyu, how do we will self-organise ? |
Tuomas' example scenario #2: |
793 |
|
'What will happen if, jyu's network connection is broken ? Inside jyu network, how do we/system will self-organise ?' |
794 |
|
|
795 |
Half-life phenomenon \cite{libennowell01observations} |
Half-life phenomenon \cite{libennowell01observations} |
796 |
Current decentralized, but structured \cite{chord, can, pastry, Tapestry etc.) ignores the fact |
Current decentralized, but structured \cite{chord, can, pastry, Tapestry etc.) ignores the fact |
814 |
underlying network properties |
underlying network properties |
815 |
|
|
816 |
Security issues related to p2p, create by Ross Lee Graham: |
Security issues related to p2p, create by Ross Lee Graham: |
817 |
http://www.ida.liu.se/~rosgr/p2psecurity.html |
http://www.ida.liu.se/~rosgr/p2psecurity.html |
818 |
|
|
819 |
|
Principles on scalable search in decentralized, and unstructured networks \cite{lv02searchreplication}: |
820 |
|
1) system must support adaptive termination |
821 |
|
2) message duplication should be minimized |
822 |
|
3) each additional step during search should not significantly increase the number of nodes visited |
823 |
|
|
824 |
|
Main problems in different approaches (own conclusions, based on research efforts): |
825 |
|
1) Decentralized, but structured |
826 |
|
-make routing/system more flexible againts adversial attacks |
827 |
|
-e.g. -there is a single point of routing failure in these approaches (h hops, little amount f of system are adversial) |
828 |
|
-make searching/query model more flexible (keyword searching) |
829 |
|
-use keywords/range searches instead of exact keys |
830 |
|
proposal for range searches: Scalable, Efficient Range Queries for Grid Information Services \cite{andrzejak02rangequeries} |
831 |
|
|
832 |
|
2) Decentralized, but unstructured |
833 |
|
-make routing more scalable: reach more nodes, create less traffic |
834 |
|
-remember mention: when people talk about Gnutella's scalability issues |
835 |
|
they jumble apples and oranges: *Gnutella* itself is scalable, but query model |
836 |
|
is not scalable, since searching creates a lot of traffic! |
837 |
|
|
838 |
|
3) Centralized |
839 |
|
-no recent research efforts/no interests |
840 |
|
-not suitable for real p2p, as Napster case showed |
841 |
|
|
842 |
5.2. Open Problems in p2p data-sharing \cite{daswani03openproblems} |
5.2. Open Problems in p2p data-sharing \cite{daswani03openproblems} |
843 |
|
|