Name
Abstract | ||
|---|---|---|
We are given a capacitated communication network and several infinite sequences of source data each of which is available at some node in the network. A function of the source data is to be computed in the network and made available at a sink node that is also on the network. The schema to compute the function is given as a directed acyclic graph (DAG). We want to generate a computation and commun... |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TNET.2017.2695578 | IEEE/ACM Transactions on Networking |
Keywords | Field | DocType |
Schedules,Servers,Communication networks,Approximation algorithms,Electrical engineering,Distributed databases,IEEE transactions | Embedding problem,Integer,Embedding,Vertex (geometry),Quadratic equation,Time complexity,Linear programming relaxation,Mathematics,Distributed computing,Bounded function | Journal |
Volume | Issue | ISSN |
25 | 4 | 1063-6692 |
Citations | PageRank | References |
1 | 0.36 | 27 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pooja Vyavahare | 1 | 5 | 4.11 |
| Nutan Limaye | 2 | 134 | 20.59 |
| D. Manjunath | 3 | 67 | 7.48 |