We consider the problem of scheduling real-time traffic with hard deadlines in a wireless ad hoc network. In contrast to existing policies that merely ensure minimal timely throughput, our design goal is provide guarantees on both throughput and data freshness terms age-of-information (AoI), which newly proposed metric captures "age" most recently received information at destination link. The main idea introduce AoI as one driving factors making decisions. first prove policy...

With the advent of Network Function Virtualization (NFV), Physical Functions (PNFs) are gradually being replaced by Virtual (VNFs) that hosted on general purpose servers. Depending call flows for specific services, packets need to pass through an ordered set network functions (physical or virtual) called Service Chains (SFC) before reaching destination. Conceivably next few years during this transition, these networks would have a mix PNFs and VNFs, which brings interesting problems studied...

The Age-of-Information is an important metric for investigating the timeliness performance in information-update systems. In this paper, we study AoI minimization problem under a new Pull model with replication schemes, where user proactively sends replicated request to multiple servers “pull” information of interest. Interestingly, find that model, schemes capture novel tradeoff between different values across (due random updating processes) and response times servers, which can be...

Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these are not well-suited for time-varying environments (i.e., serving real-time traffic under channel conditions wireless networks) two reasons: (1) the mixing time of underlying CSMA Markov Chain grows with size network, which, large networks, generates unacceptable...

It is well-known that maximum weight scheduling, with link weights which are either functions of queue lengths or the ages Head-of-Line (HoL) packets in each queue, maximizes throughput region wireless networks persistent flows. In particular, only flows, it does not matter for optimality whether one uses HoL as weights. this paper, we show following interesting result: when some flows network dynamic (i.e., they arrive and depart from persistent), then HoL-age-based scheduling algorithms...

Motivated by the regular service requirements of video applications for improving Quality-of-Experience (QoE) users, we consider design scheduling strategies in multi-hop wireless networks that not only maximize system throughput but also provide inter-service times all links. Since regularity links is related to higher-order statistics arrival process and policy operation, it highly challenging characterize analyze directly. We overcome this obstacle introducing a new quantity, namely...

The Age-of-Information (AoI) has recently been proposed as an important metric for investigating the timeliness performance in information-update systems.Prior studies on AoI optimization often consider a Push model, which is concerned about when and how to "push" (i.e., generate transmit) updated information user.In stark contrast, this paper we introduce new Pull more relevant certain applications (such real-time stock quotes service), where user sends requests servers proactively "pull"...

Motivated by the recent trend of integrating artificial intelligence into Internet-of-Things (IoT), we consider problem scheduling packets from multiple sensing sources to a central controller over wireless network. Here, different have values or degrees importance for intelligent decision making. In such setup, it is critical provide timely and valuable information controller. this paper, develop parameterized maximum-weight type policy that combines both AoI metrics Upper Confidence Bound...

In this paper, we consider a discrete-time information-update system, where service provider can proactively retrieve information from the source to update its data and users query at provider. One example is crowdsensing-based applications. order keep satisfied, application desires provide with fresh data, freshness measured by Age-of-Information (AoI). However, maintaining requires database frequently, which incurs an cost (e.g., incentive payment). Hence, there exists natural tradeoff...

We consider the design of throughput-optimal scheduling policies in multi-hop wireless networks that also possess good mean delay performance and provide regular service for all links -- critical metrics real-time applications. To end, we study a parametric class maximum-weight type with parameter α ≥ 0, called Regular Service Guarantee (RSG) Algorithm, where each link weight consists its own queue-length counter tracks time since last service. This policy has been shown to be more as...

Round robin and its variants are well known scheduling policies that popular in wireline networks due to their throughput optimality, delay insensitivity file size distributions short-term fairness. The latter two properties also extremely important for emerging wireless applications, such as Internet of Things cyber-physical systems. However, there is no direct analog round with all the desirable networks, where interference channel fading predominant. main reason fact it very difficult...

Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these are not well-suited for serving real-time traffic under time-varying channel conditions two reasons: (1) the mixing time of underlying CSMA Markov Chain grows with size network, which, large networks, generates unacceptable delay deadline-constrained traffic;...

