Cut-Set Bounds for Networks With Zero-Delay Nodes
نویسندگان
چکیده
منابع مشابه
Strong Converse for Discrete Memoryless Networks with Tight Cut-Set Bounds
This paper proves the strong converse for any discrete memoryless network (DMN) with tight cut-set bound, i.e., whose cut-set bound is achievable. Our result implies that for any DMN with tight cut-set bound and any fixed rate tuple that resides outside the capacity region, the average error probabilities of any sequence of length-n codes operated at the rate tuple must tend to 1 as n grows. Th...
متن کاملCut-set Theorems for Multi-state Networks
We derive new cut-set bounds on the achievable rates in a general multi-terminal network with finite number of states. Multiple states are common in communication networks in the form of multiple channel and nodes’ states. Our results are broadly applicable and provide much tighter upper bounds than the known single state min-cut max-flow theorem, and hence form an important new tool to bound t...
متن کاملSubset Cut Enumeration of Flow Networks with Imperfect Nodes
A general assumption made in evaluation of flow network reliability is perfectly reliable nodes. Under such assumption, network reliability is evaluated through subset cut or composite path set approaches. This paper presents a simple approach to account for node failures in reliability evaluation of flow networks using subset cut approach. The proposed approach starts with generating combinati...
متن کاملPerformance of vehicular delay-tolerant networks with relay nodes
Farid Farahmand1, Isabella Cerutti2, Ankitkumar N. Patel3, Jason P. Jue3 and Joel J. P. C. Rodrigues4∗,† 1Department of Engineering Science, Sonoma State University, Rohnert Park, CA 94928, USA 2Scuola Superiore Sant’Anna, Pisa, Italy 3Department of Computer Science, The University of Texas at Dallas, Richardson, TX 75083, USA 4Instituto de Telecomunicacões, NetGNA Group, Portugal University of...
متن کاملNetwork Calculus Delay Bounds in Queueing Networks with Exact Solutions
The purpose of this paper is to shed light on the accuracy of probabilistic delay bounds obtained with network calculus. In particular, by comparing calculus bounds with exact results in a series of M/M/1 queues with cross traffic, we show that reasonably accurate bounds are achieved when the percentage of cross traffic is low. We use recent results in network calculus and, in addition, propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2432760