Profile-Based Routing: A New Framework for MPLS Traffic Engineering
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
IEEE Journal on Selected Areas in Communications
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
RSVP: a new resource ReSerVation Protocol
IEEE Network: The Magazine of Global Internetworking
Routing bandwidth-guaranteed paths with restoration in label-switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing demands with time-varying bandwidth profiles on a MPLS network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic online QoS routing schemes: performance and bounds
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Computers
Integrated topology control and routing in wireless optical mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Zone-based congestion detection and control using routing method on the internet
International Journal of High Performance Computing and Networking
Minimum interference optical multicast
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Throughput Maximization with Traffic Profile in Wireless Mesh Network
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Adaptive algorithms for routing and traffic engineering in stochastic networks
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A QoS Framework with Traffic Request in Wireless Mesh Network
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Research challenges in QoS routing
Computer Communications
An open source traffic engineering toolbox
Computer Communications
Stochastic model and analysis for capacity optimization in communication networks
Computer Communications
Dynamic online QoS routing schemes: Performance and bounds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing demands with time-varying bandwidth profiles on a MPLS network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Link estimation methods for routing over FWA mesh network
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Reinforcement learning-based load shared sequential routing
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Wireless mesh network security: A traffic engineering management approach
Journal of Network and Computer Applications
Complexity and design of QoS routing algorithms in wireless mesh networks
Computer Communications
Optimization of bandwidth allocation in communication networks with penalty cost
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Autonomic interference avoidance with extended shortest path algorithm
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
On the performance of dynamic online qos routing schemes
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Energy efficient online routing of flows with additive constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Network and Computer Applications
Hi-index | 0.25 |
We present a new algorithm and framework for dynamic routing of bandwidth-guaranteed flows. The problem is motivated by the need to set up bandwidth-guaranteed paths in carrier and ISP networks dynamically. Traditional routing algorithms such as minimum-hop or widest-path routing do not take advantage of any knowledge about the traffic distribution or ingress-egress pairs, and therefore can often lead to severe network underutilization. Our work is inspired by the recently proposed Minimum Interference Routing Algorithm (MIRA) of Kodialam and Lakshman, but it improves on their approach in several ways. Our main idea is to use a 'traffic profile' of the network, obtained by measurements or service-level agreements as a rough predictor of the future traffic distribution. We use this profile to solve a multi-commodity network flow problem, whose output is used both to guide our online path-selection algorithm as well as to impose admission control. The offline multi-commodity solution seems very effective at distributing the routes and avoiding bottlenecks around hot spots. In particular, our algorithm can anticipate a flow's blocking effect on groups of ingress-egress pairs, whereas, MIRA only considers one ingress-egress pair at a time. Our simulation results show that the new algorithm outperforms shortest-path, widest-path, and minimum interference routing algorithms on several metrics, including the fraction of requests routed and the fraction of requested bandwidth routed. Finally, the framework is quite general and can be extended in numerous ways to accommodate a variety of traffic management priorities in the network.