Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
International Journal of Approximate Reasoning
Synapse: a scalable protocol for interconnecting heterogeneous overlay networks
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
| Hi-index | 0.02 |
Car sharing and car pooling have proven to be an effective solution to reduce the amount of running vehicles by increasing the number of passengers per car amongst medium/big communities, like schools or enterprises. However, the success of such practice relies on the ability of the community to effectively share and retrieve information about travelers and itineraries. Structured overlay networks, such as Chord, have emerged recently as a flexible solution to handle large amounts of data without the use of high-end servers, in a decentralized manner. In this paper we present CarPal, a proof-of-concept for a mobility sharing application that leverages a Distributed Hash Table to allow a community of people to spontaneously share trip information, without the costs of a centralized structure. Moreover the peer-to-peer architecture allows for deployment on portable devices, and opens new scenarios in which trips and sharing requests can be updated in real time. By using an already developed original protocol that allows to interconnect different overlays/communities, the success rate (number of shared rides) can be boosted up, thus increasing the effectiveness of our solution. Simulations results are shown to give a possible estimate of this effectiveness.