With current efforts to design Future Internet Architectures (FIAs), the evaluation and comparison of different proposals is an interesting research challenge. Previously, metrics such as bandwidth or latency have commonly been used to compare FIAs to IP networks. We suggest the use of power consumption as a metric to compare FIAs. While low power consumption is an important goal in its own right (as lower energy use translates to smaller environmental impact as well as lower operating costs), power consumption can also serve as a proxy for other metrics such as bandwidth and processor load. Lacking power consumption statistics about either commodity FIA routers or widely deployed FIA testbeds, we propose models for power consumption of FIA routers. Based on our models, we simulate scenarios for measuring power consumption of content delivery in different FIAs. Specifically, we address two questions: 1) which of the proposed FIA candidates achieves the lowest energy footprint; and 2) which set of design choices yields a power-efficient network architecture? Although the lack of real-world data makes numerous assumptions necessary for our analysis, we explore the uncertainty of our calculations through sensitivity analysis of input parameters.
Previous work mainly focuses on the evaluation of content-centric networks (CCNs) or on the evaluation of specific CCN subsystems. Fricker al @cite_10 evaluate the caching performance of CCNs under the influence of network traffic compositions. Muscariello, Carofiglio and Gallo @cite_12 evaluate the performance of bandwidth and shared storage in CCN designs. Fayazbakhsh al @cite_14 use network latency, network congestion and origin server load to compare different caching strategies in CCNs. Perino and Varvello @cite_31 use router throughput, monetary costs, and energy efficiency to estimate the feasibility of deployment of CCN routers. The main objective of our work is not limited to the exploration of power consumption of each individual FIA. Rather, we concentrate on presenting an evaluation framework to explore the power implications of adopted FIA design principles. The results obtained herein can help guide designers toward power-efficient network designs.
@cite_31 @cite_14 @cite_10 @cite_12
2590898937 2313059177 1985355206 1996673765
The fast-growing Internet traffic is increasingly becoming content-based and driven by mobile users, with users more interested in data rather than its source. This has precipitated the need for an information-centric Internet architecture. Research in information-centric networks (ICNs) have resulted in novel architectures, e.g., CCN NDN, DONA, and PSIRP PURSUIT; all agree on named data based addressing and pervasive caching as integral design components. With network-wide content caching, enforcement of content access control policies become non-trivial. Each caching node in the network needs to enforce access control policies with the help of the content provider. This becomes inefficient and prone to unbounded latencies especially during provider outages. In this paper, we propose an efficient access control framework for ICN, which allows legitimate users to access and use the cached content directly, and does not require verification authentication by an online provider authentication server or the content serving router. This framework would help reduce the impact of system down-time from server outages and reduce delivery latency by leveraging caching while guaranteeing access only to legitimate users. Experimental simulation results demonstrate the suitability of this scheme for all users, but particularly for mobile users, especially in terms of the security and latency overheads. Caching scheme will change the original feature of the network in Content Centric Networking (CCN). So it becomes a challenge to describe the caching node importance according to network traffic and user behavior. In this work, a new metric named Request Influence Degree (RID) is defined to reflect the degree of node importance. Then the caching performance of CCN has been addressed with specially focusing on the size of individual CCN router caches. Finally, a newly content store space heterogeneous allocation scheme based on the metric RID across the CCN network has been proposed. Numerical experiments reveal that the new scheme can decrease the routing stretch and the source server load contrasting that of the homogeneous assignment and several graph-related centrality metrics allocations. In this work, we study the caching performance of Content Centric Networking (CCN), with special emphasis on the size of individual CCN router caches. Specifically, we consider several graph-related centrality metrics (e.g., betweenness, closeness, stress, graph, eccentricity and degree centralities) to allocate content store space heterogeneously across the CCN network, and contrast the performance to that of an homogeneous allocation. Content Centric Networking (CCN) performance by definition depends on the in-network caching efficiency. We propose CodingCache which utilizes network coding and random forwarding to improve caching efficiency under multipath forwarding. Its advantage is that existing caching strategies can be easily incorporated with it for better performance. We evaluate CodingCache by extensive simulation experiments with the China Telecom network topology and a unique dataset consisting of video access logs from the PPTV system. The results demonstrate that compared with the CCN caching strategy, CodingCache improves the cache hit rate by about 60 .