5,148 research outputs found
Extended Equal Service and Differentiated Service Models for Peer-to-Peer File Sharing
Peer-to-Peer (P2P) systems have proved to be the most effective and popular
file sharing applications in recent years. Previous studies mainly focus on the
equal service and the differentiated service strategies when peers have no
initial data before their download. In an upload-constrained P2P file sharing
system, we model both the equal service process and the differentiated service
process when peers' initial data distribution satisfies some special
conditions, and also show how to minimize the time to get the file to any
number of peers. The proposed models can reveal the intrinsic relations among
the initial data amount, the size of peer set and the minimum last finish time.
By using the models, we can also provide arbitrary degree of differentiated
service to a certain number of peers. We believe that our analysis process and
achieved theoretical results could provide fundamental insights into studies on
bandwidth allocation and data scheduling, and can give helpful reference both
for improving system performance and building effective incentive mechanism in
P2P file sharing systems
Mobility: a double-edged sword for HSPA networks
This paper presents an empirical study on the performance of mobile High Speed Packet Access (HSPA, a 3.5G cellular standard) networks in Hong Kong via extensive field tests. Our study, from the viewpoint of end users, covers virtually all possible mobile scenarios in urban areas, including subways, trains, off-shore ferries and city buses. We have confirmed that mobility has largely negative impacts on the performance of HSPA networks, as fast-changing wireless environment causes serious service deterioration or even interruption. Meanwhile our field experiment results have shown unexpected new findings and thereby exposed new features of the mobile HSPA networks, which contradict commonly held views. We surprisingly find out that mobility can improve fairness of bandwidth sharing among users and traffic flows. Also the triggering and final results of handoffs in mobile HSPA networks are unpredictable and often inappropriate, thus calling for fast reacting fallover mechanisms. We have conducted in-depth research to furnish detailed analysis and explanations to what we have observed. We conclude that mobility is a double-edged sword for HSPA networks. To the best of our knowledge, this is the first public report on a large scale empirical study on the performance of commercial mobile HSPA networks
A Utility Proportional Fairness Radio Resource Block Allocation in Cellular Networks
This paper presents a radio resource block allocation optimization problem
for cellular communications systems with users running delay-tolerant and
real-time applications, generating elastic and inelastic traffic on the network
and being modelled as logarithmic and sigmoidal utilities respectively. The
optimization is cast under a utility proportional fairness framework aiming at
maximizing the cellular systems utility whilst allocating users the resource
blocks with an eye on application quality of service requirements and on the
procedural temporal and computational efficiency. Ultimately, the sensitivity
of the proposed modus operandi to the resource variations is investigated
Trade & Cap: A Customer-Managed, Market-Based System for Trading Bandwidth Allowances at a Shared Link
We propose Trade & Cap (T&C), an economics-inspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared resource (e.g., a DSLAM link) so as to converge on what they perceive to be an equitable allocation, while ensuring efficient resource utilization. Under T&C, rather than acting as an arbiter, an Internet Service Provider (ISP) acts as an enforcer of what the community of rational users sharing the resource decides is a fair allocation of that resource. Our T&C mechanism proceeds in two phases. In the first, software agents acting on behalf of users engage in a strategic trading game in which each user agent selfishly chooses bandwidth slots to reserve in support of primary, interactive network usage activities. In the second phase, each user is allowed to acquire additional bandwidth slots in support of presumed open-ended need for fluid bandwidth, catering to secondary applications. The acquisition of this fluid bandwidth is subject to the remaining "buying power" of each user and by prevalent "market prices" â both of which are determined by the results of the trading phase and a desirable aggregate cap on link utilization. We present analytical results that establish the underpinnings of our T&C mechanism, including game-theoretic results pertaining to the trading phase, and pricing of fluid bandwidth allocation pertaining to the capping phase. Using real network traces, we present extensive experimental results that demonstrate the benefits of our scheme, which we also show to be practical by highlighting the salient features of an efficient implementation architecture.National Science Foundation (CCF-0820138, CSR-0720604, EFRI-0735974, CNS-0524477, and CNS-0520166); Universidad Pontificia Bolivariana and COLCIENCIASâInstituto Colombiano para el Desarrollo de la Ciencia y la TecnologĂa âFrancisco Jose Ì de Caldasâ
Crowdsourced Live Streaming over the Cloud
Empowered by today's rich tools for media generation and distribution, and
the convenient Internet access, crowdsourced streaming generalizes the
single-source streaming paradigm by including massive contributors for a video
channel. It calls a joint optimization along the path from crowdsourcers,
through streaming servers, to the end-users to minimize the overall latency.
The dynamics of the video sources, together with the globalized request demands
and the high computation demand from each sourcer, make crowdsourced live
streaming challenging even with powerful support from modern cloud computing.
In this paper, we present a generic framework that facilitates a cost-effective
cloud service for crowdsourced live streaming. Through adaptively leasing, the
cloud servers can be provisioned in a fine granularity to accommodate
geo-distributed video crowdsourcers. We present an optimal solution to deal
with service migration among cloud instances of diverse lease prices. It also
addresses the location impact to the streaming quality. To understand the
performance of the proposed strategies in the realworld, we have built a
prototype system running over the planetlab and the Amazon/Microsoft Cloud. Our
extensive experiments demonstrate that the effectiveness of our solution in
terms of deployment cost and streaming quality
- âŠ