Arikan's polar coding method is extended to two-user multiple-access channels. It shown that if the two users of channel use Arikan construction, resulting channels will polarize one five possible extremals, on each which uncoded transmission optimal. The sum rate achieved by this technique correponds uniform input distributions. encoding and decoding complexities error performance these codes are as in single-user case: $O(n\log n)$ for decoding, $o(\exp(-n^{1/2-\epsilon}))$ block...

Emerging information-centric networking architectures seek to optimally utilize both bandwidth and storage for efficient content distribution. This highlights the need joint design of traffic engineering caching strategies, in order optimize network performance view current loads future demands. We present a systematic framework dynamic interest request forwarding cache placement eviction, within context Named Data Networking (NDN) architecture. The employs virtual control plane which...

A fundamental problem in networking is the allocation of limited resources among users network. In a traditional layered network architecture, resource to be allocated at medium access control (MAC) and layers utilizes communication links, viewed as "bit pipes" that deliver data fixed rate with occasional random errors. Though this separation has many advantages, there growing awareness simple bit-pipe view inadequate, particularly context modern wireless networks. article, several basic...

In cooperative relaying, multiple nodes cooperate to forward a packet within network. To date, such schemes have been primarily investigated at the physical layer with focus on communication of single end-to-end flow. This paper considers relay networks stochastically varying flows, which may be queued Throughput optimal network control policies are studied that take into account queue dynamics jointly optimize routing, scheduling and resource allocation. this end, generalization maximum...

We study the problem of optimal content placement over a network caches, naturally arising in several networking applications, including ICNs, CDNs, and P2P systems. Given demand request rates paths followed, we wish to determine that maximizes expected caching gain, i.e., reduction routing costs due intermediate caching. The offline version this is NP-hard and, general, topology may be priori unknown. Hence, distributed, adaptive, constant approximation algorithm desired. show path...

We identify properties of optimal scheduling schemes for downlink traffic in a code division multiple access (CDMA) data-only network. Under idealised assumptions, we show that it is each base station to transmit at most one delay-tolerant user time. Moreover prove station, when on, should maximum power optimality. For linear network, characterise the schedule as solution program. As by-product, our analysis yields bounds on throughput gains obtainable from scheduling.

In wireless networks, node mobility may be exploited to assist in information dissemination over time. We analyze the latency for large-scale mobile networks. To study this problem, we map a network of nodes stationary with dynamic links. then use results from percolation theory show that under constrained i.i.d. model, scaling behavior falls into two regimes. When is not percolated (subcritical), scales linearly initial Euclidean distance between sender and receiver; when (supercritical),...

Network coding techniques are used to find the minimum-cost transmission scheme for multicast sessions with or without elastic rate demand. It is shown that in wireline networks, solving optimal subgraphs network equivalent finding routing a multicommodity flow problem. A set of node-based distributed gradient projection algorithms designed jointly implement congestion control/routing at source node and ¿virtual¿ intermediate nodes. The analytical framework further extended...

We study a problem of minimizing routing costs by jointly optimizing caching and decisions over an arbitrary network topology. cast this as equivalent gain maximization problem, consider both source hop-by-hop settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within constant from the optimal. also produce distributed, adaptive with same guarantees. simulate our broad array different...

We study the optimal placement of content over a network caches, problem naturally arising in several networking applications. Given demand request rates and paths followed, we wish to determine that maximizes expected caching gain, i.e., reduction routing costs due intermediate caching. The offline version this is NP-hard and, general, topology may be priori unknown. Hence, distributed, adaptive approximation algorithm for placing contents into caches desired. show path replication, simple...

We study the problem of optimal content placement over a network caches, naturally arising in several networking applications, including ICNs, CDNs, and P2P systems. Given demand request rates paths followed, we wish to determine that maximizes expected caching gain, i.e., reduction routing costs due intermediate caching. The offline version this is NP-hard and, general, topology may be priori unknown. Hence, distributed, adaptive, constant approximation algorithm desired. show path...

