Efficient routing for PPETP in multimedia cloud services

The Peer-to-Peer Epi-Transport Protocol (PPETP) [1] is a peer-to-peer protocol designed for multimedia data distribution between end users. While its robustness and flexibility are attractive properties for multimedia cloud services, its lack of routing poses an issue if distant or specific nodes must be reached to, for example, provide service, or cloud interoperability. This paper describes an extension to the PPETP that provides fast routing based on Dynamic Linked Data Structures (DLDS) and hierarchical topology aggregation. We provide a hierarchical routing algorithm with low runtime complexity that offers PPETP several suitable paths needed to draw full benefit from its ability to send multiple reduced streams. DLDS are used to speed-up the routing of packets belonging to long-lasting streams, in periods where their paths do not change. We describe the challenges encountered implementing this solution, and evaluate its performance through simulation.