stochastic network optimization with application to communication and queueing


-
This text is written to teach the theory of Lyapunov drift and Lyapunov optimization for stochastic network optimization. It assumes only that the reader is familiar with basic probability concepts (such as expectations and the law of large numbers). Familiarity with Markov chains and with standard
Copyright c 2010 by Morgan claypool All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means-clectronic, mechanical, photocopy, recording, or any other except for brief quotations printed reviews, without the prior permission of the publisher Stochastic Network Optimization with Application to Communication and Queueing Systems Michael J. Neely www.MorgAnclaypool.com ISBN: 9781608454556 Paperback ISBN:9781608454563 DOI10.2200/S00271ED1V01Y201006CNT007 A Publication in the morgan Claypool Publishers series SYNTHESIS LECTURES ON COMMUNICATION NETWORKS Lecture #7 Series Editor: Jean Walrand, University of California, Berkele Series issn Synthesis Lectures on Communication Networl Print 1935-4185 Electronic 1935-4193 This material is supported in part by one or more of the following: the DARPA IT-MANET Program grant W911NF-07-0028, the NSF Career grant CCF-0747525, and continuing through participation in the Network Science Collaborative Technology Alliance sponsored by the U.S. Army Research Laboratory. Synthesis Lectures on Communication Networks Editor Jean Walrand, University of California, Berkeley Synthesis Lectures on Communication Networks is an ongoing series of 50-to 100-page publications on topics on the design, implementation, and management of communication networks. Each lecture is a self-contained presentation of one topic by a leading expert. The topics range from algorithms to hardware implementations and cover a broad spectrum of issues from security to multiple-access protocols. The series addresses technologies from sensor networks to reconfigurable optical networks The series is designed to Provide the best available presentations of important aspects of communication networks Help engineers and advanced students keep up with recent developments in a rapidly evolving technology Facilitate the development of courses in this field Stochastic Network Optimization with Application to Communication and Queueing Systems chae」 2010 Scheduling and Congestion Control for Wireless and Processing Networks Libin Jiang and Jean Walrand 010 Performance Modeling of communication networks with markov chains onghoon Mo 10 Communication Networks: a Concise Introduction Jean Walrand and shyam Parekh 2010 Path Problems in Networks John S Baras and George Theodorakopoulos 2010 Performance Modeling, Loss Networks, and Statistical multiplexing Ravir mazumdar 2009 Nctwork Simulation Richard m. Fujimoto, Kalyan S. Perumalla, and George F. Riley 2006 Stochastic Network Optimization with A1 pplication to Communication and Queueing Systems Michael. Neely University of Southern California SYNTHESIS LECTURES ON COMMUNICATION NETWORKS #7 M mORGAN &CLAYPOOL PUBLIShers ABSTRACT This text presents a modern thcory of analysis, control, and optimization for dynamic networks Mathematical techniques of lyapunov drift and lyapunov optimization are developed and show to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput utility, power, and distortion. Explicit performance delay tradeoffs are provided to illustrate the cost of approaching optimality. This theory is also applicable to problems in operations research and economics, where energy-efficient and profit- maximizing decisions must be made without knowing the future Topics in the text include the following Queue stability theory Backpressure, max-weight, and virtual queue methods Primal-dual methods for non-convex stochastic utility maximization Universal scheduling theory for arbitrary sample paths Approximate and randomized scheduling theory Optimization of renewal systems and markov decision systems Detailed cxamples and numcrous problem sct qucstions are provided to reinforce the main concepts KEYWORDS dynamic scheduling, decision theory, wireless networks, Lyapunov optimization,con gestion control, fairness, network utility maximization, multi-hop, mobile networks outing, backpressure, max-weight virr queues Contents Preface 1 Introduction 1.1 Example Opportunistic Scheduling proble 1.1.1 Example Problem 1: Minimizing Time Average Power Subject to tability 1.1.2 Example Problem 2: Maximizing Throughput Subject to Time Average Power Constraints 1.1.3 Example Problem 3: Maximizing Throughput-Utility Subject to Time Average Power Constraints 1.2 General Stochastic Optimization Problems 1.3 Lyapunov Drift and lyapunov Optimization 1.4 Differences from our earlier text 1.51 ternative Approaches…… 7 1.6 On Gencral markov Dccision Problems 1.7 On Network dclay 1.7.1 Delay and Dynamic Programming. 1.7.2 Optimal O(V)and O(log(v) delay tradeoffs 1.7.3 Delay-optimal Algorithms for Symmetric Networks......... 10 1.7.4 Order-optimal Delay Scheduling and Queue Grouping........ 10 17.5 Heavy Traffic and Decay Exponents.…… 1.7.6 Capacity and Delay Tradeoffs for Mobile Networks 11 1.8 Preliminaries 2 Introduction to Queues .15 2. 1 Rate Stability 2.2 Stronger Forms of stability .18 2.3 Randomized Scheduling for Rate Stability 2.3.1 A 3-Queue, 2-Server Example 20 2.3.2 A 2-Queue Opportunistic Scheduling Examp 22 2.4 Exercises VIll 3 Dynamic Scheduling Example 29 3.1 Scheduling for stabili ty 29 3.1.1 The S-only Algorithm and Emax 30 31.2 Lyapunov Drift for Stable Scheduling.………………31 3. 1.3 The "Min-Drift"or"Max-Weight"Algorithm............ 34 3.1.4 Iterated Expectations and Telescoping Sums………………36 3. 1.5 Simulation of the Max-Weight Algorithm 37 3.2 Stability and Average Power Minimization................. 37 3.2.1 Drift-Plus-Penalty 39 3.2.2 Analysis of the Drift-Plus-Penalty Algorithm 40 3.2.3 Optimizing the bounds 41 3.2.4 Simulations of the Drift-Plus-Penalty Algorithm........... 42 3.3 Generalizations............................43 4 Optimizing Time Averages 45 4.1 yapunov Drift and Lyapunov Optimization………………………45 4.1.1 Lyapunov Drift Theorem 45 4.1.2 Lyapunov Optimization Theorem ..47 4.1.3 Probability 1 Convergence,…… 49 4.2 General System Model 52 4.2.1 Boundedness Assumptions............... 53 4.3 Optimality via @-only Policies 53 4.4 Virtulal Queues 56 4.5 The Min Drift-Plus-Penalty algorithm 58 4.5.1 Where are we Using the i.i.d. Assumptions? 62 4.6 62 4.6.1 Dynamic Server Scheduling..………62 4.6.2 Opportunistic Scheduling .64 4. 7 Variable V algorithms 67 4.8 Place-Holder backlog 69 4.9Non-id. Models and Universal Scheduling.…,…,… ..72 4.9.2 Non-Ergodic Models and Arbitrary Sample Paths 49.1 Markov modulated pi 74 ..77 4.10 ExE 81 4.11 Appendix 4.A- Proving Theorem 4.5 .92 4.11.1 The Region T 92 4.11.2 Characterizing optimality 5 Optimizing Functions of Time Averages 97 5.0.3 The Rectang nt R 5.0.4 Jensens Inequality 5.0.5 Auxiliary variables 99 5.1 Solving the Transformed Problem 100 5.2 A Flow-Based Network Model 104 5.2.1 Performance of the Flow-Based Algorithm ..107 5.2.2 Delayed Feedback 5.2.3 Limitations of this model 5.3 Multi-Hop Queueing Networks 5.3.1 Transmission variables 110 5.3.2 The Utility Optimization Problem 111 5.3.3 Multi-Hop Network Utility maximization 111 5.3.4 Backpressure-Based Routing and Resource Allocation 113 5.4 General Optimization of Convex Functions of Time Averages ..............114 5.5 Non-Convex Stochastic Optimization 116 5.6 Worst Case Delay 120 6. 1 The e-persistent service queue 122 5.6.2 The Drift-Plus-Penalty for Worst-Case Delay .123 5.6.3 Algorithm Performance 125 5.7 Alternative Fairness metrics 128 5.8E 129 6 Approximate Scheduling .137 6.1 Time-Invariant Interference Networks 138 6.1.1 Computing over Multiple Slots 138 6.1.2 Randomized Searching for the Max-Weight Solution .....140 6. 1.3 The Jiang-Walrand Th theorem .141 6.2 Multiplicative Factor Approximations 144 7 Optimization of Renewal Systems .149 7.1 The Renewal System Model 149 7. 1.1 The Optimization Goal ..,,.....150 7. 1.2 Optimality over i.i.d. algorithms..................151 7.2 Drift-Plus-Penalty for Renewal Systems .152 7.2.1 Alternate formulations 157

