OpenFlow Compatible Key-Based Routing Protocol: Adapting SDN Networks to Content/Service-Centric Paradigm

The host-to-host/content/service communication instead of the host-to-host communication offered by traditional Internet Protocol (IP) routing solutions has been demanded in the last few years. Nowadays, getting this type of communication directly at network level is an increasing demand in the framework of new networking scenarios, such as Internet of Things and data center scenarios. Inspired by Key-Based Routing (KBR) solutions which, in conjunction with Distributed Hash Tables, have offered a way of providing content-sharing solutions in overlay networks on the top of the Internet for years now, we propose OFC-KBR (OpenFlow Compatible Key-Based Routing) solution. OFC-KBR is a key-based routing solution directly implemented at network layer that makes use of the potential of Software Defined Networking. In this solution, end-points are identified by virtual identifiers. These virtual identifiers are obtained from a descriptive textual name, whose format is not fixed and can be defined depending on the requirements of the service that is going to use the proposed OFC-KBR solution. OFC-KBR is totally compatible with the current OpenFlow standard and can co-exist with other L2/L3 protocols. The proposal has been implemented and evaluated by simulation considering real topologies.

[1]  Steven S. W. Lee,et al.  Design and Implementation of a GPON-Based Virtual OpenFlow-Enabled SDN Switch , 2016, Journal of Lightwave Technology.

[2]  Ben Y. Zhao,et al.  Distributed Object Location in a Dynamic Network , 2004, Theory of Computing Systems.

[3]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[4]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[5]  Zhi-Li Zhang,et al.  A Virtual Id Routing Protocol for Future Dynamics Networks and Its Implementation Using the SDN Paradigm , 2016, Journal of Network and Systems Management.

[6]  Sanjeev Kumar,et al.  Finding a Needle in Haystack: Facebook's Photo Storage , 2010, OSDI.

[7]  Sriram Sankaran,et al.  Modeling and analysis of routing in IoT networks , 2015, 2015 International Conference on Computing and Network Communications (CoCoNet).

[8]  Ye Yu,et al.  N I ] 2 6 A ug 2 01 4 Space Shuffle : A Scalable , Flexible , and High-Bandwidth Data Center Network , 2014 .

[9]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[10]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[11]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .

[12]  Martín Casado,et al.  The Design and Implementation of Open vSwitch , 2015, NSDI.

[13]  Rina Panigrahy,et al.  Sorting and Searching using Ternary CAMs , 2003, IEEE Micro.

[14]  Ben Y. Zhao,et al.  Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.

[15]  Alex F. R. Trajano,et al.  Two-phase load balancing of In-Memory Key-Value Storages using Network Functions Virtualization (NFV) , 2016, J. Netw. Comput. Appl..

[16]  Yuan Yu,et al.  Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.

[17]  Nikos Fotiou,et al.  A Survey of Information-Centric Networking Research , 2014, IEEE Communications Surveys & Tutorials.

[18]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[19]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[20]  Yehuda Afek,et al.  Orange: multi field openflow based range classifier , 2015, 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[21]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[22]  Rahim Rahmani,et al.  On Performance of Logical-Clustering Of Flow-Sensors , 2014, ArXiv.

[23]  Antony Rowstron,et al.  Symbiotic routing in future data centers , 2010, SIGCOMM 2010.

[24]  Daniel Raumer,et al.  Throughput and Latency of Virtual Switching with Open vSwitch: A Quantitative Analysis , 2018, Journal of Network and Systems Management.

[25]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

[26]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[27]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[28]  Bengt Ahlgren,et al.  A survey of information-centric networking , 2012, IEEE Communications Magazine.

[29]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[30]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[31]  Keith Kirkpatrick,et al.  Software-defined networking , 2013, CACM.

[32]  Holger Karl,et al.  MDHT: a hierarchical name resolution service for information-centric networks , 2011, ICN '11.

[33]  Achyut Sakadasariya,et al.  Software defined network: Future of networking , 2018, 2018 2nd International Conference on Inventive Systems and Control (ICISC).

[34]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[35]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[36]  Wolfgang Kellerer,et al.  Software Defined Optical Networks (SDONs): A Comprehensive Survey , 2015, IEEE Communications Surveys & Tutorials.