ICN communication is inherently multipath and potentially multi-destination. Content Centric and Named Data Networks at present do not offer a mechanism to direct traffic onto a specific path in multipath or a specific destination in a multi-destination environment, because the forwarding plane multiplexes packets across nexthops dynamically. This makes it challenging to provide practical multipath traceroute and ping applications, or implement multipath-aware congestion control, traffic engineering or SDN solutions. The symmetry of forward and reverse paths in Content Centric and Named Data Networks allows one to compute an end-to-end path label in a Data message on the reverse path and subsequently use this label to forward an Interest message through a specific nexthop. ICN Path Switching is a method of high-speed Interest forwarding in Content Centric and Named Data networks based on exact matching of a nexthop label retrieved from the Interest's path label against a nexthop ID in the ICN Forwarder's Adjacency database. ICN Path Switching maintains all major characteristics of CCN / NDN architectures, such as multicasting, caching, flow balance, etc. Simulations demonstrate that path labels are consistent with ICN control plane routing state in the presence of route updates. Analysis of ICN Path Switching with regards to Multiprotocol Label Switching (MPLS) and Segment Routing architectures suggests that it offers similar advantages at lower complexity with the potential to simplify network operations.
{"title":"Path switching in content centric and named data networks","authors":"I. Moiseenko, D. Oran","doi":"10.1145/3125719.3125721","DOIUrl":"https://doi.org/10.1145/3125719.3125721","url":null,"abstract":"ICN communication is inherently multipath and potentially multi-destination. Content Centric and Named Data Networks at present do not offer a mechanism to direct traffic onto a specific path in multipath or a specific destination in a multi-destination environment, because the forwarding plane multiplexes packets across nexthops dynamically. This makes it challenging to provide practical multipath traceroute and ping applications, or implement multipath-aware congestion control, traffic engineering or SDN solutions. The symmetry of forward and reverse paths in Content Centric and Named Data Networks allows one to compute an end-to-end path label in a Data message on the reverse path and subsequently use this label to forward an Interest message through a specific nexthop. ICN Path Switching is a method of high-speed Interest forwarding in Content Centric and Named Data networks based on exact matching of a nexthop label retrieved from the Interest's path label against a nexthop ID in the ICN Forwarder's Adjacency database. ICN Path Switching maintains all major characteristics of CCN / NDN architectures, such as multicasting, caching, flow balance, etc. Simulations demonstrate that path labels are consistent with ICN control plane routing state in the presence of route updates. Analysis of ICN Path Switching with regards to Multiprotocol Label Switching (MPLS) and Segment Routing architectures suggests that it offers similar advantages at lower complexity with the potential to simplify network operations.","PeriodicalId":394653,"journal":{"name":"Proceedings of the 4th ACM Conference on Information-Centric Networking","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123203744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Proactive caching can be a key enabler for reducing the latency of retrieving predictable content requests, alleviating backhaul traffic and mitigating latency caused by handovers. In mobile networks, proactive caching relies on mobility prediction to locate the mobile device's next location and hence the node that must prefetch the content. Previously proposed proactive caching strategies use edge caching exclusively and cache redundant copies on multiple edge nodes to address prediction uncertainty. In this paper, we present a proactive caching strategy that leverages ICN's flexibility of caching data anywhere in the network, rather than just at the edge, like conventional content delivery networks. The main contribution of the paper is to use entropy to measure mobility prediction uncertainty and locate the best prefetching node, thus eliminating redundancy. While prefetching at levels higher in the network hierarchy incurs higher delays than at the edge, our evaluation results show that the increase in latency does not negate the performance gains of proactive caching. Moreover, the gains are amplified by the reduction in server load and cache redundancy achieved.
{"title":"Proactive caching with mobility prediction under uncertainty in information-centric networks","authors":"Noor Abani, T. Braun, M. Gerla","doi":"10.1145/3125719.3125728","DOIUrl":"https://doi.org/10.1145/3125719.3125728","url":null,"abstract":"Proactive caching can be a key enabler for reducing the latency of retrieving predictable content requests, alleviating backhaul traffic and mitigating latency caused by handovers. In mobile networks, proactive caching relies on mobility prediction to locate the mobile device's next location and hence the node that must prefetch the content. Previously proposed proactive caching strategies use edge caching exclusively and cache redundant copies on multiple edge nodes to address prediction uncertainty. In this paper, we present a proactive caching strategy that leverages ICN's flexibility of caching data anywhere in the network, rather than just at the edge, like conventional content delivery networks. The main contribution of the paper is to use entropy to measure mobility prediction uncertainty and locate the best prefetching node, thus eliminating redundancy. While prefetching at levels higher in the network hierarchy incurs higher delays than at the edge, our evaluation results show that the increase in latency does not negate the performance gains of proactive caching. Moreover, the gains are amplified by the reduction in server load and cache redundancy achieved.","PeriodicalId":394653,"journal":{"name":"Proceedings of the 4th ACM Conference on Information-Centric Networking","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123341393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the past, the Information-centric networking (ICN) community has focused on issues mainly pertaining to traditional content delivery (e.g., routing and forwarding scalability, congestion control and in-network caching). However, to keep up with future Internet architectural trends the wider area of future Internet paradigms, there is a pressing need to support edge/fog computing environments, where cloud functionality is available more proximate to where the data is generated and needs processing. With this goal in mind, we propose Named Function as a Service (NFaaS), a framework that extends the Named Data Networking architecture to support in-network function execution. In contrast to existing works, NFaaSbuilds on very lightweight VMs and allows for dynamic execution of custom code. Functions can be downloaded and run by any node in the network. Functions can move between nodes according to user demand, making resolution of moving functions a first-class challenge. NFaaSincludes a Kernel Store component, which is responsible not only for storing functions, but also for making decisions on which functions to run locally. NFaaSincludes a routing protocol and a number of forwarding strategies to deploy and dynamically migrate functions within the network. We validate our design through extensive simulations, which show that delay-sensitive functions are deployed closer to the edge, while less delay-sensitive ones closer to the core.
{"title":"NFaaS: named function as a service","authors":"M. Król, I. Psaras","doi":"10.1145/3125719.3125727","DOIUrl":"https://doi.org/10.1145/3125719.3125727","url":null,"abstract":"In the past, the Information-centric networking (ICN) community has focused on issues mainly pertaining to traditional content delivery (e.g., routing and forwarding scalability, congestion control and in-network caching). However, to keep up with future Internet architectural trends the wider area of future Internet paradigms, there is a pressing need to support edge/fog computing environments, where cloud functionality is available more proximate to where the data is generated and needs processing. With this goal in mind, we propose Named Function as a Service (NFaaS), a framework that extends the Named Data Networking architecture to support in-network function execution. In contrast to existing works, NFaaSbuilds on very lightweight VMs and allows for dynamic execution of custom code. Functions can be downloaded and run by any node in the network. Functions can move between nodes according to user demand, making resolution of moving functions a first-class challenge. NFaaSincludes a Kernel Store component, which is responsible not only for storing functions, but also for making decisions on which functions to run locally. NFaaSincludes a routing protocol and a number of forwarding strategies to deploy and dynamically migrate functions within the network. We validate our design through extensive simulations, which show that delay-sensitive functions are deployed closer to the edge, while less delay-sensitive ones closer to the core.","PeriodicalId":394653,"journal":{"name":"Proceedings of the 4th ACM Conference on Information-Centric Networking","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126814673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 4th ACM Conference on Information-Centric Networking","authors":"","doi":"10.1145/3125719","DOIUrl":"https://doi.org/10.1145/3125719","url":null,"abstract":"","PeriodicalId":394653,"journal":{"name":"Proceedings of the 4th ACM Conference on Information-Centric Networking","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116415810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：