On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
On the relevance of long-range dependence in network traffic
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Why we don't know how to simulate the Internet
Proceedings of the 29th conference on Winter simulation
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Time Series Analysis, Forecasting and Control
Time Series Analysis, Forecasting and Control
An effective randomized QoS routing algorithm on networks with inaccurate parameters
Journal of Computer Science and Technology
ICCC '02 Proceedings of the 15th international conference on Computer communication
Distributed QoS Routing with Imprecise State Information
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Dynamic Routing of Real-Time Virtual Circuits
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
Multicast routing for real-time communication of high-speed networks
Multicast routing for real-time communication of high-speed networks
Efficient dynamic routing in wide-area networks
Efficient dynamic routing in wide-area networks
A new path selection algorithm for MPLS networks based on available bandwidth estimation
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The deployment of communication-intensive, real-time multimedia applications on the Internet presents challenges to network routing, as these applications often demand more bandwidth and are less tolerant to delay, delay jitter and loss than traditional data applications. The current best-effort service cannot satisfy such Quality-of-Service (QoS) requirements. Recent studies have shown that QoS routing can provide increased network utilization and balance the network load, with the prerequisite that up-to-date link state information is available for routing decisions. Considering the dynamic nature of networks, this requirement is difficult to fulfil in practice. To improve dynamic routing performance without introducing additional link state update overhead, a link state update policy based on the prediction of link utilization is proposed. The results of statistical analysis and network simulation are presented. The statistical analysis finds that a time-series of mean available bandwidth (mABW) is predictable within certain limits. The prediction approach is shown in simulations of representative networks to offer substantial performance improvements when using periodic updates and also improvements for triggered updates with hold-down timer. A reduction in signalling failures and the effective link state update rate is indicated for a range of circumstances without reduction in routing performance.