اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAnalysis of the Cost of Varying Levels of User Perceived Quality for Internet Access
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quality of Service (QoS) metrics deal with network quantities, e.g. latency and loss, whereas Quality of Experience (QoE) provides a proxy metric for end-user experience. Many papers in the literature have proposed mappings between various QoS metrics and QoE. This paper goes further in providing analysis for QoE versus bandwidth cost. We measure QoE using the widely accepted Mean Opinion Score (MOS) rating. Our results naturally show that increasing bandwidth increases MOS. However, we extend this understanding by providing analysis for internet access scenarios, using TCP, and varying the number of TCP sources multiplexed together. For these target scenarios our analysis indicates what MOS increase you get by further expenditure on bandwidth. We anticipate that this will be of considerable value to commercial organizations responsible for bandwidth purchase and allocation.
قيم البحث
اقرأ أيضاً
The cellular technology is mostly an urban technology that has been unable to serve rural areas well. This is because the traditional cellular models are not economical for areas with low user density and lesser revenues. In 5G cellular networks, the
coverage dilemma is likely to remain the same, thus widening the rural-urban digital divide further. It is about time to identify the root cause that has hindered the rural technology growth and analyse the possible options in 5G architecture to address this issue. We advocate that it can only be accomplished in two phases by sequentially addressing economic viability followed by performance progression. We deliberate how various works in literature focus on the later stage of this two-phase problem and are not feasible to implement in the first place. We propose the concept of TV band white space (TVWS) dovetailed with 5G infrastructure for rural coverage and show that it can yield cost-effectiveness from a service provider perspective.
User privacy concerns are widely regarded as a key obstacle to the success of modern smart cyber-physical systems. In this paper, we analyse, through an example, some of the requirements that future data collection architectures of these systems shou
ld implement to provide effective privacy protection for users. Then, we give an example of how these requirements can be implemented in a smart home scenario. Our example architecture allows the user to balance the privacy risks with the potential benefits and take a practical decision determining the extent of the sharing. Based on this example architecture, we identify a number of challenges that must be addressed by future data processing systems in order to achieve effective privacy management for smart cyber-physical systems.
Decades of experience have shown that there is no single one-size-fits-all solution that can be used to provision Internet globally and that invariably there are tradeoffs in the design of Internet. Despite the best efforts of networking researchers
and practitioners, an ideal Internet experience is inaccessible to an overwhelming majority of people the world over, mainly due to the lack of cost efficient ways of provisioning high-performance global Internet. In this paper, we argue that instead of an exclusive focus on a utopian goal of universally accessible ideal networking (in which we have high throughput and quality of service as well as low latency and congestion), we should consider providing approximate networking through the adoption of context-appropriate tradeoffs. Approximate networking can be used to implement a pragmatic tiered global access to the Internet for all (GAIA) system in which different users the world over have different context-appropriate (but still contextually functional) Internet experience.
We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless channel. F
or an infrastructure mode of traffic with a centralized scheduler, we are interested in the long time average throughput achievable for the real time traffic. In [1], the authors have stud- ied the feasible throughput vectors by identifying the necessary and sufficient conditions using work load characterization. In our work, we provide a characterization of the feasible throughput vectors using the notion of the rate region. We then discuss an extension to the network model studied in [1] by allowing multiple access during contention and propose an enhancement to the rate region of the wireless network. We characterize the feasible throughput vectors with the multiple access technique and study throughput optimal and utility maximizing strategies for the network scenario. Using simulations, we evaluate the performance of the proposed strategy and discuss its advantages.
In this paper, we investigate cost-aware joint learning and optimization for multi-channel opportunistic spectrum access in a cognitive radio system. We investigate a discrete time model where the time axis is partitioned into frames. Each frame cons
ists of a sensing phase, followed by a transmission phase. During the sensing phase, the user is able to sense a subset of channels sequentially before it decides to use one of them in the following transmission phase. We assume the channel states alternate between busy and idle according to independent Bernoulli random processes from frame to frame. To capture the inherent uncertainty in channel sensing, we assume the reward of each transmission when the channel is idle is a random variable. We also associate random costs with sensing and transmission actions. Our objective is to understand how the costs and reward of the actions would affect the optimal behavior of the user in both offline and online settings, and design the corresponding opportunistic spectrum access strategies to maximize the expected cumulative net reward (i.e., reward-minus-cost). We start with an offline setting where the statistics of the channel status, costs and reward are known beforehand. We show that the the optimal policy exhibits a recursive double threshold structure, and the user needs to compare the channel statistics with those thresholds sequentially in order to decide its actions. With such insights, we then study the online setting, where the statistical information of the channels, costs and reward are unknown a priori. We judiciously balance exploration and exploitation, and show that the cumulative regret scales in O(log T). We also establish a matched lower bound, which implies that our online algorithm is order-optimal. Simulation results corroborate our theoretical analysis.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
