Entity

Time filter

Source Type


Hu X.,Nanjing Southeast University | Hu X.,Jiangsu Provincial Key Laboratory of Computer Network Technology | Gong J.,Nanjing Southeast University | Gong J.,Jiangsu Provincial Key Laboratory of Computer Network Technology
IEICE Transactions on Communications | Year: 2014

As a prominent feature of Named Data Networking (NDN), in-network caching plays an important role in improving the performance of content delivery. However, if each NDN router indiscriminately caches every data packet passing by (i.e., Caching Everything Everywhere (CEE)), the result can be unnecessarily frequent cache replacement and cache redundancy in en-route routers and thus in-network caches are not utilized in an efficient way [1], [2]. Moreover, managing these in-network caches in a centralized way may lead to excessive resource consumption since the number of these caches is considerable. This work proposes a distributed and opportunistic on-path caching scheme. To be specific, each en-route router independently picks content items to cache in such a way that popular content is more likely to be cached by routers, especially routers near users, and cache redundancy is reduced. Extensive simulations including trace-driven ones in a PoP-level ISP topology suggest that the proposed scheme improves the average cache hit ratio of users' requests and reduces the average hop count as compared to CEE and the other on-path caching algorithms considered herein. Copyright © 2014 The Institute of Electronics, Information and Communication Engineers. Source


Hu X.-Y.,Nanjing Southeast University | Hu X.-Y.,Jiangsu Provincial Key Laboratory of Computer Network Technology | Hu X.-Y.,A+ Network | Gong J.,Nanjing Southeast University | And 2 more authors.
Tongxin Xuebao/Journal on Communications | Year: 2015

To facilitate content retrieval among NDN domains, a multipath inter-domain routing for named data networking (MIRNDN) was proposed. Under MIRNDN, an AS (autonomous system) maintained merely the routing state of content reachable from its own network or from its customers' networks and aggregated routing information to mitigate routing scalability issue; "valley free" routing policy was applied to guide Interest packets that solicit content unreachable from the AS's own network nor from its customers' networks to explore matching data packets via multiple paths, and NDN's requests aggregation, in-network caching and adaptive forwarding optimized such exploration; the reachability information of content from multiple paths was collected to support Interest multipath forwarding. The properties of FIB size and the convergence time and communication cost of routing update under MIRNDN were analyzed in theory. The experimental results in the AS level topology of current Internet validates that MIRNDN mitigates the scalability issue of NDN inter-domain routing, has relative short convergence time and moderate communication cost for routing update, and effectively reduces unnecessary Interest forwarding. ©, 2015, Editorial Board of Journal on Communications. All right reserved. Source


Su Q.,Nanjing Southeast University | Su Q.,Jiangsu Provincial Key Laboratory of Computer Network Technology | Gong J.,Nanjing Southeast University | Gong J.,Jiangsu Provincial Key Laboratory of Computer Network Technology | And 2 more authors.
Ruan Jian Xue Bao/Journal of Software | Year: 2014

Round-Trip time (RTT) is an important metric for network measurement and an essential indicator for network performance monitoring. Traditional packet trace based RTT estimation usually depends on particular active or passive measurement platforms. This paper proposes a new RTT estimation method, which merely takes flow data from existed routers and hardly needs extra network measurement facility. Based on the analysis of transmission features of TCP bulk flow, RTT estimation models are established corresponding to the conditions where socket buffer size and bandwidth delay product (BDP) are relatively small, large and approximate. Experiments show RTT estimation can be well accomplished through those models. Moreover, considering only duration and total packet number of a TCP bulk flow are involved in estimation, this method is also adoptable to situation with sampling flow data as input, and thus is effective in monitoring and managing the large-scale backbone network performance. © Copyright 2014, Institute of Software. the Chinese Academy of Sciences. All rights reserved. Source


Su Q.,Nanjing Southeast University | Su Q.,Jiangsu Provincial Key Laboratory of Computer Network Technology | Gong J.,Nanjing Southeast University | Gong J.,Jiangsu Provincial Key Laboratory of Computer Network Technology | And 2 more authors.
IEICE Transactions on Communications | Year: 2015

Round-trip time (RTT) is an important performance metric. Traditional RTT estimation methods usually depend on the cooperation of other networks and particular active or passive measurement platforms, whose global deployments are costly and difficult. Thus a new RTT estimation algorithm, ME algorithm, is introduced. It can estimate the RTT of two hosts communicating through border routers by using TCP CUBIC bulk flow data from those routhers without the use of extra facilities, which makes the RTT estimation in large-scale high-speed networks more effective. In addition, a simpler and more accurate algorithm - AE algorithm - is presented and used when the link has large bandwidth and low packet loss rate. The two proposed algorithms suit sampled flow data because only duration and total packet number of a TCP CUBIC bulk flow are inputs to their calculations. Experimental results show that both algorithms work excellently in real situations. Moreover, they have the potential to be adapted to other TCP versions with slight modification as their basic idea is independent of the TCP congestion control mechanism. Copyright © 2015 The Institute of Electronics, Information and Communication Engineers. Source

Discover hidden collaborations