Scheduling and Congestion Control for Wireless and by Jiang Libin, Walrand Jean

By Jiang Libin, Walrand Jean

During this booklet, we examine the matter of accomplishing the utmost throughput and application in a category of networks with resource-sharing constraints. this can be a classical challenge of serious significance. within the context of instant networks, we first suggest a completely disbursed scheduling set of rules that achieves the utmost throughput. encouraged by means of CSMA (Carrier feel a number of Access), that is broadly deployed in ultra-modern instant networks, our set of rules is straightforward, asynchronous, and straightforward to enforce. moment, utilizing a singular maximal-entropy approach, we mix the CSMA scheduling set of rules with congestion keep an eye on to procedure the utmost application. additionally, we additional express that CSMA scheduling is a modular MAC-layer set of rules that may paintings with different protocols within the delivery layer and community layer. 3rd, for instant networks the place packet collisions are unavoidable, we determine a normal analytical version and expand the above algorithms to that case. Stochastic Processing Networks (SPNs) version production, conversation, and repair platforms. In production networks, for instance, projects require components and assets to provide different elements. SPNs are extra basic than queueing networks and pose novel demanding situations to throughput-optimum scheduling. We proposes a "deficit greatest weight" (DMW) set of rules to accomplish throughput optimality and maximize the web application of the creation in SPNs. desk of Contents: creation / assessment / Scheduling in instant Networks / software Maximization in instant Networks / dispensed CSMA Scheduling with Collisions / Stochastic Processing networks

Show description

Read or Download Scheduling and Congestion Control for Wireless and Processing Networks (Synthesis Lectures on Communication Networks) PDF

Similar & telecommunications books

Spectral Analysis: Parametric and Non-Parametric Digital Methods

This publication offers with those parametric tools, first discussing these in accordance with time sequence versions, Capon's process and its versions, after which estimators in line with the notions of sub-spaces. in spite of the fact that, the e-book additionally bargains with the conventional "analog" equipment, now referred to as non-parametric equipment, that are nonetheless the main familiar in sensible spectral research.

A Brief History of the Future: From Radio Days to Internet Years in a Lifetime

An intimate, gloriously written examine the communications revolution and the way it has unfolded the area. the web is the main striking factor humans have outfitted because the pyramids. A millennium from now, historians will glance again at it and wonder humans built with such clumsy instruments succeeded in growing this type of leviathan.

The Communications Toolkit: How to Build and Regulate Any Communications Business

Even though phone, cable, broadcast, print, and net businesses are altering at a lovely expense, the basics of communications, networks, and festival have remained consistent. This booklet offers the instruments essential to construct lasting, versatile techniques to outlive and develop in those occasions of transition.

Essentials of LTE and LTE-A (The Cambridge Wireless Essentials Series)

This sensible, one-stop consultant will fast deliver you in control on LTE and LTE-Advanced. With every thing you must learn about the idea and expertise in the back of the criteria, this can be a must-have for engineers and bosses within the instant undefined. • First ebook of its style describing applied sciences and procedure functionality of LTE-A • Covers the evolution of electronic instant know-how, fundamentals of LTE and LTE-A, layout of downlink and uplink channels, multi-antenna thoughts and heterogeneous networks • Analyzes functionality advantages over competing applied sciences, together with WiMAX and 802.

Additional resources for Scheduling and Congestion Control for Wireless and Processing Networks (Synthesis Lectures on Communication Networks)

Example text

F . The utility of that flow is uf (λf ). Each node i maintains a separate queue for each flow f of packets that go through it. The backlog in that queue is Xi,f . Let sj,f be the service rate of packets of flow f by link j . Let δf and f be the source and destination node of flow f . Consider the following problem: Maximize H (π) + β uf (λf ) f sj,f ≤ Subject to j :w(j )=i sj ,f , ∀f, i = δf , i = f , λf ≤ j :t (j )=i j :t (j )=δf sj,f ≤ sj (π ), and f sj ,f , ∀f, π(S) = 1. S In this problem, sj (π) is the average service rate of link j under the distribution π .

5 MAXIMAL-ENTROPY INTERPRETATION This section provides a different view of the above scheduling problem, which will help us later develop a number of other algorithms. It shows that the desired distribution of the independent sets has maximum entropy subject to serving the links fast enough. Accordingly, to generalize the algorithm of this chapter, one will add an entropy term to the objective function of more general problems. t. hj = K k=1 xk rk , ∀j rk ≥ 0, ∀k. 32 3. SCHEDULING IN WIRELESS NETWORKS j For each j = 1, 2, .

5), then the Lagrangian is L(r; d) = F (r; λ) + dT r. 3), is the service rate (at stationary distribution) given r. Since dk∗ ≥ 0, λk ≤ sk (r ∗ ). 7) where the KL divergence ¯ : = DKL (p||p(r)) = i [p¯ i log(p¯ i /pi (r))] [ p ¯ i i log(p¯ i )] − F (r; λ). That is, we choose r ≥ 0 such that p(r) is the “closest” to p¯ in terms of the KL divergence. , a moment-matching condition). In our case, the time-reversible CSMA Markov chain gives the product-form distribution. Also, the arrival rate and service rate on link k are viewed as two marginal probabilities.

Download PDF sample

Rated 4.13 of 5 – based on 31 votes