Recently,Content-Centric Networking(CCN) has been paid more and more attention.The modeling of CCN as an important research point is the foundation of the architecture.The past work of cache network modeling always assumes the virtual round trip time(VRTT) is zero for simplicity.However,this assumption isn't practical and results in model error especially in CCN.CCN's router can aggregate the content requests during the VRTT to avoid content delivery repeatedly.Thus,to modeling CCN data transfer,as well as understanding how it should be managed,the VRTT shouldn't be ignored.In this paper,we model the data transfer in CCN,and propose a multi-cache with aggregation approximation(MCAA)algorithm to get the content miss rate and VRTT at each router.Simulation results show the validity of our MCAA algorithm.
WANG Guoqing HUANG Tao LIU Jiang CHEN Jianya LIU Yunjie
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 content-centric 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
The low-cost,self-configuration capability and "plug-and-play" feature of Ethernet establishes its dominant position in the local area networks(LAN).However,it is hard to extend to large scale because of the legacy broadcast-based service discovery mechanism.Therefore,to solve this problem,a new split network architecture named Software-Defined Networking(SDN) is introduced in this paper,and a novel floodless service discovery mechanism(FSDM)for SDN is designed.For the FSDM,the widespread broadcast messages for Dynamic Host Configuration Protocol(DHCP) and Address Resolution Protocol(ARP) are considered especially,respectively.Then the DHCP relay and ARP proxy are proposed to handle DHCP broadcast messages and ARP broadcast messages,respectively.The proposed FSDM in this paper can eliminate flooding completely,reserve the autoconfiguration characteristics.Particularly,there is no need to change the existing hardware,software and protocols of hosts for the proposed scheme.Finally,the simulation results are demonstrated to show that our proposed model allows redundant links existed in network and has the property of scalability,which can significantly reduce network traffic in data plane and control traffic in control plane,and decrease the overhead of control plane.
Content-centric networking(CCN) is rising to solve the problems suffered by traditional networks,especially in terms of content delivery.One of the critical issues for basic CCN is supporting mobility.Handoff of Mobile Content Source(MCS) will result in a large scale routing update,which generates huge amount of routing overhead and leads to service interruption.Most of the existing CCN mobility mechanisms are transplanted from the IP mobility solutions,which are unnaturally integrated with CCN.Different from previous works,a mobility strategy from the perspective of CCN architecture is proposed to support the handoff of MCS in this paper.Especially,we define the critical network routers that can limit the routing update scale effectively when MCS handoff is conducted.Based on the defined critical network routers,the proposed scheme can provide lower routing update overhead,faster routing convergence and shorter service interruption time.Finally,series of simulations are conducted to validate the effectiveness of our proposed scheme.
Video streaming,especially hypertext transfer protocol based(HTTP) adaptive streaming(HAS) of video,has been expected to be a dominant application over mobile networks in the near future,which brings huge challenge for the mobile networks.Although some works have been done for video streaming delivery in heterogeneous cellular networks,most of them focus on the video streaming scheduling or the caching strategy design.The problem of joint user association and rate allocation to maximize the system utility while satisfying the requirement of the quality of experience of users is largely ignored.In this paper,the problem of joint user association and rate allocation for HTTP adaptive streaming in heterogeneous cellular networks is studied,we model the optimization problem as a mixed integer programming problem.And to reduce the computational complexity,an optimal rate allocation using the Lagrangian dual method under the assumption of knowing user association for BSs is first solved.Then we use the many-to-one matching model to analyze the user association problem,and the joint user association and rate allocation based on the distributed greedy matching algorithm is proposed.Finally,extensive simulation results are illustrated to demonstrate the performance of the proposed scheme.
Virtual network embedding(VNE) is an essential part of network virtualization, which is considered as one of the most promising way for the future network. Its main object is to efficiently assign the nodes and links of a virtual network(VN) to a shared substrate network(SN). The NP-hard and exiting studies have put forward several heuristic algorithms. However, most of the algorithms only consider the local resource of nodes, such as CPU and bandwidth(BW), to decide the embedding, and ignore the significant impact of network attributes. Based on the attributes of entire network, a model of the connectivity between each pair of nodes was formulated to measure the resource ranking of the nodes, and a new two-stage embedding algorithm was proposed. Thereafter, the node mapping and link mapping can be jointly considered. Extensive simulation shows that the proposed algorithm improves the performance of VNE by increasing the revenue/cost ratio and acceptance ratio of VN requests while reducing the runtime.
