Search 250 million research papers

network delay

SpringerReference · 2011

Cited by 1

Network delay tomography

Yolanda Tsang, Mark Coates, Robert D. Nowak · IEEE Transactions on Signal Processing · 2003

The substantial overhead of performing internal network monitoring motivates techniques for inferring spatially localized information about performance using only end-to-end measurements. In this paper, we present a novel methodology for inferring the queuing delay distributions across internal links in the network based solely on unicast, end-to-end measurements. The major contributions are: 1) we formulate a measurement procedure for estimation and localization of delay distribution based on end-to-end packet pairs; 2) we develop a simple way to compute maximum likelihood estimates (MLEs) using the expectation-maximization (EM) algorithm; 3) we develop a new estimation methodology based on recently proposed nonparametric, wavelet-based density estimation method; and 4) we optimize the computational complexity of the EM algorithm by developing a new fast Fourier transform implementation. Realistic network simulations are carried out using network-level simulator ns-2 to demonstrate the accuracy of the estimation procedure.

Cited by 154

Delay Tolerant Network

Bijal P. Patel, Krupa Dave, Vyomal Pandya et al. · 2013

Abstract—There is no complete network from source to destination in intermediately connected mobile networks which is also called as sparse wireless networks. Those types of networks are categorized in delay tolerant networks. Wildlife tracking sensor networks, military networks, interplanetary networks and an exotic media networks are those networks that follow the above paradigm. In this, conventional routing protocol schemes would fail. To understand such type of networks researchers have suggested using flooding based schemes. In flooding based schemes delivery probability is high because they randomly send the request to its entire neighbor and so that they waste a lot of energy and significantly degrades their performance. We introduce different types of routing schemes which is based on flooding strategy.

Cited by 7

Delay Tolerant Network

Adriano Galati · 2010

DTN - Routing Simulation Study: One of the most promising emerging approaches to providing reliable data communication in such environments is Delay/Disruption Tolerant Networkin (DTN). A delay tolerant network is a store and forward network where end-to-end connectivity is not assumed and where opportunistic links between nodes are used to transfer data. This master thesis analyses some routing algorithms applied on a Delay/Disruption Tolerant Network and highlights the main weak points and further parameters that should be taken into account for routing in DTN. We also draw the attention on an homomorphism between the equation of state for gas and our equation of state for mobile ad hoc networks.

Cited by 7

Network Monitoring in Delay Tolerant Network

Alexej Ismailov · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 2015

A Disruption Tolerant Network (DTN) is a sparse network where connectivity is regulated by the proximity of mobile nodes. Connections are sporadic and the delivery rate is closely related to node movement. As network resources often are limited in such settings, it is useful to monitor the network in order to make more efficient communication decisions. This study investigates existing routing protocols and monitoring tools for DTN that best cope with the requirements of a tactical military network. A model is proposed to estimate source to destination delay in DTN. This model is evaluated in a Java-based software simulator called The ONE. In order to match the tactical military environment, two scenarios are constructed. The squad scenario simulates the formation movement pattern of several squads and the hierarchical communication scheme that is maintained in a military context. The other scenario simulates a convoy line movement of a military group during transportation. The results of this study show that the proposed mechanism can improve delivery rate and reduce network overhead in settings with strict buffer limitations. The estimation worked best in scenarios that contained some patterns of movement or communication. These patterns are resembled in the model's collected data and the model can provide the user with rough estimates of end-to-end delays in the network. Primary use of this model has been to reduce number of old messages in the network, but other applications like anomaly detection are also discussed in this work.

Cited by 2Open access

Delay-tolerant network architecture

Group V. Cerf, A. Hooke, L. Torgerson et al. · 2005

This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Copyright Notice

Cited by 0

Delay-Tolerant Network Routing

Yue Cao · 2020

Cited by 0

Hybrid Delay Tolerant Network.

