On the treeness of internet latency and bandwidth
Existing empirical studies of Internet structure and path properties indicate that the Internet is
tree-like. This work quantifies the degree to which at least two important Internet measures …
tree-like. This work quantifies the degree to which at least two important Internet measures …
Estimating hop distance between arbitrary host pairs
Establishing a clear and timely picture of Internet topology is complicated by many factors
including the vast size and dynamic nature of the infrastructure. In this paper, we describe a …
including the vast size and dynamic nature of the infrastructure. In this paper, we describe a …
A general scalable and accurate decentralized level monitoring method for large-scale dynamic service provision in hybrid clouds
Hybrid cloud computing combines private clouds with geographically-distributed resources
from public clouds, desktop grids or in-house gateways to provide the most flexibility of each …
from public clouds, desktop grids or in-house gateways to provide the most flexibility of each …
Self-stabilized distributed network distance prediction
Y Fu, X ** - IEEE/ACM Transactions On Networking, 2016 - ieeexplore.ieee.org
The network distance service obtains the network latency among large-scale nodes. With
increasing numbers of participating nodes, the network distance service has to balance the …
increasing numbers of participating nodes, the network distance service has to balance the …
Fast trust computation in online social networks
SU Nasir, TH Kim - IEICE transactions on communications, 2013 - search.ieice.org
Computing the level of trust between two indirectly connected users in an online social
network (OSN) is a problem that has received considerable attention of researchers in …
network (OSN) is a problem that has received considerable attention of researchers in …
MD-AVB: A multi-manifold based available bandwidth prediction algorithm
P Zhang, C An, Z Wang, F Ma - Tsinghua Science and …, 2019 - ieeexplore.ieee.org
The performance of Internet applications is heavily affected by the end-to-end available
bandwidth. Thus, it is very important to examine how to accurately predict the available …
bandwidth. Thus, it is very important to examine how to accurately predict the available …
[PDF][PDF] Quantitative Analysis of the Correlation of Round-Trip Times between Network Nodes
N Zhu, J He, Y Zhou, W Wang - International Journal of Future Generation …, 2013 - Citeseer
Round-trip time (RTT) is defined as the round-trip delay of a data packet between a source
and a destination node and is a very important metric for measuring the performance of …
and a destination node and is a very important metric for measuring the performance of …
[PDF][PDF] PNDP: predicting accurate network distance based on clustering
L **ao-Yong, W Yi-Jie, F Yong-Quan… - Information-An …, 2012 - yongquanf.github.io
Network distance prediction is important in many emerging applications, such as proximity-
aware content redirection in CDNs and matchmaking in network games. Network coordinate …
aware content redirection in CDNs and matchmaking in network games. Network coordinate …
Dimension Reduction of Network Bottleneck Bandwidth Data Space
The network proximity metrics, such as bottleneck bandwidth and round-trip time, are very
useful in different network applications. The round-trip-time prediction has been studied …
useful in different network applications. The round-trip-time prediction has been studied …
Large scale platform: Instantiable models and algorithmic design of communication schemes
P Uznanski - 2013 - theses.hal.science
The increasing popularity of Internet bandwidth-intensive applications prompts us to
consider followingproblem: How to compute efficient collective communication schemes on …
consider followingproblem: How to compute efficient collective communication schemes on …