Y. Nikoloudakis, E. Markakis, G. Alexiou, Stavroula Bourazani, G. Mastorakis, E. Pallis, I. Politis, C. Skianis, C. Mavromoustakis
{"title":"Edge Caching Architecture for Media Delivery over P2P Networks","authors":"Y. Nikoloudakis, E. Markakis, G. Alexiou, Stavroula Bourazani, G. Mastorakis, E. Pallis, I. Politis, C. Skianis, C. Mavromoustakis","doi":"10.1109/CAMAD.2018.8514935","DOIUrl":null,"url":null,"abstract":"Peer to Peer (P2P) systems, have been identified as one of the main contributors to the exponential growth of internet traffic. File sharing applications such as BitTorrent clients, are the most popular among P2P systems and tend to consume great amounts of network resources, stretching infrastructure capabilities to their limits. This causes interdomain links to be overloaded with traffic, created from content traversing the network, which is most of the times redundant. Cloud computing has been an empowering force towards alleviating this issue and many research approaches have been proposed. With cloud orchestration frameworks and Software Defined Networks (SDN) as our empowering technologies, we propose a cross-layered edge-caching mechanism to alleviate content and service providers of link-saturation problems, caused by identical content requested and downloaded by multiple users in the same network vicinity. The proposed mechanism identifies and classifies P2P data-in-transit, caches it locally and successively acts as a peer by sharing it with all other requesting users. This way, redundant traffic in the backhaul link is minimized, since requests for content cached by the mechanism, will be served by the target edge-node and not from the content provider. To validate the performance and overall efficacy of the proposed mechanism, simulation experiments were conducted under a controlled-conditions environment. Results indicated that the proposed mechanism can reduce redundant network traffic up to 22%.","PeriodicalId":173858,"journal":{"name":"2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMAD.2018.8514935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
Peer to Peer (P2P) systems, have been identified as one of the main contributors to the exponential growth of internet traffic. File sharing applications such as BitTorrent clients, are the most popular among P2P systems and tend to consume great amounts of network resources, stretching infrastructure capabilities to their limits. This causes interdomain links to be overloaded with traffic, created from content traversing the network, which is most of the times redundant. Cloud computing has been an empowering force towards alleviating this issue and many research approaches have been proposed. With cloud orchestration frameworks and Software Defined Networks (SDN) as our empowering technologies, we propose a cross-layered edge-caching mechanism to alleviate content and service providers of link-saturation problems, caused by identical content requested and downloaded by multiple users in the same network vicinity. The proposed mechanism identifies and classifies P2P data-in-transit, caches it locally and successively acts as a peer by sharing it with all other requesting users. This way, redundant traffic in the backhaul link is minimized, since requests for content cached by the mechanism, will be served by the target edge-node and not from the content provider. To validate the performance and overall efficacy of the proposed mechanism, simulation experiments were conducted under a controlled-conditions environment. Results indicated that the proposed mechanism can reduce redundant network traffic up to 22%.