Related papers: Resolving the Connectivity-Throughput Trade-Off in…
This paper studies how to achieve the maximal link throughputs in a CSMA wireless network through offered-load control. First, we propose an analytical model, contention-graph-combination (CGC), to describe the relationship between the…
Random scale-free overlay topologies provide a number of properties like for example high resilience against failures of random nodes, small (average) diameter as well as good expansion and congestion characteristics that make them…
The current framework of network utility maximization for distributed rate allocation assumes fixed channel code rates. However, by adapting the physical layer channel coding, different rate-reliability tradeoffs can be achieved on each…
The energy-delay tradeoffs in wireless networks are studied using a game-theoretic framework. A multi-class multiple-access network is considered in which users choose their transmit powers, and possibly transmission rates, in a distributed…
We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free?…
In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent…
This letter proposes a novel random medium access control (MAC) based on a transmission opportunity prediction, which can be measured in a form of a conditional success probability given transmitter-side interference. A transmission…
The Load-Balanced Router architecture has received a lot of attention because it does not require centralized scheduling at the internal switch fabrics. In this paper we reexamine the architecture, motivated by its potential to turn off…
This paper investigates the average throughput of a wireless powered communications system, where an energy constrained source, powered by a dedicated power beacon (PB), communicates with a destination. It is assumed that the PB is capable…
An intuitive overview of the scalability of a variety of types of wireless networks is presented. Simple heuris- tic arguments are demonstrated here for scaling laws presented in other works, as well as for conditions not previously…
High throughput is of particular interest in data center and HPC networks. Although myriad network topologies have been proposed, a broad head-to-head comparison across topologies and across traffic patterns is absent, and the right way to…
A new network construction method is presented for building of scalable, high throughput, low latency networks. The method is based on the exact equivalence discovered between the problem of maximizing network throughput (measured as…
Opportunistic analysis has traditionally relied on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks,…
Consider a wireless network that has two tiers with different priorities: a primary tier vs. a secondary tier, which is an emerging network scenario with the advancement of cognitive radio technologies. The primary tier consists of randomly…
We consider two elementary (max-flow and uniform-flow) and two realistic (max-min fairness and proportional fairness) congestion control schemes, and analyse how the algorithms and network structure affect throughput, the fairness of flow…
We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the construction of…
The transmission rate, delivery reliability and network lifetime are three fundamental but conflicting design objectives in energy-constrained wireless sensor networks. In this paper, we address the optimal rate-reliability-lifetime…
For a large multi-hop wireless network, nodes are preferable to make distributed and localized link-scheduling decisions with only interactions among a small number of neighbors. However, for a slowly decaying channel and densely populated…
We consider a scenario where a power constrained transmitter delivers randomly arriving packets to the destination over Markov time-varying channel and adapts different transmission power to each channel state in order to guarantee…
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e.…