28,829 research outputs found
Throughput Optimal On-Line Algorithms for Advanced Resource Reservation in Ultra High-Speed Networks
Advanced channel reservation is emerging as an important feature of ultra
high-speed networks requiring the transfer of large files. Applications include
scientific data transfers and database backup. In this paper, we present two
new, on-line algorithms for advanced reservation, called BatchAll and BatchLim,
that are guaranteed to achieve optimal throughput performance, based on
multi-commodity flow arguments. Both algorithms are shown to have
polynomial-time complexity and provable bounds on the maximum delay for
1+epsilon bandwidth augmented networks. The BatchLim algorithm returns the
completion time of a connection immediately as a request is placed, but at the
expense of a slightly looser competitive ratio than that of BatchAll. We also
present a simple approach that limits the number of parallel paths used by the
algorithms while provably bounding the maximum reduction factor in the
transmission throughput. We show that, although the number of different paths
can be exponentially large, the actual number of paths needed to approximate
the flow is quite small and proportional to the number of edges in the network.
Simulations for a number of topologies show that, in practice, 3 to 5 parallel
paths are sufficient to achieve close to optimal performance. The performance
of the competitive algorithms are also compared to a greedy benchmark, both
through analysis and simulation.Comment: 9 pages, 8 figure
A Stochastic Model for Car-Sharing Systems
Vehicle-sharing systems are becoming important for urban transportation. In
these systems, users arrive at a station, pick up a vehicle, use it for a while
and then return it to another station of their choice. Depending on the type of
system, there might be a possibility to book vehicles before picking-up and/or
a parking space at the chosen arrival station. Each station has a finite
capacity and cannot host more vehicles and reserved parking spaces than its
capacity. We propose a stochastic model for an homogeneous car-sharing system
with possibility to reserve a parking space at the arrival station when
picking-up a car. We compute the performance of the system and the optimal
fleet size according to a specific metric. It differs from a similar model for
bike-sharing systems because of reservation that induces complexity, especially
when traffic increases
Determination of the bundle price for digital information goods
The fast emergence of Internet as a media to distribute digital information goods created many new opportunities for the packaging and pricing of these goods. The pricing of information goods introduces a challenge since the cost structure of information goods differs from that of conventional physical goods in that they can be costly to introduce but are relatively cheap to reproduce. The bundling strategy for digital information goods helps producers to extract more value from customers and can result in cost savings due to the presence of economies of scale. This study aims to determine the optimum price a producer of digital information goods has to charge for a bundle in order to maximize his gross margin. The bundle pricing model is constructed for both uniform and exponential distributions of the fraction of information goods in the bundle that has positive value for the customers
Coalition Formation and Combinatorial Auctions; Applications to Self-organization and Self-management in Utility Computing
In this paper we propose a two-stage protocol for resource management in a
hierarchically organized cloud. The first stage exploits spatial locality for
the formation of coalitions of supply agents; the second stage, a combinatorial
auction, is based on a modified proxy-based clock algorithm and has two phases,
a clock phase and a proxy phase. The clock phase supports price discovery; in
the second phase a proxy conducts multiple rounds of a combinatorial auction
for the package of services requested by each client. The protocol strikes a
balance between low-cost services for cloud clients and a decent profit for the
service providers. We also report the results of an empirical investigation of
the combinatorial auction stage of the protocol.Comment: 14 page
- …