Analysis of Creido Enhanced Chord Overlay Protocol Under Different Movement Models in Delay Tolerant Networks
暂无分享,去创建一个
[1] Stephen Farrell,et al. DTN: an architectural retrospective , 2008, IEEE Journal on Selected Areas in Communications.
[2] David R. Karger,et al. Building peer-to-peer systems with chord, a distributed lookup service , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.
[3] Xinmin Zhou,et al. A Bidirectional Chord System Based on Base-k Finger Table , 2008, 2008 International Symposium on Computer Science and Computational Technology.
[4] Pietro Manzoni,et al. ANEJOS: a Java based simulator for ad hoc networks , 2001, Future Gener. Comput. Syst..
[5] Zygmunt J. Haas,et al. A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.
[6] Minglu Li,et al. HP-Chord: A Peer-to-Peer Overlay to Achieve Better Routing Efficiency by Exploiting Heterogeneity and Proximity , 2004, GCC.
[7] Tracy Camp,et al. A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..
[8] Ian F. Akyildiz,et al. Wireless sensor networks: a survey , 2002, Comput. Networks.
[9] Bernhard Heep. dCBR: A global view on network coordinates for more efficient peer-to-peer systems , 2010, 2010 Second International Conference on Ubiquitous and Future Networks (ICUFN).
[10] Christian Schindelhauer,et al. A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs , 2010, 2010 IEEE 16th International Conference on Parallel and Distributed Systems.
[11] David Tse,et al. Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.
[12] Rudolf Hornig,et al. An overview of the OMNeT++ simulation environment , 2008, Simutools 2008.
[13] Chin-Tser Huang,et al. Look-ahead routing and Message Scheduling in delay-tolerant networks , 2010, IEEE Local Computer Network Conference.
[14] Christian Scheideler,et al. Tiara: A Self-stabilizing Deterministic Skip List , 2008, SSS.
[15] Kam-Wing Ng,et al. An analytical study on optimizing the lookup performance of distributed hash table systems under churn , 2007, Concurr. Comput. Pract. Exp..
[16] Salma Ktari,et al. Performance evaluation of replication strategies in DHTs under churn , 2007, MUM.
[17] Edsger W. Dijkstra,et al. Self stabilization in spite of distributed control , 1974 .
[18] Arun Venkataramani,et al. Replication Routing in DTNs: A Resource Allocation Approach , 2010, IEEE/ACM Transactions on Networking.
[19] Tamer Ahmed Mostafa Mohammed Abdel-kader. Design and Performance Analysis of Opportunistic Routing Protocols for Delay Tolerant Networks , 2012 .
[20] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.
[21] Yuan Zhou,et al. AF-Chord: An improved Chord model based adjusted Finger Table , 2011, 2011 4th IEEE International Conference on Broadband Network and Multimedia Technology.
[22] Xue Chen,et al. HRing: A Structured P2P Overlay Based on Harmonic Series , 2008, IEEE Transactions on Parallel and Distributed Systems.
[23] Gonzalo Camarillo,et al. Study on maintenance operations in a chord-based Peer-to-Peer session initiation protocol overlay network , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.
[24] Zhensheng Zhang,et al. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.
[25] Christian Scheideler,et al. Linearization: Locally Self-Stabilizing Sorting in Graphs , 2007, ALENEX.
[26] Marco Conti,et al. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.
[27] Guiran Chang,et al. An Improvement to the Chord-Based P2P Routing Algorithm , 2009, 2009 Fifth International Conference on Semantics, Knowledge and Grid.
[28] Constantin Adam,et al. Patterns for routing and self-stabilization , 2004, 2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507).
[29] Christoph P. Mayer. Hybrid routing in delay tolerant networks , 2012 .
[30] Jon Crowcroft,et al. A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.
[31] Andreas Wombacher,et al. DHT-Based Self-adapting Replication Protocol for Achieving High Data Availability , 2006, SITIS.
[32] S. Krause,et al. OverSim: A Flexible Overlay Network Simulation Framework , 2007, 2007 IEEE Global Internet Symposium.
[33] Karl Aberer,et al. On Routing in Distributed Hash Tables , 2007 .
[34] Andrew Jenkins,et al. Dtn Implementation and Utilization Options on the International Space Station , 2013 .
[35] Christian Scheideler,et al. Re-Chord: a self-stabilizing chord overlay network , 2011, SPAA.
[36] Edsger W. Dijkstra,et al. Selected Writings on Computing: A personal Perspective , 1982, Texts and Monographs in Computer Science.
[37] Christian Scheideler,et al. Self-Stabilizing De Bruijn Networks , 2011, SSS.
[38] Chunling Cheng,et al. Advanced chord routing algorithm based on redundant information replaced and objective resource table , 2010, 2010 3rd International Conference on Computer Science and Information Technology.
[39] David R. Karger,et al. Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.
[40] David R. Karger,et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.