Future 5G systems will need to support ultra-reliable low-latency communications scenarios. From a latency-reliability viewpoint, it is inefficient rely on average utility-based system design. Therefore, we introduce the notion of guaranteeable delay which plus three standard deviations mean. We investigate trade-off between and throughput for point-to-point wireless erasure links with unreliable delayed feedback, by bringing together signal flow techniques area coding. use tiny codes, i.e.,...

We introduce a framework and provably-efficient schemes for `fresh' caching at the (front-end) local cache of content that is subject to `dynamic' updates (back-end) database. start by formulating hard-cache-constrained problem this setting, which quickly becomes intractable due limited cache. To bypass challenge, we first propose flexible time-based-eviction model derive average system cost function measures system's service aging in addition regular miss cost. Next, solve...

edmund.yehQyale.edu Abstract - For a multiaccess model with ran- dom packet arrivals and queueing, we character- ize resource allocation policies which optimize throughput delay over fading channel. I. INTRODUCTION We examine an M-user communication system where packets arrive in random manner. The physical channel is Gaussian fad- ing bandwidth W, modelled by Y(t) = E,=, mX,(t) + Z(t). Assume that the pro- cess H(t) (Hl(t), . , Hh.i(t))' varies slowly enough to allow for reliable at fixed...

We study connectivity and transmission latency in wireless networks with unreliable links from a percolation-based perspective. first examine static models, where each link of the network is functional (active) some probability, independently all other links, probability may depend on distance between two nodes. obtain analytical upper lower bounds critical density for phase transition this model. then dynamic active or inactive according to Markov on- off process. show that also exists such...

This paper studies the problem of resilience to node failures in large-scale networks modelled by random geometric graphs. Adopting a percolation-based viewpoint, investigates ability network maintain global communication face dependent failures. Degree-dependent site percolation processes on graphs are examined, and first known analytical conditions obtained for existence non-existence, respectively, large connected component operational nodes after degree-dependent In electrical power or...

Large-scale power blackouts caused by cascading failure are inflicting enormous socioeconomic costs. We study the problem of link failures in networks modelled random geometric graphs from a percolation-based viewpoint. To reflect fact that links fail according to amount flow going through them, we introduce model where probability which depends on number neighboring links. devise mapping maps graph nodes corresponding dual covering graph. This enables us obtain first-known analytical...

We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and decisions over an arbitrary network topology. consider both source hop-by-hop settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within constant from the optimal. also produce distributed, adaptive with same guarantees. simulate our broad array different topologies. Our...

For general multi-hop queueing networks, delay optimal network control has unfortunately been an outstanding problem. The dynamic backpressure (BP) algorithm elegantly achieves throughput optimality, but does not yield good performance in general. In this paper, we obtain asymptotically policy, which resembles the BP basing resource allocation and routing on a calculation, differs from form of calculation employed. difference suggests possible reason for unsatisfactory algorithm, i.e.,...

In battery-constrained wireless sensor networks, it is important to employ effective energy management while maintaining some level of network connectivity. Viewing this problem from a percolation-based connectivity perspective, we propose fully distributed algorithm for large-scale networks. This allows each probabilistically schedule its own activity based on node degree. mechanism modelled by degree-dependent dynamic site percolation process random geometric graphs. We specify the...

We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order observe fundamental duplexing constraint that co-located transmitters and receivers cannot operate simultaneously on same frequency band, we first devise a spectrum allocation scheme divides whole into multiple sub-bands activates conflict-free links each sub-band. show minimum number required grows asymptotically at logarithmic rate chromatic network...

In wireless networks, important network functionalities such as power control, rate allocation, routing, and congestion control must be optimized in a coherent integrated manner. this work, an interference-limited is considered, whereby routing variables are chosen to minimize the sum of link costs which depend on both capacities flow rates. The necessary conditions for optimality established. These sufficient if cost functions jointly convex, imply Pareto strictly quasi-convex. Network...

The emergence of IoT devices and the predicted increase in number data-driven delay-sensitive applications highlight importance dispersed computing platforms (e.g. edge fog computing) that can intelligently manage in-network computation data placement. In this paper, we propose DECO (Data-cEntric COmputation) framework for joint computation, caching, request forwarding data-centric networks. utilizes a virtual control plane which operates on demand rates data, an actual handles requests,...