On the Equivalence of Shannon Capacity and Stable Capacity in Networks with Memoryless Channels

被引：0
|
作者：
Yao, Hongyi [1 ]
Ho, Tracey [1 ]
Effros, Michelle [1 ]
机构：
[1] CALTECH, Pasadena, CA 91125 USA
来源：
2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2011年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
An equivalence result is established between the Shannon capacity and the stable capacity of communication networks. Given a discrete-time network with memoryless, time-invariant, discrete-output channels, it is proved that the Shannon capacity equals the stable capacity. The results treat general demands (e.g., multiple unicast demands) and apply even when neither the Shannon capacity nor the stable capacity is known for the given demands. The result also generalize from discrete-alphabet channels to Gaussian channels.
引用
收藏
页码：503 / 507
页数：5
相关论文
共 50 条
  • [21] Capacity for four classes of discrete memoryless networks
    Kramer, G
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 25 - 25
  • [22] Shannon Meets Nyquist: Capacity of Sampled Gaussian Channels
    Chen, Yuxin
    Eldar, Yonina C.
    Goldsmith, Andrea J.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (08) : 4889 - 4914
  • [23] Establishing the Shannon Ordering for Discrete Memoryless Channels
    Zhang, Yuan
    Tepedelenlioglu, Cihan
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 865 - 869
  • [24] Neural Computation of Capacity Region of Memoryless Multiple Access Channels
    Mirkarimi, Farhad
    Farsad, Nariman
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2066 - 2071
  • [25] Rectangular algorithm for computing the capacity of arbitrary discrete memoryless channels
    Yamamura, Kiyotaka
    Fukuyama, Kenjirou
    Horiuchi, Kazuo
    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), 1991, 74 (02): : 1 - 9
  • [26] ON THE NON-ABELIAN GROUP CODE CAPACITY OF MEMORYLESS CHANNELS
    Arpasi, Jorge P.
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2020, 14 (03) : 423 - 436
  • [27] Capacity Results for Discrete Memoryless Channels in the Finite Blocklength Regime
    Oohama, Yasutada
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 654 - 658
  • [28] On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels
    Sahebi, Aria G.
    Pradhan, S. Sandeep
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011,
  • [29] GEOMETRICAL METHOD FOR CALCULATING THE CAPACITY OF DISCRETE MEMORYLESS CHANNELS.
    Watanabe, Yoichiro
    Electronics & communications in Japan, 1981, 64 (11): : 9 - 17
  • [30] A New Upperbound for the Oblivious Transfer Capacity of Discrete Memoryless Channels
    Rao, K. Sankeerth
    Prabhakaran, Vinod M.
    2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 35 - 39
12345