Towards Content-Centric Geometric Routing

Content delivery is a crucial feature of existing cloud and telecom networks. This is confirmed by the tremendous success of media streaming services such as Spotify and Netflix, as well as the content and file-distribution systems such as BitTorrent. A recurring problem in these type of network services is about keeping the protocol overhead as low as possible while maximizing the efficiency of such systems in terms of network delay to customers. In this paper we propose the use of a routing system-inferred coordinate system to improve: i) content server selection upon receiving content requests, and ii) the mapping of content to servers/caches. We describe the required protocol mechanisms, and evaluate potential gains using coordinates of Geometric Tree Routing and compare it to pure IP-based mechanisms or measurement-based content systems relying on coordinates. The proposed approach can be further extended in order to include alternate geometric systems for example supporting hyperbolic geometries.

[1]  Mark Crovella,et al.  On the choice of a spanning tree for greedy embedding of network graphs , 2013 .

[2]  Robert D. Kleinberg Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .

[4]  Didier Colle,et al.  Experimentation of Geometric Information Routing on Content Locators , 2014, 2014 IEEE 22nd International Conference on Network Protocols.

[5]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[6]  M. Frans Kaashoek,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM 2004.

[7]  Cédric Westphal,et al.  Scalable Routing Via Greedy Embedding , 2009, IEEE INFOCOM 2009.

[8]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[9]  Didier Colle,et al.  Single failure resiliency in greedy routing , 2013, 2013 9th International Conference on the Design of Reliable Communication Networks (DRCN).

[10]  David Eppstein,et al.  Succinct Greedy Geometric Routing Using Hyperbolic Geometry , 2011, IEEE Transactions on Computers.