Recently, Internet energy efficiency is paid more and more attention. New Internet architectures with more energy efficiency were proposed to promote the scalability in energy consumption. The eontent-eentrie networking （CCN） proposed a content-centric paradigm which was proven to have higher energy efficiency. Based on the energy optimization model of CCN with in-network caching, the authors derive expressions to tradeoff the caching energy and the transport energy, and then design a new energy efficiency cache scheme based on virtual round trip time （EV） in CCN. Simulation results show that the EV scheme is better than the least recently used （LRU） and popularity based cache policies on the network average energy consumption, and its average hop is also much better than LRU policy.
WANG Guo-qingHUANG TaoLIU JiangXIE Ren-chaoLIU Yun-jie
Service-oriented future internet architecture（SOFIA） is a clean-slate network architecture. In SOFIA, a service request is mainly processed through service resolution and network resource allocation. To realize the network resource allocation, we reference the idea of network virtualization and propose resource scheduling virtualization. In resource scheduling virtualization, a service request is abstracted as a virtual network（VN） and the network resources are allocated by mapping the VN onto the physical network. Resource scheduling virtualization provides centralized resource scheduling control within an autonomous system（AS） and achieves better controllability compared with the distributed schemes. Besides, resource scheduling virtualization supports multi-site selection as well. Meanwhile, we propose a collection of resource scheduling algorithms based on maximum resource tree（MRT） adapting to different scenarios. According to the simulation results, the proposed algorithms show good performance on the key metrics, such as acceptance ratio, revenue, cost and utilization. Moreover, the simulation results reveal that our algorithm is more efficient than the traditional ones.
The virtual network embedding/mapping problem is a core issue of the network virtualization. It＇s mainly concerned with how to map virtual network requests to the substrate network efficiently. Previous researches mainly focus on developing heuristic algorithms for general topology virtual network request. In this paper, we propose a new algorithm for the hub-and-spoke （HAS） topology virtual request. The characters of the HAS topology are exploited to develop the new algorithm. The simulation results show that the new algorithm greatly enhances the performance of revenue/cost （R/C） ratio while the HAS topology request arrives.
Information-centric networking （ICN） proposes a content-centric paradigm which has some attractive advantages, such as network load reduction, low dissemination latency, and energy efficiency. In this paper, based on the analytical model of ICN with receiver-driven transport protocol employing least-recently used （LRU） replacement policy, we derive expressions to compute the average content delivery time of the requests＇ arrival sequence of a single cache, and then we extend the expressions to a cascade of caches＇ scenario. From the expressions, we know the quantitative relationship among the delivery time, cache size and bandwidth. Our results, analyzing the trade-offs between performance and resources in ICN, can be used as a guide to design ICN and to evaluation its performance.
WANG Guo-qingHUANG TaoLIU JiangCHEN Jian-yaLIU Yun-jie
Content center networking （CCN） is one of the most promising future network architectures. Current researches on CCN routing scheme mainly focus on finding the best single routing path, which may induce to low usage of the in-network caches. In order to overcome this problem, a reverse trace routing （RTR） scheme is proposed in this paper, in which Interest packet is sent to the edge-cache along with the reverse trace of the corresponding former Data packet. By doing this, the Interest packets will have better chances to be routed to the promising in-network caches before reaching the source server, which could increase the in-network hit rate, while decrease the server stress. The simulation results show clearly that the RTR scheme decreases the source server load, while reducing the mean hops of entire data retrieval process under certain circumstances.
One of the key research fields of content-centric networking （CCN） is to develop more efficient cache replacement policies to improve the hit ratio of CCN in-network caching. However, most of existing cache strategies designed mainly based on the time or frequency of content access, can not properly deal with the problem of the dynamicity of content popularity in the network. In this paper, we propose a fast convergence caching replacement algorithm based on dynamic classification method for CCN, named as FCDC. It develops a dynamic classification method to reduce the time complexity of cache inquiry, which achieves a higher caching hit rate in comparison to random classification method under dynamic change of content popularity. Meanwhile, in order to relieve the influence brought about by dynamic content popularity, it designs a weighting function to speed up cache hit rate convergence in the CCN router. Experimental results show that the proposed scheme outperforms the replacement policies related to least recently used （LRU） and recent usage frequency （RUF） in cache hit rate and resiliency when content popularity in the network varies.
