An improved upper bound on network function computation using cut-set partition

2016 IEEE Information Theory Workshop (ITW) ◽

10.1109/itw.2016.7606786 ◽

2016 ◽

Author(s):

Xuan Guang ◽

Shenghao Yang ◽

Congduan Li

Keyword(s):

Upper Bound ◽

Set Partition ◽

Function Computation ◽

Network Function ◽

Download Full-text

On the Tightness of a Cut-Set Bound on Network Function Computation

2018 IEEE International Symposium on Information Theory (ISIT) ◽

10.1109/isit.2018.8437902 ◽

2018 ◽

Author(s):

Jie Wang ◽

Shenghao Yang ◽

Congduan Li

Keyword(s):

Function Computation ◽

Network Function ◽

Download Full-text

Comments on Cut-Set Bounds on Network Function Computation

IEEE Transactions on Information Theory ◽

10.1109/tit.2018.2827405 ◽

2018 ◽

Vol 64 (9) ◽

pp. 6454-6459 ◽

Author(s):

Cupjin Huang ◽

Zihan Tan ◽

Shenghao Yang ◽

Xuan Guang

Keyword(s):

Function Computation ◽

Network Function ◽

Download Full-text

Efficient Flow Allocation Algorithms for In-Network Function Computation

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011 ◽

10.1109/glocom.2011.6133878 ◽

2011 ◽

Author(s):

V. Shah ◽

B. K. Dey ◽

D. Manjunath

Keyword(s):

Function Computation ◽

Network Function ◽

Allocation Algorithms

Download Full-text

Towards a queueing-based framework for in-network function computation

2011 IEEE International Symposium on Information Theory Proceedings ◽

10.1109/isit.2011.6034026 ◽

2011 ◽

Author(s):

Siddhartha Banerjee ◽

Piyush Gupta ◽

Sanjay Shakkottai

Keyword(s):

Function Computation ◽

Network Function

Download Full-text

Network function computation as a service in future 5G machine type communications

2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) ◽

10.1109/istc.2016.7593138 ◽

2016 ◽

Author(s):

Dejan Vukobratovic ◽

Dusan Jakovetic ◽

Vitaly Skachek ◽

Dragana Bajovic ◽

Dino Sejdinovic

Keyword(s):

Function Computation ◽

Network Function ◽

Machine Type ◽

Machine Type Communications

Download Full-text

Towards a queueing-based framework for in-network function computation

Queueing Systems ◽

10.1007/s11134-012-9296-8 ◽

2012 ◽

Vol 72 (3-4) ◽

pp. 219-250 ◽

Author(s):

Siddhartha Banerjee ◽

Piyush Gupta ◽

Sanjay Shakkottai

Keyword(s):

Function Computation ◽

Network Function

Download Full-text

An Enhanced Capacity Bound for Network Function Computation

2018 IEEE International Symposium on Information Theory (ISIT) ◽

10.1109/isit.2018.8437692 ◽

2018 ◽

Author(s):

Xuan Guang ◽

Raymond W. Yeung ◽

Shenghao Yang ◽

Congduan Li

Keyword(s):

Function Computation ◽

Network Function ◽

Download Full-text

HierHybNET: Cut-set upper bound of ad hoc networks with cost-effective infrastructure

Wireless Networks ◽

10.1007/s11276-015-1017-x ◽

2015 ◽

Vol 22 (4) ◽

pp. 1133-1144 ◽

Author(s):

Cheol Jeong ◽

Won-Yong Shin

Keyword(s):

Ad Hoc Networks ◽

Upper Bound ◽

Ad Hoc ◽

Cost Effective ◽

Cut Set ◽

Download Full-text

Upper bound on function computation in directed acyclic networks

2015 IEEE Information Theory Workshop (ITW) ◽

10.1109/itw.2015.7133086 ◽

2015 ◽

Author(s):

Cupjin Huang ◽

Zihan Tan ◽

Shenghao Yang

Keyword(s):

Upper Bound ◽

Function Computation

Download Full-text

Energy-latency tradeoff for in-network function computation in random networks

2011 Proceedings IEEE INFOCOM ◽

10.1109/infcom.2011.5934949 ◽

2011 ◽

Author(s):

Paul Balister ◽

Bela Bollobas ◽

Animashree Anandkumar ◽

Alan Willsky

Keyword(s):

Random Networks ◽

Function Computation ◽

Network Function ◽

Download Full-text