On the design of fair contact plans in predictable Delay-Tolerant Networks
暂无分享,去创建一个
[1] Siyuan Chen,et al. Cost-Efficient Topology Design Problem in Time-Evolving Delay-Tolerant Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.
[2] J. G. Walker,et al. Comments on "Rosette Constellations of Earth Satellites" , 1982 .
[3] Arun Venkataramani,et al. DTN routing as a resource allocation problem , 2007, SIGCOMM '07.
[4] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[5] Michael D. Noakes,et al. An adaptive link assignment algorithm for dynamically changing topologies , 1993, IEEE Trans. Commun..
[6] Mostafa Ammar,et al. Routing in Space and Time in Networks with Predictable Mobility , 2004 .
[7] Yanghee Choi,et al. Topological design and routing for low-Earth orbit satellite networks , 1995, Proceedings of GLOBECOM '95.
[8] Kurt Mehlhorn,et al. Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures , 2000, Algorithm Engineering.
[9] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[10] Minsu Huang,et al. Topology design in time-evolving delay-tolerant networks with unreliable links , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).
[11] Jeffrey M. Jaffe,et al. Bottleneck Flow Control , 1981, IEEE Trans. Commun..
[12] Brian Gallagher,et al. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[13] Cauligi S. Raghavendra,et al. Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.
[14] Vladimir Kolmogorov,et al. Blossom V: a new implementation of a minimum cost perfect matching algorithm , 2009, Math. Program. Comput..
[15] Raj Jain,et al. A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.
[16] Vinton G. Cerf,et al. Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..
[17] Anders Lindgren,et al. Probabilistic Routing Protocol for Intermittently Connected Networks , 2012, RFC.
[18] Carlo Caini,et al. Application of Contact Graph Routing to LEO satellite DTN communications , 2012, 2012 IEEE International Conference on Communications (ICC).
[19] Kevin R. Fall,et al. A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.
[20] Carlo Caini,et al. DTN for LEO Satellite Communications , 2011, PSATS.
[21] Haitham S. Cruickshank,et al. Delay- and Disruption-Tolerant Networking (DTN): An Alternative Solution for Future Satellite Networking Applications , 2011, Proceedings of the IEEE.
[22] Scott Burleigh. Contact Graph Routing , 2010 .