4 Hits in 2.2 sec

Cut-Set Bounds for Networks With Zero-Delay Nodes

Silas L. Fong, Raymond W. Yeung
2015 IEEE Transactions on Information Theory  
We obtain the capacity regions for three classes of MMNs with zero-delay nodes, namely the deterministic network dominated by product distribution, the MMN consisting of independent DMCs and the wireless  ...  In this paper, we investigate the multimessage multicast network (MMN) under a generalized-delay model which allows some nodes to incur no delay.  ...  The achievable rate region is contained in the positive-delay region because the NNC III. DISCRETE MEMORYLESS MULTIMESSAGE MULTICAST NETWORK We consider a DM-MMN that consists of N nodes.  ... 
doi:10.1109/tit.2015.2432760 fatcat:4mriv5vtt5hedhhymfxlbxo6my

Cut-Set Bounds for Multimessage Multicast Networks With Independent Channels and Zero-Delay Edges

Silas L. Fong
2016 IEEE Transactions on Information Theory  
In this paper, we investigate the multimessage multicast network (MMN) consisting of independent channels where each channel is associated with a set of edges and each edge may incur zero delay on some  ...  Our result reveals that the capacity region of the MMN with independent channels and zero-delay edges lies within the classical cut-set bound despite a violation of the unit-delay assumption.  ...  Multimessage Multicast Network In this paper, we consider the multimessage multicast network (MMN) [5, Ch. 18 ] consisting of independent channels, where the destination nodes want to decode the same  ... 
doi:10.1109/tit.2016.2604376 fatcat:dueccjxujjfnvaqeiwg5vki5du

Network Coding in Node-Constrained Line and Star Networks

S. M. Sadegh Yazdi, Serap A. Savari, Gerhard Kramer
2011 IEEE Transactions on Information Theory  
Line and star networks with both node and edge constraints are studied in the network coding framework.  ...  For line networks, the capacity region of the general multiple multicast problem is established.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their comments that helped to improve the presentation of the paper.  ... 
doi:10.1109/tit.2011.2146450 fatcat:b2cacvv6cncsxhgr4fpuvgbb7q


Manuel Costa, Jon Crowcroft, Miguel Castro, Antony Rowstron, Lidong Zhou, Lintao Zhang, Paul Barham
2008 ACM Transactions on Computer Systems  
We introduce dynamic data-flow analysis: a broad-coverage host-based algorithm that can detect unknown worms by tracking the flow of data from network messages and disallowing unsafe uses of this data.  ...  Costa is also affiliated with Microsoft Research.  ...  Mihocka for their help with Nirvana. We thank E. Traut for discussions about Virtual PC. We thank R. Wilhelm and H. Uijterwaal for access to the RIPE data. We thank J.  ... 
doi:10.1145/1455258.1455259 fatcat:p5p3cvu5vvhhtd2bhdh7b3d2vy