Related papers: Throughput Optimal Routing in Overlay Networks

This study explores the throughput and delay that can be achieved by various forwarding schemes employing multiple paths and different degrees of redundancy focusing on linear network coding. The key contribution of the study is an…

The advent of real-time multimedia services over the Internet has stimulated new technologies for expanding the information carrying capacity of optical network backbones. Multilayer wavelength division multiplexing (WDM) packet switching…

We study scheduling control of parallel processing networks in which some resources need to simultaneously collaborate to perform some activities and some resources multitask. Resource collaboration and multitasking give rise to…

Load balancing plays a critical role in efficiently dispatching jobs in parallel-server systems such as cloud networks and data centers. A fundamental challenge in the design of load balancing algorithms is to achieve an optimal trade-off…

Ramp metering is one of the most effective tools to combat traffic congestion. In this paper, we present a ramp metering policy for a network of freeways with arbitrary number of on- and off-ramps, merge, and diverge junctions. The proposed…

We investigate the network stability problem when two users are scheduled simultaneously. The key idea is to simultaneously transmit to more than one users experiencing different channel conditions by employing hierarchical modulation. For…

Two-way relaying promises considerable improvements on spectral efficiency in wireless relay networks. While most existing works focus on physical layer approaches to exploit its capacity gain, the benefits of two-way relaying on upper…

Scheduling is a critical and challenging resource allocation mechanism for multihop wireless networks. It is well known that scheduling schemes that favor links with larger queue length can achieve high throughput performance. However,…

We consider a dual-hop full-duplex relaying system, where the energy constrained relay node is powered by radio frequency signals from the source using the time-switching architecture, both the amplify-and-forward and decode-and-forward…

In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on…

With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and…

We consider dynamic routing in multi-hop wireless networks with adversarial traffic. The model of wireless communication incorporates interferences caused by packets' arrivals into the same node that overlap in time. We consider two classes…

We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source- destination pairs increases up to the operating maximum. Our opportunistic…

We consider a class of open stochastic processing networks, with feedback routing and overlapping server capabilities, in heavy traffic. The networks we consider satisfy the so-called complete resource pooling condition and therefore have…

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

This paper focuses on two commonly used path assignment policies for agents traversing a congested network: self-interested routing, and system-optimum routing. In the self-interested routing policy each agent selects a path that optimizes…

The aim of this paper is to demonstrate the feasibility of authenticated throughput-efficient routing in an unreliable and dynamically changing synchronous network in which the majority of malicious insiders try to destroy and alter…

To account for the randomness of propagation channels and interference levels in hierarchical spectrum sharing, a novel approach to multihop routing is introduced for cognitive random access networks, whereby packets are randomly routed…

Mobile networks are intriguing in recent years due to their practical implications. Previous routing strategies for improving transport efficiency have little attention what order should the packets be forwarded, just simply used…

We present an analysis of the topologies of a class of networks which are optimal in terms of the requirements of having as short a route as possible between any two nodes while yet keeping the congestion in the network as low as possible.…