๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Service capacity in vehicular networks: A resource dissemination analysis

โœ Scribed by L. Galluccio; A. Leonardi; A. Matera; S. Palazzo


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
668 KB
Volume
5
Category
Article
ISSN
1570-8705

No coin nor oath required. For personal study only.

โœฆ Synopsis


The support of peer-to-peer (P2P) resource sharing in dynamic scenarios is one of the most challenging research fields for both its expected commercial and technological impact on everyday life. To this purpose, resource sharing within a vehicular network can facilitate an acceleration in the dissemination process and increase the number of nodes in the network which possess a certain resource and can share it with other devices. This performance parameter, denoted as service capacity, has been recently studied in the context of wired P2P networks but its calculation in mobile networks is still an open problem. In this paper, we perform a service capacity analysis in P2P vehicular networks where nodes move according to traffic patterns which consider realistic car interactions such as acceleration, breaking and inter-car minimum safety distance maintenance and, while moving, perform resource dissemination. More specifically, we will present a service capacity analysis which considers the impact of traffic correlation and node density on the number of mobile vehicles in the network possessing a certain resource. Finally, we will also estimate the impact of link errors on the probability that a resource is propagated up to a certain location, in a given time.


๐Ÿ“œ SIMILAR VOLUMES


Modelling and analysis of routing and re
โœ Gรกbor Fodor; Pรฉter Barta; รdรกm Marquetant; Andrรกs Rรกcz; Tamรกs Henk ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 740 KB

In this paper a novel call level model based on the extension of the classical Erlang multi-rate model for broadband integrated services networks is proposed. We use the model to study routing strategies in multi-service networks where service classes with/without QoS guarantees coexist. Examples fo

A middleware service for employing and e
โœ Vassilios M. Stathopoulos; Iakovos S. Venieris ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 527 KB

The first part of this paper introduces the design of a middleware-based service which is valuable for distributed networks for mainly managing their resources. The second part evaluates the performance of a distributed intelligent network (D-IN), which comprises the proposed service together with a

Design and analysis of a merging algorit
โœ Chun-Liang Lee; Yaw-Chung Chen ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB

In this paper, we propose a merging algorithm, which can provide efยฎcient support for multipoint-to-point ABR service in ATM networks. By forwarding the FRM cells belonging to the VC with the largest FRM-cell arrival rate in a merge point, the proposed algorithm can achieve better link utilization t