Searched for: faculty%3A%22Electrical%255C%252BEngineering%252C%255C%252BMathematics%255C%252Band%255C%252BComputer%255C%252BScience%22
(1 - 4 of 4)
document
Stokkink, Q.A. (author)
There are two key components for high throughput distributed anonymizing applications. The first key component is overhead due to message complexity of the utilized algorithms. The second key component is an nonscalable architecture to deal with this high throughput. These issues are compounded by the need for anonymization. Using a state of the...
master thesis 2017
document
Norberhuis, S.D. (author)
Peer-to-peer networks are often large, collaborative networks where peers can join openly. The essence of a collaborative, distributed system is that every node performs tasks for other nodes. The peers often help in singular interactions and without direct reciprocity. Malicious peers can abuse and freeride the public goods. The network without...
master thesis 2015
document
Plak, R.S. (author)
Throughout the years the Internet became of indispensable value to social, economic and political life. Despite this, the Internet in all its forms and protocols has proven to be extremely sensitive to manipulation by forces in control of the infrastructure of the Internet. Along with the growth of The Internet came the growth of censorship and...
master thesis 2014
document
Logiotatidis, G. (author)
Peer-to-peer networks rely on gossip algorithms to spread information about the peer activity and the network status. State-of-the-art gossip algorithms are not sufficient to spread the information widely, as the size and the complexity of the unmanaged networks grow. They suffer from high bandwidth utilization and lack mechanisms to verify the...
master thesis 2010
Searched for: faculty%3A%22Electrical%255C%252BEngineering%252C%255C%252BMathematics%255C%252Band%255C%252BComputer%255C%252BScience%22
(1 - 4 of 4)