Ilsun You (3545252), Vishal Sharma (1310979), Mohammed Atiquzzaman (3154632) et al. · Figshare · 2016

Cited by 0Open access

Dynamic Network Delay Cartography

Rajawat, Ketan, Dall'Anese, Emiliano, Giannakis, Georgios B. · arXiv (Cornell University) · 2012

Path delays in IP networks are important metrics, required by network operators for assessment, planning, and fault diagnosis. Monitoring delays of all source-destination pairs in a large network is however challenging and wasteful of resources. The present paper advocates a spatio-temporal Kalman filtering approach to construct network-wide delay maps using measurements on only a few paths. The proposed network cartography framework allows efficient tracking and prediction of delays by relying on both topological as well as historical data. Optimal paths for delay measurement are selected in an online fashion by leveraging the notion of submodularity. The resulting predictor is optimal in the class of linear predictors, and outperforms competing alternatives on real-world datasets.

Cited by 0Open access

Delay Tolerant Network Routing

Gomes, Tiago Miguel Vitorino Simões · Estudo Geral (Universidade de Coimbra) · 2020

A warm thank you to all colleagues who have been a part of my 5 years in this department, be it by collaborating in projects, sharing ideas, studying together or, most importantly, sharing fun moments in our free times.Your camaraderie made these years easier and certainly more enjoyable.Particularly, I would like to thank my close friends Artur, Carolina, Guilherme, Leonardo and Pedro for their support and honesty.I know that I can always count on you and that we will stick together.A heartfelt thanks to Mariana for always being able to cheer me up, even in this tough period.You make me a better and happier person.Lastly, but just as importantly, thank you to my parents

Cited by 0Open access

Delay Tolerant Network Routing

Sathya Narayanan · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · 2011

Presented at the Miltary Wireless Communications Conference

Cited by 0Open access

Delay tolerant network Reputation

Gianluca Dini, See Profile, Available From Gianluca Dini et al. · 2011

All in-text\treferences\tunderlined\tin\tblue\tare\tlinked\tto\tpublications\ton\tResearchGate, letting you\taccess\tand\tread\tthem\timmediately.

Cited by 0

Characterizing network processing delay

R. Ramaswamy, Ning Weng, Tilman Wolf · 2005

Computer networks have progressed from a simple store-and-forward medium to a complex communication infrastructure. Routers in the network need to implement a variety of functions ranging from simple packet classification for forwarding and firewalling to complex payload modifications for encryption and content adaptation. As these functions increase in number and complexity, more processing time is required, and packets experience a significant processing delay. In most network simulations, this delay has not been addressed because it was considered negligible. However, we show that this network processing delay can reach the magnitude of long-distance propagation delay and thus becomes a significant contributor to the overall packet delay. We evaluate different network applications and develop a model that characterizes packet processing cost with only a few parameters that can easily be derived from our simulations. To validate our simulation and our model, we compare them to actual network measurements. The contributions of this work can be used to increase the accuracy of network simulations and improve network performance estimations.

Cited by 87

Models of Network Delay

Ronan Wallace, Xabier Garcia Andrade, Pedro Kayser et al. · Contributions to statistics · 2024

Cited by 2

Flexicast network delay tomography.

Earl Lawrence · Deep Blue (University of Michigan) · 2005

This thesis considers the estimation of link delay distributions based on path-level measurements in communications networks. The data are collected by actively probing the network: traffic is injected on the network and travels from one accessible point (source) to a group of accessible points (receivers). We observe the end-to-end path-level delays of the injected traffic. The statistical challenge is to deconvolve the observed end-to-end distributions to estimate the link-level distributions. We consider networks represented by tree-shaped graphs: directed graphs in which each node has a single parent except for the source or root node. The probing is based on the multicast protocol in which observed end-to-end delays at the receivers have common components arising from the delay along the shared path to the receivers. We consider two situations. The first is based on discretized link delay in which the delay is assumed to occur in units of fixed size. For this scenario, we prove a necessary and sufficient condition for identifiability and develop two estimators: the maximum likelihood estimate based on the EM algorithm and a faster algorithm based on solving for local MLEs. The second scenario is based on assuming continuous delay, possible with point masses at zero and infinity. Within this framework, we consider several models both parametric and semiparametric. We develop estimation based on moment matching under squared-error loss. Identifiability conditions and inference properties are discussed. The techniques are applied to simulated data and real data collected as part of a Voice-Over-IP testbed.

