Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
An improved spectral graph partitioning algorithm for mapping parallel computations
SIAM Journal on Scientific Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Geometric mesh partitioning: implementation and experiments
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A stochastic process on the hypercube with applications to peer-to-peer networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Challenge: peers on wheels - a road to new traffic information systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
ACM Transactions on Algorithms (TALG)
Relays, base stations, and meshes: enhancing mobile networks with infrastructure
Proceedings of the 14th ACM international conference on Mobile computing and networking
PeerTIS: a peer-to-peer traffic information system
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
A fundamental scalability criterion for data aggregation in VANETs
Proceedings of the 15th annual international conference on Mobile computing and networking
A survey of urban vehicular sensing platforms
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the feasibility of UMTS-based Traffic Information Systems
Ad Hoc Networks
| Hi-index | 0.00 |
Cooperative traffic information systems support the driver of a car in selecting a route, based on traffic information collected by other cars. We propose to use a peer-to-peer network based on Internet access via cellular networks to distribute traffic information between the participants of such a system. This approach avoids the well-known limitations of VANET-based communication. Since the data maintained in a cooperative traffic information system has a very specific structure, it is particularly profitable-in terms of bandwidth consumption and latency-to tailor the system to this specific application domain instead of re-using generic peer-to-peer approaches. This realization led us to the development of GraphTIS-a peer-to-peer network specifically designed to manage traffic information. In this paper, we derive, step-by-step, the core mechanisms of GraphTIS, starting with a standard peer-to-peer system, outlining a first solution-named PeerTIS-which is based on a modification of this standard DHT, and then presenting GraphTIS, a novel peer-to-peer system that has been specifically designed to support traffic information systems.