Analysis of Time-Varying Characteristics of Internet End-to-End Network Delay

Accurate knowledge of network topology is vital for network monitoring and management. Network tomography can probe the underlying topologies of the intervening networks solely by sending and receiving packets between end hosts: the performance correlations of the end-to-end paths between each pair of end hosts can be mapped to the lengths of their shared paths, which could be further used to identify the interior nodes and links. However, such performance correlations are usually heavily affected by the time-varying cross-traffic, making it hard to keep the estimated lengths consistent during different measurement periods, i.e., once inconsistent measurements are collected, a biased inference of the network topology then will be yielded. In this paper, we prove conditions under which it is sufficient to identify the network topology accurately against the time-varying cross-traffic. Our insight is that even though the estimated length of the shared path between two paths might be “zoomed in or out” by the cross-traffic, the network topology can still be recovered faithfully as long as we obtain the relative lengths of the shared paths between any three paths accurately.

Download Full-text

End-to-End Network Delay-Constrained for QoS Multicast Routing

2009 First International Conference on Networks & Communications ◽

10.1109/netcom.2009.50 ◽

2009 ◽

Author(s):

S.P. Balakannan ◽

Yier Yan ◽

Jae Seung Yang ◽

Moon Ho Lee

Keyword(s):

Multicast Routing ◽

Network Delay ◽

End To End

Download Full-text

Experiential Learning of Networking Technologies: Understanding Network Delays

10.34048/2017.3.f3 ◽

2017 ◽

Author(s):

Ram P. Rustagi ◽

Viraj Kumar

Keyword(s):

Experiential Learning ◽

Web Page ◽

Network Delay ◽

Web Servers ◽

Simple Set ◽

Network Delays ◽

End To End ◽

Networking Technologies ◽

The Moment

We have all experienced a degree of frustration when a web page takes longer than expected to load. The delay between the moment when the user enters a URL (or clicks a link) and when the page contents are finally displayed has two causes: the time needed to fetch the page contents from one or more web servers (known as the end to end network delay) and the time needed to render the content in the browser window (known as the page load time). In this article, we will explore the components of the former delay via a simple set of experiments.

Download Full-text

An ACO-based cross-layer routing algorithm in space-air-ground integrated networks

Peer-to-Peer Networking and Applications ◽

10.1007/s12083-021-01145-y ◽

2021 ◽

Author(s):

Rongping Zheng ◽

Jiaxiang Zhang ◽

Qi Yang

Keyword(s):

Signal To Noise Ratio ◽

Routing Algorithm ◽

Link Quality ◽

Cross Layer ◽

Time Varying ◽

Queuing Delay ◽

Integrated Networks ◽

Channel Information ◽

The Common ◽

End To End

AbstractSpace-air-ground integrated networks (SAGINs) are heterogeneous, self-organizing and time-varying wireless networks providing massive and global connectivity. These three characteristics of SAGINs bring great challenges for routing design. In this paper, the important parameters affecting performance of SAGINs are analyzed, based on which the heterogeneous network framework is described as a vector weighted topology. Instead of a scale, the weighted parameter of the topology is a vector with elements of signal-to-noise ratio (SNR), variation of SNR, end-to-end delay and queuing length. To meet the time-varying requirements, a Wiener predictor is adopted for obtaining the estimated channel information, the expectation of queuing delay is also acquired by modeling the process of packets waiting the transmitting buffer as a M/M/1 queuing system. Considering the Ant Colony Optimization (ACO) algorithm sharing the common decentralized feature with routing algorithm in SAGINs, a novel ACO-based cross-layer routing algorithm for SAGINs is proposed. The proposed algorithm takes the link quality and end-to-end packed delay in the physical layer as deciding factors in searching for optimal routing. Simulations performed in different scenarios show that this proposed algorithm demonstrates a higher packet delivery rate.

Download Full-text

Network Delay Tomography from End-to-End Unicast Measurements

Lecture Notes in Computer Science - Evolutionary Trends of the Internet ◽

10.1007/3-540-45400-4_37 ◽

2007 ◽

pp. 576-595 ◽

Cited By ~ 36

Author(s):

N. G. Duffield1 ◽

J. Horowitz ◽

F. Presti ◽

D. Towsley

Keyword(s):

Network Delay ◽

End To End

Download Full-text

H∞ Control for LPV Discrete Systems with Random Time-Varying Network Delay

Mathematical Problems in Engineering ◽

10.1155/2018/9095014 ◽

2018 ◽

Vol 2018 ◽

pp. 1-9

Author(s):

Kewang Huang ◽

Tao Ma ◽

Feng Pan

Keyword(s):

Linear Matrix Inequalities ◽

Sufficient Conditions ◽

Lyapunov Stability Theory ◽

Discrete Systems ◽

Performance Criterion ◽

Random Time ◽

Linear Matrix ◽

Time Varying ◽

Matrix Inequalities ◽

Network Delay

In this paper, we study the H∞ control problem for Linear Parameter Varying (LPV) discrete systems with random time-varying network delay. The state matrices of LPV discrete systems are deterministic functions and changed with parameters; the range of parameters is measurable. Considering the characteristics of networks with random time-varying delay, we proposed a new parameter-dependent H∞ performance criterion based on the Lyapunov stability theory. The coupling between Lyapunov functions and system matrices could be eliminated by introducing an additional matrix in this criterion, which made it easier for numerical implementation. On this basis, we designed a state feedback controller by virtue of linear matrix inequalities, which transformed the sufficient conditions into existence condition of solution of parametric linear matrix inequalities. The designed controller could keep the closed-loop system asymptotically stable under given time delay and probability and meet predefined performance metric. The validity of the proposed method is verified by numerical simulation.

Download Full-text