Congested link inference algorithms in dynamic routing IP network
Summary: The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB) network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP) and Rest Bayesian Network Model (RBNM), we proposed an Improved CLINK (ICLINK) algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient) to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.
- scientific article; zbMATH DE number 2247706
- Routing control in IP-networks with the variable performance criterion
- Structure varied discrete dynamic Bayesian network and its inference algorithm
- Network congestion control with Markovian multipath routing
- Model of a frame of dynamic routing and its equilibrium
- scientific article; zbMATH DE number 472960 (Why is no real title available?)
- Network Tomography of Binary Network Performance Characteristics
- Network tomography: a review and recent developments
- Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
- Structure varied discrete dynamic Bayesian network and its inference algorithm
This page was built for publication: Congested link inference algorithms in dynamic routing IP network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992970)
