What
is it?
The Socialized.Net is a peer-to-peer
network based with socialized peers. Routing in the network is
thus based on knowledge about other node's interests, making it work
much in the same way as humans cooperate. When I want to get
information about used cars, I'm more likely to ask my car-interested
buddy than starting on the first page in the phone-book...
The Socialized.Net is designed to work in both disconnected,
weakly-connected (ad-hoc) and fully connected modes. The
idea is that many of the future networking capable devices will be both
very mobile. If we carry computers around, they should at least
be able to help navigate the environment they are in. For
example, travellers on a train should be able to find out about the
train's schedule and progress. This can easily be done locally on
the train, thus using local communication as opposed to global
communication (through the Internet). So, a traveller might ask
"does anyone in this train know our schedule?", and the train (or
another traveller) can give a reply.
The Socialized.Net is a PhD project, and is as such a work in progress
and merely an experiment.
Papers
Published
Social Peer-to-Peer for Social People
With increasing amounts of information digitally available, computerized searching has become a commodity. Typical computer search services work by creating a searchable, central index equivalent to the Yellow Pages. Humans will often use such central indexes, but we are also likely to exploit our social networks. We can directly contact someone we believe has knowledge about the resources we seek. This social network is built and maintained by socializing with and talking about other people.
In this paper we present how we use a social Peer-to-Peer search infrastructure, The Socialized.Net, to give computers a rudimentary social network. This allows applications to work in a more humanly natural way, seamlessly integrating centralized services and distributed, direct contact. Specifically, we demonstrate applications within Instant Messaging, Shared bookmarks and Distributed BitTorrent key files and how The Socialized.Net makes the creation of such applications much easier than other currently used approaches.
Accepted for publication at
The International Conference on Internet technologies & applications - Wrexham, September 2005.
Improving semantic routing efficiency
Peer-to-Peer networks allow users to globally share resources directly
with each other. As these users are from all over the world, they
will utilize the network differently. For example, they might use
their native tongue to describe resources. These differences makes
it a difficult task to provide efficient and robust search
capabilities within fully distributed P2P networks.
In this paper, we show how our P2P search infrastructure The
Socialized.Net give nodes a rudimentary social network. This
allows a close grouping of nodes
based on interest, backgrounds and agendas. We discuss how the social
network improves network performance, network integrity and search
relevance.
Accepted for publication at the
Hot P2P topics workshop at
The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services - San Diego, July 2005.
Searching variably connected networks
Peer-to-Peer networks are gaining popularity through file-sharing
communities. Most P2P networks demand a certain stability from it's
nodes in order to function satisfactory. A variably connected
P2P network, however, is a network where the connectivity of nodes
might vary greatly over time. The nodes can be in different
connection states, such as connected to the Internet or moving between
networks as well as ad-hoc or offline operation.
Creating a search infrastructure for variably connected P2P networks
is challenging, as it will be very hard to keep updated shared state
(such as distributed indexes) within the network. Both scalability
and stability must be addressed; scalability for large scale overlay
networks and stability in order to handle the large fluctuations in
the network.
Routing queries in Peer-to-Peer networks based on semantic information
looks very promising for solving scalability issues. This paper
discusses how a Semantic Query Routing protocol can be extended to
solve stability issues and thus better support both mobility and
ad-hoc operations. We will make an implementation in the Seers
experimental P2P search infrastructure to verify the new
protocol.
Published in
The 2004 International MultiConference in Computer Science & Computer Engineering - Las Vegas, June 2004
Not published
(submitted or
drafts)
There are currently no papers in this catecory.
Presentations
Files
During the project, some files are
created. Some of these are patches for other programs, some are
downloadable files for the project itself.
Files section
Related
work
NeuroGrid
- Semantic routing in Internet overlay networks. Very exciting...
Chord - Distributed
Hash tables for p2p searching.
Contact me!
