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 uncertain parameters
IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
QoS Routing with Incomplete Information by Analog Computing Algorithms
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Profile-Based Routing: A New Framework for MPLS Traffic Engineering
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Distributed QoS Routing with Imprecise State Information
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Research challenges in QoS routing
Computer Communications
Optimizing routing decisions under inaccurate network state information
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
| Hi-index | 0.00 |
In highly dynamic large IP/MPLS networks, when routing information includes not only topology information but also information to provide QoS, such as available link bandwidth, network state databases must be frequently updated. This updating process generates an important signaling overhead. Reducing this overhead implies having inaccurate routing information, which may cause both non-optimal path selection and a call-blocking increase. In order to avoid both effects in this paper we suggest a new QoS explicit routing mechanism called BYPASS Based Routing (BBR), which is based on bypassing those links along the selected path that potentially cannot cope with the traffic requirements. Routing algorithms derived from the proposed BBR mechanism reduce the call-blocking ratio without increasing the amount of routing control information.