End-to-end routing behavior in the Internet
IEEE/ACM Transactions on Networking (TON)
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Time Series Models for Internet Data Traffic
LCN '99 Proceedings of the 24th Annual IEEE Conference on Local Computer Networks
Scalable Link-State Internet Routing
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Performance Analysis of Communications Networks and Systems
Performance Analysis of Communications Networks and Systems
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
Time series models for internet traffic
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
Tree-based link-state routing in the presence of routing information corruption
Computer Communications
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
Long-term forecasting of Internet backbone traffic
IEEE Transactions on Neural Networks
A simple automata based model for stable routing in dynamic ad hoc networks
Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
| Hi-index | 0.00 |
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information, and in wireless ad hoc networking, signal strength fluctuations complicate the choice of stable paths. In this paper we will focus on the stability of paths in a network with dynamically changing link weights. The level of path stability has a direct relation to the number of updates that are necessary to maintain an accurate view of the network state. If a small change in the network state does not affect the shortest path, then such a change need not be distributed throughout the network. We evaluate path stability by adding noise and observing the change in paths.