1901 |
After that, we summarized open problems in Peer-to-Peer networks. Specifically, |
After that, we summarized open problems in Peer-to-Peer networks. Specifically, |
1902 |
we divided open problems into three sub-categories: security related problems, |
we divided open problems into three sub-categories: security related problems, |
1903 |
performance related problems and miscellaneous problems. Each of these |
performance related problems and miscellaneous problems. Each of these |
1904 |
sub-categories have number of open problems, where there are no solutions |
sub-categories have number of open problems, in which there are no solutions |
1905 |
yet, or solutions are only partial. Much research work is required to |
yet, or solutions are only partial. Much research work is required to |
1906 |
solve open problems. |
solve open problems. |
1907 |
|
|
1916 |
for identifying data. Second, our Storm design uses Semantic-Free references |
for identifying data. Second, our Storm design uses Semantic-Free references |
1917 |
for locating data in distributed networks. As the authors of \cite{balakrishnan03semanticfree}, |
for locating data in distributed networks. As the authors of \cite{balakrishnan03semanticfree}, |
1918 |
we also observe that tightly structured overlays provide general purpose |
we also observe that tightly structured overlays provide general purpose |
1919 |
interface to next-generation Reference Resolution Services. Second, by using |
interface to next-generation reference resolution services. Second, by using |
1920 |
DOLR method of tightly structured overlay, we can minimize the the lack |
DOLR method of tightly structured overlay, we can minimize the the lack |
1921 |
of locality in tightly structured overlays. Finally, we believe that issues |
of locality in tightly structured overlays. Finally, we believe that issues |
1922 |
related to tightly structured overlays are solved in near future, because of |
related to tightly structured overlays are solved in near future, because of |