Key Laboratory of Broadband Optical Fiber Transmission and Communication Network

Chengdu, China

Key Laboratory of Broadband Optical Fiber Transmission and Communication Network

Chengdu, China
SEARCH FILTERS
Time filter
Source Type

Duan J.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network | Wang X.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network | Wang S.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network | Xu S.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network
China Communications | Year: 2015

Publish/subscribe (pub/sub) paradigm is the main communication model for Information-Centric Network (ICN) proposals. A key issue for pub/sub system is how to route the content objects to the correct subscribers, and ICN is no exception. ICN network would be divided into core domain and many edge domains as today's internet does. HHR (Hierarchy Hybrid Routing scheme) is presented for ICN: A Chord-like routing scheme is used in core domain, while edge domains routing structure can be classified into three categories, Local Routing (LR), Delivery of Local Publication to Core domain (DLPC), and Remote Publication Routing into edge domain (RPR). LR can be decided by each edge domain, which determined by many factors, such as locality characteristic for pub/sub information and local policies. A hierarchical routing algorithm is proposed to solve DLPC and RPR simultaneously. Simulation results demonstrate that HHR can be fast deployed, and can be applied in large scale network or dynamic subscription environment. © 2013 IEEE.


Duan J.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network | Wang X.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network | Wang S.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network | Xu S.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network
Proceedings - 2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing, DASC 2013 | Year: 2013

In-network caching as one of the primary components for ICN (information-centric network) has attracted more and more attentions. In this paper, we present a profit-based caching for ICN. The profit value for the content arriving on a router is determined by request popularity, distance to content source, content size and content duration, etc. The content duration is considered as an important factor in methodology to avoid the error caused by storing the overdue contents, which is the main difference from existing caching scheme. A 0-1 ILP (integer linear programming) is used to formulate whether to cache the coming content or not and eviction objects simultaneously. Also, a near-optimal heuristic algorithm is proposed to find profit-efficient cache decision, which can be quickly deployed. The analytical and simulation results show our profit-based caching scheme can attain a better network profit compare to Least Frequently used (LFU), and totally avoids caching withdrawing contents. © 2013 IEEE.


Duan J.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network | Wang X.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network | Wang S.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network | Xu S.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Network
Proceedings - 17th IEEE International Conference on Computational Science and Engineering, CSE 2014, Jointly with 13th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2014, 13th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2014 and 8th International Conference on Frontier of Computer Science and Technology, FCST 2014 | Year: 2015

In-network caching as a fundamental characteristic of ICN has been paid more attentions. How to cache is an important problem should to be answered by ICN designers and ISPs. Our argument is how to program a better cache placement within a funds limit. That is, an Internet Service Provider (ISP) wants to invest on deploying some cache equipment on the ICN router to improve the network performance. A mathematical model is built to describe the following problems simultaneously: cache type, cache location and cache capacity. And then a heuristic algorithm is presented: an Integer Linear Programming (ILP) is used for helping to achieve initial solution, while interlayer iterative adjustment algorithm is proposed to meet the funds constraint and reduce latency. Simulation results shows that our algorithm can improve the network performance effectively, which is practical for ISP. © 2014 IEEE.

Loading Key Laboratory of Broadband Optical Fiber Transmission and Communication Network collaborators
Loading Key Laboratory of Broadband Optical Fiber Transmission and Communication Network collaborators