Data networks
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Effective bandwidths at multi-class queues
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Introduction to Algorithms
Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
Formulation of the Traffic Engineering Problems in MPLS Based IP Networks
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
IEEE/ACM Transactions on Networking (TON)
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Simplification of network dynamics in large systems
IEEE/ACM Transactions on Networking (TON)
Building reliable MPLS networks using a path protection mechanism
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Statistical multiplexing of multiple time-scale Markov streams
IEEE Journal on Selected Areas in Communications
Resource management in wide-area ATM networks using effective bandwidths
IEEE Journal on Selected Areas in Communications
Effective bandwidth in high-speed digital networks
IEEE Journal on Selected Areas in Communications
Admission control for statistical QoS: theory and practice
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
This paper presents a methodology for protecting low-priority best-effort (BE) traffic in a network domain that provides both virtual-circuit routing with bandwidth reservation for QoS traffic and datagram routing for BE traffic. When a QoS virtual circuit is established, bandwidths amounting to the traffic's effective bandwidths are reserved along the links. We formulate a new QoS-virtual-circuit admission control and routing policy that sustains a minimum level of BE performance. In response to a QoS connection request, the policy executes a two-stage optimization. The first stage seeks a minimum-net-effective-bandwidth reservation path that satisfies a BE protecting constraint; the second stage is a tie-breaking rule, selecting from tied paths one that least disturbs BE traffic. Our novel policy implementation efficiently executes both optimization stages simultaneously by a single run of Dijkstra's algorithm. According to simulation results, within a practical operating range, the consideration that our proposed policy gives to the BE service does not increase the blocking probability of a QoS connection request.