The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The completion times of jobs in a computing cluster may be influenced by a variety of factors including job size and machine processing variability. In this paper, we explore online resource allocation policies which combine size-dependent scheduling with redundant execution and opportunistic checkpointing to minimize the overall job flowtime. We introduce a simplified model for the job service capacity...
Traditional wireless schedulers have been driven by rate-based criteria, e.g., utility maximizing/proportionally fair, and/or queue-based packet schedulers which do not directly reflect the Quality of Experience (QoE) associated with flow-based transactions and services. This paper proposes, a Measurement-Based Delay Optimal (MBDO) scheduler, which optimizes a cost function of the mean flow delays...
Network slicing to enable resource sharing among multiple tenants-network operators and/or services-is considered a key functionality for next generation mobile networks. This paper provides an analysis of a well-known model for resource sharing, the ‘share-constrained proportional allocation’ mechanism, to realize network slicing. This mechanism enables tenants to reap the performance benefits of...
Next generation wireless architectures are expected to enable slices of shared wireless infrastructure which are customized to specific mobile operators/services. Given infrastructure costs and the stochastic nature of mobile services' spatial loads, it is highly desirable to achieve efficient statistical multiplexing amongst network slices. We study a simple dynamic resource sharing policy which...
Wireless channels in millimeter wave based wearable networks are particularly susceptible to environmental blockages and dynamics when there are humans/objects in motion. Such dynamics imply, not only physical layer overheads to discover and track viable transmission paths, but also MAC overheads to keep track of neighboring interferers, perform clustering and enable proper scheduling of transmissions...
Modern broadband wireless networks support application mixes, with different, possibly complex, application/user Quality of Service/Experience (QoS/QoE) metrics. The central problem underlying resource allocation for such systems is realizing QoS/QoE trade-offs given the dynamic loads and capacity variability they would typically see. The paper explores a framework for context-aware scheduling based...
This paper proposes a stochastic geometry framework to study the temporal performance variations experienced by a mobile user in a cellular network. The focus is on the variations of the Signal to Noise Ratio (SNR) and the downlink Shannon rate experienced when the user moves across Poisson cellular network of the Euclidean plane. The motion is the simplest possible i.e., a user moving at a constant...
MmWave based wearable networks will need to function in various environments including possibly high density settings, e.g., train cars. At such densities one might expect challenges in interference management and/or excessive overheads tracking and jointly scheduling interferers. In this paper we use simple stochastic geometric models to examine the characteristics (number and sensitivity to motion)...
State-of-the-art D2D schedulers' performance can be evaluated from at least two different perspectives: the sum throughput and the fraction of satisfied users/applications. In this paper we revisit the performance of such schedulers, e.g., FlashLinQ/ITLinQ, showing they strike particular trade-offs between these two metrics. Our analysis and simulations show that the sum-rate benefits of such schedulers...
An increasing number of real-time applications with compute and/or communication deadlines are being supported on shared infrastructure. Such applications can often tolerate occasional deadline violations without substantially impacting their Quality of Service (QoS). A fundamental problem in such systems is deciding how to allocate shared resources so as to meet applications' QoS requirements. A...
Cloud-based computing infrastructure provides an efficient means to support real-time processing workloads, e.g., virtualized base station processing, and collaborative video conferencing. This paper addresses resource allocation for a computing system with multiple resources supporting heterogeneous soft real-time applications subject to Quality of Service (QoS) constraints on failures to meet processing...
We conducted a subjective study wherein we found that viewers' Quality of Experience (QoE) was strongly correlated with the empirical cumulative distribution function (eCDF) of the predicted video quality. Based on this observation, we propose a rate-adaptation algorithm that can incorporate QoE constraints on the empirical cumulative quality distribution per user. Simulation results show that the...
Cellular systems using Coordinated Multi-Point (CoMP) transmissions leveraging clusters of spatially distributed radio antennas as Virtual Base Stations (VBSs) have the potential to realize overall throughput gains and, perhaps more importantly, can deliver substantial enhancement to poor performing “edge” users. In this paper we propose a novel framework aimed at fully exploiting the potential of...
Large scale Content Delivery Networks (CDNs) are one of the key components of today's information infrastructure. This paper proposes and analyzes a simple stochastic model for a file-server system wherein servers can work together, as a pooled resource, to meet individual user requests. In such systems basic questions include: How and where to replicate files? What is the impact of dynamic service...
We consider the problem of optimizing video delivery for a network supporting video clients streaming stored video. Specifically, we consider the joint optimization of network resource allocation and video quality adaptation. Our objective is to fairly maximize video clients' Quality of Experience (QoE) realizing tradeoffs among the mean quality, temporal variability in quality, and fairness, incorporating...
Newly developed HTTP-based video streaming technology enables flexible rate-adaptation in varying channel conditions. The users' Quality of Experience (QoE) of rate-adaptive HTTP video streams, however, is not well understood. Therefore, designing QoE-optimized rate-adaptive video streaming algorithms remains a challenging task. An important aspect of understanding and modeling QoE is to be able to...
This paper considers the design of cross-layer opportunistic transport for stored video over wireless networks with a slow varying (average) capacity. We focus on two key ideas: (1) scheduling data transmissions when capacity is high; and (2), exploiting knowledge of future capacity variations. The latter is possible when users' mobility is known or predictable, e.g., users riding on public transportation...
Although electric vehicles are attracting increasing interest from consumers and automakers, the disadvantages associated with limited range and the current scarcity of public recharge stations have played a key role in limiting their large scale adoption. In this paper, we explore how information technologies might be used to mitigate ‘range anxiety’ and further strengthen the potential of electric...
Network Utility Maximization (NUM) provides a key conceptual framework to study reward allocation amongst a collection of users/entities in disciplines as diverse as economics, law and engineering. In network engineering, this framework has been particularly insightful towards understanding how Internet protocols allocate bandwidth, and motivated diverse research efforts on distributed mechanisms...
We propose mechanisms to combat the congestion caused by non-homogeneities in the distribution of information, the peers' locations, and the demand for information in a peer-to-peer system for exchanging context. We propose two novel mechanisms for adapting the topology formed by the peers to the underlying traffic: our first mechanism employs virtual locations for the peers while the second modifies...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.