Concave switching in single and multihop networks

@article{Walton2014ConcaveSI,
  title={Concave switching in single and multihop networks},
  author={Neil S. Walton},
  journal={ArXiv},
  year={2014},
  volume={abs/1404.2725}
}
  • N. Walton
  • Published 10 April 2014
  • Computer Science
  • ArXiv
Switched queueing networks model wireless networks, input queued switches and numerous other networked communications systems. For single-hop networks, we consider a (α,g)-switch policy} which combines the MaxWeight policies with bandwidth sharing networks -- a further well studied model of Internet congestion. We prove the maximum stability property for this class of randomized policies. Thus these policies have the same first order behavior as the MaxWeight policies. However, for multihop… 

Figures from this paper

Queue-proportional rate allocation with per-link information in multihop wireless networks
TLDR
This work proposes another algorithm, called Queue-Proportional Rate Allocation (QPRA), which also only uses per-link queues and allocates service rates to links in proportion to their queue lengths, and employs the Serve-In-Random-Order queueing discipline within each link.
Queue-Proportional Rate Allocation with Per-Link Information in Multihop Networks
TLDR
This work proposes a algorithm called Queue Proportional Rate Allocation (QPRA) which also only uses per-link queues, and allocates service rates to links in proportion to their queue-lengths and employs the Serve-In-Random-Order (SIRO) discipline within each link.
Store-forward and its implications for proportional scheduling
  • N. Walton
  • Computer Science
    2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
TLDR
This article postulates on the equilibrium behaviour of the Proportional Scheduler through the analysis of an analogous rule called the Store-Forward allocation, where it has been shown that Store- forward allocates asymptotically according to theproportional scheduler.
Emulating Round-Robin in Wireless Networks
TLDR
A round-robin-like algorithm in wireless networks that has nice properties as round robin in wireline networks is developed, and it is shown that the proposed algorithm achieves maximum system throughput, which demands a nontraditional approach due to the abrupt dynamics of the TSLS metrics.
Decentralized Proportional Load Balancing
TLDR
A general model capturing the performance of communication and computer networks is considered, and on top of it a decentralized algorithm for balancing load among multiple network paths is proposed that achieves network-wide utility optimization.
Emulating round-robin for serving dynamic flows over wireless fading channels
TLDR
The intricate dynamics of TSLS-based algorithm are explored and it is shown that flows are provided round-robin-like service with a very high probability and the algorithm can achieve throughput-optimality, and also exhibits desired properties such as delay-insensitivity and excellent short-term fairness performance in the presence of dynamic flows over wireless fading channels.
Centralized Congestion Control and Scheduling in a Datacenter
TLDR
A centralized policy that guarantees a per-flow end-to-end flow delay bound of $O$ and an emulation of Store-and-Forward congestion control in conjunction with Last-Come-First-Serve Preemptive-Resume (LCFS-PR) scheduling policy is proposed.
Communication-Aware Scheduling of Serial Tasks for Dispersed Computing
TLDR
This work considers a network where servers are capable of serving all task types, and sending the results of processed tasks from one server to another server results in some communication delay that makes the design of optimal scheduling policy significantly more challenging than classical queueing networks.
Communication-Aware Scheduling of Serial Tasks for Dispersed Computing
TLDR
A virtual queueing network for DAG scheduling over broadcast networks, where servers always broadcast the data of processed tasks to other servers, and proves that Max-Weight policy is throughput-optimal.
Generalized Proportional Allocation Policies for Robust Control of Dynamical Flow Networks
TLDR
The theoretical results find one application in the control of urban traffic networks with signalized intersections, where vehicles have to queue up at junctions and the traffic signal controls determine the green light allocation to the different incoming lanes.
...
1
2
3
...

References

SHOWING 1-10 OF 50 REFERENCES
Proportional switching in FIFO networks
TLDR
A scheduling policy for FIFO networks, the Proportional Scheduler, which is based on the proportional fairness criterion is introduced and it is shown that, like BackPressure, this policy has a maximal stability region and does not require explicit knowledge of traffic arrival rates.
Randomized Scheduling Algorithm for Queueing Networks
TLDR
A stable scheduling algorithm is presented that is myopic, distributed and performs few logical operations at each node per unit time for the packet-level wireless network model and a buffered circuit switched network model for an optical core of future Internet.
Optimal queue-size scaling in switched networks
TLDR
A new class of online scheduling policies are provided that achieve optimal average queue-size scaling for a class of switched networks including input-queued switches, establishing the validity of a conjecture about optimal queue- size scaling for input-Queued switches.
Throughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information
TLDR
The goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, while guaranteeing throughput optimality.
Fluid models of congestion collapse in overloaded switched networks
TLDR
It is shown that queue sizes grow linearly with time, under either generalized version of max-weight, and under either α-fair policy, and the growth rates are characterized, which is used to demonstrate examples of congestion collapse.
Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse
TLDR
A queueing network in which there are constraints on which queues may be served simultaneously is considered, and it is shown that fluid-scaled performance processes can be approximated by fluid model solutions.
Stability and performance analysis of networks supporting elastic services
TLDR
An architectural problem in TCP/IPs decoupling of the transport and network layer from the point of view of guaranteeing connection-level stability is posed, which it is claimed may explain congestion phenomena on the Internet.
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
TLDR
The stability of a queueing network with interdependent servers is considered and a policy is obtained which is optimal in the sense that its Stability Region is a superset of the stability region of every other scheduling policy, and this stability region is characterized.
A Novel Architecture for Reduction of Delay and Queueing Structure Complexity in the Back-Pressure Algorithm
TLDR
The proposed architecture allows each node to maintain only per-neighbor queues and, moreover, improves the delay performance of the back-pressure algorithm.
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
TLDR
An adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively and is combined with congestion control to achieve the optimal utility and fairness of competing flows.
...
1
2
3
4
5
...