Cited by 5

Delay Budget Allocation for Delay-Guaranteed Network Paths

Kartik Gopalan, Tzi-cker Chiueh · 2007

Algorithms for provisioning virtual circuits or virtual private networks with quality of service guarantees typically attempt to optimize the resource usage of the underlying networks. The key technique used is to choose network routes so as to balance the loads on the underlying network's links and routers. Standard routing protocols can be viewed as a restricted instance of such network load balancing techniques. For network paths with delay guarantee, there is a separate dimension along which network resource provision algorithms can optimize to increase resource usage efficiency: end-to-end delay budget allocation along a provisioned path. This paper presents a unified algorithm template for the delay budget allocation problem, and describes its application to unicast and multicast network paths with deterministic and probabilistic delay guarantees. The proposed algorithms are designed for long-term network resource provision, rather than for setting up individual network connections as in QoS routing. A detailed simulation study demonstrates that compared to previous approaches, the proposed delay budget allocation algorithm can indeed substantially increase the total number of network paths that can be provisioned on the same network with the same set of resource provisioning requests.

Cited by 0

Network Delay Model for Overlay Network Application

Jin Tian, Haiyan JIN - · International Journal of Communications Network and System Sciences · 2009

This paper presents a method to model network delay for overlay network application. The network topology measurement technology and network AS information is used to build up model of network delay via AS and geographic distance. Based on global Internet measurement result, we calculated the parameters of the model. Furthermore, the model verification is done by comparing on AS-MMI protocol and HMTP protocol.

Cited by 2Open access

DELAY CONTROL NETWORK CODING TECHNIQUE

Shereen Ali Malek Ahmed Hamato, Sharifah H. S. Ariffin, Norsheila Fisal et al. · Jurnal Teknologi · 2015

Network coding is a technique known to efficiently utilize the bandwidth by exploiting the broadcast nature of the wireless medium. Network coding reduces the number of retransmissions by allowing the relay not only to forward the packets, but to do some logic operation. However, considering the randomness and the asymmetric nature of the traffic in the wireless medium, it is usually very challenging for the relay to predict when the next packet is coming, thus the main question for the relay when receives a packet is whether to hold the packet in order to obtain a network coding opportunity or to rebroadcast the packet directly and eliminate the delay. In this paper, we address this challenge by introducing two schemes; Bandwidth Consideration Scheme (BCS) which considers pure network coding to achieve the maximum improvement in network throughput, and Time Limited Scheme (TLS), which uses the network coding but considers the imposed delay. The results show that, BCS can lead to up to 50% improvement in the bandwidth, however for symmetric flows using pure network coding leads to unbounded delay. On the other hand, TLS noticeably decreases the imposed delay for the symmetric flows and leads to relatively similar improvement in the throughput for asymmetric flows.

Cited by 1Open access

Delay-Tolerant Network Routing Algorithm

Xiao Mingjun and Huang Liusheng · 2009

Cited by 11

Delay Tolerant Network Management Protocol

Vignesh Ramachandran, Edward Birrane · 2014

This draft describes the Delay/Disruption Tolerant Network Management Protocol (DTNMP). The DTNMP provides monitoring and configuration services between managing devices and managed devices, some of which may operate on the far side of high-delay or high-disruption links. The protocol is designed to minimize the number of transmitted bytes, to operate without sessions or (concurrent) two-way links, and to function autonomously when there is no timely contact with a network operator.

Cited by 3