End-to-end available bandwidth as a random autocorrelated QoS-relevant time-series

Alexander Chobanyan; Matt Mutka; Vidiadhar Mandrekar; Ning Xi

doi:10.1016/j.comnet.2008.01.009

End-to-end available bandwidth as a random autocorrelated QoS-relevant time-series

Computer Networks ◽

10.1016/j.comnet.2008.01.009 ◽

2008 ◽

Vol 52 (6) ◽

pp. 1220-1237 ◽

Cited By ~ 4

Author(s):

Alexander Chobanyan ◽

Matt Mutka ◽

Vidiadhar Mandrekar ◽

Ning Xi

Keyword(s):

Time Series ◽

Available Bandwidth ◽

End To End

Download Full-text

Real-Time Measurement of End-to-End Available Bandwidth using Kalman Filtering

2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006 ◽

10.1109/noms.2006.1687540 ◽

2006 ◽

Cited By ~ 60

Author(s):

S. Ekelin ◽

M. Nilsson ◽

E. Hartikainen ◽

A. Johnsson ◽

J.-E. Mangs ◽

...

Keyword(s):

Real Time ◽

Kalman Filtering ◽

Time Measurement ◽

Available Bandwidth ◽

Real Time Measurement ◽

End To End

Download Full-text

A Comparative Study of End-To-End Discriminative Deep Learning Models for Knee Joint Kinematic Time Series Classification

2019 IEEE Signal Processing in Medicine and Biology Symposium (SPMB) ◽

10.1109/spmb47826.2019.9037831 ◽

2019 ◽

Author(s):

M. Abid ◽

A. Mitiche ◽

Y. Ouakrim ◽

P. A. Vendittoli ◽

A. Fuentes ◽

...

Keyword(s):

Time Series ◽

Deep Learning ◽

Knee Joint ◽

Comparative Study ◽

Time Series Classification ◽

Learning Models ◽

Joint Kinematic ◽

End To End

Download Full-text

Estimating End-to-End Available Bandwidth with Single End Host

Lecture Notes in Electrical Engineering - Advances in Electrical Engineering and Electrical Machines ◽

10.1007/978-3-642-25905-0_56 ◽

2011 ◽

pp. 425-432

Author(s):

Hui Zhou ◽

Wencai Du

Keyword(s):

Available Bandwidth ◽

End To End

Download Full-text

An End to End Real Time Architecture for Analyzing and Clustering Time Series Data: Case of an Energy Management System

2018 6th International Renewable and Sustainable Energy Conference (IRSEC) ◽

10.1109/irsec.2018.8702839 ◽

2018 ◽

Cited By ~ 4

Author(s):

Hanaa Talei ◽

Mohamed Essaaidi ◽

Driss Benhaddou

Keyword(s):

Time Series ◽

Real Time ◽

Energy Management ◽

Management System ◽

Time Series Data ◽

Series Data ◽

Energy Management System ◽

End To End

Download Full-text

Estimation of End-to-End Available Bandwidth and Link Capacity in SDN

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering - Ubiquitous Communications and Network Computing ◽

10.1007/978-3-319-73423-1_12 ◽

2017 ◽

pp. 130-141

Author(s):

Manmeet Singh ◽

Nitin Varyani ◽

Jobanpreet Singh ◽

K. Haribabu

Keyword(s):

Link Capacity ◽

Available Bandwidth ◽

End To End

Download Full-text

On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints

International Journal of Foundations of Computer Science ◽

10.1142/s0129054103001868 ◽

2003 ◽

Vol 14 (03) ◽

pp. 503-523 ◽

Cited By ~ 9

Author(s):

William C. Grimmell ◽

Nageswara S. V. Rao

Keyword(s):

Piecewise Constant Function ◽

Circuit Switching ◽

Available Bandwidth ◽

Piecewise Constant ◽

Quickest Path ◽

End To End Delay ◽

Propagation Delays ◽

Routing Mechanism ◽

End To End ◽

Dynamic Bandwidth

Routing in the newer generation of network transmission methods may be performed at various levels of the IP stack such as datagram, TCP stream, and application levels. It is important in the use of these methods to compute the routes that minimize the end-to-end delays for the specific routing mechanism. We formulate an abstract network path computation problem, the dynamic quickest path problem, to encompass a number of message forwarding mechanisms including circuit switching, Internet Protocol, and their variations. This problem deals with the transmission of a message from a source to a destination with the minimum end-to-end delay over a network with propagation delays and dynamic bandwidth constraints on the links. The available bandwidth for each link is specified as a piecewise constant function. We present for each message forwarding mechanism or mode an algorithm to compute a path with the minimum end-to-end delay for a given message size. Our algorithms with suitable network restrictions have polynomial time complexity in the size of the network and total number of segments in the bandwidth list.

Download Full-text