Adaptation of the Kademila Routing for Tactical Networks

• Autorzy: Ginzler T. , Amanowicz M.
• Języki publikacji: EN

Abstrakty

EN

In this paper a modification of the widely used Kademlia peer-to-peer system to tactical networks is proposed. We first take a look at the available systems today to cover the range of possibilities peer-to-peer systems offer. We identify candidates for use in military networks. Then we compare two candidate systems in an environment with highly dynamic participants. The considered environment is focused on the special conditions in tactical networks. Then we give rationale for choosing Kademlia as a suitable system for tactical environments. Since Kademlia is not adapted to military networks, a modification to this system is proposed to adapt it to the special conditions encountered in this environment. We show that optimizations in the routing may lead to faster lookups by measuring the modified algorithm in a simulation of the target environment. We show also that the proposed modification can be used to extend the battery lifetime of mobile peer-to-peer nodes. Our results show that peer-to-peer systems can be used in military networks to increase their robustness. The modifications proposed to Kademlia adapt the system to the special challenges of military tactical networks.

Słowa kluczowe

EN

Kademlia; network enabled capabilities; peer-to-peer; wireless tactical military networks

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2011
• Tom: nr 1
• Strony: 69--77
• Opis fizyczny: Bibliogr. 29 poz., rys., tab.

Twórcy

autor

Ginzler T.

autor

Amanowicz M.

• Fraunhofer FKIE, Neuenahrer Str. 20, 53343 Wachtberg, Germany,

Bibliografia

