On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks

@article{Ghosh2007OnAR,
  title={On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks},
  author={Joy Ghosh and Hung Q. Ngo and Seokhoon Yoon and Chunming Qiao},
  journal={IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications},
  year={2007},
  pages={1721-1729}
}
Given a probabilistic graph G representing an intermittently connected network and routing algorithm A, we wish to determine a delivery subgraph G[A] of G with at most k edges, such that the probability Conn2 (G[A]) that there is a path from source s to destination t (in a graph H chosen randomly from the probability space defined by G[A]) is maximized. To the best of our knowledge, this problem and its complexity has not been addressed in the literature. Also, there is the corresponding… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

Efficient Information Flow Maximization in Probabilistic Graphs

IEEE Transactions on Knowledge and Data Engineering • 2018
View 4 Excerpts
Highly Influenced

Efficient Information Flow Maximization in Probabilistic Graphs (Extended Abstract)

2018 IEEE 34th International Conference on Data Engineering (ICDE) • 2018
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 42 references

Extracting a Mobility Model from Real User Traces

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications • 2006

Similar Papers

Loading similar papers…