Stochastic Network Optimization Communication and Queueing Systems下载_course
2020-08-19Stochastic network optimization with application to communication and queueing systems, 经典的教材 相关下载链接
1.37MB
Stochastic Network Optimization Communication and Queueing Systems
2017-11-20Stochastic network optimization with application to communication and queueing systems, 经典的教材
C语言入门--必须基础17讲
2017-07-28适合没有基础的人群学习C语言,简单的入门教程。帮助小白理解什么是开发,什么是编程。做的很简单,很多细节没有详细讲解,不适合用来深入研究。学了这个,你能理解什么是编程,什么是C语言。
5.8MB
2020美赛C题题目.rar
2020-03-06Problem C: 电商里的数据财富 在电商市场中,亚马逊为消费者提供了对购买商品的评价(打分和评论)的服务。个人评级,又称为“星级评级”,意思是允许消费者使用1(低分差评,低满意度)到5(高分好评
89KB
html制作的登录界面
2011-05-12html制作的登录界面html制作的登录界面html制作的登录界面html制作的登录界面html制作的登录界面html制作的登录界面html制作的登录界面html制作的登录界面
Java系列技术之JavaWeb入门
2018-09-18JavaWeb里的基础核心技术
793.88MB
7套JavaWeb毕业设计+教程
2020-10-157套JavaWeb毕业设计+教程,包括:1.源代码;2数据库;3.模块解析;4.视频教程;5.项目截图
19.9MB
谷粒商城官方笔记(基础高级集群).rar
2020-07-27谷粒商城官方笔记,很好的配套资料,更多笔记可以去我专栏找https://blog.csdn.net/hancoder/category_10147715.html
1.70MB
微信抽奖源码PHP前后台+转盘+数据库完整示例
2020-01-14微信抽奖源码PHP前后台+转盘+数据库完整示例
308KB
研究论文-一种新的WIMAX标准LDPC码的软判决译码算法.pdf
2019-08-07WIMAX标准下的LDPC码采用准循环编码方式,其译码多为和积(SP)译码算法。为了进一步降低译码复杂度,通过大量仿真分析获得最优乘性因子的值,并推导出近似线性公式,提出了一种改进型的归一化最小和(M
9KB
侯捷C++全套课程视频资源
2019-06-06侯捷全套课程,C++11新标准,侯捷 - C++面向对象高级开发,侯捷 - STL和泛型编程,C++内存管理_侯捷
程序员的数学:微积分
2019-09-28本课程介绍程序员必备的数学基础内容,在取材上侧重人工智能、数据分析等热门领域
Java小白修炼手册
2019-12-28Java是一门面向对象编程语言,不仅吸收了C++语言的各种优点,还摒弃了C++里难以理解的多继承、指针等概念,因此Java语言具有功能强大和简单易用两个特征。Java语言作为静态面向对象编程语言的代表,极好地实现了面向对象理论,允许程序员以优雅的思维方式进行复杂的编程。 课程讲从零开始讲解Java 语言,小白快速入门学习的必修课!
174KB
2018美赛C题详细思路
2018-02-112018美赛C题思路,严谨科学,学科竞赛必备,论文请自己完成
1.71MB
2019年美赛A题特等奖论文(中文版).pdf
2020-04-08本文为2019年美赛A题特等奖论文中文版,好不容易找到的资源分享给大家,供大家学习。
-
学院
【2021】UI自动化测试Selenium3
【2021】UI自动化测试Selenium3
-
下载
TFTP客户端(C++)
TFTP客户端(C++)
-
学院
转行做IT-第5章 流程控制语句
转行做IT-第5章 流程控制语句
-
下载
HNU编程新技术实务实验二——HTML以及J2EE简单编程
HNU编程新技术实务实验二——HTML以及J2EE简单编程
-
学院
SQL Server 2016 高可用灾备技术合集
SQL Server 2016 高可用灾备技术合集
-
下载
dw1000室内定位直接可以应用的源代码
dw1000室内定位直接可以应用的源代码
-
学院
Laya 2.0 开发3D小游戏 入门教学
Laya 2.0 开发3D小游戏 入门教学
-
学院
第3章 入门程序、常量、变量
第3章 入门程序、常量、变量
-
学院
微信公众号2021之网页授权一学就会java版
微信公众号2021之网页授权一学就会java版
-
博客
虚拟机安装Ubuntu(个人记录)
虚拟机安装Ubuntu(个人记录)
-
下载
dnSpy6.1.8-net48-win64.zip
dnSpy6.1.8-net48-win64.zip
-
博客
Visual Studio 2019中不能使用Ctrl+Shift+M调出实现Unity消息窗口
Visual Studio 2019中不能使用Ctrl+Shift+M调出实现Unity消息窗口
-
下载
【057期】AMOS结构方程模型进阶.docx
【057期】AMOS结构方程模型进阶.docx
-
学院
java微服务常用技术整合
java微服务常用技术整合
-
学院
Unity游戏开发之数字华容道
Unity游戏开发之数字华容道
-
下载
xshellxftp.rar
xshellxftp.rar
-
下载
HTML5+CSS仿小米金融首页文件
HTML5+CSS仿小米金融首页文件
-
博客
重拾路由交换之VLAN端口(Access、Trunk、Hybrid)类型(二)
重拾路由交换之VLAN端口(Access、Trunk、Hybrid)类型(二)
-
下载
互联网传媒行业2021年度策略.pdf
互联网传媒行业2021年度策略.pdf
-
博客
机器学习-55-RL-Sparse Reward(强化学习-稀疏奖励:Reward Shaping,Curriculum Learning,Hierarchical RL)
机器学习-55-RL-Sparse Reward(强化学习-稀疏奖励:Reward Shaping,Curriculum Learning,Hierarchical RL)
-
下载
juejin.jpeg
juejin.jpeg
-
学院
JavaEE框架(Maven+SSM)全程实战开发教程(源码+讲义)
JavaEE框架(Maven+SSM)全程实战开发教程(源码+讲义)
-
博客
2021-01-25
2021-01-25
-
学院
Selenium3分布式与虚拟化
Selenium3分布式与虚拟化
-
下载
半导体清洗方法:湿法清洗,RCA清洗法,稀释化学法,IMEC清洗法,单晶片清洗,干法清洗分析(1月25).doc
半导体清洗方法:湿法清洗,RCA清洗法,稀释化学法,IMEC清洗法,单晶片清洗,干法清洗分析(1月25).doc
-
博客
LeetCode,LCP 01:猜数字
LeetCode,LCP 01:猜数字
-
博客
谈谈vue生命周期-看了这篇你就懂了
谈谈vue生命周期-看了这篇你就懂了
-
学院
云计算基础-Linux系统管理员
云计算基础-Linux系统管理员
-
博客
TabLayout设置选中字体大小粗细
TabLayout设置选中字体大小粗细
-
博客
kWHM
kWHM