• [1] Dr. Scholl. Opennap, 2000 [Online]. Available: http://opennap.sourceforge.net/
• [2] The gnutella protocol specification v0.4 [Online]. Available: http://www.stanford.edu/class/cs244b/gnutella protocol 0.4
• [3] J. Liang, R. Kumar, and K. Ross, “The kazaa overlay: a measurement study”, in Proc. 19th IEEE Ann. Comput. Commun. Worksh., Bonita Springs, USA, 2004.
• [4] T. Klingberg and R. Manfredi, Gnutella 0.6, 2002 [Online]. Available: http://www.rfc-gnutella.sourceforge.net/src/rfc-0 6-draft.html
• [5] S. Guha and N. Daswani, “An experimental study of the skype peer-to-peer voIP system”, Techn. Rep., Cornell University, Dec. 2005.
• [6] B. Yang and H. Garcia-Molina, “Designing a super-peer network”, Techn. Rep. 2002-13, Stanford University, 2002.
• [7] M. Steiner, E. W. Biersack, and T. En Najjary, “Actively monitoring peers in KAD”, in 6th Int. Worksh. Peer-to-Peer Sys. IPTPS’07, Bellevue, USA, 2007.
• [8] Why Kad Lookup Fails, H. Schulzrinne, K. Aberer, and A. Datta, Eds. in Proc. IEEE 9th Int. Conf. P2P Comput. 2009, Seattle, Washington, USA, 2009.
• [9] P. Maymounkov and D. Mazieres, “Kademlia: a peer-to-peer information system based on the XOR metric”, in Int. Worksh. Peer-to-Peer Sys. IPTPS, LNCS, vol. 1, Cambridge MA, USA, 2002.
• [10] B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz, “Tapestry: a resilient global-scale overlay for service deployment”, IEEE J. Selec. Areas Commun., vol. 22, no. 1, pp. 41–53, 2004.
• [11] I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: a scalable peer-to-peer lookup service for internet applications”, in Proc. 1st ACM SIGCOMM, San Francisco, USA, 2001, pp. 149–160.
• [12] A. Rowstron and P. Druschel, “Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems”, in Proc. IFIP/ACM Int. Conf. Distr. Sys. Platforms (Middleware), Heidelberg, Germany, 2001, pp. 329–350.
• [13] A. Rowstron, A.-M. Kermarrec, M. Castro, and P. Druschel, “Scribe: the design of a large-scale event notification infrastructure”, in Proc. 3rd Int. COST264 Worksh. Networked Group Communication NGC’2001 , Lecture Notes in Computer Science, J. Crowcroft and M. Hofmann, Eds., vol. 2233. London: Springer, 2001, pp. 30–43.
• [14] E.W. Zegura, K. L. Calvert, and S. Bhattacharjee, “How to model an internetwork”, in Proc. IEEE INFOCOM’96, San Francisco, USA, 1996, pp. 594–602.
• [15] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content addressable network”, Techn. Rep. TR-00-010, International Computer Science Institute, Berkeley, USA, Oct. 2000.
• [16] M. Castro, M. B. Jones, A.-M. Kermarrec, A. Rowstron, M. Theimer, H. Wang, and A. Wolman, “An evaluation of scalable application-level multicast built using peer-to-peer overlays”, in Proc. IEEE INFOCOM 2003, San Francisco, USA, 2003.
• [17] J. Li, J. Stribling, R. Morris, M. F. Kaashoek, and T. M. Gil, “A performance versus cost framework for evaluating DHT design tradeoffs under churn”, in Proc. IEEE INFOCOM 2005, Miami, USA, 2005, pp. 225–236.
• [18] D. Kato and T. Kamiya, “Evaluating DHT implementations in complex environments by network emulator” in Proc. Int. Worksh. Peer-to-Peer Sys. IPTPS’07, Bellevue, USA, 2007.
• [19] M. Steiner, T. En-Najjary, and E. W. Biersack, “Exploiting KAD: possible uses and misuses”, Comput. Commun. Rev., vol. 37, no. 5, pp. 65–70, 2007.
• [20] M. Steiner, D. Carra, and E. W. Biersack, “Faster content access in KAD” in Peer-to-Peer Computing, K. Wehrle, W. Kellerer, S. K. Singhal, and R. Steinmetz, Eds. New York: IEEE Comput. Society, 2008, pp. 195–204.
• [21] I. Baumgart, B. Heep, and S. Krause, “OverSim: a flexible overlay network simulation framework”, in Proc. 10th IEEE Glob. Internet Symp. GI’07 in conj. with IEEE INFOCOM 2007, Anchorage, USA, 2007, pp. 79–84.
• [22] A. Varga, “OMNeT++ discrete event simulation system”, 2009 [On-line]. Available: http://www.omnetpp.org
• [23] K. P. Gummadi, S. Saroiu, and S. D. Gribble, “King: estimating latency between arbitrary internet end hosts”, in Proc. 2nd ACM SIGCOMM Internet Measur. Worksh. 2002, Marseille, France, 2002.
• [24] Z. Yao, D. Leonard, X. Wang, and D. Loguinov, “Modeling heterogeneous user churn and local resilience of unstructured p2p networks”, in Proc. IEEE Int. Conf. Netw. Prot. ICNP’06, Washington, USA, 2006, pp. 32–41.
• [25] R. Brunner, A Performance Evaluation of the Kad-Protocol. Corporate Communications Department Institut Eur´ecom France, 2006.
• [26] K. C. Almeroth and M. H. Ammar, “Multicast group behavior in the internet’s multicast backbone (mbone)”, IEEE Commun. Mag., vol. 35, pp. 224–229, 1997.
• [27] D. Stutzbach and R. Rejaie, “Understanding churn in peer-to-peer networks”, in Proc. 6th ACM SIGCOMM Conf. Internet Measur. IMC’06, J. M. Almeida, V. A. F. Almeida, and P. Barford, Eds., Rio de Janeiro, Brazil, 2006, pp. 189–202.
• [28] T. Ginzler and M. Amanowicz, “Simulation of the impact of packet errors on the kademlia peer-to-peer routing”, in RTO Informa. Sys. Technol. Panel Symp. IST–092/RSY–022, NATO, 2010.
• [29] M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron, “Exploiting network proximity in distributed hash tables”, in Proc. Int. Worksh. Future Direct. Distrib. Comput. FuDiCo, O. Babaoglu, K. Birman, and K. Marzullo, Eds., Bertinoro (Forli), Italy, 2002, pp. 52–55.