The proliferation of smart mobile devices has spurred an explosive growth crowd-learning services, where service providers rely on the user community to voluntarily collect, report, and share real-time information for a collection scattered points interest (PoI). A critical factor affecting future large-scale adoption such applications is freshness crowd-learned information, which can be measured by metric termed "age-of-information" (AoI). However, we show that AoI could arbitrarily bad...

In this paper, we study the design of joint flow rate control and scheduling policies in multi-hop wireless networks for achieving maximum network utility with provably optimal convergence speed. Fast is especially important which are dominated by dynamics incoming outgoing flows as well time sensitive applications. Yet, fast converging complicated by: (i) interference-constrained communication capabilities, (ii) finite set transmission rates to select from due operational physical-layer...

In this paper, we study the design of joint flow-rate control and scheduling policies in multihop wireless networks for achieving maximum network utility with provably optimal convergence speed. Fast is especially important that are dominated by dynamics incoming outgoing flows as well time-sensitive applications. Yet, fast converging complicated by: 1) interference-constrained communication capabilities, 2) finite set transmission rates to select from due operational physical-layer...

Unmanned Aerial Vehicle (UAV) Networks have recently attracted great attention as being able to provide convenient and fast wireless connections. One central question is how allocate a limited number of UAVs services across large regions, where each region has dynamic arriving flows depart from the system once they receive desired amount service (referred flow-level model). In this article, we propose MaxWeight-type scheduling algorithm taking into account sharp dynamics that efficiently...

The proliferation of smart mobile devices has spurred an explosive growth crowd-learning services, where service providers rely on the user community to voluntarily collect, report, and share real-time information for a collection scattered points interest (PoI). A critical factor affecting future large-scale adoption such applications is freshness crowd-learned information, which can be measured by metric termed "age-of-information" (AoI). However, we show that AoI could arbitrarily bad...

We consider the design of throughput-optimal scheduling policies in multihop wireless networks that also possess good mean delay performance and provide regular service for all links-critical metrics real-time applications. To end, we study a parametric class maximum-weight-type policies, called Regular Service Guarantee (RSG) Algorithm, where each link weight consists its own queue length counter tracks time since last service, namely Time-Since-Last-Service (TSLS). The RSG Algorithm not...

Multi-user panoramic video streaming demands 4~6× bandwidth of a regular with the same resolution, which poses significant challenge on wireless scheduling design to achieve desired performance. On other hand, recent studies reveal that one can effectively predict user's Field-of-View (FoV) and thus simply deliver corresponding portion instead entire scenes. Motivated by this important fact, we aim employ autoregressive process for motion prediction analytically characterize successful...

The backpressure scheduling algorithm for multihop wireless networks is known to be throughput optimal, but it requires each node maintain per-destination queues. Recently, a clever generalization of processor sharing has been proposed which also only uses per-link Here we propose another called Queue Proportional Rate Allocation (QPRA) queues, and allocates service rates links in proportion their queue-lengths employs the Serve-In-Random-Order (SIRO) discipline within link. Through fluid...

Mobile cloud computing enables compute-limited mobile devices to perform real-time intensive computations such as speech recognition or object detection by leveraging powerful servers. An important problem in large-scale is computational offloading, where each device decides when and how much computation should be uploaded servers considering the local processing delay cost of using In this paper, we develop a distributed threshold-based offloading algorithm it uploads an incoming task if...

We study cloud storage systems with a very large number of files stored in servers. In such systems, are either replicated or coded to ensure reliability, i.e., guarantee file recovery from server failures. This redundancy can further be exploited improve system performance (mean file-access delay) through appropriate load-balancing (routing) schemes. However, it is unclear whether coding replication better perspective since the corresponding queueing analysis is, general, quite difficult...

Randomization is a powerful and pervasive strategy for developing efficient practical transmission scheduling algorithms in interference-limited wireless networks. Yet, despite the presence of variety earlier works on design analysis particular randomized schedulers, there does not exist an extensive study limitations randomization In this paper, we aim to fill gap by proposing common modeling framework three functional forms schedulers that utilize queue-length information probabilistically...

It is energy-consuming and operationally cumbersome for all users to continuously estimate the channel quality before each data transmission decision in opportunistic scheduling over wireless fading channels. This observation motivates us understand whether how gains can still be achieved with significant reductions probing requirements without centralized coordination amongst competing users. In this work, we first provide an optimal algorithm under constraints. Noting difficulties...