The impact of Stochastic noisy feedback on distributed network utility maximization

被引:3
|
作者
Zhang, Junshan [1 ]
Zheng, Dong [2 ]
Chiang, Mung [3 ]
机构
[1] Arizona State Univ, Dept Elect Engn, Tempe, AZ 85287 USA
[2] Next Wave Broadband Inc, San Diego, CA 92130 USA
[3] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
来源
INFOCOM 2007, VOLS 1-5 | 2007年
基金
美国国家科学基金会;
关键词
D O I
10.1109/INFCOM.2007.34
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practical systems the feedback is often obtained using error-prone measurement mechanisms and suffers from random errors. There has been little work in this direction, and by and large the impact of noisy feedback remains unclear. A main objective of this study is to fill this void and to obtain a rigorous and systematic understanding of the impact of stochastic noisy feedback. In this paper, we consider distributed NUM in multi-hop wireless networks, and focus on the impact of noisy feedback on the distributed algorithms based on the Lagrangian dual method. These algorithms can in general be regarded as some form of gradient (or sub-gradient) based methods. Assuming strong duality, we study both cases when the stochastic gradients are unbiased or biased, and develop a general theory on the stochastic stability of these algorithms in the presence of noisy feedback. When the gradient estimator is unbiased, we establish, via a combination of the stochastic Lyapunov Stability Theorem and local analysis, that the iterates generated by distributed NUM algorithms converge with probability one to the optimal point, under standard technical conditions. In contrast, when the gradient estimator is biased, we show that the iterates converge to a contraction region around the optimal point, provided that the biased terms are asymptotically bounded by a scaled version of the true gradients. We also investigate the rate of convergence for the unbiased case, and find that, in general, the limit process of the interpolated process corresponding to the normalized iterate sequence is a stationary reflected linear diffusion process, not necessarily a Gaussian diffusion process. We also apply the above general theory to investigate stability of cross-layer rate control for joint congestion control and random access. Our numerical examples corroborate the theoretic findings well.
引用
收藏
页码:222 / +
页数:2
相关论文
共 50 条
  • [41] Backward stochastic PDEs related to the utility maximization problem
    Mania, Michael
    Tevzadze, Revaz
    GEORGIAN MATHEMATICAL JOURNAL, 2010, 17 (04) : 705 - 740
  • [42] A Stochastic control approach to a robust utility maximization problem
    Bordigoni, Giuliana
    Matoussi, Anis
    Schweizer, Martin
    STOCHASTIC ANALYSIS AND APPLICATIONS, 2007, 2 : 125 - +
  • [43] Utility maximization with a stochastic clock and an unbounded random endowment
    Zitkovic, G
    ANNALS OF APPLIED PROBABILITY, 2005, 15 (1B): : 748 - 777
  • [44] The network utility function:: A practicable concept for assessing network impact on distributed services
    Fiedler, M
    Chevul, S
    Radtke, O
    Tutschku, K
    Binzenhöfer, A
    PERFORMANCE CHALLENGES FOR EFFICIENT NEXT GENERATION NETWORKS, VOLS 6A-6C, 2005, 6A-6C : 1465 - 1474
  • [45] Distributed Cooperative Caching for Utility Maximization of VoD Systems
    Avrachenkov, Konstantin
    Goseling, Jasper
    Serbetci, Berksan
    2019 IEEE 20TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC 2019), 2019,
  • [46] Distributed Utility Maximization From the Edge in IP Networks
    Magnouche, Youcef
    Pham Tran Anh Quang
    Leguay, Jeremie
    Gong, Xu
    Zeng, Feng
    2021 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2021), 2021, : 224 - 232
  • [47] The Impact of Information in Distributed Submodular Maximization
    Grimsman, David
    Ali, Mohd Shabbir
    Hespanha, Joao P.
    Marden, Jason R.
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2019, 6 (04): : 1334 - 1343
  • [48] Completely Uncoupled Algorithms for Network Utility Maximization
    Ramakrishnan, S.
    Ramaiyan, Venkatesh
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (02) : 607 - 620
  • [49] A tutorial on decomposition methods for network utility maximization
    Palomar, Daniel P.
    Chiang, Mung
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (08) : 1439 - 1451
  • [50] Delay-Based Network Utility Maximization
    Neely, Michael J.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2013, 21 (01) : 41 - 54